Coalitionally stable pricing schemes for inter-domain forwarding

In this work, we model and analyze the problem of stable and efficient pricing for inter-domain traffic routing in the future Internet. We consider a general network topology with multiple sources and sinks of traffic, organized into separate domains managed by Internet Service Providers (ISPs) solely interested in maximizing their own profit. In this framework, we prove that there exists a pricing scheme that attains network-wide efficiency and is yet coalitionally stable, where the coalitions correspond to the ISPs that are acting in self-interest. This implies that this pricing scheme not only maximizes the overall utility of the resulting traffic flows, but is also such that ISPs cannot expect to improve their profit through deviation from it, even if multiple ISPs deviate at the same time. Through simulations on scale-free preferential attachment network topology models as well as actual inter-domain topologies obtained from the CAIDA database, we evaluate the convergence of best-response based simple price updates, and show that they quickly attain near-optimal network utility in these network topologies.

[1]  Aditya Akella,et al.  Cooperative Interdomain Traffic Engineering Using Nash Bargaining and Decomposition , 2007, IEEE/ACM Transactions on Networking.

[2]  Paul Barford,et al.  Accurate and efficient SLA compliance monitoring , 2007, SIGCOMM '07.

[3]  Éva Tardos,et al.  A network pricing game for selfish traffic , 2006, Distributed Computing.

[4]  Richard Cole,et al.  Pricing network edges for heterogeneous selfish users , 2003, STOC '03.

[5]  Asuman E. Ozdaglar,et al.  Price competition with elastic traffic , 2008, Networks.

[6]  Christos H. Papadimitriou,et al.  A New Look at Selfish Routing , 2010, ICS.

[7]  Mohammad Mahdian,et al.  Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[8]  Nicolás E. Stier Moses,et al.  Pricing with markups under horizontal and vertical competition , 2010, BQGT.

[9]  Guy Leduc,et al.  Combined intra- and inter-domain traffic engineering using hot-potato aware link weights optimization , 2008, SIGMETRICS '08.

[10]  Xin Huang,et al.  Efficiency and Braess' Paradox under pricing in general networks , 2006, IEEE Journal on Selected Areas in Communications.

[11]  Koushik Kar,et al.  Strategic Pricing in Next-Hop Routing with Elastic Demands , 2011, Theory of Computing Systems.

[12]  Patrick Maillé,et al.  Analysis of Price Competition in a Slotted Resource Allocation Game , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[13]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[14]  Olivier Bonaventure,et al.  Interdomain traffic engineering with redistribution communities , 2004, Comput. Commun..

[15]  R. Johari,et al.  Routing and peering in a competitive Internet , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[16]  Contract-switching for managing inter-domain dynamics , 2011 .

[18]  Ellen W. Zegura,et al.  Interdomain Ingress Traffic Engineering Through Optimized AS-Path Prepending , 2005, NETWORKING.

[19]  Nicole Immorlica,et al.  First-price path auctions , 2005, EC '05.

[20]  Lixin Gao On inferring autonomous system relationships in the internet , 2001, TNET.

[21]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[22]  Ignacio Castro,et al.  Using Tuangou to Reduce IP Transit Costs , 2014, IEEE/ACM Transactions on Networking.

[24]  Elliot Anshelevich,et al.  Network Formation and Routing by Strategic Agents Using Local Contracts , 2008, WINE.

[25]  Éva Tardos,et al.  A network pricing game for selfish traffic , 2005, PODC '05.

[26]  João L. Sobrinho,et al.  Network routing with path vector protocols: theory and applications , 2003, SIGCOMM '03.

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

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

[29]  G. Huston,et al.  Interconnection, Peering and Settlements , 2003 .

[30]  Lixia Zhang,et al.  Observing the evolution of internet as topology , 2007, SIGCOMM.

[31]  It Informatics,et al.  Border Gateway Protocol , 2013 .

[32]  Jennifer Rexford,et al.  MIRO: multi-path interdomain routing , 2006, SIGCOMM.

[33]  Asuman E. Ozdaglar,et al.  Partially Optimal Routing , 2007, IEEE Journal on Selected Areas in Communications.

[34]  Brighten Godfrey,et al.  Pathlet routing , 2009, SIGCOMM '09.

[35]  Feng Niu,et al.  The price of anarchy in bertrand games , 2009, EC '09.

[36]  Scott Shenker,et al.  Route Bazaar: Automatic Interdomain Contract Negotiation , 2015, HotOS.

[37]  R. Srikant,et al.  Revenue-maximizing pricing and capacity expansion in a many-users regime , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[38]  T. Başar,et al.  A Stackelberg Network Game with a Large Number of Followers , 2002 .

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

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

[41]  Alexander Hall,et al.  Incentive-Compatible Interdomain Routing with Linear Utilities , 2007, Internet Math..

[42]  Tim Roughgarden,et al.  Bertrand competition in networks , 2008, SECO.

[43]  Priya Mahadevan,et al.  The internet AS-level topology: three data sources and one definitive metric , 2005, Comput. Commun. Rev..

[44]  Olivier Bonaventure,et al.  Interdomain traffic engineering with BGP , 2003, IEEE Commun. Mag..

[45]  Jennifer Rexford,et al.  Putting BGP on the right path: a case for next-hop routing , 2010, Hotnets-IX.

[46]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[47]  Evangelos Markakis,et al.  On the core of the multicommodity flow game , 2003, EC '03.

[48]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[49]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

[50]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[51]  J. Walrand,et al.  Pricing Internet Services With Multiple Providers ∗ , 2003 .

[52]  Michael Schapira,et al.  Interdomain routing and games , 2008, SIAM J. Comput..

[53]  Amogh Dhamdhere,et al.  Twelve Years in the Evolution of the Internet Ecosystem , 2011, IEEE/ACM Transactions on Networking.

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

[55]  Edmund M. Yeh,et al.  Pricing, competition, and routing in relay networks , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[56]  Abraham Silberschatz,et al.  On route selection for interdomain traffic engineering , 2005, IEEE Network.

[57]  David M. Pennock,et al.  Comparing static and dynamic measurements and models of the Internet's AS topology , 2004, IEEE INFOCOM 2004.

[58]  Asuman E. Ozdaglar,et al.  Competition in Parallel-Serial Networks , 2007, IEEE Journal on Selected Areas in Communications.