A Speed-Up Technique for Distributed Shortest Paths Computation
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.
KeywordsShort Path Central Node Peripheral Node Dynamic Graph Space Overhead
Unable to display preview. Download preview PDF.
- 4.McQuillan, J.: Adaptive routing algorithms for distributed computer networks. Technical Report BBN Report 2831, Cambridge, MA (1974)Google Scholar
- 6.Moy, J.T.: OSPF: Anatomy of an Internet routing protocol. Addison-Wesley, Reading (1998)Google Scholar
- 7.Elmeleegy, K., Cox, A.L., Ng, T.S.E.: On count-to-infinity induced forwarding loops in ethernet networks. In: Proceedings IEEE INFOCOM, pp. 1–13 (2006)Google Scholar
- 8.Myers, A., Ng, E., Zhang, H.: Rethinking the service model: Scaling ethernet to a million nodes. In: ACM SIGCOMM HotNets. ACM Press, New York (2004)Google Scholar
- 10.Zhao, C., Liu, Y., Liu, K.: A more efficient diffusing update algorithm for loop-free routing. In: 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCom 2009), pp. 1–4. IEEE Press, Los Alamitos (2009)Google Scholar
- 12.Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D., Maurizio, V.: Engineering a new algorithm for distributed shortest paths on dynamic networks (submitted for publication), http://informatica.ing.univaq.it/misc/DUST/, Prel. version in 
- 13.D’Angelo, G., Frigioni, D., Maurizio, V.: An experimental study of distributed algorithms for shortest paths on real networks. In: 12th Italian Conference on Theoretical Computer Science, ICTCS (2010)Google Scholar
- 14.Hyun, Y., Huffaker, B., Andersen, D., Aben, E., Shannon, C., Luckie, M., Claffy, K.: The CAIDA IPv4 routed/24 topology dataset, http://www.caida.org/data/active/ipv4_routed_24_topology_dataset.xml
- 16.OMNeT++: The discrete event simulation environment, http://www.omnetpp.org/