IP Library Granted Patent US 12,744,733
Granted Patent B2
US 12,744,733 · App. 18/776,125 · Granted Sep 22, 2026

Domain border router resiliency with segment compaction

Inventors: Todd Defilippi (Redwood City, CA); Amal Karboubi (Ottawa, CA)
Assignee: Ciena Corporation
H04L45/74H04L45/02
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,744,733
App. No.
18/776,125
Granted
Sep 22, 2026
Kind
B2
Abstract

Systems and methods for domain Border Router (BR) resiliency with segment compaction in Segment Routing include obtaining a compressed segment list for a calculated path in a Segment Routing network, wherein the Segment Routing network includes a plurality of domains with the calculated path being through at least two domains, wherein the compressed segment list includes a plurality of Segment Identifiers (SID) each SID identifying a segment, and wherein, when expanded, the compressed segment list matches the calculated path; analyzing the compressed segment list for any domain border routers between two domains of the at least two domains to determine associated anycast SID for the any domain border routers; and utilizing the associated anycast SID in the compressed SID list for resiliency between the two domains.

Claims (44)

1 . A non-transitory computer-readable medium storing instructions that, when executed, cause one or more processors to execute steps of:

performing a path calculation to determine a calculated path in a Segment Routing network without considering any domain border routers, wherein the Segment Routing network includes a plurality of domains with the calculated path being through at least two domains;

obtaining a compressed segment list for the calculated path, wherein the compressed segment list includes a plurality of Segment Identifiers (SID) each SID identifying a segment, and wherein, when expanded, the compressed segment list matches the calculated path;

analyzing the compressed segment list for any domain border routers between two domains of the at least two domains to determine associated anycast SID for the any domain border routers, wherein the analyzing includes (i) identifying, from the calculated path, a domain border router between a first domain and a second domain and identifying one or more corresponding domain border routers that participate in both the first domain and the second domain, and (ii) monitoring advertisements in the Segment Routing network to determine an anycast prefix and a corresponding anycast SID that are advertised by exactly the corresponding domain border routers; and

utilizing the associated anycast SID in the compressed SID list for resiliency between the two domains, wherein utilizing includes replacing a node SID for the domain border router in the compressed segment list with the anycast SID.

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

identifying a domain border router between the two domains; and

for the identified domain border router, identifying corresponding one or more domain border routers and determining the associated anycast SID based thereon.

3 . The non-transitory computer-readable medium of claim 2 , wherein the analyzing the compressed segment list includes identifying the domain border router based on a corresponding node SID in the plurality of SIDs.

4 . The non-transitory computer-readable medium of claim 1 , wherein the plurality of Segment Identifiers (SID) include node SIDs.

5 . The non-transitory computer-readable medium of claim 1 , wherein the plurality of Segment Identifiers (SID) include node SIDs and adjacency SIDs.

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

prior to the obtaining and subsequent to the performing, determining the compressed segment list with node SIDs and with zero or more adjacency SIDs.

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

monitoring advertisements from the Segment Routing network to determine the domain border routers and the associated anycast SIDs.

8 . A method comprising steps of:

performing a path calculation to determine a calculated path in a Segment Routing network without considering any domain border routers, wherein the Segment Routing network includes a plurality of domains with the calculated path being through at least two domains;

obtaining a compressed segment list for the calculated path, wherein the compressed segment list includes a plurality of Segment Identifiers (SID) each SID identifying a segment, and wherein, when expanded, the compressed segment list matches the calculated path;

analyzing the compressed segment list for any domain border routers between two domains of the at least two domains to determine associated anycast SID for the any domain border routers, wherein the analyzing includes (i) identifying, from the calculated path, a domain border router between a first domain and a second domain and identifying one or more corresponding domain border routers that participate in both the first domain and the second domain, and (ii) monitoring advertisements in the Segment Routing network to determine an anycast prefix and a corresponding anycast SID that are advertised by exactly the corresponding domain border routers; and

