IP Library › Granted Patent US 12,494,983
Granted Patent B2
US 12,494,983 · App. 18/001,746 · Granted Dec 9, 2025

Method and apparatus generating a forwarding path, network device and storage medium

Inventors: Xiangqing Chang (Beijing, CN); Mengxiao Chen (Beijing, CN); Zhaoyan Lei (Beijing, CN); Tao Lin (Beijing, CN); Hao Li (Beijing, CN)
Assignee: NEW H3C TECHNOLOGIES CO., LTD.
H04L45/02H04L41/12
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,494,983
App. No.
18/001,746
Granted
Dec 9, 2025
Kind
B2
Abstract

Method and apparatus for generating a forwarding path, network device and storage medium. Method comprises: obtaining topology information of first network nodes supporting a target path calculation algorithm; performing, using the target path calculation algorithm, path calculation based on the topology information of first network nodes to generate a first forwarding path; obtaining a second forwarding path from the source node to the tail node when there is a path interruption in the first forwarding path; determining, from the second forwarding path, first network nodes communicated with second network nodes obtaining node pairs; updating a next hop device of the first node in each node pair on the second forwarding path as the second node in the node pair obtaining a forwarding path communicated from the source node to the tail node. Second node is located behind first node in each node pair in a direction of second forwarding path.

Claims (49)

1 . A method for generating a forwarding path, comprising:

obtaining topology information of first network nodes supporting a target path calculation algorithm;

performing, using the target path calculation algorithm, path calculation based on the topology information of the first network nodes to generate a first forwarding path, wherein the first forwarding path is a forwarding path from a designated source node to a designated tail node in the first network nodes;

obtaining a second forwarding path from the source node to the tail node when there is a path interruption in the first forwarding path, wherein the second forwarding path is a forwarding path determined based on topology information of all the first network nodes and topology information of second network nodes, and the second network nodes do not support the target path calculation algorithm;

determining, from the second forwarding path, first network nodes communicated with second network nodes to obtain node pairs; and

updating a next hop device of a first node in each node pair on the second forwarding path as a second node in the node pair to obtain a forwarding path communicated from the source node to the tail node, the second node is located behind the first node in each node pair in a direction of the second forwarding path.

2 . The method of claim 1 , wherein obtaining a second forwarding path from the source node to the tail node comprises:

determining a third network node in the first forwarding path where a path interruption occurs, and determining a first forwarding sub-path from the source node to the third network node; and

generating a second forwarding sub-path from the third network node to the tail node based on topology information of fourth network nodes and topology information of second network nodes, the fourth network nodes being first network nodes that are not located in the first forwarding sub-path;

wherein determining, from the second forwarding path, first network nodes communicated with second network nodes to obtain node pairs comprises:

determining, from the second forwarding sub-path, first network nodes in communication with second network nodes to obtain node pairs;

wherein updating a next hop device of a first node in each node pair on the second forwarding path as a second node in the node pair to obtain a forwarding path communicated from the source node to the tail node comprises:

updating the next hop device of the first node in each node pair on the second forwarding sub-path as the second node in the node pair; and

connecting the first forwarding sub-path and the updated second forwarding sub-path to obtain a forwarding path communicated from the source node to the tail node.

3 . The method of claim 2 , wherein generating a second forwarding sub-path from the third network node to the tail node based on topology information of fourth network nodes and topology information of second network nodes comprises:

performing path calculation based on the topology information of the fourth network nodes and the topology information of the second network nodes by using the target path calculation algorithm to generate the second forwarding sub-path from the third network node to the tail node;

after connecting the first forwarding sub-path and the updated second forwarding sub-path to obtain a forwarding path communicated from the source node to the tail node, the method further comprises:

when generating a segment list of the communicated forwarding path, adding a binding segment identifier BSID between a first segment identifier SID and a second SID, so that the first node in a first node pair invokes a SRv6 forwarding strategy corresponding to the BSID to select a forwarding path to the second node in the first node pair, wherein, the forwarding strategy corresponding to the BSID uses the target path calculation algorithm, the first node pair is a node pair in the communicated forwarding path, the first SID is a SID corresponding to the first node in the first node pair, and the second SID is a SID corresponding to the second node in the first node pair.

4 . The method of claim 3 , further comprising:

when generating the segment list of the communicated forwarding path, adding security authentication instructions and instruction parameters of the security authentication instructions into function fields of a SID corresponding to each node in the first node pair.

5 . The method of claim 2 , wherein generating a second forwarding sub-path from the third network node to the tail node based on topology information of fourth network nodes and topology information of second network nodes comprises:

performing path calculation based on the topology information of the fourth network nodes and the topology information of the second network nodes by using a shortest path first algorithm to generate the second forwarding sub-path from the third network node to the tail node.

6 . The method of claim 1 , wherein obtaining a second forwarding path from the source node to the tail node comprises:

sending a path request to a control node; and

receiving a second forwarding path fed back by the control node, wherein the second forwarding path is a forwarding path from the source node to the tail node determined by the control node based on topology information of all the first network nodes and topology information of second network nodes.

7 . A network device, comprising a processor and a machine-readable storage medium having processor executable instructions stored thereon which, when executed by the processor, cause the processor to carry out operations of:

obtaining topology information of first network nodes supporting a target path calculation algorithm;

performing, using the target path calculation algorithm, path calculation based on the topology information of the first network nodes to generate a first forwarding path, wherein the first forwarding path is a forwarding path from a designated source node to a designated tail node in the first network nodes;

