Routing-policy aware peering for large content providers

We investigate the impact of routing policies and peering policies on the selection of peering connections for content providers.We formulate the policy-aware peering problem, and prove that the problem is NP-complete.We provide a heuristic algorithm to solve policy-aware peering problem.We examine the lower bound of peering connections to cover end users in todays Internet.We investigate 5 large content providers, and find that adding as little as 35 new peering connections can enhance their connection to end users significantly. Large content providers, such as Google, Yahoo, and Microsoft, aim to directly connect with consumer networks and place the content closer to end users. Exchanging traffic directly between end users and content providers can reduce the cost of transit services. However, direct connection to all end users is simply not feasible. Content providers by-and-large still rely on transit services to reach the majority of end users. We argue that routing policies are an important factor in considering the selection of ISPs for content providers. Therefore, determining which ISP to peer or use as a transit becomes a key question for content providers. In this paper, we formulate the policy-aware peering problem, in which we determine not only which ISP to connect with, but also the kind of peering agreement to establish. We prove that such a policy-aware peering problem is NP-complete, and propose a heuristic algorithm to solve the problem. Further, we perform a large-scale measurement study of the peering characteristics of five large content providers, and evaluate the existing peering connections deployed by the content providers. Our measurement results show that changing the existing peering agreements or adding as little as 35 new peering connections can enhance the connection between content providers and end users significantly.

[1]  Kimberly C. Claffy,et al.  Using peeringDB to understand the peering ecosystem , 2014, CCRV.

[2]  Jin Huang,et al.  Top-k most influential locations selection , 2011, CIKM '11.

[3]  Ratul Mahajan,et al.  The causes of path inflation , 2003, SIGCOMM '03.

[4]  Ioannis Stavrakakis,et al.  Scalable service migration in autonomic network environments , 2010, IEEE Journal on Selected Areas in Communications.

[5]  Yuval Shavitt,et al.  Topological trends of internet content providers , 2012, SIMPLEX '12.

[6]  Naveen Garg,et al.  Improved approximation for universal facility location , 2005, SODA '05.

[7]  Anja Feldmann,et al.  Pushing CDN-ISP collaboration to the limit , 2013, CCRV.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Lixia Zhang,et al.  On the placement of Internet instrumentation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[11]  Gwendal Simon,et al.  Optimal network locality in distributed virtualized data-centers , 2011, Comput. Commun..

[12]  Rami Cohen,et al.  The Internet Dark Matter - on the Missing Links in the AS Connectivity Map , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Dmitri V. Krioukov,et al.  AS relationships: inference and validation , 2006, CCRV.

[14]  Arun Venkataramani,et al.  Distributing content simplifies ISP traffic engineering , 2012, SIGMETRICS '13.

[15]  Enrico Gregori,et al.  On the incompleteness of the AS-level graph: a novel methodology for BGP route collector placement , 2012, Internet Measurement Conference.

[16]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[17]  Robert Krauthgamer,et al.  Tight lower bounds for the asymmetric k-center problem , 2003, Electron. Colloquium Comput. Complex..

[18]  Yin Zhang,et al.  On AS-level path inference , 2005, SIGMETRICS '05.

[19]  Farnam Jahanian,et al.  Internet inter-domain traffic , 2010, SIGCOMM '10.

[20]  Jennifer Rexford,et al.  Stable internet routing without global coordination , 2001, TNET.

[21]  Amogh Dhamdhere,et al.  The Internet is flat: modeling the transition from a transit hierarchy to a peering mesh , 2010, CoNEXT.

[22]  Walter Willinger,et al.  Towards capturing representative AS-level Internet topologies , 2002, SIGMETRICS '02.

[23]  Azer Bestavros,et al.  Distributed Placement of Service Facilities in Large-Scale Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[24]  Roger Wattenhofer,et al.  Facility location: distributed approximation , 2005, PODC '05.

[25]  Priya Mahadevan,et al.  Lessons from Three Views of the Internet Topology , 2005, ArXiv.

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

[27]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[28]  Giuseppe Di Battista,et al.  Computing the types of the relationships between autonomous systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[29]  William B. Norton.  The Emerging 21st Century Access Power Peering , 2011 .

[30]  Amogh Dhamdhere,et al.  A value-based framework for internet peering agreements , 2010, 2010 22nd International Teletraffic Congress (lTC 22).

[31]  G. Nemhauser,et al.  The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs , 1984 .

[32]  Amogh Dhamdhere,et al.  Peering strategy adoption by transit providers in the internet: a game theoretic approach? , 2012, PERV.

[33]  D. T. Lee,et al.  Capacitated Domination Problem , 2007, Algorithmica.

[34]  Chung-Shou Liao,et al.  Capacitated Domination Problem , 2007, ISAAC.

[35]  Samir Khuller,et al.  The Capacitated K-Center Problem , 2000, SIAM J. Discret. Math..

[36]  Aaron Archer,et al.  Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem , 2001, IPCO.

[37]  Walter Willinger,et al.  To Peer or Not to Peer: Modeling the Evolution of the Internet's AS-Level Topology , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[38]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[39]  Spiridon Bakiras,et al.  Combining replica placement and caching techniques in content distribution networks , 2005, Comput. Commun..

[40]  Lixin Gao,et al.  Efficient Inference of AS-Level Paths in the Internet , 2014 .

[41]  S. Jamin.  On the placement of internet instrumentaion , 2000 .

[42]  Lixin Gao,et al.  On inferring autonomous system relationships in the Internet , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

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

[44]  Zongpeng Li,et al.  The Flattening Internet Topology: Natural Evolution, Unsightly Barnacles or Contrived Collapse? , 2008, PAM.

[45]  Anja Feldmann,et al.  Anatomy of a large european IXP , 2012, SIGCOMM '12.

[46]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[47]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[48]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[49]  Azer Bestavros,et al.  Distributed Server Migration for Scalable Internet Service Deployment , 2014, IEEE/ACM Transactions on Networking.

[50]  Eric Jahn,et al.  Interconnection and Competition Among Asymmetric Networks in the Internet Backbone Market , 2006 .

[51]  Anja Feldmann,et al.  Enabling content-aware traffic engineering , 2012, CCRV.