Abstract
The current Internet implements hop-by-hop packet forwarding based entirely on globally-unique identifiers specified in packet headers, and routing tables that identify destinations with globally unique identifiers and specify the next hops to such destinations. This model is very robust; however, it supports only a single forwarding class per destination. As a result, the Internet must rely on mechanisms working “on top” of IP to support quality-of-service (QoS) or traffic engineering (TE). We present the first policy-based connectionless routing architecture and algorithms to support QoS and TE as part of the basic network-level service of the Internet. We show that policy-aware connectionless routing can be accomplished with roughly the same computational efficiency of the traditional single-path shortest-path routing approach.
This work was supported in part by the Defense Advanced Research Projects Agency (DARPA) under Grant N66001-00-8942 and by the Baskin Chair of Computer Engineering at UCSC.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Awduche, D.O., Malcom, J., Agogbua, J., O’Dell, M., McManus, J.: Requirements for Traffic Engineering Over MPLS. RFC 2702 (December 1999)
Braden, B., Clark, D., Shenker, S.: Integrated Services in the Internet Architecture: an Overview. RFC 1633 (June 1994)
Cavendish, D., Gerla, M.: Internet QoS Routing using the Bellman-Ford Algorithm. In: Proc. IFIP Conference on High Performance Networking (1998)
Chandranmenon, G.P., Varghese, G.: Trading Packet Headers for Packet Processing. IEEE ACM Trans. Networking 4(2), 141–152 (1995)
Chen, S., Nahrstedt, K.: An Overview of Quality of Service Routing for Next-Generation High-Speed Networks: Problems and Solutions. IEEE Network, pp. 64–79 (November 1998)
Davie, B., Rekhter, Y.: MPLS: Technology and Applications. Morgan Kaufmann, San Francisco (2000)
Garcia-Luna-Aceves, J.J., Behrens, J.: Distributed, Scalable Routing Based on Vectors of Link States. IEEE JSAC (October 1995)
Jaffe, J.M.: Algorithms for Finding Paths with Multiple Constraints. Networks 14(1), 95–116 (1984)
Ma, Q., Steenkiste, P.: Quality-of-Service Routing for Traffic with Performance Guarantees. In: Proc. 4th International IFIP Workshop on QoS (May 1997)
Van Mieghem, P., De Neve, H., Kuipers, F.: Hop-by-hop quality of service routing. Computer Networks 37, 407–423 (2001)
Siachalou, S., Georgiadis, L.: Efficient QoS Routing. In: Proc. Infocom 2003 (April 2003)
Smith, B.: Efficient Policy-Based Routing in the Internet. PhDThesis, Computer Science, University of California, Santa Cruz, CA 95064 (September 2003)
Sobrinho, J.L.: Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet. IEEE/ACM Trans. Networking 10(4), 541–550 (2002)
Wang, Z., Crowcroft, J.: Quality-of-Service Routing for Supporting Multimedia Applications. IEEE JSAC, 1228–1234 (September 1996)
Zegura, E.W., Calvert, K., Bhattacharjee, S.: How to Model an Internetwork. In: Proc. IEEE Infocom 1996 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smith, B.R., Garcia-Luna-Aceves, J.J. (2004). Policy-Aware Connectionless Routing. In: Solé-Pareta, J., et al. Quality of Service in the Emerging Networking Panorama. WQoSR QofIS ICQT 2004 2004 2004. Lecture Notes in Computer Science, vol 3266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30193-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-30193-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23238-4
Online ISBN: 978-3-540-30193-6
eBook Packages: Springer Book Archive