Abstract
The problem of finding and updating shortest paths in distributed networks is considered crucial in today’s practical applications. In the recent past, there has been a renewed interest in devising new efficient distance-vector algorithms as an attractive alternative to link-state solutions for large-scale Ethernet networks. In this paper we present Distributed Computation Pruning (DCP), a new technique, which can be combined with every distance-vector algorithm based on shortest paths, allowing to reduce the total number of messages sent by that algorithm and its space occupancy per node. To check its effectiveness, we combined DCP with DUAL (Diffuse Update ALgorithm), one of the most popular distance-vector algorithm in the literature, and with the recently introduced LFR (Loop Free Routing) which has been shown to have good performances on real networks. We give experimental evidence that these combinations lead to a significant gain both in terms of number of messages sent and memory requirements per node.
Support for the IPv4 Routed/24 Topology Dataset is provided by National Sc. Foundation, US Dept of Homeland Security, WIDE Project, Cisco Systems, and CAIDA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, R., Barabási, A.-L.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall International (1992)
Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D.: Partially dynamic efficient algorithms for distributed shortest paths. Theoretical Computer Science 411, 1013–1037 (2010)
Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D., Maurizio, V.: Engineering a new algorithm for distributed shortest paths on dynamic networks. Algorithmica (to appear, 2012), doi: 10.1007/s00453-012-9623-9
Cicerone, S., Stefano, G.D., Frigioni, D., Nanni, U.: A fully dynamic algorithm for distributed shortest paths. Theoretical Comp. Science 297(1-3), 83–102 (2003)
D’Angelo, G., D’Emidio, M., Frigioni, D., Maurizio, V.: A Speed-Up Technique for Distributed Shortest Paths Computation. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part II. LNCS, vol. 6783, pp. 578–593. Springer, Heidelberg (2011)
D’Angelo, G., D’Emidio, M., Frigioni, D., Maurizio, V.: Engineering a New Loop-Free Shortest Paths Routing Algorithm. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 123–134. Springer, Heidelberg (2012)
Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms 34(2), 251–281 (2000)
Garcia-Lunes-Aceves, J.J.: Loop-free routing using diffusing computations. IEEE/ACM Trans. on Networking 1(1), 130–141 (1993)
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
Moy, J.T.: OSPF: Anatomy of an Internet routing protocol. Addison-Wesley (1998)
Myers, A., Ng, E., Zhang, H.: Rethinking the service model: Scaling ethernet to a million nodes. In: ACM SIGCOMM HotNets. ACM Press (2004)
OMNeT++. Discrete event simulation environment, http://www.omnetpp.org
Ray, S., Guérin, R., Kwong, K.-W., Sofia, R.: Always acyclic distributed path computation. IEEE/ACM Trans. on Networking 18(1), 307–319 (2010)
Rosen, E.C.: The updating protocol of arpanet’s new routing algorithm. Computer Networks 4, 11–19 (1980)
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 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D’Angelo, G., D’Emidio, M., Frigioni, D., Romano, D. (2012). Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. In: Even, G., Rawitz, D. (eds) Design and Analysis of Algorithms. MedAlg 2012. Lecture Notes in Computer Science, vol 7659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34862-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-34862-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34861-7
Online ISBN: 978-3-642-34862-4
eBook Packages: Computer ScienceComputer Science (R0)