Multiple top-of-rack (TOR) switches connected to a network virtualization device
US-12086625-B2 · Sep 10, 2024 · US
US10122627B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10122627-B2 |
| Application number | US-201615252821-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 31, 2016 |
| Priority date | Aug 31, 2016 |
| Publication date | Nov 6, 2018 |
| Grant date | Nov 6, 2018 |
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.
Computer networking device obtains route information including route attributes specifying characteristics for each of a plurality of routes through a first network. A routing algorithm is applied to choose an optimal route to one of a plurality of peer computer networking devices comprising a second network which is an overlay upon the first network. The optimal route is chosen based on the type of data contained in the data packet and the plurality of route attributes associated with the routes. The routes traverse paths through the first computer network which include network nodes other than the peer networking devices.
Opening claim text (preview).
We claim: 1. A method for routing packet data through an overlay network based on application needs and network conditions, comprising: in a computer networking device connected to a first computer network, determining a plurality of routes to a plurality of peer computer networking devices; obtaining at the computer networking device route information for each of the plurality of routes, said route information comprising a plurality of route attributes specifying dynamic characteristics for each of the plurality of routes; storing at the computer networking device the route information for each of the plurality of routes, including the plurality of route attributes; receiving at least one data packet to be communicated through the computer networking device; inspecting the at least one data packet received to determine a type of data contained therein; selectively varying levels of significance or weight accorded to each of the plurality of route attributes within a routing algorithm based on the type of data contained in the at least one data packet; using the routing algorithm to choose an optimal route to one of the peer computer networking devices from among the plurality of routes based on the type of data contained in the data packet and the plurality of route attributes associated with each of said plurality of routes; wherein said computer networking device and the peer computer networking devices comprise a second computer network which is an overlay upon on the first computer network, and wherein said plurality of routes traverse paths through said first computer network which include network nodes other than said peer networking devices. 2. The method according to claim 1 , further comprising selecting said plurality of route attributes from the group consisting of the available bandwidth associate with the particular route, data latency associated with the particular route, data loss characteristics associated with the particular route and jitter corresponding to the route. 3. The method according to claim 1 , wherein the type of data packet implies a type of application which communicated said data packet, and the routing algorithm selects the optimal route to facilitate optimal performance of the type of application which is implied. 4. The method according to claim 3 , wherein said optimal performance is obtained by more heavily weighting within the routing algorithm the importance of one or more attributes from among the plurality of attributes for purposes of selecting the optimal route from among the plurality of routes. 5. The method according to claim 1 , further comprising selectively varying an optimal route which is chosen for a subsequently received second data packet which is of the same type as the at least one data packet. 6. The method according to claim 5 , wherein said optimal route is varied when a change occurs in one or more of the plurality of routes with respect to one or more of the route attributes which are predetermined to be of importance for communicating the type of data. 7. The method according to claim 1 , wherein the obtaining step further comprises receiving from one or more of the peer computer networking devices one or more route update messages specifying the one or more network routes and plurality of route attributes. 8. The method according to claim 1 , further comprising communicating to the plurality of peer computer networking devices one or more network routes to the peer computer network devices as identified by the computer networking device. 9. The method according to claim 8 , further comprising including in said communication to the plurality of peer computer networking devices the plurality of route attributes associated with said one or more network routes. 10. The method according to claim 9 , wherein the plurality of route attributes are dynamically variable and the first computer network device communicates updates to the peer computer network devices when a change exceeds a predetermined threshold. 11. The method according to claim 9 , wherein updated information concerning the plurality of route attributes for each of said network routes is determined by the computer networking device based on data traffic communicated between the computer networking device and one or more of the peer computer network devices. 12. A network appliance for routing packet data through an overlay network, comprising: a computer networking device including at least one processing circuit and configured to determine within a first computer network a plurality of routes to a plurality of peer computer networking devices; obtain route information for each of the plurality of routes, said route information comprising a plurality of route attributes specifying dynamic characteristics for each of the plurality of routes; store in a memory device the route information for each of the plurality of routes, including the plurality of route attributes; receive at least one data packet to be communicated through the first computer network; inspect the at least one data packet received to determine a type of data contained therein; and apply a routing algorithm to choose an optimal route to one of the peer computer networking devices from among the plurality of routes based on the type of data contained in the data packet and the plurality of route attributes associated with each of said plurality of routes; wherein said computer networking device and the peer computer networking devices comprise a second computer network which is an overlay upon on the first computer network; wherein said plurality of routes traverse paths through said first computer network which include network nodes other than said peer networking devices; and wherein said routing algorithm selectively varies a level of significance or weight accorded to each of the plurality of route attributes based on the type of data contained in the data packet. 13. The network appliance according to claim 12 , wherein said plurality of route attributes are selected from the group consisting of the available bandwidth associate with the particular route, data latency associated with the particular route, data loss characteristics associated with the particular route and jitter corresponding to the route. 14. The network appliance according to claim 12 , wherein the type of data packet implies a type of application which communicated said data packet, and the routing algorithm is configured to select the optimal route to facilitate optimal performance of the type of application which is implied. 15. The network appliance according to claim 14 , wherein said optimal performance is obtained by selectively weighting within the routing algorithm the importance of one or more attributes from among the plurality of attributes for purposes of selecting the optimal route from among the plurality of routes. 16. The network appliance according to claim 12 , wherein said routing algorithm selectively varies an optimal route which is chosen for a subsequently received second data packet which is of the same type as the at least one data packet. 17. The network appliance according to claim 16 , wherein said routing algorithm is configured to vary the optimal route when a change occurs in one or more of the plurality of routes with respect to one or more of the route attributes which are predetermined to be of importance for communicating the type of data. 18. The network appliance according to claim 12 , wherein the computer networking device is configured to receive f
using an overlay routing layer · CPC title
using a combination of metrics · CPC title
Avoiding congestion; Recovering from congestion · CPC title
using node-based peer discovery mechanisms (static access to replicated servers H04L67/1006; service discovery H04L67/51) · CPC title
Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.