Shortest paths and loop-free routing in dynamic networks

In this paper, we survey the existing methods for designing shortest paths routing algorithms for dynamic networks. We compare them based on worst-case communication and message complexity, and suggest new approach that yields a protocol with linear time and polynomial communication. The main idea behind our approach is to use a “dynamic synchronizer”, which transforms a dynamic asynchronous network into static synchronous one. We believe this is an important methodology in design and analysis of communication protocols, that can be applied to other problems as well.

[1]  Taesoon Park,et al.  Checkpointing and rollback-recovery in distributed systems , 1989 .

[2]  S. Finn.  Resynch Procedures and a Fail-Safe Network Protocol , 1979, IEEE Trans. Commun..

[3]  J. J. Garcia-Luna-Aceves,et al.  A unified approach to loop-free routing using distance vectors or link states , 1989, SIGCOMM '89.

[4]  Moshe Sidi,et al.  A Failsafe Distributed Protocol for Minimum Delay Routing , 1981, IEEE Trans. Commun..

[5]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[6]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM '89.

[7]  Decision Systems.,et al.  Distributed minimum hop algorithms , 1982 .

[8]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[9]  Bala Rajagopalan,et al.  A new responsive distributed shortest-path rounting algorithm , 1989, SIGCOMM '89.

[10]  William D. Tajibnapis,et al.  A correctness proof of a topology information maintenance protocol for a distributed computer network , 1977, CACM.

[11]  Pierre A. Humblet,et al.  An adaptive distributed Dijkstra shortest path algorithm , 1988 .

[12]  Baruch Awerbuch,et al.  Dynamic networks are as fast as static networks , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  Baruch Awerbuch,et al.  Applying static network protocols to dynamic networks , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[14]  Robert G. Gallager,et al.  A new distributed algorithm to find breadth first search trees , 1987, IEEE Trans. Inf. Theory.

[15]  Greg N. Frederickson,et al.  A Single Source Shortest Path Algorithm for a Planar Distributed Network , 1985, STACS.

[16]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[17]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..