Cope: Traffic Engineering in Dynamic Networks

Traffic engineering plays a critical role in determining the performance and reliability of a network. A major challenge in traffic engineering is how to cope with dynamic and unpredictable changes in traffic demand. In this paper, we propose COPE, a class of traffic engineering algorithms that optimize for the expected scenarios while providing a worst-case guarantee for unexpected scenarios. Using extensive evaluations based on real topologies and traffic traces, we show that COPE can achieve efficient resource utilization and avoid network congestion in a wide variety of scenarios.

[1]  Tao Ye,et al.  Optimization of OSPF Weights Using On-line Simulation , 2002 .

[2]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[3]  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).

[4]  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).

[5]  Rajeev Rastogi,et al.  Optimal configuration for BGP route selection , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Yin Zhang,et al.  On the constancy of internet path properties , 2001, IMW '01.

[7]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[8]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2003, STOC '03.

[9]  Mikkel Thorup,et al.  Traffic engineering with estimated traffic matrices , 2003, IMC '03.

[10]  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).

[11]  Jennifer Rexford,et al.  BGP routing policies in ISP networks , 2005, IEEE Network.

[12]  Nick Feamster,et al.  Network-wide BGP route prediction for traffic engineering , 2002, SPIE ITCom.

[13]  Antonio Nucci,et al.  Measuring the shared fate of IGP engineering and interdomain traffic , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[14]  Renata Teixeira,et al.  BGP routing changes: merging views from two ISPs , 2005, CCRV.

[15]  Ikjun Yeom,et al.  A Framework for Practical Performance Evaluation and Traffic Engineering in IP Networks , 2000 .

[16]  Edith Cohen,et al.  Coping with network failures: routing strategies for optimal demand oblivious restoration , 2004, SIGMETRICS '04/Performance '04.

[17]  Nick Feamster,et al.  Guidelines for interdomain traffic engineering , 2003, CCRV.

[18]  Nick Feamster,et al.  A model of BGP routing for network engineering , 2004, SIGMETRICS '04/Performance '04.

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

[20]  Matthew Roughan.  First order characterization of Internet traffic matrices , 2005 .

[21]  Adam Meyerson,et al.  Online oblivious routing , 2003, SPAA '03.

[22]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[23]  Matthew Roughan,et al.  Traffic Matrix Reloaded: Impact of Routing Changes , 2005, PAM.

[24]  Janelle J. Harms,et al.  A simple method for balancing network utilization and quality of routing , 2005, Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005..

[25]  Yin Zhang,et al.  BGP routing stability of popular destinations , 2002, IMW '02.

[26]  Renata Teixeira,et al.  Network sensitivity to hot-potato disruptions , 2004, SIGCOMM '04.

[27]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[28]  Donald F. Towsley,et al.  Optimal routing with multiple traffic matrices tradeoff between average and worst case performance , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

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

[30]  Abraham Silberschatz,et al.  Stable egress route selection for interdomain traffic engineering: model and analysis , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[31]  Olivier Bonaventure,et al.  Implications of Interdomain Traffic Characteristics on Traffic Engineering , 2002, Eur. Trans. Telecommun..

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

[33]  RexfordJennifer,et al.  Dynamics of hot-potato routing in IP networks , 2004 .

[34]  Zhi-Li Zhang,et al.  Profiling internet backbone traffic: behavior models and applications , 2005, SIGCOMM '05.

[35]  Yin Zhang,et al.  Finding critical traffic matrices , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[36]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[37]  N. McKeown,et al.  Designing a Predictable Internet Backbone Network , 2004 .

[38]  Donald F. Towsley,et al.  On optimal routing with multiple traffic matrices , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[39]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[40]  Jia Wang,et al.  Finding a needle in a haystack: pinpointing significant BGP routing changes in an IP network , 2005, NSDI.

[41]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[42]  Melvyn Sim,et al.  Robust linear optimization under general norms , 2004, Oper. Res. Lett..

[43]  Carsten Lund,et al.  An information-theoretic approach to traffic matrix estimation , 2003, SIGCOMM '03.

[44]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[45]  Chen-Nee Chuah,et al.  The impact of BGP dynamics on intra-domain traffic , 2004, SIGMETRICS '04/Performance '04.

[46]  Renata Teixeira,et al.  Dynamics of hot-potato routing in IP networks , 2004, SIGMETRICS '04/Performance '04.

[47]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[48]  Sudipta Sengupta,et al.  Efficient and robust routing of highly variable traffic , 2005 .