Data networks
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
Distributed Algorithms for Updating Shortest Paths (Extended Abstract)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science
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
Always acyclic distributed path computation
IEEE/ACM Transactions on Networking (TON)
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Engineering a new loop-free shortest paths routing algorithm
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Enhancing the computation of distributed shortest paths on real dynamic networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
A loop-free shortest-path routing algorithm for dynamic networks
Theoretical Computer Science
| Hi-index | 0.00 |
We propose a simple and practical speed-up technique, which can be combined with every distance vector routing algorithm based on shortest paths, allowing to reduce the total number of messages sent by that algorithm. We combine the new technique with two algorithms known in the literature: DUAL, which is part of CISCO's widely used EIGRP protocol, and the recent DUST, which has been shown to be very effective on networks with power law node degree distribution. We give experimental evidence that these combinations lead to an important gain in terms of the number of messages sent by DUAL and DUST at the price of a little increase in terms of space occupancy per node.