The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 18, 2025

Filed:

May. 14, 2024
Applicant:

Ciena Corporation, Hanover, MD (US);

Inventors:

Peeyush Deshpande, Pune, IN;

Todd Defilippi, Redwood City, CA (US);

Roopesh Palasdeokar, Pune, IN;

Assignee:

Ciena Corporation, Hanover, MD (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 13/00 (2006.01); H04L 45/12 (2022.01); H04L 45/122 (2022.01); H04L 45/24 (2022.01);
U.S. Cl.
CPC ...
H04L 45/122 (2013.01); H04L 45/123 (2013.01); H04L 45/24 (2013.01);
Abstract

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.


Find Patent Forward Citations

Loading…