Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Subtle design issues in the implementation of distributed, dynamic routing algorithms
Computer Networks and ISDN Systems
Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
IEEE Transactions on Computers
Routing management in very large-scale networks
Future Generation Computer Systems
Hierarchical clustering with topology databases
Computer Networks and ISDN Systems
A minimum-hop routing algorithm bases on distributed information
Computer Networks and ISDN Systems
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Shortest paths and loop-free routing in dynamic networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Design of inter-administrative domain routing protocols
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Dynamics of distributed shortest-path routing algorithms
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Performance comparison of routing protocols using MaRS: distance-vector versus link-state
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Performance comparison of routing protocols under dynamic and static file transfer connections
ACM SIGCOMM Computer Communication Review
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
A Cluster-based Approach for Routing in Ad-Hoc Networks
MLICS '95 Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing
Avoiding Counting to Infinity in Distance Vector Routing
ICN '01 Proceedings of the First International Conference on Networking-Part 1
IEEE/ACM Transactions on Networking (TON)
Avoiding transient loops during the convergence of link-state routing protocols
IEEE/ACM Transactions on Networking (TON)
Consensus routing: the internet as a distributed system
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Improving internet-wide routing protocols convergence with MRPC timers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A more efficient diffusing update algorithm for loop-free routing
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Loop-free forwarding table updates with minimal link overflow
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Sequence numbers do not guarantee loop freedom: AODV can yield routing loops
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.00 |
We present a unified approach for the dynamic computation of shortest paths in a computer network using either distance vectors or link states. We describe a distributed algorithm that provides loop-free paths at every instant and extends or improves algorithms introduced previously by Chandy and Misra, Jaffe and Moss, Merlin and Segall, and the author. Our approach treats the problem of distributed shortest-path routing as one of diffusing computations, which was first proposed by Dijkstra and Scholten. We verify the loop-freedom of the new algorithm, and also demonstrate that it converges to the correct routing entries a finite time after an arbitrary sequence of topological changes. We analyze the complexity of the new algorithm when distance vectors and link states are used, and show that using distance vectors is better insofar as routing overhead is concerned.