IP Library › Granted Patent US 12,395,422
Granted Patent B2
US 12,395,422 · App. 18/154,939 · Granted Aug 19, 2025

Route advertisement method and related device

Inventors: Zhibo Hu (Beijing, CN); Ka Zhang (Beijing, CN); Sheng Fang (Beijing, CN)
Assignee: Huawei Technologies Co., Ltd.
H04L45/02H04L45/04H04L45/748
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,395,422
App. No.
18/154,939
Granted
Aug 19, 2025
Kind
B2
Abstract

A first network device obtains a first route, where the first route includes a first route prefix. The first network device advertises a second route, where the second route includes a subnet prefix and a path identifier, and a range of the subnet prefix includes a range of the first route prefix.

Claims (33)

1. A method, comprising:

obtaining, by a first network device, first routing information of a first route, wherein the first routing information comprises a first route prefix; and

advertising, by the first network device, second routing information of a second route, wherein the advertised second routing information comprises a subnet prefix and a path identifier, a range of the subnet prefix comprises a range of the first route prefix, the path identifier comprises a network slice identifier, the network slice identifier comprises a flexible algorithm identifier corresponding to a network slice, and the path identifier corresponds to a traffic engineering tunnel.

2. The method according to claim 1 , further comprising:

obtaining, by the first network device, third routing information of a third route, wherein the third routing information comprises a second route prefix; and

obtaining, by the first network device, the subnet prefix based on the second route prefix and the first route prefix.

3. The method according to claim 1 , wherein the second routing information is advertised by using an interior gateway protocol (IGP) packet.

4. The method according to claim 1 , wherein the first routing information is advertised by a second network device.

5. The method according to claim 4 , wherein the second network device and the first network device belong to different interior gateway protocol (IGP) domains.

6. An apparatus, comprising:

at least one processor; and

at least one non-transitory computer-readable storage medium storing a program to be executed by the at least one processor, the program including instructions to:

obtain first routing information, wherein the first routing information comprises a first route prefix; and

advertise second routing information, wherein the second routing information comprises a subnet prefix and a path identifier, a range of the subnet prefix comprises a range of the first route prefix, the path identifier comprises a network slice identifier, the network slice identifier comprises a flexible algorithm identifier corresponding to a network slice, and the path identifier corresponds to a traffic engineering tunnel.

7. The apparatus according to claim 6 , wherein the instructions further include instructions to:

obtain third routing information, wherein the third routing information comprises a second route prefix; and

obtain the subnet prefix based on the second route prefix and the first route prefix.

8. The apparatus according to claim 6 , wherein the second routing information is advertised by using an interior gateway protocol (IGP) packet.

9. The apparatus according to claim 6 , wherein the first routing information is advertised by a second network device.

10. A non-transitory storage medium storing a program, wherein when the program is executed by one or more processors, the execution causes the one or more processors to perform operations, the operations comprising:

obtaining first routing information, wherein the first routing information comprises a first route prefix; and

advertising second routing information, wherein the second routing information comprises a subnet prefix and a path identifier, a range of the subnet prefix comprises a range of the first route prefix, the path identifier comprises a network slice identifier, the network slice identifier comprises a flexible algorithm identifier corresponding to a network slice, and the path identifier corresponds to a traffic engineering tunnel.

11. The non-transitory storage medium according to claim 10 , wherein the operations further comprise:

obtaining third routing information, wherein the third routing information comprises a second route prefix; and

obtaining the subnet prefix based on the second route prefix and the first route prefix.

12. The non-transitory storage medium according to claim 10 , wherein the second routing information is advertised by using an interior gateway protocol (IGP) packet.

13. The non-transitory storage medium according to claim 10 , wherein the first routing information is advertised by a second network device.

14. The non-transitory storage medium according to claim 13 , wherein the second network device and a first network device to which the one or more processors are applied belong to different interior gateway protocol (IGP) domains.

15. The apparatus according to claim 9 , wherein the second network device and the apparatus belong to different interior gateway protocol (IGP) domains.

