Region Guided and Change Tolerant Fast Shortest Path Algorithm and Graph Preprocessing Framework
US-2016377442-A1 · Dec 29, 2016 · US
US10693733B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10693733-B2 |
| Application number | US-201815912839-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 6, 2018 |
| Priority date | Oct 27, 2017 |
| Publication date | Jun 23, 2020 |
| Grant date | Jun 23, 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.
A method for establishing a partitioned fabric network is described. The method includes establishing a fabric network including a plurality of border nodes to couple the fabric network to one or more external data networks and a plurality of edge nodes to couple to the fabric network to one or more hosts. The method further includes defining a plurality of partitions of the fabric network. The method further includes registering each of the plurality of partitions with a corresponding one of the plurality of border nodes and with each of the plurality of edge nodes.
Opening claim text (preview).
What is claimed is: 1. A method comprising: establishing a fabric network comprising a plurality of border nodes and a plurality of edge nodes, wherein the plurality of border nodes are coupled to one or more external data networks via a first network layer, and wherein the plurality of edge nodes are coupled to one or more hosts via a second network layer, the second network layer being different than the first network layer, and wherein the plurality of border nodes are connected to the plurality of edge nodes via an underlay network; partitioning the fabric network into a plurality of partitions, wherein each of the plurality of partitions of the fabric network comprises a border node of the plurality of border nodes, and wherein each of the plurality of partitions further comprises a network address and a control plane; and registering each of the plurality of partitions with the border node of the plurality of border nodes and with each of the plurality of edge nodes. 2. The method of claim 1 , wherein a number of the plurality of partitions is the same as a number of the plurality of border nodes. 3. The method of claim 1 , further comprising: detecting association of a first host with a first edge node of the plurality of edge nodes; assigning the first host to a first partition of the plurality of partitions; transmitting a map-update request for the first host to a corresponding first border node of the plurality of border nodes to cause the first border node to update a map to include an entry associating the first host with the first edge node. 4. The method of claim 3 , wherein assigning the first host to a first one of the plurality of partitions is performed randomly, in a round-robin fashion, or according to policy heuristics. 5. The method of claim 3 , wherein the entry includes an endpoint identifier (EID) of the first host and a resource locator (RLOC) of the first edge node. 6. The method of claim 3 , wherein the map only includes entries for hosts assigned to the first partition. 7. The method of claim 1 , further comprising announcing the plurality of partitions of the fabric network to one or more external networks. 8. The method of claim 1 , wherein announcing the plurality of partitions includes announcing, by each of the plurality of border nodes, the corresponding one of the plurality of partitions. 9. A method comprising: establishing a fabric network comprising a plurality of border nodes and a plurality of edge nodes, wherein the plurality of border nodes are coupled to one or more external data networks, wherein the plurality of edge nodes are coupled to one or more hosts, and wherein the plurality of border nodes are connected to the plurality of edge nodes via an underlay network; partitioning the fabric network into a plurality of partitions, wherein each of the plurality of partitions comprises a border node of the plurality of border nodes, and wherein each of the plurality of partitions further comprises a network address and a control plane; registering each of the plurality of partitions with the border node and with each of the plurality of edge nodes; receiving, at a first edge node of the fabric network, data from a first host of the one or more hosts addressed to a second host of the one or more hosts; selecting the border node of the fabric network that is associated with the second host; sending, from the first edge node to the border node, a map-request for the second host; receiving, at the first edge node in response to the map-request, an indication of a second edge node associated with the second host; and sending, from the first edge node to the second edge node, the data from the first host addressed to the second host. 10. The method of claim 9 , wherein selecting the border node of the fabric network that is associated with the second host includes: determining a partition associated with the second host; and selecting the border node of the fabric network that is associated with the partition. 11. The method of claim 10 , wherein determining the partition associated with the second host includes: inspecting an endpoint identifier (EID) of the second host included in the data from the first host; and determining the partition based on the EID. 12. The method of claim 11 , wherein determining the partition based on the EID includes: parsing the EID to extract an instance identifier (IID) or IP address portion; and determining the partition based on the IID or IP address portion. 13. The method of claim 11 , wherein the map-request for the second host includes the EID. 14. A method comprising: establishing a fabric network comprising a plurality of border nodes and a plurality of edge nodes, wherein the plurality of border nodes are coupled to one or more external data networks, wherein the plurality of edge nodes are coupled to one or more hosts, and wherein the plurality of border nodes are connected to the plurality of edge nodes via an underlay network; partitioning the fabric network into a plurality of partitions, wherein each of the plurality of partitions comprises a border node of the plurality of border nodes, and wherein each of the plurality of partitions further comprises a network address and a control plane; registering each of the plurality of partitions with the border node and with each of the plurality of edge nodes; detecting, at a first edge node of the fabric network, association by a first host of the one or more hosts; selecting the border node of the fabric network that is associated with the first host; sending, to the border node, a map-update request to update a mapping for the first host to point to the first edge node. 15. The method of claim 14 , wherein selecting the border node of the fabric network that is associated with the first host includes: determining a partition associated with the first host; and selecting the border node of the fabric network that is associated with the partition. 16. The method of claim 15 , wherein determining the partition associated with the first host includes: inspecting an endpoint identifier (EID) of the first host included in the data from the first host; and determining the partition based on the ED. 17. The method of claim 16 , wherein determining the partition based on the HD includes: parsing the EID to extract an instance identifier (IID) or IP address portion; and determining the partition based on the IID or IP address portion. 18. The method of claim 16 , wherein the map-update request for the first host includes the ED. 19. The method of claim 14 , further comprising sending, to a second edge node to which the first host was previously associated, an update message instructing the second edge node to remove the first host from a local cache of the second edge node. 20. The method of claim 19 , wherein the update message further instructs the second edge node to add the first host to a remote cache of the second edge node.
Discovery or management of network topologies · CPC title
Virtual switches · CPC title
Layer-2 addresses, e.g. medium access control [MAC] addresses · CPC title
Providing for device mobility (network addressing or numbering for mobility support in wireless networks H04W8/26; mobile IP H04W80/04) · CPC title
Internet protocol [IP] addresses · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.