Beyond MLU: An application-centric comparison of traffic engineering schemes

Traffic engineering (TE) has been long studied as a network optimization problem, but its impact on user-perceived application performance has received little attention. Our paper takes a first step to address this disparity. Using real traffic matrices and topologies from three ISPs, we conduct very large-scale experiments simulating ISP traffic as an aggregate of a large number of TCP flows. Our application-centric, empirical approach yields two rather unexpected findings. First, link utilization metrics, and MLU in particular, are poor predictors of application performance. Despite significant differences in MLU, all TE schemes and even a static shortest-path routing scheme achieve nearly identical application performance. Second, application adaptation in the form of location diversity, i.e., the ability to download content from multiple potential locations, significantly improves the capacity achieved by all schemes. Even the ability to download from just 2–4 locations enables all TE schemes to achieve near-optimal capacity, and even static routing to be within 30% of optimal. Our findings call into question the value of TE as practiced today, and compel us to significantly rethink the TE problem in the light of application adaptation.

[1]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[2]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[3]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[4]  Mung Chiang,et al.  Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing , 2007, IEEE Journal on Selected Areas in Communications.

[5]  Jennifer Rexford,et al.  Route Optimization in IP Networks , 2006, Handbook of Optimization in Telecommunications.

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

[7]  Aleksandar Kuzmanovic,et al.  Drafting behind Akamai (travelocity-based detouring) , 2006, SIGCOMM 2006.

[8]  Nick McKeown,et al.  Experimental study of router buffer sizing , 2008, IMC '08.

[9]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[10]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[11]  Robert G. Cole,et al.  Voice over IP performance monitoring , 2001, CCRV.

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

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

[14]  Donald F. Towsley,et al.  Fixed point approximations for TCP behavior in an AQM network , 2001, SIGMETRICS '01.

[15]  Konstantina Papagiannaki,et al.  Measurement and analysis of single-hop delay on an IP backbone network , 2003, IEEE J. Sel. Areas Commun..

[16]  Martin Arlitt,et al.  Web Workload Characterization: Ten Years Later , 2005 .

[17]  Christophe Diot,et al.  Detection and analysis of routing loops in packet traces , 2002, IMW '02.

[18]  Zongpeng Li,et al.  Youtube traffic characterization: a view from the edge , 2007, IMC '07.

[19]  Vishal Misra,et al.  Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED , 2000, SIGCOMM 2000.

[20]  Evangelos P. Markatos,et al.  One-click hosting services: a file-sharing hideout , 2009, IMC '09.

[21]  João Pedro Hespanha,et al.  A hybrid systems modeling framework for fast and accurate simulation of data communication networks , 2003, SIGMETRICS '03.

[22]  Mung Chiang,et al.  Cooperative content distribution and traffic engineering in an ISP network , 2009, SIGMETRICS '09.

[23]  Randy Bush,et al.  Some Internet Architectural Guidelines and Philosophy , 2002, RFC.

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

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

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

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

[28]  Ramesh Johari,et al.  Traffic Engineering vs. Content Distribution: A Game Theoretic Perspective , 2009, IEEE INFOCOM 2009.

[29]  Abraham Silberschatz,et al.  P4p: provider portal for applications , 2008, SIGCOMM '08.

[30]  Albert G. Greenberg,et al.  COPE: traffic engineering in dynamic networks , 2006, SIGCOMM.

[31]  Mung Chiang,et al.  Rethinking internet traffic management: from multiple decompositions to a practical protocol , 2007, CoNEXT '07.

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

[33]  Chase Cotton,et al.  Packet-level traffic measurements from the Sprint IP backbone , 2003, IEEE Netw..