Patent attributes
Systems and methods for computing disjoint paths in a network considering continuity constraints include, responsive to a request for disjoint paths in the network which are subject to the continuity constraints, initializing a plurality of variables associated with a graph defining the network where edges constitute nodes and vertices constitute links; determining a first path through the graph; determining an auxiliary directed graph based on the first path; and determining a second path through the auxiliary directed graph, wherein the second path is determined by considering entry into cut edges, exit from cut edges, and a destination in the auxiliary directed graph and the plurality of variables are adjusted based on the entry, the exit, and the destination to address the continuity constraints. This approach concept applies to not just continuity constraints but to any constraints, which are non-additive in nature; the objective function is still additive for Shortest Path First (SPF).
