Ciena Corporation

Sourabh Vijay

John Wade Cherrington

Ankur Jain

Suvendu Kumar Barik

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

Jaipur, India

Sourabh Vijay