IP Library › Granted Patent US 12,500,832
Granted Patent B2
US 12,500,832 · App. 18/456,716 · Granted Dec 16, 2025

Establishing and advertising co-routed bidirectional paths across multiple domains

Inventors: Amila Pradeep Kumara Tharaperiya Gamage (Kanata, CA); Muthurajah Sivabalan (Kanata, CA)
Assignee: Ciena Corporation
H04L45/04H04L43/50H04L45/24H04L45/34
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 12,500,832
App. No.
18/456,716
Granted
Dec 16, 2025
Kind
B2
Abstract

Establishing and advertising co-routed bidirectional paths across multiple domains includes determining a path from the router to a BGP peer, in a Segment Routing (SR) network, as a reverse path SR policy; appending a Binding Segment Identifier (BSID) of the reverse path SR policy in a BGP update message; and sending the BGP update message to the BGP peer. This can be used to ensure an Operations, Administration, and Maintenance (OAM) packet is guaranteed to traverse the same forward and reverse path for fault detection thereon.

Claims (43)

1 . A router configured as a Border Gateway Protocol (BGP) speaker, the router comprising circuitry configured to:

determine a path from the router to a BGP peer, in a Segment Routing (SR) network, as a reverse path SR policy,

append a Binding Segment Identifier (BSID) of the reverse path SR policy to a Reverse-Label-Stack attribute of a BGP update message, wherein the append of the BSID contributes to construction of the Reverse-Label-Stack in a distributed manner as the BGP update message propagates, the construction involving each BGP speaker along the path appending a BSID of its installed reverse path SR policy, and

send the BGP update message to the BGP peer.

2 . The router of claim 1 , wherein the circuitry is further configured to

receive a packet having, as an active segment, the BSID from the Reverse-Label Stack, and

send the packet on the path based on the reverse path SR policy.

3 . The router of claim 2 , wherein the packet is an Operations, Administration, and Maintenance (OAM) packet including Bidirectional Forwarding Detection (BFD) or Seamless BFD (S-BFD) information, which is guaranteed to traverse a same forward and reverse path for fault detection by virtue of the co-routed reverse-path SR policy advertised in the BGP update message.

4 . The router of claim 1 , wherein, to determine the path, the circuitry is further configured to

compute a path from the BGP speaker to the BGP peer using a set of constraints for a color in a BGP color extended community.

5 . The router of claim 1 , wherein, to determine the path, the circuitry is further configured to

reverse a forward path of an SR policy which is from the BGP peer to the BGP speaker that was computed using a set of constrains for a color in a BGP color extended community.

6 . The router of claim 1 , wherein the SR network includes multiple domains, and wherein the router is one of a Border Router (BR) and a Provider Edge (PE) router.

7 . The router of claim 1 , wherein the reverse path SR policy further includes one or more prefix Segment Identifiers SIDs and the path includes one or more Equal Cost Multi-Paths (ECMPs), and wherein the circuitry is further configured to

test the one or more ECMPs to validate the path.

8 . A non-transitory computer-readable medium comprising instructions for programming circuitry associated with a router to perform steps of:

determining a path from the router to a BGP peer, in a Segment Routing (SR) network, as a reverse path SR policy;

appending a Binding Segment Identifier (BSID) of the reverse path SR policy to a Reverse-Label-Stack attribute of a BGP update message, wherein the appending of the BSID contributes to construction of the Reverse-Label-Stack in a distributed manner as the BGP update message propagates, the construction involving each BGP speaker along the path appending a BSID of its installed reverse path SR policy; and

sending the BGP update message to the BGP peer.

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

receiving a packet having, as an active segment, the BSID from the Reverse-Label Stack; and

sending the packet on the path based on the reverse path SR policy.

10 . The non-transitory computer-readable medium of claim 9 , wherein the packet is an Operations, Administration, and Maintenance (OAM) packet including Bidirectional Forwarding Detection (BFD) or Seamless BFD (S-BFD) information, which is guaranteed to traverse a same forward and reverse path for fault detection by virtue of the co-routed reverse-path SR policy advertised in the BGP update message.