obtaining a second forwarding path from the source node to the tail node when there is a path interruption in the first forwarding path, wherein the second forwarding path is a forwarding path determined based on topology information of all the first network nodes and topology information of second network nodes, and the second network nodes do not support the target path calculation algorithm;

determining, from the second forwarding path, first network nodes communicated with second network nodes to obtain node pairs; and

updating a next hop device of a first node in each node pair on the second forwarding path as a second node in the node pair to obtain a forwarding path communicated from the source node to the tail node, the second node is located behind the first node in each node pair in a direction of the second forwarding path.

8 . The network device of claim 7 , wherein the processor executable instructions, when executed by the processor, cause the processor to specifically carry out operations of:

determining a third network node in the first forwarding path where a path interruption occurs, and determining a first forwarding sub-path from the source node to the third network node; and

generating a second forwarding sub-path from the third network node to the tail node based on topology information of fourth network nodes and topology information of second network nodes, the fourth network nodes being first network nodes that are not located in the first forwarding sub-path;

determining, from the second forwarding sub-path, first network nodes in communication with second network nodes to obtain node pairs;

updating the next hop device of the first node in each node pair on the second forwarding sub-path as the second node in the node pair; and

connecting the first forwarding sub-path and the updated second forwarding sub-path to obtain a forwarding path communicated from the source node to the tail node.

9 . The network device of claim 8 , wherein the processor executable instructions, when executed by the processor, cause the processor to specifically carry out operations of:

performing path calculation based on the topology information of the fourth network nodes and the topology information of the second network nodes by using the target path calculation algorithm to generate the second forwarding sub-path from the third network node to the tail node;

wherein after connecting the first forwarding sub-path and the updated second forwarding sub-path to obtain a forwarding path communicated from the source node to the tail node, the processor executable instructions, when executed by the processor, cause the processor to further carry out an operation of:

when generating a segment list of the communicated forwarding path, adding a binding segment identifier BSID between a first segment identifier SID and a second SID, so that the first node in a first node pair invokes a SRv6 forwarding strategy corresponding to the BSID to select a forwarding path to the second node in the first node pair, wherein, the forwarding strategy corresponding to the BSID uses the target path calculation algorithm, the first node pair is a node pair in the communicated forwarding path, the first SID is a SID corresponding to the first node in the first node pair, and the second SID is a SID corresponding to the second node in the first node pair.

10 . The network device of claim 9 , the processor executable instructions, when executed by the processor, cause the processor to further carry out an operation of:

when generating the segment list of the communicated forwarding path, adding security authentication instructions and instruction parameters of the security authentication instructions into function fields of a SID corresponding to each node in the first node pair.

11 . A non-transitory machine-readable storage medium having machine-executable instructions stored thereon which, when called and executed by a processor, cause the processor to implement the method of claim 1 .

12 . The network device of claim 7 , wherein the processor executable instructions, when executed by the processor, cause the processor to specifically carry out operations of:

sending a path request to a control node; and

receiving a second forwarding path fed back by the control node, wherein the second forwarding path is a forwarding path from the source node to the tail node determined by the control node based on topology information of all the first network nodes and topology information of second network nodes.

13 . The network device of claim 11 , wherein the processor executable instructions, when executed by the processor, cause the processor to specifically carry out an operation of:

performing path calculation based on the topology information of the fourth network nodes and the topology information of the second network nodes by using a shortest path first algorithm to generate the second forwarding sub-path from the third network node to the tail node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 14, 2022
From: CHANG, XIANGQING; CHEN, MENGXIAO; LEI, ZHAOYAN; LIN, TAO; LI, HAO
To: NEW H3C TECHNOLOGIES CO., LTD.
Reel/Frame 062090/0485 →
Continuity (1)
Related Publication 20240243989A1 · Jul 18, 2024
References Cited (24)
US 10637598B2 · Shen · 2020 [cited by examiner]
US 10659359B2 · Li · 2020 [cited by examiner]
US 10965536B2 · ChoFleming, Jr. · 2021 [cited by examiner]
US 20090232030A1 · Suzuki · 2009 [cited by examiner]
US 20150023150A1 · Chen · 2015 [cited by examiner]
US 20180083856A1 · Wang · 2018 [cited by examiner]
US 20200145319A1 · Joseph et al. · 2020 [cited by applicant]
US 20200344151A1 · Joseph et al. · 2020 [cited by applicant]
US 20220255853A1 · Peng · 2022 [cited by examiner]
US 20240243989A1 · Chang · 2024 [cited by examiner]
CN 109831382 · 2019 [cited by applicant]
CN 110661704A · 2020 [cited by examiner]
CN 110677341 · 2020 [cited by applicant]
CN 112822106 · 2021 [cited by applicant]
JP 2011166359 · 2011 [cited by applicant]
JP 2015029346 · 2015 [cited by applicant]
JP 2016146512 · 2016 [cited by applicant]
WO WO2006059787 · 2006 [cited by applicant]
WO WO2020187308 · 2020 [cited by applicant]
WO WO2020211609 · 2020 [cited by applicant]
Office Action issued in corresponding Japanese Application No. 2022-577542, dated Feb. 6, 2024. [cited by applicant]
Britto et al. “IGP Flexible Algorithms (Flexalgo) in IP networks draft-bonica-lsr-ip-flexalgo-00”, [cited by applicant]
Extended European Search Report issued in corresponding European Application No. 21945362.8, dated Jun. 26, 2023. [cited by applicant]
Psenak et al. “IGP Flexible Algorithm draft-ietf-lsr-flex-algo-09.txt” [cited by applicant]