Network Congestion Reduction using Boolean Constrained Multipath Routing

A packet routing method implemented in a data network by network routing equipment, the method comprising:

• computing, for each source node in the data network and each destination node in the data network, a set of multiple routes satisfying a full range of policy constraints from the source node to the destination node in the data network, where the full range of policy constraints is defined by a policy constraints specified using Boolean expressions composed of a Boolean variables representing policy-relevant properties of network traffic, network resources, and network state;
• where the computing comprises computing for each truth assignment of the Boolean expressions a shortest route such that the truth assignment is satisfying for a policy constraint;
• selecting, for a packet originating from a source node and addressed to a destination node, a route selected from the computed set of multiple routes, such that a logical conjunction of Boolean expressions for the packet and for the route is satisfiable, where the Boolean expressions specify policy constraints for the packet and for the route, and such that the route has sufficient bandwidth for the packet, thereby reducing network congestion;
• and
• forwarding the packet in accordance with the selected route.