Avoiding Routing Loops on the Internet

Theory of Computing Systems

Volumn 36, Issue 6, 2003, Pages 597-609

  Ito, Hiro ^a   Iwama, Kazuo ^a   Okabe, Yasuo ^a   Yoshihiro, Takuya ^b  

^a KYOTO UNIVERSITY   (Japan)

^b WAKAYAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ROUTING LOOPS;

ALGORITHMS; OPTIMIZATION; PACKET NETWORKS; PROBLEM SOLVING; QUALITY OF SERVICE; ROUTERS;

INTERNET;

EID: 0346361541     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-003-1119-1     Document Type: Conference Paper

References (14)

1. J. Bang-Jensen and G. Gutin. Digraphs: Theory, Algorithms and Applications. Springer-Verlag, London, 2001.
2. E. Cohen and U. Zwick. All-Pairs Small-Stretch Paths. Proceedings of SODA 97, pp. 93-102, 1997.
3. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms, second edition. The MIT Press, Cambridge, MA, 2001.
4. E. W. Dijkstra and C. S. Scholten. Termination Detection for Diffusing Computations. Information Processing Letters, 11:1-4, 1980.
5. J. J. Garcia-Luna-Aceves. A Unified Approach for Loop-Free Routing Using Link States or Distance Vectors. Computer Communications Review, 19(4):212-223, 1989.
6. J. J. Garcia-Luna-Aceves. Loop-Free Routing Using Diffusing Computations. IEEE/ACM Transactions on Networking, 1:130-141, 1993.
7. J. J. Garcia-Luna-Aceves and S. Murthy. A Path-Finding Algorithm for Loop-Free Routing. IEEE/ACM Transactions on Networking, 5:148-160, 1997.
8. J. M. Jaffe and F. H. Moss. A Responsive Distributed Routing Algorithm for Computer Networks. IEEE Transactions on Communications, COM-30(7):1758-1762, 1982.
9. G. Malkin. RIP Version 2. IETF (Internet Engineering Task Force) RFC 2453, 1998.
10. J. McQuillan, I. Richer and E. Rosen. The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications, 28(5):711-719, 1980.
11. P. M. Merlin and A. Segall. A Failsafe Distributed Routing Protocol. IEEE Transactions on Communications, COM-27(9):1280-1287, 1970.
12. J. Moy. Open Shortest Path Fast (OSPF) Version 2. IETF (Internet Engineering Task Force) RFC 2328, 1998.
13. R. Ramaswamy, J. B. Orlin and N. Chakravarti. Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs. Operations Research Center Working Paper, 2001.
14. A. Segall. Distributed Network Protocols. IEEE Transactions on Information Theory, IT-29(1):23-35, 1983.