Systems and methods for optimizing traffic in a data network. Network traffic may be optimized by associating costs with data links that connect network nodes. A set of lowest cost paths between a source network node and a destination network node may be determined by analyzing paths in the data network. An explored path may be extended to another network node based on whether the other network node is able to reach the destination network node without forming a loop with the explored path.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method comprising: retrieving, from a memory, map data identifying a plurality of network nodes and a plurality of data links between the network nodes, wherein each data link has an associated cost; receiving an identification of a source network node and a destination network node in the plurality of network nodes; determining, by a processing circuit, a set of respective singlemost lowest cost paths between the destination network node and each other network node of the plurality based in part on the associated costs of the plurality of data links; determining, by the processing circuit, a set of explored paths based in part on the difference between the map data and the set of respective singlemost lowest cost paths between the plurality of network nodes and the destination network node; and determining, by the processing circuit, a set of at least two lowest cost paths from the source network node to the destination network node by extending one or more of the explored paths based in part on whether one of the plurality of data links is a valid path extension for an explored path.
2. The method of claim 1 , wherein one of the plurality of data links is determined to be a valid path extension based in part on whether a path exists from the extended path to the destination network node without forming a loop with the explored path.
3. The method of claim 2 , wherein the one of the plurality of data links is determined to be a valid path utilizing map data that does not include one or more nodes in the explored path.
4. The method of claim 1 , wherein paths are explored in order of associated cost and lexicographic order.
5. The method of claim 1 , further comprising utilizing the set of at least two lowest cost paths to route data from the source network node to the destination network node.
6. The method of claim 1 , further comprising storing, within the memory, a plurality of sets of at least two lowest cost paths between a plurality of source network nodes and destination network nodes.
7. A processing circuit configured to retrieve map data identifying a plurality of network nodes and a plurality of data links between the network nodes, wherein each data link has an associated cost, wherein the processing circuit is further configured to: receive an indication of a source network node and a destination network node in the plurality of network nodes; determine a set of respective singlemost lowest cost paths between the destination network node and each other network node of the plurality based in part on the associated costs of the plurality of data links; determine a set of explored paths based in part on the difference between the map data and the set of respective singlemost lowest cost paths between the plurality of network nodes and the destination network node; and determine a set of at least two lowest cost paths from the source network node to the destination network node by extending one or more of the explored paths based in part on whether one of the plurality of data links is a valid path extension for an explored path.
8. The processing circuit of claim 7 , wherein one of the plurality of data links is determined to be a valid path extension based in part on whether a path exists from the extended path to the destination network node without forming a loop with the explored path.
9. The processing circuit of claim 8 , wherein the one of the plurality of data links is determined to be a valid path utilizing map data that does not include one or more nodes in the explored path.
10. The processing circuit of claim 7 , wherein paths are explored in order of associated cost and lexicographic order.
11. The processing circuit of claim 7 , wherein the processing circuit is further configured to utilize the set of at least two lowest cost paths to route data from the source network node to the destination network node.
12. The processing circuit of claim 7 , wherein the processing circuit is further configured to store a plurality of sets of at least two lowest cost paths between a plurality of source network nodes and destination network nodes.
13. The processing circuit of claim 7 , wherein the processing circuit is further configured to provide, to another electronic device, the set of at least two lowest cost paths from the source network node to the destination network node.
14. One or more non-transitory computer-readable media having instructions stored therein, the instructions being executable by one or more processors to cause the one or more processors to perform operations comprising: receiving map data identifying a plurality of network nodes and a plurality of data links between the network nodes, wherein each data link has an associated cost; receiving an identification of a source network node and a destination network node in the plurality of network nodes; determining a set of respective singlemost lowest cost paths between the destination network node and each other network node of the plurality based in part on the associated costs of the plurality of data links; determining a set of explored paths based in part on the difference between the map data and the set of respective singlemost lowest cost paths between the plurality of network nodes and the destination network node; and determining a set of at least two lowest cost paths from the source network node to the destination network node by extending one or more of the explored paths based in part on whether one of the plurality of data links is a valid path extension for an explored path.
15. The one or more non-transitory computer-readable media of claim 14 , wherein one of the plurality of data links is determined to be a valid path extension based in part on whether a path exists from the extended path to the destination network node without forming a loop with the explored path.
16. The one or more non-transitory computer-readable media of claim 15 , wherein the one of the plurality of data links is determined to be a valid path utilizing map data that does not include one or more nodes in the explored path.
17. The one or non-transitory more computer-readable media of claim 14 , wherein paths are explored in order of associated cost and lexicographic order.
18. The one or non-transitory more computer-readable media of claim 14 , wherein the operations further comprise utilizing the set of at least two lowest cost paths to route data from the source network node to the destination network node.
19. The one or non-transitory more computer-readable media of claim 14 , wherein the operations further comprise storing a plurality of sets of at least two lowest cost paths between a plurality of source network nodes and destination network nodes.
20. The one or non-transitory more computer-readable media of claim 14 , wherein the associated cost of each data link is based on a ping time between network nodes connected by the data link.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
November 22, 2011
January 14, 2014
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.