Hop-by-hop routing with node-dependent topology information

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 1999, Pages 79-87

  Fayet, V ^a   Khotimsky, D A ^b   Przygienda, T ^b  

^a NOKIA RESEARCH CENTER   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Graph theory; Packet switching; Quality of service; Routing

Indexed keywords

ADDRESS SPACE; DIFFERENT PROTOCOLS; DYNAMIC ROUTING; EFFICIENT ALGORITHM; HOP-BY-HOP ROUTING; NETWORK LINKS; NETWORK TOPOLOGY; ROUTING; ROUTING APPROACH; ROUTING METHODS; ROUTING POLICIES; TOPOLOGY INFORMATION;

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; OPTIMIZATION; PACKET SWITCHING; QUALITY OF SERVICE; VISIBILITY; INTEROPERABILITY; NETWORK PROTOCOLS; SET THEORY;

NETWORK ROUTING; PACKET SWITCHING;

HOP-BY-HOP ROUTING; QUALITY OF SERVICE (QOS);

EID: 0032677663     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1999.749255     Document Type: Conference Paper

References (15)

1. J. Schoch, "Inter-network naming, adressing and routing, " in Proceedings of IEEE Compcon'78 Conference, 1978.
2. G. Ash, J. Chen, A. Frey, B. Huang, C. Lee, and G. McDonald, "Real-time network routing in the at&t network-improved service quality at lower cost, " in Proceedings of Globecom'92 Conference. AT&T Bell Laboratories, 1992, p. 802 ff.
3. ATM-Forum, "Private Network-Network Interface Specification Version 1.0, " ATM Forum af-pnni-0055.000, March 1996.
4. J. Moy, "OSPFv2, RFC 2178, " Internet Engineering Task Force, July 1997.
5. L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, 1962.
6. J. M. McQuillan, I. Richer, and E. C. Rosen, "ARPANET Routing Algorithm Improvements, " BBN Technical Report 3803, April 1978.
7. S. Murthy and J. J. Garcia-Luna-Aceves, "Loop-Free Internet Routing Using Hierarchical Routing Trees, " in Proceedings of IEEE Infocom'97, Kobe, Japan, 1997, pp. 101-108.
8. E. W. Dijkstra, "A note on two problems in connexion with graphs, " Numerische Mathematik I, 1957.
9. R. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1983.
10. R. Dial, "A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees, " Networks, vol. 9, 1979.
11. B. Cherkassky, A. Goldberg, and T. Radzik, "Shortest Path Algorithms: Theory and Experimental Evaluation, " Tech. Rep., Cornell University, 1993.
12. ISO, "Information Technology - Telecommunications and Information Exchange between Systems - Intermediate System to Intermediate System Routing Exchange Protocol for Use in Conjunction with the Protocol for Providing the Connectionless-Mode Network Service, " ISO, 1990.
13. Y. Rekhter and T. Li, "A Border Gateway Protocol 4 (BGP-4), RFC 1771, " Internet Engineering Task Force, March 1995.
14. R. Guerin, S. Kamat, A. Orda, T. Przygienda, and D. Williams, "QoS Routing Mechanisms and OSPF Extensions, " Internet Draft, January 1998.
15. B. Rajagopalan and R. Nair, "A Framework for QoS-based Routing in the Internet, " Internet Draft, May 1998.