New dynamic algorithms for shortest path tree computation

IEEE/ACM Transactions on Networking

Volumn 8, Issue 6, 2000, Pages 734-746

  Narváez, Paolo ^a   Siu, Kai Yeung ^b   Tzeng, Hong Yi ^c  

^a Sycamore Networks   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Amber Networks   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NETWORK PROTOCOLS; TELECOMMUNICATION LINKS; TOPOLOGY;

SHORTEST PATH TREES (SPT);

ROUTERS;

EID: 0034466560     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.893870     Document Type: Article

References (31)

1. C. Baransel, W. Dobosiewicz, and P. Gburzynski, "Routing in multihop packet switching networks: Gb/s challenge," IEEE Network, vol. 9, pp. 38-61, May/June 1995.
2. R. Bellman, "On a routing problem," Q. Appl. Math., vol. 16, pp. 87-90, 1958.
3. D. Bertsekas, Linear Network Optimization: Algorithms and Codes, MA, Cambridge: MIT Press, 1991.
4. L. Breslau and D. Estrin, "Design of inter-administrative domain routing protocols," in Proc. SIGCOMM'90, Sept., pp. 231-241.
5. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
6. S. Deering and D. Cheriton, "Multicast routing in datagram internet-works and extended LANs," ACM Trans. Comput. Syst., vol. 8, no. 2, pp. 85-110, May 1990.
7. E. Dijkstra, "A note two problems in connection with graphs," Numerical Math., vol. 1, pp. 269-271, 1959.
8. E. Feuerstein and A. Marchetti-Spaccamela, "Dynamic algorithms for shortest paths in planar graphs," Theoretical Comput. Sci., vol. 116, pp. 359-371, 1993.
9. P. Franciosa, D. Frigioni, and R. Giaccio, "Semi-dynamic shortest paths and breadth-first search in digraph," in Proc. 14th Annu. Symp. Theoretical Aspects of Computer Science, Mar. 1997, pp. 33-46.
10. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni, "Fully dynamic output bounded single source shortest path problem," in Proc. 7th Annu. ACM-SIAM Symp. Discrete Algorithms, Atlanta, GA, 1998, pp. 212-221.
11. _, "Incremental algorithms for single-source shortest path trees," in Proc. Foundations of Software Technology and Theoretical Computer Science, Dec. 1994, pp. 113-124.
12. J. J. Garcia-Luna-Aceves and S. Murthy, "A path finding algorithm for loop-free routing," IEEE/ACM Trans. Networking, pp. 148-160, Feb. 1997.
13. C. Huitema, Routing in the Internet. Englewood Cliffs, NJ: Prentice-Hall, 1995.
14. G. Italiano, A. Marchetti-Spaccamela, and U. Nanni, "Incremental algorithms for minimal length paths," J. Algorithms, vol. 12, pp. 615-638, 1991.
15. C. Labovitz, G. Malan, and F. Jahanian, "Internet routing instability," in Proc. SIGCOMM'97, Sept., pp. 115-126.
16. J. Moy, "OSPF version 2," Cascade Communications Corp., Internet Draft, RFC 2178, July 1997.
17. _, OSPF: Anatomy of an Internet Routing Protocol. Reading, MA: Addison-Wesley, 1998.
18. J. McQuillan, I. Richer, and E. Rosen, "The new routing algorithm for the ARPANET," IEEE Trans. Commun., vol. COM-28, pp. 711-719, May 1980.
19. P. Narvaez, K.-Y. Siu, and H.-Y. Tzeng. (1998, May) New dynamic algorithms for shortest path tree computation. Bell Labs, Lucent Technologies. [Online]. Available: http://perth.mit.edu/ pnarvaez/publications.html
20. V. Paxson, "End-to-end routing behavior in the Internet," IEEE/ACM Trans. Networking, vol. 5, pp. 601-615, Oct. 1997.
21. R. Perlman and G. Varghese, "Pitfalls in the design of distributed routing algorithms," in Proc. SIGCOMM'88, Aug., pp. 43-54.
22. R. Perlman, "A comparison between two routing protocols: OSPF and IS-IS," IEEE Network, vol. 5, pp. 18-24, Sept. 1991.
23. B. Rajagopalan and M. Faiman, "A responsive distributed shortest-path routing algorithm within autonomous systems," Internetworking: Research and Experience, vol. 2, no. 1, pp. 51-69, Mar. 1991.
24. G. Ramalingam and T. Reps, "An incremental algorithm for a generalization of the shortest-path problem," J. Algorithms, vol. 21, pp. 267-305, 1996.
25. Y. Rekhter and T. P. Gross, "Applications of the border gateway protocol in the Internet," DDN Network Information Center, RFC 1772, Mar. 1995.
26. M. Schwartz and T. Stern, "Routing techniques used in computer communication networks," IEEE Trans. Commun., vol. 28, pp. 539-552, Apr. 1980.
27. P. Spira and A. Pan, "On finding and updating spanning trees and shortest paths," SIAM J. Computing, vol. 4, no. 3, pp. 375-380, Sept. 1975.
28. M. Streenstrup, Ed., Routing in Communications Networks. Englewood Cliffs, NJ: Prentice-Hall, 1995.
29. R. Tarjan, "Amortized computational complexity," SIAM J. Algorithms and Discrete Methods, vol. 6, no. 2, pp. 306-318, Apr. 1985.
30. BGP-4 Protocol Analysis: DDN Network Information Center, Mar. 1995.
31. L. Wei. Random topology generator (RTG). Univ. Southern California, Los Angeles, CA. [Online]. Available: http://netweb.usc.edu/daniel/research/sims/topology/