IP Library Granted Patent US 12,244,497
Granted Patent B2
US 12,244,497 · App. 18/243,814 · Granted Mar 4, 2025

Dynamic segment routing mapping server for a multiprotocol label switching network

Inventor: Eric Osborne (Sutton, MA)
Assignee: Level 3 Communications, LLC
H04L45/74H04L45/50H04L61/5007H04L65/104H04L65/65
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,244,497
App. No.
18/243,814
Granted
Mar 4, 2025
Kind
B2
Abstract

A dynamic SRMS (DSRMS) in a MPLS network generates unique segment identifiers for nodes of the network lacking segment identifiers (SIDs). The DSRMS receives network information from other nodes of the network that may include, for example, Internal Gateway Protocol (IGP) routing information, advertised prefix values for the nodes, and label values used in MPLS routing. The DSRMS analyzes the information and identifies nodes of the network that are not associated with a SID. For each identified node, the DSRMS generates a unique SID and then announces the SID to other nodes within the network. Generating the unique SID may include executing a hashing function using the IP address of the identified node as an input.

Claims (23)

1. A network routing method comprising:

receiving a plurality of Internet Protocol (IP) addresses from a plurality of components of a Multiprotocol Label Switching (MPLS) network, at least one IP address of the plurality of IP addresses being unmapped to a segment identifier (SID) for routing communication packets in the MPLS network;

analyzing the at least one IP address to identify a router identifier (RID) IP address, the RID IP address corresponding to a node of the MPLS network included in a Label-Switched Path (LSP) of the MPLS network, wherein analyzing the at least one IP address to identify the RID IP address comprises at least one of:

comparing a mask length of each of the plurality of IP addresses to a known mask length of RID IP addresses; or

comparing each of the plurality of IP addresses to a known range of RID IP addresses;

generating a unique SID for the RID IP address; and

announcing, through a signaling protocol, the unique SID and the RID IP address as a matched pair for segment routing in the MPLS network,

wherein the unique SID is generated if the mask length is equal to the known mask length or if the IP address is within the known range of RID IP addresses, respectively.

2. The method of claim 1 , wherein generating the unique SID for the RID IP address comprises executing a hashing function and the RID IP address is an input to the hashing function.

3. The method of claim 1 , wherein the signaling protocol for announcing the unique SID and the RID IP address is an Interior Gateway Protocol (IGP).

4. The method of claim 1 , further comprising updating a table of SID-IP address pairs of the telecommunications network maintained at the computing device to include the unique SID and RID IP address, wherein the unique SID and the RID IP address are announced by announcing SID-IP address pairs stored in the table.

5. A system for facilitating routing within a telecommunications network, the system comprising:

a computing device communicatively couplable to the telecommunications network, the computing device configured to:

receive a plurality of Internet Protocol (IP) addresses from a plurality of components of a Multiprotocol Label Switching (MPLS) network, at least one IP address of the plurality of IP addresses being unmapped to a segment identifier (SID) for routing communication packets in the MPLS network;

analyze the at least one IP address to identify a router identifier (RID) IP address, the RID IP address corresponding to a node of the MPLS network included in a Label-Switched Path (LSP) of the MPLS network, wherein analyzing the at least one IP address to identify the RID IP address comprises at least one of:

comparing a mask length of each of the plurality of IP addresses to a known mask length of RID IP addresses; or

comparing each of the plurality of IP addresses to a known range of RID IP addresses;

generate a unique SID for the RID IP address; and

announce, through a signaling protocol, the unique SID and the RID IP address as a matched pair for segment routing in the MPLS network,

wherein the unique SID is generated if the mask length is equal to the known mask length or if the IP address is within the known range of RID IP addresses, respectively.

6. The system of claim 5 , wherein generating the unique SID for the RID IP address comprises executing a hashing function and the RID IP address is an input to the hashing function.

7. The system of claim 5 , wherein the signaling protocol for announcing the unique SID and the RID IP address is an Interior Gateway Protocol (IGP).

