Avoiding asymetric routing in an sdwan by dynamically setting bgp attributes within routing information advertised by an sdwan appliance
US-2021306261-A1 · Sep 30, 2021 · US
US12289232B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12289232-B2 |
| Application number | US-202318504576-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 8, 2023 |
| Priority date | Dec 10, 2021 |
| Publication date | Apr 29, 2025 |
| Grant date | Apr 29, 2025 |
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.
In one embodiment, a method includes receiving, by a first node of a node cluster in a software-defined wide area network (SD-WAN), traffic from a wide area network (WAN), assigning, by the first node of the node cluster, flow ownership of the traffic to the first node, and communicating, by the first node of the node cluster, the traffic to a local area network (LAN). The method also includes receiving, by the first node of the node cluster, return traffic from a second node of the node cluster and detecting, by the first node of the node cluster, a diversion of the return traffic. The method further includes relinquishing, by the first node of the node cluster, the flow ownership and assigning, by the first node of the node cluster, the flow ownership to the second node of the node cluster.
Opening claim text (preview).
What is claimed is: 1. A network component comprising one or more processors and one or more computer-readable non-transitory storage media coupled to the one or more processors and including instructions that, when executed by the one or more processors, cause the network component to perform operations comprising: receiving traffic from a first network; assigning flow ownership of the traffic to a first node; communicating the traffic to a second network; receiving return traffic from a second node; detecting a diversion of the return traffic; relinquishing the flow ownership; and assigning the flow ownership to the second node. 2. The network component of claim 1 , wherein: a node cluster comprises the first node and the second node; and the network component is the first node of the node cluster. 3. The network component of claim 1 , wherein: the first network is a local area network (LAN); and the second network is a LAN. 4. The network component of claim 1 , wherein the traffic and the return traffic are asymmetrically routed. 5. The network component of claim 1 , wherein assigning the flow ownership to the first node comprises creating a flow owner entry in a flow entry table to identify the first node as a flow owner. 6. The network component of claim 1 , wherein assigning the flow ownership to the second node comprises updating a flow owner entry in a flow entry table to identify the second node as a flow owner. 7. The network component of claim 1 , wherein detecting the diversion of the return traffic is in response to receiving the return traffic from the second node. 8. A method, comprising: receiving traffic from a first network; assigning flow ownership of the traffic to a first node; communicating the traffic to a second network; receiving return traffic from a second node; detecting a diversion of the return traffic; relinquishing the flow ownership; and assigning the flow ownership to the second node. 9. The method of claim 8 , wherein a node cluster comprises the first node and the second node. 10. The method of claim 8 , wherein: the first network is a local area network (LAN); and the second network is a LAN. 11. The method of claim 8 , wherein the traffic and the return traffic are asymmetrically routed. 12. The method of claim 8 , wherein assigning the flow ownership to the first node comprises creating a flow owner entry in a flow entry table to identify the first node as a flow owner. 13. The method of claim 8 , wherein assigning the flow ownership to the second node comprises updating a flow owner entry in a flow entry table to identify the second node as a flow owner. 14. The method of claim 8 , wherein detecting the diversion of the return traffic is in response to receiving the return traffic from the second node. 15. One or more computer-readable non-transitory storage media embodying instructions that, when executed by a processor, cause the processor to perform operations comprising: receiving traffic from a first network; assigning flow ownership of the traffic to a first node; communicating the traffic to a second network; receiving return traffic from a second node; detecting a diversion of the return traffic; relinquishing the flow ownership; and assigning the flow ownership to the second node. 16. The one or more computer-readable non-transitory storage media of claim 15 , wherein a node cluster comprises the first node and the second node. 17. The one or more computer-readable non-transitory storage media of claim 15 , wherein: the first network is a local area network (LAN); and the second network is a LAN. 18. The one or more computer-readable non-transitory storage media of claim 15 , wherein the traffic and the return traffic are asymmetrically routed. 19. The one or more computer-readable non-transitory storage media of claim 15 , wherein assigning the flow ownership to the first node comprises creating a flow owner entry in a flow entry table to identify the first node as a flow owner. 20. The one or more computer-readable non-transitory storage media of claim 15 , wherein assigning the flow ownership to the second node comprises updating a flow owner entry in a flow entry table to identify the second node as a flow owner.
Distributed routing · CPC title
Dynamic adaptation of the update intervals, e.g. event-triggered updates · CPC title
Routing in software-defined topologies, e.g. routing between virtual machines · CPC title
Interdomain routing, e.g. hierarchical routing · CPC title
using an overlay routing layer · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.