Internet Traffic Engineering

Traffic engineering is concerned with the performance optimization of operational networks. Its main objective is to reduce congested hot spots and improve resource utilization across the network by carefully managing the traffic distribution inside a network. Over the past few years, traffic engineering has become an indispensable tool in managing the performance of large Internet backbones. This chapter presents the reasons for current IP routing not being sufficient from the traffic-engineering perspective, and presents an overview of traffic-engineering solutions to these problems. The optimization objective tends to vary depending on the specific problem that service providers are trying to solve. Topology and state discovery, and constraint-based routing are two critical components in a traffic-engineering system. There are two basic approaches to traffic engineering: the Overlay Model and the Peer Model. In the Overlay Model, constraint-based routing calculates the routes for traffic demands between the edge nodes. In the Peer Model, constraint-based routing produces a link weight for each link in the network. The link weight is calculated in such a way that the resulting shortest-path computation generates a set of routes that meet the traffic-engineering objectives.

[1]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[2]  Richard J. Gibbens,et al.  Distributed connection acceptance control for a connectionless network , 1999 .

[3]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[4]  K. Mani Chandy,et al.  Distributed computation on graphs: shortest path algorithms , 1982, CACM.

[5]  K. K. Ramakrishnan,et al.  A Proposal to add Explicit Congestion Notification (ECN) to IP , 1999, RFC.

[6]  Vern Paxson,et al.  Empirically derived analytic models of wide-area TCP connections , 1994, TNET.

[7]  Donald F. Ferguson,et al.  An approach to pricing, optimal allocation and quality of service provisioning in high-speed packet networks , 1995, Proceedings of INFOCOM'95.

[8]  Liam Murphy,et al.  Bandwidth Allocation By Pricing In ATM Networks , 1994, Broadband Communications.

[9]  Scott Shenker,et al.  Endpoint admission control: architectural issues and performance , 2000, SIGCOMM.

[10]  Deborah Estrin,et al.  RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  Jon Postel,et al.  User Datagram Protocol , 1980, RFC.

[12]  Andrew Odlyzko,et al.  Paris Metro pricing: the minimalist differentiated services solution , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[13]  Walter Willinger,et al.  On the Self-Similar Nature of Ethernet Traffic ( extended version ) , 1995 .

[14]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[15]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

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

[17]  M. Angela Sasse,et al.  It ain't what you charge, it's the way that you do it: a user perspective of network QoS and pricing , 1999, Integrated Network Management VI. Distributed Management for the Networked Millennium. Proceedings of the Sixth IFIP/IEEE International Symposium on Integrated Network Management. (Cat. No.99EX302).

[18]  Jerome Chifflet,et al.  Proximal decomposition for multicommodity flow problems with convex costs , 1994, Telecommun. Syst..

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

[20]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[21]  Costas Courcoubetis,et al.  An evaluation of pricing schemes that are based on effective usage , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[22]  S. Clearwater.  Market-based control: a paradigm for distributed resource allocation , 1996 .

[23]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[24]  Joseph Y. Hui.  Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[25]  Wu-chang Fengy,et al.  BLUE: A New Class of Active Queue Management Algorithms , 1999 .

[26]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[27]  Gordon T. Wilfong,et al.  An analysis of BGP convergence properties , 1999, SIGCOMM '99.

[28]  C. Manolakisy.  An Intelligent Agent for Optimizing Qos-for-money in Priced Abr Connections , 1998 .

[29]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[30]  Keir Fraser,et al.  Switchlets and resource-assured MPLS networks , 2001 .

[31]  David L. Mills.  Autonomous confederations , 1986, RFC.

[32]  Stan Zachary,et al.  Distributed admission control , 2000, IEEE Journal on Selected Areas in Communications.

[33]  Greg Minshall,et al.  Ip Switching: Atm under Ip * , 1998 .

[34]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

[35]  S. Shenker.  Service models and pricing policies for an integrated services Internet , 1995 .

[36]  Peter Key,et al.  An ECN-based end-to-end congestion-control framework: experiments and evaluation , 2000 .

[37]  David L. Mills,et al.  Network Time Protocol (Version 3) Specification, Implementation , 1992 .

[38]  A. Bouch,et al.  Of packets and people: a user-centered approach to quality of service , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[39]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[40]  H. Jonathan Chao,et al.  Multiprotocol Label Switching , 2002 .

[41]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[42]  John N. Tsitsiklis,et al.  Congestion-dependent pricing of network services , 2000, TNET.

[43]  Sally Floyd,et al.  Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996, CCRV.

[44]  Laurent Massoulié,et al.  Arguments in favour of admission control for TCP flows , 1999 .

[45]  Henning Schulzrinne,et al.  RTP: A Transport Protocol for Real-Time Applications , 1996, RFC.

[46]  Enke Chen,et al.  An Application of the BGP Community Attribute in Multi-home Routing , 1996, RFC.

[47]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[48]  Zhen Liu,et al.  Evaluation of TCP Vegas: emulation and experiment , 1995, SIGCOMM '95.

[49]  Robert T. Braden,et al.  Requirements for Internet Hosts - Communication Layers , 1989, RFC.

[50]  Deborah Estrin,et al.  A study of priority pricing in multiple service class networks , 1991, SIGCOMM '91.

[51]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[52]  V. Paxson,et al.  Growth trends in wide-area TCP connections , 1994, IEEE Network.

