Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks

  • Gianlorenzo D’Angelo
  • Mattia D’Emidio
  • Daniele Frigioni
  • Daniele Romano
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7659)


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.


Short Path Central Node Generic Node Open Short Path First Space Occupancy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albert, R., Barabási, A.-L.: Emergence of scaling in random networks. Science 286, 509–512 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall International (1992)Google Scholar
  3. 3.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    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-9Google Scholar
  5. 5.
    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)zbMATHCrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms 34(2), 251–281 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Garcia-Lunes-Aceves, J.J.: Loop-free routing using diffusing computations. IEEE/ACM Trans. on Networking 1(1), 130–141 (1993)CrossRefGoogle Scholar
  10. 10.
    Hyun, Y., Huffaker, B., Andersen, D., Aben, E., Shannon, C., Luckie, M., Claffy, K.: The CAIDA IPv4 routed/24 topology dataset,
  11. 11.
    Moy, J.T.: OSPF: Anatomy of an Internet routing protocol. Addison-Wesley (1998)Google Scholar
  12. 12.
    Myers, A., Ng, E., Zhang, H.: Rethinking the service model: Scaling ethernet to a million nodes. In: ACM SIGCOMM HotNets. ACM Press (2004)Google Scholar
  13. 13.
    OMNeT++. Discrete event simulation environment,
  14. 14.
    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)CrossRefGoogle Scholar
  15. 15.
    Rosen, E.C.: The updating protocol of arpanet’s new routing algorithm. Computer Networks 4, 11–19 (1980)zbMATHGoogle Scholar
  16. 16.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Gianlorenzo D’Angelo
    • 1
  • Mattia D’Emidio
    • 2
  • Daniele Frigioni
    • 2
  • Daniele Romano
    • 2
  1. 1.MASCOTTE Project INRIA/I3S(CNRS/UNSA)Sophia–Antipolis CedexFrance
  2. 2.Department of Information Engineering, Computer Science and MathematicsUniversity of L’AquilaL’AquilaItaly

Personalised recommendations