Method and apparatus for controlling network traffic path

Patent metadata

Field	Value
Publication number	US-11805047-B2
Application number	US-202217985647-A
Country	US
Kind code	B2
Filing date	Nov 11, 2022
Priority date	Oct 11, 2013
Publication date	Oct 31, 2023
Grant date	Oct 31, 2023

Abstract

The present disclosure discloses a method and an apparatus for controlling a network traffic path. The method includes: receiving routing advertisement information from a first network to a second network; determining all routing nodes included in a path through which data pass when flowing from the second network to the first network according to the routing advertisement information; and configuring a next hop routing node for each determined routing node, where the next hop routing node is a node in all the routing nodes included in the path and is adjacent to the routing node for which the next hop routing node is configured, and the routing node for which the next hop routing node is configured does not include a routing node of the first network or a routing node of the second network.

First claim

What is claimed is:

1. A method for controlling a network traffic path, the method comprising:
receiving, by a routing controller, routing advertisement information from a first network to a second network;
determining, by the routing controller, a next hop routing node in a path through which data pass from the second network to the first network according to the routing advertisement information by sequentially selecting routing nodes in the second network until the selected routing node is determined to be the next hop routing node for connecting to the first network,
wherein determining the next hop routing node includes determining whether any routing nodes connected to one of the sequentially selected routing nodes are among nodes identified in routing plan information comprising N nodes between the first and second networks or determining whether any routing nodes connected to the one of the sequentially selected routing nodes otherwise conform to a preset constraint condition, and
wherein N is a positive integer; and

configuring, by the routing controller, the determined next hop routing node.

2. The method according to claim 1 , including:
determining, by the routing controller, all the routing nodes in the path according to the routing advertisement information and the routing plan information or the routing advertisement information and the preset constraint condition.

3. The method according to claim 1 , wherein the preset constraint condition is a condition constraining one or more of a bandwidth, a routing cost, a reliability, a time delay and a load.

4. The method according to claim 1 , wherein the next hop routing node is adjacent to the one of the sequentially selected routing nodes and the one of the sequentially selected routing nodes is not a routing node of the first or second network.

5. An apparatus for controlling a network traffic path, the apparatus comprising:
a processor;
a receiver configured to cooperate with the processor to receive routing advertisement information from a first network to a second network; and
the processor is configured to
determine a next hop routing node in a path through which data pass from the second network to the first network according to the routing advertisement information by sequentially selecting routing nodes in the second network until the selected routing node is determined to be the next hop routing node for connecting to the first network,
wherein determining the next hop routing node includes determining whether any routing nodes connected to one of the sequentially selected routing nodes are among nodes identified in routing plan information comprising N nodes between the first and second networks or determining whether any routing nodes connected to the connected routing nodes conform to a preset constraint condition based on none of the connected routing nodes being among the nodes identified in the routing plan information, and
wherein N is a positive integer; and
configure the determined next hop routing node for the one of the sequentially selected nodes.

6. The apparatus according to claim 5 , wherein the processor is further configured to:
determine all the routing nodes in the path according to the routing advertisement information and the routing plan information or the routing advertisement information and the preset constraint condition.

7. The apparatus according to claim 6 , wherein the preset constraint condition is a condition constraining one or more of a bandwidth, a routing cost, a reliability, a time delay and a load.

8. The apparatus according to claim 5 , wherein the next hop routing node is adjacent to the one of the sequentially selected routing nodes and the one of the sequentially selected routing nodes is not a routing node of the first or second network.

9. A non-transitory computer readable medium storing instructions that, when executed by a processor, cause the processor to provide at least the following operations:
receiving routing advertisement information from a first network to a second network;
determining a next hop routing node in a path through which data pass from the second network to the first network according to the routing advertisement information by sequentially selecting routing nodes in the second network until the selected routing node is determined to be the next hop routing node for connecting to the first network,
wherein determining the next hop routing node includes determining whether any routing nodes connected to one of the sequentially selected routing nodes are among nodes identified in routing plan information comprising N nodes between the first and second networks or determining whether any routing nodes connected to the connected routing nodes conform to a preset constraint condition based on none of the connected routing nodes being among the nodes identified in the routing plan information, and
wherein N is a positive integer; and

configuring the determined next hop routing node for the one of the sequentially selected routing nodes.

10. The non-transitory computer readable medium according to claim 9 , wherein the next hop routing node is adjacent to the one of the sequentially selected routing nodes and the one of the sequentially selected routing nodes is not a routing node of the first or second network.

11. The non-transitory computer readable medium according to claim 9 , wherein determining the next hop routing node is determined according to the routing advertisement information and the routing plan information or the routing advertisement information and the preset constraint condition.

12. The non-transitory computer readable medium according to claim 9 , wherein the preset constraint condition is a condition constraining one or more of a bandwidth, a routing cost, a reliability, a time delay and a load.

Assignees

• Huawei Tech Co Ltd

Inventors

• Zhuang Shunwan
• Yan Changjiang
• Yu Fengqing
• Chen Fei
• Wang Lili
• Ouyang Yuanbin

Classifications

• H04L45/02

  Topology update or discovery · CPC title

• H04L45/04 Primary

  Interdomain routing, e.g. hierarchical routing · CPC title

• H04L45/123

  Evaluation of link metrics (techniques for monitoring network metrics H04L43/08) · CPC title

• H04L45/20

  Hop count for routing purposes, e.g. TTL · CPC title

• H04L45/42

  Centralised routing · CPC title