Advertisement

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches

  • Annalisa D’Andrea
  • Mattia D’Emidio
  • Daniele Frigioni
  • Stefano Leucci
  • Guido Proietti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8504)

Abstract

In this paper we focus on dynamic batch algorithms for single-source shortest paths in graphs with positive real edge weights. A dynamic algorithm is called batch if it is able to handle graph changes that consist of multiple edge updates at a time, i.e., a batch. Unfortunately, most of the algorithmic solutions known in the literature for this problem are analyzed with respect to heterogeneous parameters, and this makes unfeasible an effective comparison on a theoretical basis. Thus, for a full comprehension of their actual performance, in the past these solutions have been assessed experimentally. In this paper, we move ahead along this direction, by focusing our attention on homogeneous batches, i.e., either incremental or decremental batches, which model realistic dynamic scenarios like node failures in communication networks and traffic jams in road networks. We provide an extensive experimental study including both the most effective previous batch algorithms and a recently developed one, which was explicitly designed (and was shown to be theoretically efficient) exactly for homogeneous batches. Our work complements previous studies and shows that the various solutions can be consistently ranked on the basis of the type of homogeneous batch and of the underlying network. As a result, we believe it can be helpful in selecting a proper solution depending on the specific application scenario.

Keywords

Short Path Road Network Node Failure Short Path Problem Short Path Tree 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albert, R., Barabási, A.L.: Emergence of scaling in random networks. Science 286, 509–512 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bauer, R., Wagner, D.: Batch dynamic single-source shortest-path algorithms: An experimental study. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 51–62. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Bollobás, B.: Random Graphs. Cambridge University Press, Cambridge (2001)CrossRefzbMATHGoogle Scholar
  4. 4.
    Bruera, F., Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D.: Dynamic multi-level overlay graphs for shortest paths. Math. Comput. Sci. 1(4), 709–736 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Chan, E., Yang, Y.: Shortest path tree computation in dynamic graphs. IEEE Trans. Comput. 4(58), 541–557 (2009)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Cicerone, S., D’Angelo, G., Di Stefano, G., Frigioni, D.: Partially dynamic efficient algorithms for distributed shortest paths. Theoret. Comput. Sci. 411, 1013–1037 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    D’Andrea, A., D’Emidio, M., Frigioni, D., Leucci, S., Proietti, G.: Dynamically maintaining shortest path trees under batches of updates. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 286–297. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  8. 8.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Semidynamic algorithms for maintaining single source shortest paths trees. Algorithmica 22(3), 250–274 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms 34(2), 251–281 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms 49(1), 86–113 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    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
  13. 13.
    Narváez, P., Siu, K.Y., Tzeng, H.Y.: New dynamic algorithms for shortest path tree computation. IEEE/ACM Trans. Netw. 8(6), 734–746 (2000)CrossRefGoogle Scholar
  14. 14.
    PTV: (2008), http://www.ptv.de
  15. 15.
    Ramalingam, G., Reps, T.W.: An incremental algorithm for a generalization of the shortest paths problem. J. Algorithms 21, 267–305 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theoret. Comput. Sci. 158(1&2), 233–277 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Roditty, L., Zwick, U.: On dynamic shortest paths problems. Algorithmica 61(2), 389–401 (2011)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Annalisa D’Andrea
    • 1
  • Mattia D’Emidio
    • 1
  • Daniele Frigioni
    • 1
  • Stefano Leucci
    • 1
  • Guido Proietti
    • 1
  1. 1.Department of Information Engineering, Computer Science and MathematicsUniversity of L’AquilaL’AquilaItaly

Personalised recommendations