[53]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[54]  Nemo Semret,et al.  Spot and Derivative Markets in Admission Control , 1999 .

[55]  Frank P. Kelly,et al.  A study of simple usage‐based charging schemes for broadband networks , 1998, Telecommun. Syst..

[56]  A. Odlyzko.  The History of Communications and its Implications for the Internet , 2000 .

[57]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[58]  Deborah Estrin,et al.  Pricing in Computer Networks: Reshaping the Research Agenda , 2020, The Internet and Telecommunications Policy.

[59]  Van Jacobson,et al.  An Expedited Forwarding PHB , 1999, RFC.

[60]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

[61]  S. Jamin.  Measurement-based Admission Control Algorithms for Controlled-load Service : A Structural Examination , 1995 .

[62]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[63]  Anurag Kumar,et al.  Nonintrusive TCP connection admission control for bandwidth management of an Internet access link , 2000, IEEE Commun. Mag..

[64]  Andrew M. Odlyzko,et al.  Paris metro pricing for the internet , 1999, EC '99.

[65]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[66]  A. Erramilli,et al.  A connection admission control algorithm for self-similar traffic , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[67]  Shai Herzog,et al.  RSVP Extensions for Policy Control , 2000, RFC.

[68]  Henning Schulzrinne,et al.  The Loss-delay Based Adjustment Algorithm: a Tcp-friendly Adaptation Scheme , 1998 .

[69]  Cengiz Alaettinoglu,et al.  Routing Policy Specification Language (RPSL) , 1998, RFC.

[70]  Peter B. Danzig,et al.  Comparison of measurement-based admission control algorithms for controlled-load service , 1997, Proceedings of INFOCOM '97.

[71]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[72]  Richard Mortier,et al.  Implicit admission control , 2000, IEEE Journal on Selected Areas in Communications.

[73]  Rebecca Isaacs.  Dynamic Provisioning of Resource-Assured and Programmable Virtual Private Networks , 2000 .

[74]  Deborah Estrin,et al.  The impact of routing policy on Internet paths , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[75]  C. Manolakis,et al.  An Intelligent Agent for Negotiating Qos in Priced Abr Connections , 1998 .

[76]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[77]  Ramesh Govindan,et al.  BGP Route Flap Damping , 1998, RFC.

[78]  Vern Paxson,et al.  Measurements and analysis of end-to-end Internet dynamics , 1997 .

[79]  Scott Shenker,et al.  Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1994 .

[80]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[81]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[82]  Huw Oliver,et al.  Market Managed Multiservice Internet , 2000 .

[83]  Frank Kelly.  Charging and Accounting for Bursty Connections , 1995 .

[84]  J. J. Garcia-Luna-Aceves,et al.  Dynamics of distributed shortest-path routing algorithms , 1991, SIGCOMM '91.

[85]  David L. Mills.  Exterior Gateway Protocol formal specification , 1984, RFC.

[86]  Farnam Jahanian,et al.  Internet routing instability , 1997, SIGCOMM '97.

[87]  S. Floyd.  Comments on Measurement-based Admissions Control for Controlled-Load Services , 1996 .

[88]  Bob Briscoe,et al.  An End to End Price-Based QoS Control Component Using Reflective Java , 1997, COST 237 Workshop.

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

[90]  Ravishanker Chandra,et al.  BGP Route Reflection An alternative to full mesh IBGP , 1996, RFC.

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

[92]  Paul Traina.  Autonomous System Confederations for BGP , 1996, RFC.

[93]  Zheng Wang,et al.  Explicit routing algorithms for Internet traffic engineering , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[94]  Andrew G. Malis,et al.  A Framework for IP Based Virtual Private Networks , 2000, RFC.

[95]  Ulf Bodin,et al.  Load-tolerant differentiation with active queue management , 2000, CCRV.

[96]  Peter Key,et al.  Congestion Pricing for Congestion Avoidance , 1999 .

[97]  Pravin Varaiya,et al.  Billing Users and Pricing for TCP , 1995, IEEE J. Sel. Areas Commun..

[98]  Robert Tappan Morris,et al.  Scalable TCP congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[99]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM.

[100]  Anand Rangarajan.  Early Regulation of Unresponsive Flows , 1999 .

[101]  Michael Devetsikiotis,et al.  An overview of pricing concepts for broadband IP networks , 2000, IEEE Communications Surveys & Tutorials.

[102]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[103]  Larry L. Peterson,et al.  Understanding TCP Vegas: a duality model , 2001, JACM.

[104]  Brian Zill,et al.  Constructing optimal IP routing tables , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[106]  Jennifer Rexford,et al.  Inherently safe backup routing with BGP , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[107]  David L. Mills.  DCN Local-Network Protocols , 1983, RFC.

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

[109]  David R. Oran,et al.  OSI IS-IS Intra-domain Routing Protocol , 1990, RFC.

[110]  Sally Floyd,et al.  Congestion Control Principles , 2000, RFC.

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

[112]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM '89.

[113]  R. Gibbens.  Measurement-based connection admission control , 1997 .

[114]  Richard Mortier,et al.  Internet traffic engineering , 2002 .

[115]  Richard J. Gibbens,et al.  A Decision-Theoretic Approach to Call Admission Control in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[116]  John W. Stewart,et al.  BGP4 : inter-domain routing in the Internet , 1998 .

[117]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).