Distributed algorithm for shortest path problem via randomized strategy

In this paper, we introduce a distributed algorithm for single source shortest path problem for undirected graphs. In this problem, we find the shortest path from a given source node to other nodes in the graph. We start with undirected unweighted graphs in which the shortest path is a path with minimum number of edges. Following, we modify the algorithm to find shortest path for weighted graphs in which the shortest path is a path with minimum cost, i.e., sum of the edge weights. We examine the convergence time of the given algorithm for random Erdös-Rényi graphs as a random variable; based on that we approximate the stop-time criteria of the algorithm for graphs with unknown topology. We claim that the stop-time criteria is related to the graph parameters such as number of nodes and graph diameter.

[1]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[2]  Nicholas Roy,et al.  Rapidly-exploring Random Belief Trees for motion planning under uncertainty , 2011, 2011 IEEE International Conference on Robotics and Automation.

[3]  Peter Sanders,et al.  Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.

[4]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[5]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[6]  Amos Fiat,et al.  Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.

[7]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  Soummya Kar,et al.  A coordination-free distributed algorithm for simple assignment problems using randomized actions , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[10]  Usman A. Khan,et al.  A distributed self-clustering algorithm for autonomous multi-agent systems , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  Albert-László Barabási,et al.  Control Centrality and Hierarchical Structure in Complex Networks , 2012, PloS one.

[12]  B. Bollobás.  The evolution of random graphs , 1984 .

[13]  M. Mesbahi,et al.  Brief Paper - Sieve method for consensus-type network tomography , 2013 .

[14]  Mehran Mesbahi,et al.  A graph realization approach to network identification , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[15]  Robert Nowak,et al.  Network Tomography: Recent Developments , 2004 .