utilizing the associated anycast SID in the compressed SID list for resiliency between the two domains, wherein utilizing includes replacing a node SID for the domain border router in the compressed segment list with the anycast SID.

9 . The method of claim 8 , wherein the analyzing further includes steps of

identifying a domain border router between the two domains; and

for the identified domain border router, identifying corresponding one or more domain border routers and determining the associated anycast SID based thereon.

10 . The method of claim 9 , wherein the analyzing the compressed segment list includes identifying the domain border router based on a corresponding node SID in the plurality of SIDs.

11 . The method of claim 8 , wherein the plurality of Segment Identifiers (SID) include node SIDs.

12 . The method of claim 8 , wherein the plurality of Segment Identifiers (SID) include node SIDs and adjacency SIDs.

13 . The method of claim 8 , wherein the steps further include

prior to the obtaining and subsequent to the performing, determining the compressed segment list with node SIDs and with zero or more adjacency SIDs.

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

monitoring advertisements from the Segment Routing network to determine the domain border routers and the associated anycast SIDs.

15 . An apparatus comprising:

one or more processors;

a network interface communicatively coupled to a Segment Routing network; and

memory storing instructions that, when executed, cause the one or more processors to

perform a path calculation to determine a calculated path in a Segment Routing network without considering any domain border routers, wherein the Segment Routing network includes a plurality of domains with the calculated path being through at least two domains,

obtain a compressed segment list for the calculated path, wherein the compressed segment list includes a plurality of Segment Identifiers (SID) each SID identifying a segment, and wherein, when expanded, the compressed segment list matches the calculated path,

analyze the compressed segment list for any domain border routers between two domains of the at least two domains to determine associated anycast SID for the any domain border routers, wherein the analyzing includes (i) identifying, from the calculated path, a domain border router between a first domain and a second domain and identifying one or more corresponding domain border routers that participate in both the first domain and the second domain, and (ii) monitoring advertisements in the Segment Routing network to determine an anycast prefix and a corresponding anycast SID that are advertised by exactly the corresponding domain border routers, and

utilize the associated anycast SID in the compressed SID list for resiliency between the two domains, wherein utilizing includes replacing a node SID for the domain border router in the compressed segment list with the anycast SID.

16 . The apparatus of claim 15 , wherein the compressed segment list is analyzed by

identify a domain border router between the two domains, and

for the identified domain border router, identify corresponding one or more domain border routers and determining the associated anycast SID based thereon.

17 . The apparatus of claim 15 , wherein the plurality of Segment Identifiers (SID) include node SIDs.

18 . The apparatus of claim 15 , wherein the memory storing instructions that, when executed, further cause the one or more processors to

