Partially dynamic concurrent update of distributed shortest paths

Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007

Volumn , Issue , 2007, Pages 32-38

  D'Angelo, Gianlorenzo ^a   Di Stefano, Gabriele ^a   Cicerone, Serafino ^a   Frigioni, Daniele ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONCURRENT ENGINEERING; CONVERGENCE OF NUMERICAL METHODS; DYNAMIC PROGRAMMING; PARTIAL DIFFERENTIAL EQUATIONS; PROBLEM SOLVING;

DISTRIBUTED SHORTEST PATHS; DYNAMIC ALGORITHMS; PATHS PROBLEM;

MOTION PLANNING;

EID: 34547362337     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCTA.2007.101     Document Type: Conference Paper

References (17)

1. H. Attiya and J. Welch. Distributed Computing. John Wiley and Sons, 2004.
2. B. Awerbuch, A. Bar-Noy, and M. Gopal. Approximate distributed bellman-ford algorithms. IEEE Transactions on Communications, 42(8):2515-2517, 1994.
3. B. Awerbuch, I. Cidon, and S. Kutten. Communications-optimal maintenance of replicated information. In Proc. IEEE Symposium on Foundation of Computer Science, pages 492-502, 1990.
4. D. Bertsekas and R. Gallager. Data Networks. Prentice Hall International, 1992.
5. S. Cicerone, G. D. Stefano, D. Frigioni, and U. Nanni. A fully dynamic algorithm for distributed shortest paths. Theoretical Computer Science, 297(1-3):83-102, Mar. 2003.
6. G. D'Angelo, S. Cicerone, G. D. Stefano, and D. Frigioni. Partially dynamic concurrent update of distributed shortest paths. Technical Report R.06-92, Univ. of L'Aquila IT, 2006. http://www.diel.univaq.it/tr/web/ web_search_tr.php.
7. C. Demetrescu and G. F. Italiano. A new approch to dynamic all pairs shortest paths. Jou. of ACM, 51(6):968-992, 2004.
8. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms, 34(2):251-281, 2000.
9. P. A. Humblet. Another adaptive distributed shortest path algorithm. IEEE Transactions on Communications, 39(6):995-1002, Apr. 1991.
10. G. F. Italiano. Distributed algorithms for updating shortest paths. Proceedings of Int. Workshop on Distributed Algorithms., LNCS, 579:200-211, 1991.
11. J. McQuillan. Adaptive routing algorithms for distributed coomputer networks. Technical Report BBN Report 2831, Cambridge, MA, 1974.
12. J. T. Moy. OSPF - Anatomy of an Internet routing protocol. Addison-Wesley, 1998.
13. A. Orda and R. Rom. Distributed shortest-path and minimum-delay protocols in networks with time-dependent edge-length. Distributed Computing, 10:49-62, 1996.
14. G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problem. Theoretical Computer Science, 158:233-277, 1996.
15. K. V. S. Ramarao and S. Venkatesan. On finding and updating shortest paths distributively. Journal of Algorithms, 13:235-257, 1992.
16. E. C. Rosen. The updating protocol of arpanet's new routing algorithm. Computer Networks, 4:11-19, 1980.
17. A. S. Tanenbaum. Computer Networks. Prentice Hall, 1996.