Distributing content simplifies ISP traffic engineering

Several major Internet service providers today also offer content distribution services. The emergence of such "network-CDNs" (NCDNs) is driven both by market forces as well as the cost of carrying ever-increasing volumes of traffic across their backbones. An NCDN has the flexibility to determine both where content is placed and how traffic is routed within the network. However NCDNs today continue to treat traffic engineering independently from content placement and request redirection decisions. In this paper, we investigate the interplay between content distribution strategies and traffic engineering and ask whether or how an NCDN should address these concerns in a joint manner. Our experimental analysis, based on traces from a large content distribution network and real ISP topologies, shows that realistic (i.e., history-based) joint optimization strategies offer little benefit (and often significantly underperform) compared to simple and "unplanned" strategies for routing and placement such as InverseCap and LRU. We also find that the simpler strategies suffice to achieve network cost and user-perceived latencies close to those of a joint-optimal strategy with future knowledge.

[1]  Edith Cohen,et al.  Making routing robust to changing traffic demands: algorithms and evaluation , 2006, TNET.

[2]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[4]  Ramesh K. Sitaraman,et al.  The Akamai network: a platform for high-performance internet applications , 2010, OPSR.

[5]  Nick Feamster,et al.  Quantifying the benefits of joint content and network routing , 2013, SIGMETRICS '13.

[6]  Yin Zhang,et al.  COPE: traffic engineering in dynamic networks , 2006, SIGCOMM 2006.

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

[8]  Bruce M. Maggs,et al.  Globally Distributed Content Delivery , 2002, IEEE Internet Comput..

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

[10]  克里斯托福·牛顿,et al.  Content Delivery Network , 2012 .

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

[12]  B. E. Eckbo,et al.  Appendix , 1826, Epilepsy Research.

[13]  Minghua Chen,et al.  Joint VM placement and routing for data center traffic engineering , 2012, 2012 Proceedings IEEE INFOCOM.

[14]  William R. McShane,et al.  A review of pedestrian safety models for urban areas in Low and Middle Income Countries , 2016 .

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

[16]  Arun Venkataramani,et al.  Beyond MLU: An application-centric comparison of traffic engineering schemes , 2011, 2011 Proceedings IEEE INFOCOM.

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

[18]  Baochun Li,et al.  Joint request mapping and response routing for geo-distributed cloud services , 2013, 2013 Proceedings IEEE INFOCOM.

[19]  Chiara Petrioli,et al.  Distributed Dynamic Replica Placement and Request Redirection in Content Delivery Networks , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

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

[21]  Edith Cohen,et al.  Making Routing Robust to Changing Traffic Demands: Algorithms and Evaluation , 2006, IEEE/ACM Transactions on Networking.

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

[23]  Reuven Cohen,et al.  A Traffic Engineering Approach for Placement and Selection of Network Services , 2007, IEEE/ACM Transactions on Networking.

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

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

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

[27]  SharmaAbhigyan,et al.  Distributing content simplifies ISP traffic engineering , 2013 .

[28]  Michael Vrable,et al.  The Overlay Network Content Distribution Problem , 2005 .