公开(公告)号：US11489758B1

公开(公告)日：2022-11-01

申请号：US17480198

申请日：2021-09-21

Applicant: Ciena Corporation

Inventor： Ankur Jain ,  John Wade Cherrington ,  Suvendu Kumar Barik ,  Sourabh Vijay

IPC: H04L45/122 ,  H04L45/02 ,  H04L45/00 ,  H04L45/586 ,  H04L45/24

Abstract: 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≥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>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.

公开(公告)号：US12068923B2

公开(公告)日：2024-08-20

申请号：US17493945

申请日：2021-10-05

Applicant: Ciena Corporation

Inventor： Ankur Jain ,  Suvendu Kumar Barik ,  John Wade Cherrington

IPC: H04L41/12 ,  H04L41/042 ,  H04L41/044 ,  H04L41/0803

CPC classification number: H04L41/12 ,  H04L41/042 ,  H04L41/044 ,  H04L41/0803

Abstract: 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.

公开(公告)号：US20230057874A1

公开(公告)日：2023-02-23

申请号：US17493945

申请日：2021-10-05

Applicant: Ciena Corporation

Inventor： Ankur Jain ,  Suvendu Kumar Barik ,  John Wade Cherrington

IPC: H04L12/24

Abstract: 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.