Methods, devices and systems for determining a target path in a network

1. A method, comprising:

iteratively providing, from a Message Handler of a processing system, messages to each of a group of Node Processors of the processing system, wherein each of the group of Node Processors represents a node of a group of nodes, wherein the iteratively providing of the messages comprises:

providing, by the Message Handler to a Node Bus, a group of first messages, wherein each first message of the group of first messages includes a cost associated with a path of nodes visited by said each first message;

determining, by each of the group of Node Processors, paths having common endpoints among a portion of the group of first messages;

identifying, by each of the group of Node Processors, a cost for each of the paths having common endpoints resulting in a group of common endpoint costs;

identifying, by each of the group of Node Processors, a lowest cost from among the group of common endpoint costs; and

identifying, by each of the group of Node Processors, a selected path associated with the lowest cost, wherein a next group of messages includes the selected path, wherein the iteratively providing of the messages results in a plurality of selected paths; and

responsive to the iteratively providing of the messages, determining, by the processing system, a target path that is a remaining path of the plurality of selected paths, wherein the remaining path is identified from the iteratively providing of the messages, wherein the target path is through each node of the group of nodes.

2. The method of claim 1 , comprising determining an existence of a complete path.

3. The method of claim 1 , wherein the target path is a complete shortest path.

4. The method of claim 1 , wherein the group of nodes comprises a source node, an intermediate node, and a destination node, the intermediate node being situated, with respect to the target path between the source node and the destination node, and wherein the target path is a shortest path connecting at least the source node, the intermediate node, and the destination node.

5. The method of claim 1 , wherein each of the paths having common endpoints traverses a same subgroup of the group of nodes.

6. The method of claim 1 , wherein the lowest cost is associated with a first path from the paths having common endpoints, wherein the identifying of the lowest cost from among the group of common endpoint costs comprises:

identifying, by each of the group of Node Processors, a next higher cost from among the group of common endpoint costs, wherein the next higher cost is associated with a second path from the paths having common endpoints;

comparing, by each of the group of Node Processors, the lowest cost to the next higher cost; and

determining, by each of the group of Node Processors, the lowest cost is lower than the next higher cost.

7. The method of claim 1 , wherein the identifying of the selected path associated with the lowest cost comprises identifying, by each of the group of Node Processors, the selected path and eliminating one or more pruned paths, wherein the cost is one of time, distance, monetary cost, available bandwidth, latency, throughput, risk, or probability of success.

8. A device, comprising:

a processing system including a processor, a group of Node Processors, an Administration Processor, and a Message Handler, wherein each of the group of Node Processors represents a node of a group of nodes; and

a memory that stores executable instructions that, when executed by the processing system, facilitates performance of operations, the operations comprising:

iteratively providing messages to each of the group of node processors, wherein the iteratively providing of the messages comprises:

providing a group of first messages by the Message Handler to a Node Bus, wherein each first message of the group of first messages includes a cost associated with a path of nodes visited by said each first message;

determining by each of the group of Node Processors, paths having common endpoints among a portion of the group of first messages;

identifying by each of the group of Node Processors, a cost for each of the paths having common endpoints resulting in a group of common endpoints costs;

identifying by each of the group of Node Processors a lowest cost from among the group of common endpoint costs; and

identifying by each of the group of Node Processors a selected path associated with the lowest cost, wherein a next group of messages includes the selected path, wherein the iteratively providing of the messages results in a plurality of selected paths; and

responsive to the iteratively providing of the messages, determining a target path that is a remaining path of the plurality of selected paths, wherein the remaining path is identified from the iteratively providing of the messages, wherein the target path is through each node of the group of nodes.

9. The device of claim 8 , wherein the target path is a complete path.

10. The device of claim 8 , wherein the target path is a complete shortest path.

11. The device of claim 8 , wherein each of the paths having common endpoints traverses a same subgroup of the group of nodes.

12. The device of claim 8 , wherein the lowest cost is associated with a first path from the paths having common endpoints, wherein the identifying of the lowest cost from among the group of common endpoint costs comprises:

identifying by each of the group of Node Processors a next higher cost from among the group of common endpoint costs, wherein the next higher cost is associated with a second path from the paths having common endpoints;

comparing by each of the group of Node Processors the lowest cost to the next higher cost; and

determining by each of the group of Node Processors the lowest cost is lower than the next higher cost.

13. The device of claim 8 , wherein the cost is one of time, distance, monetary cost, available bandwidth, latency, throughput, risk or probability of success.

14. A non-transitory machine-readable medium, comprising executable instructions that, when executed by a processing system including a processor, a group of Node Processors, an Administration Processor, and a Message Handler, wherein each of the group of Node Processors represents a node of a group of nodes, facilitate performance of operations, the operations comprising:

iteratively providing messages to each of the group of node processors, wherein the iteratively providing of the messages comprises:

providing a group of first messages by the Message Handler to a Node Bus, wherein each first message of the group of first messages includes a quantifiable metric associated with a path of nodes visited by said each first message;

determining by each of the group of Node Processors, paths having common endpoints among a portion of the group of first messages, wherein each of the paths having common endpoints traverses a same subgroup of the group of nodes;

identifying by each of the group of Node Processors, a quantifiable metric for each of the paths having common endpoints resulting in a group of common endpoint quantifiable metrics;

identifying by each of the group of Node Processors a lowest quantifiable metric from among the group of common endpoint quantifiable metrics; and

identifying by each of the group of Node Processors a selected path associated with the lowest quantifiable metric, wherein a next group of messages includes the selected path, wherein the iteratively providing of the messages results in a plurality of selected paths; and

responsive to the iteratively providing of the messages, determining a target path that is from a remaining path of the plurality of selected paths, wherein the remaining path is identified from the iteratively providing of the messages, wherein the target path is through each node of the group of nodes.

15. The non-transitory machine-readable medium of claim 14 , wherein the target path is a complete path.

16. The non-transitory machine-readable medium of claim 14 , wherein the target path is a complete shortest path.

17. The non-transitory machine-readable medium of claim 14 , wherein the target path is a shortest path.

18. The non-transitory machine-readable medium of claim 14 , wherein the quantifiable metric is one of time, distance, monetary cost, available bandwidth, latency, throughput, risk or a probability of success.

19. The non-transitory machine-readable medium of claim 14 , wherein the lowest quantifiable metric is associated with a first path from the paths having common endpoints, wherein the identifying of the lowest quantifiable metric from among the group of endpoint quantifiable metrics comprises: identifying by each of the group of Node Processors a next higher quantifiable metric from among the group of common endpoint quantifiable metrics, wherein the next higher quantifiable metric is associated with a second path from the paths having common endpoints; and comparing by each of the group of Node Processors the lowest quantifiable metric to the next higher quantifiable metric.

20. The non-transitory machine-readable medium of claim 19 , wherein the identifying of the lowest quantifiable metric from among the group of common endpoint quantifiable metrics comprises determining by each of the group of Node Processors the lowest quantifiable metric is lower than the next higher quantifiable metric.