8. The system of claim 5 , wherein the computing device is further configured to update a table of SID-IP address pairs of the telecommunications network maintained at the computing device to include the unique SID and RID IP address, wherein the unique SID and the RID IP address are announced by announcing SID-IP address pairs stored in the table.

Assignments (3)
NOTICE OF GRANT OF SECURITY INTEREST IN INTELLECTUAL PROPERTY (SECOND LIEN) Recorded Nov 4, 2024
From: LEVEL 3 COMMUNICATIONS, LLC; GLOBAL CROSSING TELECOMMUNICATIONS, INC
To: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Reel/Frame 069295/0749 →
NOTICE OF GRANT OF SECURITY INTEREST IN INTELLECTUAL PROPERTY (FIRST LIEN) Recorded Nov 4, 2024
From: LEVEL 3 COMMUNICATIONS, LLC; GLOBAL CROSSING TELECOMMUNICATIONS, INC.
To: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Reel/Frame 069295/0858 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 11, 2023
From: OSBORNE, ERIC
To: LEVEL 3 COMMUNICATIONS, LLC
Reel/Frame 064862/0120 →
Continuity (5)
Continuation 17719781 · Apr 13, 2022
Continuation 17021703 · Sep 15, 2020
Continuation 16054594 · Aug 3, 2018
Provisional Application 62545266 · Aug 14, 2017
Related Publication 20230421496A1 · Dec 28, 2023
References Cited (37)
US 7620055B1 · Chandran · 2009 [cited by examiner]
US 7974201B1 · Daruwalla · 2011 [cited by examiner]
US 9369347B2 · Filsfils · 2016 [cited by applicant]
US 10263881B2 · Psenak · 2019 [cited by applicant]
US 10491720B2 · Brissette · 2019 [cited by examiner]
US 10785153B2 · Osborne · 2020 [cited by applicant]
US 11310157B2 · Osborne · 2022 [cited by examiner]
US 11757776B2 · Osborne · 2023 [cited by examiner]
US 20120082163A1 · Rothenberg · 2012 [cited by applicant]
US 20120177054A1 · Pati · 2012 [cited by applicant]
US 20130163594A1 · Sharma · 2013 [cited by applicant]
US 20140269724A1 · Mehler · 2014 [cited by examiner]
US 20140369356A1 · Bryant · 2014 [cited by examiner]
US 20150016304A1 · Unbehagen · 2015 [cited by applicant]
US 20170093611A1 · Arora · 2017 [cited by applicant]
US 20170195135A1 · Singh · 2017 [cited by applicant]
US 20170346718A1 · Psenak · 2017 [cited by examiner]
US 20180006995A1 · Bickhart · 2018 [cited by applicant]
US 20180034648A1 · Nagarajan · 2018 [cited by examiner]
US 20180077051A1 · Nainar · 2018 [cited by examiner]
US 20180205641A1 · Pignataro · 2018 [cited by applicant]
US 20180287934A1 · Wang · 2018 [cited by examiner]
US 20180287935A1 · Wang · 2018 [cited by examiner]
US 20180287990A1 · Bickhart · 2018 [cited by examiner]
US 20180295054A1 · Chunduri · 2018 [cited by examiner]
US 20180309596A1 · Brissette · 2018 [cited by applicant]
US 20180351882A1 · Jeganathan · 2018 [cited by applicant]
US 20190013964A1 · Wignands · 2019 [cited by applicant]
US 20190020738A1 · Paul · 2019 [cited by examiner]
US 20190058657A1 · Chunduri · 2019 [cited by examiner]
US 20190349303A1 · Previdi · 2019 [cited by examiner]
US 20190386848A1 · Wang · 2019 [cited by examiner]
US 20200044967A1 · Osborne · 2020 [cited by applicant]
US 20200099775A1 · Brissette · 2020 [cited by examiner]
US 20200412650A1 · Osborne · 2020 [cited by applicant]
US 20220166860A1 · Brissette · 2022 [cited by examiner]
US 20220239593A1 · Osborne · 2022 [cited by applicant]