16. The apparatus according to claim 9 , wherein the second network device and the apparatus belong to different Border Gateway Protocol (BGP) domains.

17. The method according to claim 4 , wherein the second network device and the first network device belong to different Border Gateway Protocol (BGP) domains.

18. The non-transitory storage medium according to claim 13 , wherein the second network device and a first network device to which the one or more processors are applied belong to different Border Gateway Protocol (BGP) domains.

19. The method according to claim 1 , wherein the first network device maintains a mapping between a plurality of flexible algorithm identifiers and segment identifiers.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 2, 2023
From: HU, ZHIBO; ZHANG, KA; FANG, SHENG
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 063512/0550 →
Priority Claims (3)
CN 202010692883.2 · Jul 17, 2020 · national
CN 202011248687.2 · Nov 10, 2020 · national
CN 202011254841.7 · Nov 11, 2020 · national
Continuity (2)
Continuation PCTCN2021107119 · Jul 19, 2021
Related Publication 20230155937A1 · May 18, 2023
References Cited (29)
US 20040196854A1 · Thubert · 2004 [cited by examiner]
US 20090257439A1 · Xu · 2009 [cited by examiner]
US 20160173415A1 · Wang · 2016 [cited by examiner]
US 20180375685A1 · Zhuang · 2018 [cited by examiner]
US 20200145319A1 · Joseph · 2020 [cited by examiner]
US 20200313956A1 · Heitz · 2020 [cited by examiner]
US 20210273881A1 · Peng · 2021 [cited by examiner]
US 20230155938A1 · Hu · 2023 [cited by examiner]
CN 101014014A · 2007 [cited by examiner]
CN 101977150A · 2011 [cited by examiner]
CN 102546413A · 2012 [cited by examiner]
CN 108259341A · 2018 [cited by applicant]
CN 109218185A · 2019 [cited by examiner]
CN 110535766A · 2019 [cited by examiner]
EP 2099175A1 · 2009 [cited by examiner]
EP 3860057A1 · 2021 [cited by applicant]
JP 2004266822A · 2004 [cited by applicant]
JP 2010199800A · 2010 [cited by applicant]
WO WO2020052641A1 · 2020 [cited by examiner]
WO 2020063500A1 · 2020 [cited by applicant]
WO 2020083016A1 · 2020 [cited by applicant]
Machine translation of CN-101014014 (Year: 2007). [cited by examiner]
Machine translation of CN-110535766 (Year: 2019). [cited by examiner]
Unknown, “Understanding Route Aggregation in BGP”, 2018, Cisco, https://web.archive.org/web/20180826193647/https://www.cisco.com/c/en/us/support/docs/ip/border-gateway-protocol-bgp/5441-aggregation.html (Year: 2018). [cited by examiner]
Peter Psenak et al., “IGP Flexible Algorithm (draft-ietf-lsr-flex-algo-05)” (version 05), Nov. 2019, Internet Engineering Task Force (IETF) Network Working Group, https://datatracker.ietf.org/doc/draft-ietf-lsr-flex-alg… [cited by examiner]
Talaulikar et al., “Flexible Algorithm Definition Advertisement with BGP Link-State (draft-ietf-idr-bgp-ls-flex-algo-01)” (version 01), Jul. 2019, Internet Engineering Task Force (IETF) Network Working Group, https://da… [cited by examiner]
Dawra G.et.al., “SRv6 BGP based Overlay services draft-ietf-bess-srv6-services-03”, XP15140580A, Jul. 11, 2020, total 28 pages. [cited by applicant]
Zhou Chunning Dai Shaofu Peng ZTE Corp J:“Inter-domain Network Slicing via BGP-LU;draft-zhou-idr-inter-domain-lcu-01 .txt”, Feb. 18, 2020 (Feb. 18, 2020), pp. 1-7, XP015137795. [cited by applicant]
C. Filsfils et al., “RFC 9256 Segment Routing Policy Architecture”, Jul. 2022, total 35 pages. [cited by applicant]