IP Library Granted Patent US 11,882,032
Granted Patent B2
US 11,882,032 · App. 17/709,290 · Granted Jan 23, 2024

Emulating MPLS-TP behavior with non-revertive candidate paths in Segment Routing

Inventors: Cengiz Alaettinoglu (Sherman Oaks, CA); Amal Karboubi (Oshawa, CA); Himanshu Shah (Hopkinton, MA); Muthurajah Sivabalan (Kanata, CA)
Assignee: Ciena Corporation
H04L45/645H04L43/0811H04L45/28
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,882,032
App. No.
17/709,290
Granted
Jan 23, 2024
Kind
B2
Abstract

Systems and methods implemented in a network element in a Segment Routing network include, for a service having two or more candidate paths and responsive to a failure on a current candidate path of the two or more candidate paths, setting an eligibility flag for the current candidate path; and selecting another candidate path of the two or more candidate paths, for the service, based on their eligibility flag.

Claims (37)

1. A non-transitory computer-readable medium having instructions stored thereon for programming a network element in a Segment Routing network to perform steps of:

for a service having two or more candidate paths, wherein the network element is a head-end for the service, and responsive to a failure on a current candidate path of the two or more candidate paths, setting an eligibility flag to False for the current candidate path; and

selecting another candidate path of the two or more candidate paths, for the service, based on their eligibility flag such that the another candidate path is only selected if its eligibility flag is set to True, wherein each of the two or more candidate paths have their associated eligibility flag set based on Bidirectional Forwarding Detection (BFD).

2. The non-transitory computer-readable medium of claim 1 , wherein the steps further include

detecting the failure via a liveness check running over the current candidate path.

3. The non-transitory computer-readable medium of claim 1 , wherein the steps further include

performing the setting and the selecting responsive to an auto-reversion flag for the service.

4. The non-transitory computer-readable medium of claim 1 , wherein the eligibility flag for each of the two or more candidate paths is set to True if an associated path is viable and False if there is the failure on the associated path.

5. The non-transitory computer-readable medium of claim 1 , wherein the setting is performed subsequent to detection of the failure and the eligibility flag is changed by a Path Computation Element (PCE) after the failure is repaired.

6. The non-transitory computer-readable medium of claim 1 , wherein the steps further include

reselecting the current candidate path after a Path Computation Element (PCE) detects the current candidate path is repaired.

7. The non-transitory computer-readable medium of claim 1 , wherein, responsive to detecting any of the two or more candidate paths deviate from their intended path, an associated eligibility flag is set to False.

8. The non-transitory computer-readable medium of claim 1 , wherein the steps further include

performing a liveness check for all of the two of more candidate paths; and

setting associated eligibility flag based on the liveness check.

9. A method implemented in a network element in a Segment Routing network comprising steps of:

for a service having two or more candidate paths, wherein the network element is a head-end for the service, and responsive to a failure on a current candidate path of the two or more candidate paths, setting an eligibility flag to False for the current candidate path; and

selecting another candidate path of the two or more candidate paths, for the service, based on their eligibility flag such that the another candidate path is only selected if its eligibility flag is set to True, wherein each of the two or more candidate paths have their associated eligibility flag set based on Bidirectional Forwarding Detection (BFD).

10. The method of claim 9 , wherein the steps further include

detecting the failure via a liveness check running over the current candidate path.

11. The method of claim 9 , wherein the steps further include

performing the setting and the selecting responsive to an auto-reversion flag for the service.

12. The method of claim 9 , wherein the eligibility flag for each of the two or more candidate paths is set to True if an associated path is viable and False if there is the failure on the associated path.

13. The method of claim 9 , wherein the setting is performed subsequent to detection of the failure and the eligibility flag is changed by a Path Computation Element (PCE) after the failure is repaired.

14. The method of claim 9 , wherein the steps further include

reselecting the current candidate path after a Path Computation Element (PCE) detects the current candidate path is repaired.

15. The method of claim 9 , wherein, responsive to detecting any of the two or more candidate paths deviate from their intended path, an associated eligibility flag is set to False.

16. The method of claim 9 , wherein the steps further include

performing a liveness check for all of the two of more candidate paths; and

setting associated eligibility flag based on the liveness check.

17. A network element in a Segment Routing network comprising circuitry configured to:

for a service having two or more candidate paths, wherein the network element is a head-end for the service, and responsive to a failure on a current candidate path of the two or more candidate paths, set an eligibility flag to False for the current candidate path, and

select another candidate path of the two or more candidate paths, for the service, based on their eligibility flag such that the another candidate path is only selected if its eligibility flag is set to True, wherein each of the two or more candidate paths have their associated eligibility flag set based on Bidirectional Forwarding Detection (BFD).

18. The network element of claim 17 , wherein the circuitry is further configured to

detect the failure via a liveness check running over the current candidate path.

19. The network element of claim 17 , wherein the eligibility flag for each of the two or more candidate paths is set to True if an associated path is viable and False if there is the failure on the associated path.

20. The non-transitory computer-readable medium of claim 1 , wherein the setting is by one of the network element and by a Path Computation Element (PCE), configured to perform bandwidth reservation based on the eligibility flag.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 14, 2022
From: ALAETTINOGLU, CENGIZ; KARBOUBI, AMAL; SHAH, HIMANSHU; SIVABALAN, MUTHURAJAH
To: CIENA CORPORATION
Reel/Frame 059595/0991 →
Continuity (2)
Continuation In Part 17489979 · Sep 30, 2021
Related Publication 20230095297A1 · Mar 30, 2023
Cited By (1)
US 12,726,432