Systems and methods for constrained path computation in networks with connectivity and resource availability rules

A processing device comprising:

• one or more processors;
• and
• memory comprising instructions that, when executed, cause the one or more processors to
• obtain data associated with a network, wherein the data includes a topology that describes how a plurality of network elements in the network are connected and constraint rules associated with constrained network elements of the plurality of network element that describe internal connectivity therein;
• define a routing graph that includes vertices for the plurality of network elements, edges for links between the plurality of network elements, and forwarding groups as additional vertices in the routing graph where the forwarding groups encode the internal connectivity of the constrained network elements;
• and
• determine a path from a source port in a source network element to a destination port in a destination port by walking through the routing graph.

A method comprising:

• obtaining data associated with a network, wherein the data includes a topology that describes how a plurality of network elements in the network are connected and constraint rules associated with constrained network elements of the plurality of network element that describe internal connectivity therein;
• defining a routing graph that includes vertices for the plurality of network elements, edges for links between the plurality of network elements, and forwarding groups as additional vertices in the routing graph where the forwarding groups encode the internal connectivity of the constrained network elements;
• and
• determining a path from a source port in a source network element to a destination port in a destination port by walking through the routing graph.