Multicast forwarding methods and apparatuses across autonomous systems
US-2024275714-A1 · Aug 15, 2024 · US
US11528216B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11528216-B2 |
| Application number | US-202017035239-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 28, 2020 |
| Priority date | Oct 11, 2013 |
| Publication date | Dec 13, 2022 |
| Grant date | Dec 13, 2022 |
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.
A method and an apparatus for controlling a network traffic path are provided. 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).
The invention claimed is: 1. A method for controlling a network traffic path, the method comprising: receiving, by a controller, routing advertisement information from a first network to a second network, wherein the routing advertisement information includes information of selected routing nodes in a third network connecting the first network and the second network; determining, by the controller, a path in the third network based on the routing advertisement information, wherein the path includes the selected routing nodes for transmitting data from the second network to the first network; and in response to the controller determining that one of the selected nodes is not in the determined path, selecting, by the controller, a routing node that is in a next hop relationship with the selected node not in the determined path and conforms to a preset constraint condition for routing the routing advertisement information between the first and second networks. 2. The method according to claim 1 , wherein determining, by the controller, the path in the third network based on the routing advertisement information comprises: determining, by the controller, a first border node in the third network communicating with the first network based on the routing advertisement information; and determining, by the controller, a second border node in the third network communicating with the second network based on the routing advertisement information. 3. The method according to claim 1 , wherein determining, by the controller, the path in the third network based on the routing advertisement information comprises: determining, by the controller, a first border node in the third network communicating with the first network based on the routing advertisement information; determining, by the controller, a second border node in the third network communicating with the second network based on the routing advertisement information. 4. The method according to claim 3 , wherein the next hop routing node of the first border node conforms to the preset constraint condition based on received routing plan information between the first border node and the second border node, wherein the routing plan information comprise at least one routing node between the first border node and the second border node. 5. The method according to claim 4 , wherein selecting, by the controller, the next hop routing node of the first border node from one or more routing nodes in the third network based on the routing advertisement information comprises: selecting, by the controller, a routing node among the selected routing nodes that is in direct communication with the second border node; executing, by the controller, the following operations for the selected routing node: (i) determining whether other selected routing nodes connected to the selected routing node comprise a routing node communicating with the first border node; (ii) in response to determining that the other selected routing nodes connected to the selected routing node comprise at least one routing node communicating with the first border node, selecting the at least one routing node as the next hop routing node; and (iii) in response to determining that the other selected routing nodes connected to the selected routing node do not comprise at least one routing node communicating with the first border node, selecting a routing node conforming to the preset constraint condition from routing nodes connected to the selected routing node that are not among the selected nodes; and repeat (i) through (iii) until the selected routing nodes create a path for communicating between the first and second border nodes. 6. The method according to claim 3 , wherein selecting, by the 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: in response to a need for transmitting data of a plurality of the second networks to the first network, for the second network, determining, by the 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. 7. An apparatus for controlling a network traffic path, the apparatus comprising: a processor; and a non-transitory computer-readable storage medium coupled to the processor and storing programming instructions for execution by the processor, the programming instructions instruct the processor to: receive routing advertisement information from a first network to a second network, wherein the routing advertisement information includes information of selected routing nodes in a third network connecting the first network and the second network; determine a path in the third network based on the routing advertisement information, wherein the path includes the selected routing nodes for transmitting data from the second network to the first network; and in response to the controller determining that one of the selected nodes is not in the determined path, selecting, by the controller, a routing node that is in a next hop relationship with the selected node not in the determined path and conforms to a preset constraint condition for routing the routing advertisement information between the first and second networks. 8. The apparatus according to claim 7 , wherein the programming instructions instruct the processor to: determine a first border node in the third network communicating with the first network based on the routing advertisement information; and determine a second border node in the third network communicating with the second network based on the routing advertisement information. 9. The apparatus according to claim 8 , wherein the next hop routing node of the first border node conforms to the preset constraint condition based on received routing plan information between the first border node and the second border node, wherein the routing plan information comprise at least one routing node between the first border node and the second border node. 10. The apparatus according to claim 9 , wherein the programming instructions instruct the processor to: select a routing node among the selected routing nodes that is in direct communication with the second border node; execute the following operations for the selected routing node: (i) determine whether other selected routing nodes connected to the selected routing node comprise a routing node communicating with the first border node; (ii) in response to determining that the other selected routing nodes connected to the selected routing node comprise at least one routing node communicating with the first border node, select the at least one routing node as the next hop routing node; and (iii) in response to determining that the other selected routing nodes connected to the selected routing node do not comprise at least one routing node communicating with the first border node, select a routing node conforming to the preset constraint condition from routing nodes connected to the selected routing node that are not among the selected nodes; and repeat (i) through (iii) until the selected routing nodes create a path for communicating between the first and second border nodes. 11. The apparatus according to claim 10 , wherein the programming instructions instruct the processor to: in response to data of a plurality of the second networks needing to be transmitted to the first network, for the second network, determine the routing node conforming to the pre
Interdomain routing, e.g. hierarchical routing · CPC title
Centralised routing · CPC title
Hop count for routing purposes, e.g. TTL · CPC title
Evaluation of link metrics (techniques for monitoring network metrics H04L43/08) · CPC title
Topology update or discovery · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.