Ciena Corporation

Peeyush Deshpande

Todd Defilippi

Cengiz Alaettinoglu

Parag Amritkar

A Constrained Shortest Path First (CSPF) path computation for an unordered list of included interfaces includes receiving a request for a shortest path in a network from a source to a destination; determining all possible path combinations between the source, the list of interfaces, and the destination, where each of the possible path combinations includes a plurality of sub-paths stitched together to form an end-to-end path between the source and the destination; for each of the possible path combinations, determining an end-to-end path from the source to the destination based on (1) utilizing an already computed sub-path if available, (2) computing a sub-path if it has not been computed yet and storing a result for re-use, and (3) rejecting a possible path combination based on one or more criteria; and responding to the request with a shortest path of all of the possible path combinations based on the metric.

Constrained shortest path first path computation for unordered list of included interfaces

Systems and methods for computing paths through a network are provided. A method, according to one implementation, includes the step of storing and managing a first set of objects including one or more Segment Routing (SR) policies and Traffic Engineering (TE) tunnels, where the first set of objects represents custom behavior received from a network operator for defining intended characteristics of traffic flowing through a network. The method also includes the step of storing and managing a second set of objects representing one or more managed paths through the network, where the managed paths are calculated by a TE technique using the one or more SR policies and TE tunnels.

Growing community of inventors

Pune, India

Peeyush Deshpande