monitor advertisements from the Segment Routing network to determine the domain border routers and the associated anycast SIDs.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 17, 2024
From: DEFILIPPI, TODD; KARBOUBI, AMAL
To: CIENA CORPORATION
Reel/Frame 068015/0251 →
Continuity (1)
Related Publication 20260025331A1 · Jan 22, 2026
References Cited (57)
US 7120792B1 · Jacobson · 2006 [cited by examiner]
US 7197573B1 · Jacobson · 2007 [cited by examiner]
US 7539191B1 · Jacobson · 2009 [cited by examiner]
US 8135834B1 · Jacobson · 2012 [cited by examiner]
US 8274901B1 · Casner · 2012 [cited by examiner]
US 8422502B1 · Alaettinoglu · 2013 [cited by examiner]
US 8824331B1 · Alaettinoglu et al. · 2014 [cited by applicant]
US 8937946B1 · Kanna · 2015 [cited by examiner]
US 9026674B1 · Kanna · 2015 [cited by examiner]
US 9929946B2 · Filsfils · 2018 [cited by examiner]
US 10033623B2 · Jain · 2018 [cited by examiner]
US 10171338B2 · Filsfils · 2019 [cited by examiner]
US 10887225B1 · Chan · 2021 [cited by examiner]
US 10917330B1 · Szarecki · 2021 [cited by examiner]
US 10984316B2 · Qiao · 2021 [cited by examiner]
US 11025545B2 · Enguehard · 2021 [cited by examiner]
US 11057278B1 · Côté · 2021 [cited by examiner]
US 11133958B2 · Torvi · 2021 [cited by examiner]
US 11134002B2 · Filsfils · 2021 [cited by examiner]
US 11240145B2 · Kashyap · 2022 [cited by examiner]
US 11271854B2 · Yadav · 2022 [cited by examiner]
US 11336569B2 · Arora · 2022 [cited by examiner]
US 11438259B2 · Torvi · 2022 [cited by examiner]
US 11546246B2 · Szarecki · 2023 [cited by examiner]
US 11563675B2 · Shah · 2023 [cited by examiner]
US 11757757B2 · Alaettinoglu · 2023 [cited by examiner]
US 11838200B2 · Filsfils · 2023 [cited by examiner]
US 11949584B2 · Saad · 2024 [cited by examiner]
US 12476907B2 · Shah · 2025 [cited by examiner]
US 20140369238A1 · Alaettinoglu · 2014 [cited by examiner]
US 20160057049A1 · Jacobson · 2016 [cited by examiner]
US 20210014084A1 · Torvi · 2021 [cited by examiner]
US 20210083963A1 · Szarecki · 2021 [cited by examiner]
US 20210099378A1 · Alaettinoglu · 2021 [cited by examiner]
US 20210266251A1 · Yadav · 2021 [cited by examiner]
US 20220014460A1 · Filsfils · 2022 [cited by examiner]
US 20220086078A1 · Sivabalan · 2022 [cited by examiner]
US 20220103462A1 · Sidebottom · 2022 [cited by examiner]
US 20230067946A1 · Alaettinoglu · 2023 [cited by examiner]
US 20230095297A1 · Alaettinoglu · 2023 [cited by examiner]
US 20230098528A1 · Alaettinoglu · 2023 [cited by examiner]
US 20230120019A1 · Shah · 2023 [cited by examiner]
US 20230146226A1 · Sivabalan · 2023 [cited by examiner]
US 20230224238A1 · Saad · 2023 [cited by examiner]
US 20230269167A1 · Bhargava · 2023 [cited by examiner]
US 20230412492A1 · Alaettinoglu · 2023 [cited by examiner]
US 20240146648A1 · Alaettinoglu · 2024 [cited by examiner]
US 20240340241A1 · Alaettinoglu · 2024 [cited by examiner]
US 20250133013A1 · Defilippi · 2025 [cited by examiner]
EP 3813310A1 · 2021 [cited by applicant]
WO 2021067231A1 · 2021 [cited by applicant]
WO 2022055861A1 · 2022 [cited by applicant]
WO 2023038818A1 · 2023 [cited by applicant]
Cisco, “Segment Routing Configuration Guide for Cisco 8000 Series Routers, IOS XR Release 7.9.x”, Mar. 13, 2023; https://www.cisco.com/c/en/us/td/docs/iosxr/cisco8000/segment-routing/79x/b-segment-routing-cg-cisco8000-7… [cited by examiner]
P. Psenak et al., “IGP Flexible Algorithm,” Internet Engineering Task Force (IETF), RFC 9350, ISSN: 2070-1721, Feb. 2023, 42 Pages. [cited by applicant]
C. Filsfils et al., “Segment Routing Architecture,” Internet Engineering Task Force (IETF), Standards Track, ISSN: 2070-1721, Jul. 2018, 32 Pages. [cited by applicant]
K. Talaulikar et al., “Border Gateway Protocol—Link State (BGP-LS) Extensions for Flexible Algorithm Advertisement,” Internet Engineering Task Force (IETF), RFC 9351, Standards Track, ISSN: 2070-1721, Feb. 2023, 14 Page… [cited by applicant]