Multicast forwarding methods and apparatuses across autonomous systems
US-2024275714-A1 · Aug 15, 2024 · US
US10812368B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10812368-B2 |
| Application number | US-201615094621-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 8, 2016 |
| Priority date | Oct 11, 2013 |
| Publication date | Oct 20, 2020 |
| Grant date | Oct 20, 2020 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
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.
Opening claim text (preview).
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, wherein the routing advertisement information includes information about routing nodes in a third network capable of providing paths connecting the first and second networks; determining, by the routing controller, a path between a first border node of the third network and a second border node of the third network according to the routing advertisement information, wherein the path comprises the first and second border nodes, and one or more of the routing nodes of the third network that connect the first and second border nodes so as to allow for communication between the first and second border nodes, and wherein the first border node communicates with the first network, and the second border node communicates with the second network; and configuring, by the routing controller, a next hop routing node for each of the border and routing nodes in the determined path by sending to each of the border and routing nodes in the determined path a route between the node and its associated next hop routing node, wherein each of the border and routing nodes in the determined path is adjacent its associated next hop routing node, wherein each next hop routing node is a routing node not in the determined path, and wherein configuring the next hop routing node for each of the border and routing nodes in the determined path provides each of the border and routing nodes in the determined path with an alternative path connecting the first and second border nodes. 2. The method according to claim 1 , wherein determining the path between the first border node of the third network and the second border node of the third network according to the routing advertisement information comprises: determining, by the routing controller, the routing nodes in the path according to the routing advertisement information and received routing plan information between the first and second border nodes, wherein plan nodes in the routing plan information comprise at least one routing node between the first and second border nodes, and the determined path comprises the at least one routing node. 3. The method according to claim 1 , wherein determining the path between the first border node of the third network and the second border node of the third network comprises: determining, by the routing controller, a routing node between the first border node and the second border node that conforms to a preset constraint condition according to the routing advertisement information and received routing plan information between the first and second border nodes, wherein plan nodes in the routing plan information comprise at least one routing node between the first and second border nodes, and the determined path comprises the at least one routing node. 4. The method according to claim 3 , wherein determining the routing node between the first border node and the second border node that conforms to the preset constraint condition according to the routing advertisement information and the received routing plan information between the first and second border nodes comprises: selecting, by the routing controller, a routing node communicating with the second border node; executing, by the routing controller, the following operations for the selected routing node until the selected routing node communicates with the first border node: determining, by the routing controller, whether routing nodes connected to the selected routing node comprise a routing node in the at least one routing node; in response to determining that the routing nodes connected to the selected routing node comprise the routing node in the at least one routing node, selecting, by the routing controller, the routing node in the at least one routing node as the next hop routing node; and in response to determining that the routing nodes connected to the selected routing node do not comprise the routing node in the at least one routing node, selecting, by the routing controller, a routing node conforming to the preset constraint condition from the routing nodes connected to the selected routing node communicating with the second border node as the next hop routing node. 5. The method according to claim 4 , wherein selecting, by the routing controller, the routing node conforming to the preset constraint condition from the routing nodes connected to the selected routing node communicating with the second border node as the next hop routing node comprises: when data of a plurality of the second networks need to be transmitted to the first network, for the second network, determining, by the routing controller, the routing node conforming to the preset constraint condition from at least one unselected routing node connected to the selected routing node communicating with the second border node as the next hop routing node. 6. The method according to claim 1 , wherein determining the path between the first and second border nodes of the third network according to the routing advertisement information comprises: determining, by the routing controller, a routing node between the first and second border nodes conforming to a preset constraint condition according to the routing advertisement information. 7. The method according to claim 6 , wherein determining the routing node between the first and second border nodes conforming to the preset constraint condition according to the routing advertisement information comprises: selecting, by the routing controller, a routing node communicating with the second border node; executing, by the routing controller, the following operation for the selected routing node until the selected routing node communicates with the first border node: and selecting, by the routing controller, a routing node conforming to the preset constraint condition from routing nodes connected to the selected routing node communicating with the second border node as the next hop routing node. 8. The method according to claim 7 , wherein selecting, by the routing controller, the routing node conforming to the preset constraint condition from the routing nodes connected to the selected routing node communicating with the second border node as the next hop routing node comprises: when data of a plurality of the second networks need to be transmitted to the first network, for the second network, determining, by the routing controller, a routing node conforming to the preset constraint condition from at least one unselected routing node connected to the selected routing node communicating with the second border node as the next hop routing node. 9. A routing controller for controlling a network traffic path, the routing controller comprising: a processor; a receiver configured to cooperate with the processor to receive routing advertisement information from a first network to a second network, wherein the routing advertisement information includes information about routing nodes in a third network capable of providing paths connecting the first and second networks; and the processor configured to: determine a path between a first border nodes of the third network and a second border node of the third network according to the routing advertisement information, wherein the path comprises the first and second border nodes and one or more of the routing nodes of the third network that connects the first and second border nodes so as to allow for communication between the first and second border nodes, wherein the first border node communicates with the first network, and the second bor
Topology update or discovery · CPC title
Evaluation of link metrics (techniques for monitoring network metrics H04L43/08) · CPC title
Centralised routing · CPC title
Interdomain routing, e.g. hierarchical routing · CPC title
Hop count for routing purposes, e.g. TTL · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.