11 . The non-transitory computer-readable medium of claim 8 , wherein the determining includes

computing a path from a BGP speaker to the BGP peer using a set of constraints for a color in a BGP color extended community.

12 . The non-transitory computer-readable medium of claim 8 , wherein the determining includes

reversing a forward path of an SR policy which is from the BGP peer to the BGP speaker that was computed using a set of constraint for a color in a BGP color extended community.

13 . The non-transitory computer-readable medium claim 8 , wherein the SR network includes multiple domains, and wherein the router is one of a Border Router (BR) and a Provider Edge (PE) router.

14 . The non-transitory computer-readable medium of claim 8 , wherein the reverse path SR policy further includes one or more prefix Segment Identifiers SIDs and the path includes one or more Equal Cost Multi-Paths (ECMPs), and wherein the steps further include

testing the one or more ECMPs to validate the path.

15 . A method comprising steps of:

determining a path from a router to a BGP peer, in a Segment Routing (SR) network, as a reverse path SR policy;

appending a Binding Segment Identifier (BSID) of the reverse path SR policy to a Reverse-Label-Stack attribute of a BGP update message, wherein the appending of the BSID contributes to construction of the Reverse-Label-Stack in a distributed manner as the BGP update message propagates, the construction involving each BGP speaker along the path appending a BSID of its installed reverse path SR policy; and

sending the BGP update message to the BGP peer.

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

receiving a packet having, as an active segment, the BSID from the Reverse-Label Stack; and

sending the packet on the path based on the reverse path SR policy.

17 . The method of claim 16 , wherein the packet is an Operations, Administration, and Maintenance (OAM) packet including Bidirectional Forwarding Detection (BFD) or Seamless BFD (S-BFD) information, which is guaranteed to traverse a same forward and reverse path for fault detection by virtue of the co-routed reverse-path SR policy advertised in the BGP update message.

18 . The method of claim 15 , wherein the determining includes

computing a path from a BGP speaker to the BGP peer using a set of constraints for a color in a BGP color extended community.

19 . The method of claim 15 , wherein the determining includes

reversing a forward path of an SR policy which is from the BGP peer to the BGP speaker that was computed using a set of constraints for a color in a BGP color extended community.

