Complexity of network synchronization
Journal of the ACM (JACM)
Checkpointing and Rollback-Recovery for Distributed Systems
IEEE Transactions on Software Engineering - Special issue on distributed systems
A single source shortest path algorithm for a planar distributed network
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
A new distributed algorithm to find breadth first search trees
IEEE Transactions on Information Theory
A minimum-hop routing algorithm bases on distributed information
Computer Networks and ISDN Systems
A unified approach to loop-free routing using distance vectors or link states
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new responsive distributed shortest-path rounting algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Communications of the ACM
A distributed routing algorithm for mobile wireless networks
Wireless Networks
Hi-index | 0.00 |
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.