Ciena Corporation

Suvendu Kumar Barik

Ankur Jain

John Wade Cherrington

Sourabh Vijay

Systems and methods for diversifying k-shortest path computation results for multiple vertices as destination or as inclusion constraint include receiving a request for k paths, in a network from a source port at a source node to a node, wherein the node includes a plurality of ports; representing the network as a graph with vertices representing ports, edges representing connections between the ports, and with weights assigned to each of the edges; assigning a dummy destination vertex to connect to each of the plurality of ports and associated edges between each of the plurality of ports and the dummy destination vertex having a same weight; determining up to the k paths between the source port and the dummy destination vertex, and, subsequent to the determining each of the k paths, assigning a corresponding edge of the associated edges in each of the k paths a predetermined value.

Diversifying k-shortest path computation results for multiple vertices as destination or as inclusion constraint

Systems and methods include creating a graph of a network having i) vertices representing ports, and ii) edges representing possible connections between vertices; receiving a request for one or more paths in the network; traversing the graph to determine the one or more paths; responsive to encountering a non-local constraint in the graph, adding a traversal state based thereon; and responsive to satisfying the non-local constraint in the graph, removing the traversal state based thereon.

Path computation with direct enforcement of non-local constraints

Systems and methods include receiving a request for a path from a source node to a destination node in a network with the request including N unordered inclusion nodes, N&#x2265;1; adding a virtual vertex in a graph with edges connected to each of the N inclusion nodes, wherein the graph includes the virtual vertex, vertices representing nodes in the network, and edges representing links; determining a shortest path from the source node to the virtual vertex and removing an edge from a first inclusion node, that is on the shortest path, from the virtual vertex; if N&#x3e;1, determining a shortest path N times to find path segments between the N inclusion nodes, removing an edge from each of the N inclusion nodes from the virtual vertex when on a corresponding shortest path; and determining a shortest path from a last inclusion node to the destination node.

Growing community of inventors

Noida, India

Suvendu Kumar Barik