20 . The method of claim 15 , wherein the SR network includes multiple domains, and wherein the router is one of a Border Router (BR) and a Provider Edge (PE) router.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 28, 2023
From: GAMAGE, AMILA PRADEEP KUMARA THARAPERIYA; SIVABALAN, MUTHURAJAH
To: CIENA CORPORATION
Reel/Frame 064721/0731 →
Continuity (1)
Related Publication 20250080451A1 · Mar 6, 2025
References Cited (64)
US 7031262B2 · Vasseur et al. · 2006 [cited by applicant]
US 7345994B2 · Sivabalan et al. · 2008 [cited by applicant]
US 7359386B2 · Vasseur et al. · 2008 [cited by applicant]
US 7599349B2 · Vasseur et al. · 2009 [cited by applicant]
US 7626925B1 · Sivabalan et al. · 2009 [cited by applicant]
US 7648772B2 · Sivabalan et al. · 2010 [cited by applicant]
US 7801048B1 · Sivabalan et al. · 2010 [cited by applicant]
US 7884351B2 · Vasseur et al. · 2011 [cited by applicant]
US 8004964B2 · Boutros et al. · 2011 [cited by applicant]
US 8131873B2 · Vasseur et al. · 2012 [cited by applicant]
US 8320255B2 · Vasseur et al. · 2012 [cited by applicant]
US 8572225B2 · Scudder et al. · 2013 [cited by applicant]
US 8724454B2 · Boutros et al. · 2014 [cited by applicant]
US 8976682B2 · Boutros et al. · 2015 [cited by applicant]
US 9013985B2 · Sivabalan et al. · 2015 [cited by applicant]
US 9313145B2 · Gandhi et al. · 2016 [cited by applicant]
US 9369371B2 · Filsfils · 2016 [cited by examiner]
US 9419885B2 · Boutros et al. · 2016 [cited by applicant]
US 9497107B1 · Akiya et al. · 2016 [cited by applicant]
US 9537753B2 · Alvarez et al. · 2017 [cited by applicant]
US 9641416B2 · Frost et al. · 2017 [cited by applicant]
US 9699087B2 · Boutros et al. · 2017 [cited by applicant]
US 9722916B2 · Sivabalan et al. · 2017 [cited by applicant]
US 9834929B2 · Boutros et al. · 2017 [cited by applicant]
US 9979629B2 · Sivabalan et al. · 2018 [cited by applicant]
US 10063463B2 · Saad et al. · 2018 [cited by applicant]
US 10158558B1 · Ward et al. · 2018 [cited by applicant]
US 10165093B2 · Flisfils et al. · 2018 [cited by applicant]
US 10250459B2 · All et al. · 2019 [cited by applicant]
US 10250494B2 · Sivabalan et al. · 2019 [cited by applicant]
US 10833976B2 · Saad et al. · 2020 [cited by applicant]
US 10868755B2 · Flisfils et al. · 2020 [cited by applicant]
US 10892967B2 · Filsfils et al. · 2021 [cited by applicant]
US 11411876B2 · Tharaperiya Gamage · 2022 [cited by applicant]
US 11483230B2 · Filsfils et al. · 2022 [cited by applicant]
US 11552879B1 · Sivabalan et al. · 2023 [cited by applicant]
US 11722400B2 · Sivabalan et al. · 2023 [cited by applicant]
US 20150117222A1 · Saad et al. · 2015 [cited by applicant]
US 20160254994A1 · Bryant et al. · 2016 [cited by applicant]
US 20170026461A1 · Boutros et al. · 2017 [cited by applicant]
US 20170230274A1 · Flistils et al. · 2017 [cited by applicant]
US 20180108450A1 · Filsfils et al. · 2018 [cited by applicant]
US 20190297017A1 · Pignataro et al. · 2019 [cited by applicant]
US 20190356600A1 · Barton et al. · 2019 [cited by applicant]
US 20200127913A1 · Filsfils · 2020 [cited by examiner]
US 20200153856A1 · Nainar et al. · 2020 [cited by applicant]
US 20220088078A1 · Sivabalan et al. · 2022 [cited by applicant]
US 20220124019A1 · Boutros et al. · 2022 [cited by applicant]
US 20220200903A1 · Boutros et al. · 2022 [cited by applicant]
US 20220368638A1 · Garage et al. · 2022 [cited by applicant]
US 20230067946A1 · Alaettinoglu et al. · 2023 [cited by applicant]
US 20230071325A1 · Boutros et al. · 2023 [cited by applicant]
US 20230073266A1 · Boutros et al. · 2023 [cited by applicant]
US 20230095297A1 · Alaettinoglu et al. · 2023 [cited by applicant]
US 20230141362A1 · Mittal · 2023 [cited by examiner]
US 20230146226A1 · Sivabalan et al. · 2023 [cited by applicant]
US 20230146374A1 · Sivabalan et al. · 2023 [cited by applicant]
US 20230171178A1 · Gamage et al. · 2023 [cited by applicant]
US 20230239176A1 · Boutros et al. · 2023 [cited by applicant]
US 20230388177A1 · Li · 2023 [cited by examiner]
US 20240340236A1 · Vasudevan · 2024 [cited by examiner]
WO 2022161061A1 · 2022 [cited by applicant]
Y. Liu et al., “SR Policy for Reverse Path,” Spring WG, Internet-Draft, Standards Track, Jan. 27, 2021, 6 pages. [cited by applicant]
Dec. 3, 2024, International Search Report and Written Opinion for International Patent Application No. PCT/US2024/043952. [cited by applicant]