IP Library Granted Patent US 12,413,500
Granted Patent B2
US 12,413,500 · App. 17/168,040 · Granted Sep 9, 2025

Service differentiation based on constrained network topology slicing

Inventors: Gunter Van de Velde (Lint, BE); Matthew Bocci (East Sussex, GB)
Assignee: NOKIA SOLUTIONS AND NETWORKS OY
H04L45/02H04L41/0803
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,413,500
App. No.
17/168,040
Granted
Sep 9, 2025
Kind
B2
Abstract

Various example embodiments for supporting service differentiation in a communication network are presented herein. The service differentiation may be supported in a constrained network topology of the communication network. The service differentiation may be supported in the constrained network topology of the communication network based on use of one or more constrained network topology slices supported for the constrained network topology of the communication network. The constrained network topology of the communication network may be a Flexible Algorithm topology, in which case the constrained network topology slices may be Flexible Algorithm topology slices.

Claims (42)

1. A first router, comprising:

at least one processor; and

at least one memory storing instructions that, when executed by the at least one processor, cause the first router to:

receive, for a segment routing flexible algorithm, flexible algorithm definition information, wherein the flexible algorithm definition information includes a flexible algorithm definition defining the segment routing flexible algorithm, wherein the flexible algorithm definition information includes a flexible algorithm topology slice description and a slice identifier for the flexible algorithm topology slice description;

receive, from a second router, advertising information, wherein the advertising information includes a first node segment identifier of the second router for the segment routing flexible algorithm, wherein the advertising information includes a second node segment identifier of the second router for the segment routing flexible algorithm and the slice identifier for the flexible algorithm topology slice description; and

send, toward the second router based on the flexible algorithm definition information and the advertising information, a first packet using a first flexible algorithm topology slice of the segment routing flexible algorithm based on inclusion of the first node segment identifier in the first packet and a second packet using a second flexible algorithm topology slice of the segment routing flexible algorithm based on inclusion of the second node segment identifier in the second packet.

2. The first router of claim 1 , wherein the first flexible algorithm topology slice defines a first service level for the segment routing flexible algorithm, wherein the second flexible algorithm topology slice defines a second service level for the segment routing flexible algorithm.

3. The first router of claim 2 , wherein the first service level is based on a first set of quality-of-service properties, wherein the second service level is based on a second set of quality-of-service properties that is different than the first set of quality-of-service properties.

4. The

first router of claim 2 , wherein the first service level is a default service level for the segment routing flexible algorithm, wherein the second service level is configured to provide service differentiation within a flexible algorithm topology of the segment routing flexible algorithm.

5. The first router of claim 1 , wherein the advertising information is received based on a routing protocol.

6. The first router of claim 5 , wherein the slice identifier for the flexible algorithm topology slice description is received using at least one optional transitive opaque extension of the routing protocol.

7. The first router of claim 5 , wherein the routing protocol includes at least one of an Open Shortest Path First (OSPF) protocol, an Intermediate-System-to-Intermediate-System (IS-IS) protocol, or a Border Gateway Protocol-Link State (BGP-LS) protocol.

8. The first router of claim 1 , wherein

the flexible algorithm topology slice description includes a set of quality-of-service properties configured to provide service differentiation within the segment routing flexible algorithm.

9. The first router of claim 1 , wherein the flexible algorithm definition information is received based on a routing protocol.

10. The first router of claim 9 , wherein the flexible algorithm topology slice description and the slice identifier for the flexible algorithm topology slice description are received using at least one optional transitive opaque extension of the routing protocol.

11. The first router of claim 9 , wherein the routing protocol includes at least one of an Open Shortest Path First (OSPF) protocol, an Intermediate-System-to-Intermediate-System (IS-IS) protocol, or a Border Gateway Protocol-Link State (BGP-LS) protocol.

12. The first router of claim 1 , wherein

the flexible algorithm definition information is received from a segment routing enabled router.

13. The first router of claim 1 , wherein

the flexible algorithm definition information is received from a network controller.

14. The first router of claim 1 , wherein the instructions, when executed by the at least one processor, cause the apparatus to:

generate, based on the flexible algorithm definition information and the advertising information, a forwarding construct configured to map the first node segment identifier of the second router for the segment routing flexible algorithm to the flexible algorithm definition defining the segment routing flexible algorithm.

15. The first router of claim 1 , wherein the instructions, when executed by the at least one processor, cause the apparatus to:

generate, based on the flexible algorithm definition information and the advertising information, a forwarding construct configured to map the second node segment identifier of the second router for the segment routing flexible algorithm to the flexible algorithm definition defining the segment routing flexible algorithm and to the flexible algorithm topology slice description.

16. The first router of claim 1 , wherein the first flexible algorithm topology slice of the segment routing flexible algorithm is based on at least one of a delay metric, a routing protocol metric, or a traffic engineering metric.

17. The first router of claim 1 , wherein the second flexible algorithm topology slice of the segment routing flexible algorithm is based on at least one of a quality-of-service parameter, a traffic metering parameter, a flow enhancer parameter, a security parameter, or an optimization parameter.

18. A router, comprising:

at least one processor; and

at least one memory storing instructions that, when executed by the at least one processor, cause the router to:

receive, for a segment routing flexible algorithm, flexible algorithm definition information, wherein the flexible algorithm definition information includes a flexible algorithm definition defining the segment routing flexible algorithm, wherein the flexible algorithm definition information includes a flexible algorithm topology slice description and a slice identifier for the flexible algorithm topology slice description;

send, for a segment routing flexible algorithm, a first advertisement for a first flexible algorithm topology slice supported by the router for the segment routing flexible algorithm, wherein the first advertisement includes a first node segment identifier of the router for the segment routing flexible algorithm;

