Patent ID: 8630185
Filing Date: 2014-01-14
Classification: H04L

Abstract:
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.