Constraint-based routing in the internet: Basic principles and recent research

Novel routing paradigms based on policies, quality of service (QoS) requirements, and packet content have been proposed for the Internet over the last decade. Constraint-based routing algorithms select a routing path satisfying constraints that are either administrative-oriented (policy routing) or service-oriented (QoS routing). The routes, in addition to satisfying constraints, are selected to reduce costs, balance network load, or increase security. In this article, we discuss several constraint-based routing approaches and explain their requirements, complexity, and recent research proposals. In addition, we illustrate how these approaches can be integrated with Internet label switching and QoS architectures. We also discuss examples of application-level routing techniques used in today's Internet.

[1]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[2]  Timothy G. Griffin,et al.  On the correctness of IBGP configuration , 2002, SIGCOMM.

[3]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[4]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[5]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[6]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[7]  G. Barish,et al.  World Wide Web caching: trends and techniques , 2000, IEEE Commun. Mag..

[8]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[9]  Klara Nahrstedt,et al.  Routing Support for Providing Guaranteed End-to-End Quality-of-Service , 1999 .

[10]  Ratul Mahajan,et al.  Understanding BGP misconfiguration , 2002, SIGCOMM 2002.

[11]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[12]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.

[13]  Eitan Altman,et al.  Competitive routing in networks with polynomial cost , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  Mon-Yen Luo,et al.  Efficient Support for Content-based Routing in Web Server Clusters , 1999, USENIX Symposium on Internet Technologies and Systems.

[15]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[16]  Quan Sun,et al.  Efficient Multicast Routing for Delay-Sensitive Applications , 1995 .

[17]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[18]  Shai Herzog,et al.  Requirements for a Policy Management System , 2000 .

[19]  Andrea Westerinen,et al.  Policy Core Information Model - Version 1 Specification , 2001, RFC.

[20]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[21]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[22]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[23]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[24]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[25]  Lionel M. Ni,et al.  Traffic engineering with MPLS in the Internet , 2000, IEEE Netw..

[26]  Satish K. Tripathi,et al.  Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis , 1999, IEEE Netw..

[27]  Anees Shaikh,et al.  Load-sensitive routing of long-lived IP flows , 1999, SIGCOMM '99.

[28]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[29]  Fang Hao,et al.  On scalable QoS routing: performance evaluation of topology aggregation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[30]  Satish K. Tripathi,et al.  Improving QoS Routing Performance Under Inaccurate Link State Information , 1999 .

[31]  Deep Medhi,et al.  QoS routing computation with path caching: a framework and network performance , 2002, IEEE Commun. Mag..

[32]  Srihari Nelakuditi,et al.  Adaptive proportional routing: a localized QoS routing approach , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[33]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[34]  J. J. Garcia-Luna-Aceves,et al.  An efficient path selection algorithm for on-demand link-state hop-by-hop routing , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[35]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[36]  Funda Ergün,et al.  QoS routing with performance-dependent costs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[37]  Pawan Goyal,et al.  QoS Routing for Best-effort Flows , 1999 .

[38]  Ariel Orda,et al.  Networks with advance reservations: the routing perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[39]  Bal Azs.  Lagrange Relaxation Based Method for the QoS Routing Problem , 2001 .

[40]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[41]  Zartash Afzal Uzmi,et al.  Content aware networking in the Internet: issues and challenges , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[42]  Deborah Estrin,et al.  Persistent route oscillations in inter-domain routing , 2000, Comput. Networks.

[43]  John Strassner,et al.  Policy Quality of Service (QoS) Information Model , 2003, RFC.

[44]  Kang G. Shin,et al.  Distributed Route Selection for Establishing Real-Time Channels , 2000, IEEE Trans. Parallel Distributed Syst..

[45]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[46]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[47]  Amin Vahdat,et al.  Detour: informed Internet routing and transport , 1999, IEEE Micro.

[48]  Debanjan Saha,et al.  Design, implementation and performance of a content-based switch , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[49]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[50]  Marco Mellia,et al.  A new class of QoS routing strategies based on network graph reduction , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[51]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[52]  Raphael Rom,et al.  Multi-path routing combined with resource reservation , 1997, Proceedings of INFOCOM '97.

[53]  Jim Boyle,et al.  Accept-Ranges : bytes Content-Length : 55967 Connection : close Content-Type : text / plain Internet Draft , 2012 .

[54]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[55]  Ariel Orda,et al.  A scalable approach to the partition of QoS requirements in unicast and multicast , 2005, TNET.

[56]  Sonia Fahmy,et al.  Topology-aware overlay networks for group communication , 2002, NOSSDAV '02.

[57]  Klara Nahrstedt,et al.  Hop-by-hop routing algorithms for premium-class traffic in DiffServ networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[58]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.