send, for the segment routing flexible algorithm, a second advertisement for a second flexible algorithm topology slice supported by the router for the segment routing flexible algorithm, wherein the second advertisement includes a second node segment identifier of the router for the segment routing flexible algorithm and the slice identifier of the flexible algorithm topology slice description; and

receive, by the router, a first packet including the first node segment identifier based on the first flexible algorithm topology slice and a second packet including the second node segment identifier based on the second flexible algorithm topology slice.

19. A first router, comprising:

at least one processor; and

at least one memory storing instructions that, when executed by the at least one processor, cause the first router to:

receive, for a segment routing flexible algorithm, flexible algorithm definition information, wherein the flexible algorithm definition information includes a flexible algorithm definition defining the segment routing flexible algorithm, wherein the flexible algorithm definition information includes a flexible algorithm topology slice description and a slice identifier for the flexible algorithm topology slice description;

receive, for a segment routing flexible algorithm, a first advertisement of a second router for a first flexible algorithm topology slice of the segment routing flexible algorithm, wherein the first advertisement includes a first node segment identifier of the second router for the segment routing flexible algorithm;

receive, for the segment routing flexible algorithm, a second advertisement of the second router for a second flexible algorithm topology slice of the segment routing flexible algorithm, wherein the second advertisement includes a second node segment identifier of the second router for the segment routing flexible algorithm and the slice identifier of the flexible algorithm topology slice description; and

send, toward the second router, a first packet using the first flexible algorithm topology slice based on inclusion of the first node segment identifier of the second router in the first packet and a second packet using the second flexible algorithm topology slice based on inclusion of the second node segment identifier of the second router in the second packet.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 4, 2021
From: BOCCI, MATTHEW
To: NOKIA UK LIMITED
Reel/Frame 055155/0297 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 4, 2021
From: VAN DE VELDE, GUNTER
To: NOKIA BELL NV
Reel/Frame 055155/0330 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 4, 2021
From: NOKIA UK LIMITED
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 055155/0406 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 4, 2021
From: NOKIA BELL NV
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 055155/0444 →
Continuity (1)
Related Publication 20220247663A1 · Aug 4, 2022
References Cited (31)
US 10601724B1 · Filsfils · 2020 [cited by examiner]
US 11071017B2 · Dong · 2021 [cited by examiner]
US 20200008067A1 · Filsfils · 2020 [cited by examiner]
US 20200128445A1 · Dong · 2020 [cited by applicant]
US 20200244588A1 · Filsfils et al. · 2020 [cited by applicant]
US 20220200893A1 · Yao · 2022 [cited by examiner]
US 20230033298A1 · Peng · 2023 [cited by examiner]
US 20230283568A1 · Filsfils · 2023 [cited by examiner]
CN 1625872A · 2005 [cited by applicant]
CN 101641913A · 2010 [cited by applicant]
CN 105247822A · 2016 [cited by applicant]
CN 109565467A · 2019 [cited by applicant]
CN 111225419A · 2020 [cited by applicant]
CN 111835637A · 2020 [cited by applicant]
CN 112311673A · 2021 [cited by applicant]
CN 113285876A · 2021 [cited by examiner]
EP 3648420A1 · 2020 [cited by applicant]
WO WO2022110535A1 · 2022 [cited by examiner]
Shaofu, “IGP Flexible Algorithm Optimization for Network Slicing draft-peng-lsr-flex-algo-opt-slicing-02”, (Year: 2020). [cited by examiner]
J. Zhou, Z. Zhang and N. Zhou, “A Segment List Management Algorithm Based on Segment Routing,” 2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN), Chongqing, China, 2019, pp. 297-302,… [cited by examiner]
A. Cai, Z. Fan, K. Xu, M. Zukerman and C. -K. Chan, “Elastic versus WDM networks with dedicated multicast protection,” in Journal of Optical Communications and Networking, vol. 9, No. 11, pp. 921-933, Nov. 2017, doi: 10… [cited by examiner]
EP Search Report mailed in corresponding EP Application No. 22151848.3 on Jul. 4, 2022, 12 pages. [cited by applicant]
Saad, T., et al., “Scalable Network Slicing over SR Networks,” draft-bestbar-spring-scalable-ns-00, Spring Working Group, Internet Engineering Task Force, Dec. 16, 2022, 10 pages. [cited by applicant]
Farrel, Ed., A., “Overview and Principles of Internet Traffic Engineering,” draft-ietf-teas-rfc3272bis-10, TEAS Working Group, Internet Engineering Task Force, Dec. 28, 2020, 82 pages. [cited by applicant]
Psenak, P., et al., “IGP Flexible Algorithm,” IETF, Network Working Group, draft-ietf-Isr-flex-algo-13, Oct. 22, 2020, 37 pages. [cited by applicant]
Blake, S., C., et al., “An Architecture for Differentiated Services,” IETF, RFC 2475, Dec. 1998, 36 pages. [cited by applicant]
Awduche, D., et al., “RSVP-TE: Extensions to RSVP for LSP Tunnels,” IETF, RFC 3209, Dec. 2001, 61 pages. [cited by applicant]
Filsfils, C., et al., “Segment Routing Architecture,” IETF, RFC 8402, Jul. 2018, 32 pages. [cited by applicant]
Office Action received in corresponding European Patent Application No. 22 151 848.3-1215, dated Aug. 29, 2024, 8 pages. [cited by applicant]
1st Office Action and Search Report, CN 202210112512.1, Nov. 23, 2023, 8 pages. [cited by applicant]
Office Action received for corresponding Chinese Patent Application No. 202210112512.1, dated May 22, 2024, 7 pages of Office Action and 8 pages of translation, 15 total pages. [cited by applicant]