Xl: An efficient network routing algorithm

Computer Communication Review

Volumn 38, Issue 4, 2008, Pages 15-26

  Levchenko, Kirill ^a   Voelker, Geoffrey M ^a   Paturi, Ramamohan ^a   Savage, Stefan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Link state; Routing protocol

Indexed keywords

DISTANCE VECTOR ALGORITHMS; LINK-STATE; LINK-STATE ROUTING; OPTIMALITY; ORDER OF MAGNITUDES; PATH LENGTHS; ROUTING EFFICIENCIES;

CONVOLUTIONAL CODES; ROUTERS; ROUTING PROTOCOLS;

ROUTING ALGORITHMS;

EID: 65249120689     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/1402946.1402962     Document Type: Conference Paper

References (32)

1. Abilene interior-routing metrics. http://noc.net.internet2.edu, March 2006.
2. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris. Resilient overlay networks. In Proceedings of the 18th Symposium on Operating Systems Principles, pages 131-145, 2001.
3. J. Behrens and J. J. Garcia-Lunes-Aceves. Distributed, scalable routing based on link-state vectors. In Proceedings of the ACM SIGCOMM Conference, pages 136-147, 1994.
4. C. Cheng, R. Riley, S. P. R. Kumar, and J. J. Garcia-Lunes-Aceves. A loop-free extended Bellman-Ford routing protocol without bouncing effect. ACM SIGCOMM Computer Communication Review, 19(4):224-236, September 1989.
5. Cisco Systems. Introduction to EIGRP. Document ID 13669.
6. Cisco Systems. OSPF Design Guide. Document ID 7039.
7. T. H. Clausen and P. Jacquet. RFC 3626: Optimized Link State Routing protocol (OLSR), October 2003.
8. V. Fayet, D. A. Khotimsky, and T. Przygienda. Hop-by-hop routing with node-dependent topology information. In Proceedings of The Eighteenth INFOCOM Conference, pages 79-87, 1999.
9. D. Fedyk and P. Bottorff. Provider link state bridging (PLSB). IEEE Draft, 2007.
10. J. J. Garcia-Lunes-Aceves. Loop-free routing using diffusing computations. Transactions on Networking, 1 (1): 130-141, Feb 1993.
11. F. E. Heart, A. McKenzie, J. M. McQuillan, and D. C. Walden. ARPANET completion report. Technical Report 4799, Bolt, Baranek and Newman, 1978.
12. P. A. Humblet. Another adaptive distributed shortest path algorithm. IEEE Transactions on Communications, 39(6):995-1003, June 1991.
13. G. Iannaccone, C. Chuah, R. Mortier, S. Bhattacharyya, and C. Diot. Analysis of link failures in an IP backbone. In Proceedings of the Second Internet Measurement Workshop, pages 237-242, 2002.
14. IEEE 802.11s draft standard, 2007.
15. K. Ishiguro, V. Manral, A. Davey, and A. Lindem. Traffic engineering extensions to OSPF version 3. IETF Draft, 2007.
16. A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen. Scalable routing strategies for ad hoc wireless networks. IEEE Journal on Selected Areas in Communication, 17(8): 1369-1379, August 1999.
17. J. M. Jaffe and F. H. Moss. A responsive distributed routing algorithm for computer networks. IEEE Transactions on Communications, COM-30(7):1758-1762, July 1982.
18. P. Mahadevan, C. Hubble, D. Krioukov, B. Huffaker, and A. Vahdat. Orbis: Rescaling degree correlations to generate annotated Internet topologies. In Proc. of the 2007 ACM SIGCOMM Conference, pages 325-336, 2007.
19. R. Mahajan, N. Spring, D. Wetherall, and T. Anderston. Inferring link weights using end-to-end measurements. In Proceedings of 2nd Internet Measurement Workshop, pages 231-236, 2002.
20. G. Malkin. RFC 2453: RIP version 2, 1998.
21. J. M. McQuillan, G. Falk, and I. Richer. A review of the development and performance of the ARPANET routing algorithm. IEEE Transactions on Communications, COM-26(12): 1802-1811, Dec 1978.
22. J. M. McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, 28(5):711-719, May 1980.
23. P. M. Merlin and A. Segall. A failsafe distributed routing protocol. IEEE Transactions on Communications, COM-27(9): 1280-1287, September 1979.
24. J. Moy. RFC 2328: OSPF version 2, 1998.
25. Y. Ohara, M. Bhatia, N. Osamu, and J. Murai. Route Flapping Effects on OSPF. In Proceedings of the 2003 Symposium on Applications and the Internet Workshops, 2003.
26. V. D. Park and M. S. Corson. A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing. In Proceedings of the 3rd IEEE Symposium on Computers and Communications, pages 592-598, 1998.
27. P. Pillay-Esnault. OSPF Refresh and Flooding Reduction in Stable Topologies. RFC 4136, 2005.
28. B. Rajagopalan and M. Faiman. A new responsive distributed shortest-path routing algorithm. In Proceedings of the ACM SIGCOMM Conference, pages 237-246, 1989.
29. S. B. Seidman. Network structure and minimum degree. Social Networks, 5(3):269-287, September 1983.
30. A. Shaikh, C. Isett, A. Greenberg, M. Roughan, and J. Gottlieb. A case study of OSPF behavior in a large enterprise network. In Proceedings of the 2nd Workshop on Internet Measurement, pages 217-230, 2002.
31. M. Thorup. OSPF Areas Considered Harmful. Private paper, Apr 2003.
32. A. Zinin and M. Shand. Flooding Optimizations in Link-state Routing Protocols. IETF Draft, 2000.