US 12,476,897 B2
Constrained shortest path first path computation for unordered list of included interfaces
Peeyush Deshpande, Pune (IN); Todd Defilippi, Redwood City, CA (US); and Roopesh Palasdeokar, Pune (IN)
Assigned to Ciena Corporation, Hanover, MD (US)
Filed by Ciena Corporation, Hanover, MD (US)
Filed on May 14, 2024, as Appl. No. 18/663,147.
Claims priority of application No. 202411027083 (IN), filed on Apr. 1, 2024.
Prior Publication US 2025/0310238 A1, Oct. 2, 2025
Int. Cl. G06F 13/00 (2006.01); H04L 45/12 (2022.01); H04L 45/122 (2022.01); H04L 45/24 (2022.01)
CPC H04L 45/122 (2013.01) [H04L 45/123 (2013.01); H04L 45/24 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A non-transitory computer-readable medium comprising instructions that, when executed, cause one or more processors to perform steps of:
receiving a request for a shortest path in a network from a source to a destination, based on a metric and with one or more constraints including a list of interfaces that should be included in the shortest path, in any order;
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 the 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.