A loop-free routing protocol for large-scale internets using distance vectors

Computer Communications

Volumn 21, Issue 2, 1998, Pages 147-161

  Murthy, Shree ^a,c   Garcia Luna Aceves, J J ^b  

^a SUN MICROSYSTEMS   (United States)

^b University of California Santa Cruz   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Distance vector; Hierarchical; Loop free; Path finding; Routing

Indexed keywords

ALGORITHMS; HIERARCHICAL SYSTEMS; NETWORK PROTOCOLS; TELECOMMUNICATION NETWORKS;

INTERNET; ROUTING;

COMPUTER NETWORKS;

EID: 0032022893     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0140-3664(97)00136-9     Document Type: Article

References (18)

1. J. McQuillan, Adaptive routing algorithms for distributed computer networks. Technical Report BBN Report 2831. Bolt Beranck and Newman, 1974.
2. F. Kamoun, Design considerations for large computer communications network. PhD Thesis, University of California, Los Angeles, CA, 1976. UCLA-ENG-7642, Computer Science Department.
3. A.E. Baratz, J.M. Jaffe, Establishing virtual circuits in large computer networks. In INFOCOM, San Diego, CA, IEEE, 1983, pp. 311-318.
4. J.J. Garcia-Luna-Aceves.IEEE, N. Shacham, Analysis of routing strategies for packet ratio networks. In INFOCOM, Washington, DC, IEEE, 1985, pp. 292-302.
5. G.S. Lauer, Hierarchical routing design for suran. In ICC, IEEE, 1986, pp. 93-102.
6. C.V. Rumamoorthy, W. Tsai, An adaptive hierarchical routing algorithm. In COMPSAC, IEEE, 1983, pp. 93-104.
7. J. Seeger, A. Khanna, Reducing routing overhead in a growing ddn. In MILCOM, IEEE, 1986, pp. 15.3.1-15.3.13.
8. J.J. Garcia-Luna-Aceves, W. T. Zaumen, Area-based loop-free internet routing. In INFOCOM, Toronto, Canada, IEEE, 3 (1994) 1000-1008.
9. J. Moy, OSPF version 2. RFC 1247 (1992).
10. C. Cheng, R. Riley, S.P.R. Kumar, A loop-free extended bellman-ford routing protocol without bouncing effect. In SIGCOMM, SCM. Austin, TX. 19 (1989) 224-236.
11. P.A. Humblet, Another adaptive shortest-path algorithm, IEEE Trans. Commun. 39 (6) (1991) 885-1003.
12. S. Murthy, J.J. Garcia-Luna-Accses, A more efficient path-finding algorithm. In 28th Asilomar Conf., Pacific Groove, California. 1994. pp. 229-233.
13. H. Rajagopalan and M. Faiman, A new responsive distributed shortest path routing algorithm. In SIGCOMM, ACM, Austin, TX. 19 (1989) 237-246.
14. J.J. Garcia-Luna-Aceves, S. Murthy. A loop-free path-finding algorithm: specification, verification and complexity. In INFOCOM, IEEE, 1995.
15. G. Malin, RIP Version 2, Carrying Additional Information, RFC 1723, 1994.
16. J.J. Garcia-Luna-Aceves, S. Murthy, A path-finding algorithm for loop-free routing. IEEE/ACM Trans. Networking, February 1997.
17. W.T. Zaumen, Simulations in drama, Network Information System Center, SRI International, 1991.
18. B.M. Waxman, Routing of multipoint connections, J. Selected Areas Commun. 6 (9) (1988) 1617-1622.