Dynamic update of shortest path tree in OSPF

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn , Issue , 2004, Pages 18-23

  Xiao, Bin ^a   Cao, Jiannong ^a   Zhuge, Qingfeng ^b   Shao, Zili ^b   Sha, Edwin H M ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DYNAMICS; INTERNET; ROUTERS; TOPOLOGY;

MULTIPLE EDGE WEIGHT; OPEN SHORTEST PATH FIRST (OSPF); OSPF; SHORTEST PATH TREES (SPT);

NETWORK PROTOCOLS;

EID: 3543064756     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. S. Sengupta, D. Saha, and S. Chaudhuri, "Analysis of enhanced OSPF for routing lightpaths in optical mesh networks," in Proceedings of IEEE International Conference on Communications (ICC 2002), pp. 2865-2869, 2002.
2. R. Rastogi, Y. Breitbart, M. Garofalakis, and A. Kumar, "Optimal configuration of OSPF aggregates," IEEE/ACM Trans. on Networking, vol. 11, pp. 181-194, April 2003.
3. O. Sharon, "Dissemination of routing information in broadcast networks: OSPF versus IS-IS," IEEE Network, vol. 15, pp. 56-65, Jan/Feb 2001.
4. B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS weights in a changing world," IEEE Journal on Selected Areas in Communications, vol. 20, pp. 756-767, May 2002.
5. E. Dijkstra, "A note two problems in connection with graphs," Numerical Math., vol. 1, pp. 269-271, 1959.
6. A. Basu and J. Riecke, "Stability issues in OSPF routing," in Proc. the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 225-236, 2001.
7. D. Chakraborty, G. Chakraborty, and N. Shiratori, "A dynamic multicast routing satisfying multiple QoS constraints," International Journal of Network Management, vol. 13, pp. 321-335, 2003.
8. S.-J. Yang, "Design issues and performance improvements in routing strategy on the internet workflow," International Journal of Network Management, vol. 13, pp. 359-374, 2003.
9. B. Zhang and H. Mouftah, "A destination-driven shortest path tree algorithm," in Proc. IEEE International Conference on Communications, vol. 4, pp. 2258-2262, April 2002.
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), pp. 212-221, 1998.
11. P.Narvaez, K.-Y. Siu, and H.-Y. Tzeng, "New dynamic algorithms for shortest path tree computation," IEEE/ACM Trans. Networking, vol. 8, pp. 734-746, Dec. 2000.
12. P.Narvaez, K.-Y. Siu, and H.-Y. Tzeng, "New dynamic SPT algorithm based on a ball-and-string model," IEEE/ACM Trans. Networking, vol. 9, pp. 706-718, Dec. 2001.
13. R. Bellman, "On a routing problem," Quarterly Applied Mathematics, vol. 16, pp. 87-90, 1958.