Traffic Engineering vs. Content Distribution: A Game Theoretic Perspective

In this paper we explore the interaction between content distribution and traffic engineering. Because a traffic engineer may be unaware of the structure of content distribution systems or overlay networks, this management of the network does not fully anticipate how traffic might change as a result of his actions. Content distribution systems that assign servers at the application level can respond very rapidly to changes in the routing of the network. Consequently, the traffic engineer's decisions may almost never be applied to the intended traffic. We use a game-theoretic framework in which infinitesimal users of a network select the source of content, and the traffic engineer decides how the traffic will route through the network. We formulate a game and prove the existence of equilibria. Additionally, we present a setting in which equilibria are socially optimal, essentially unique, and stable. Conditions under which efficiency loss may be bounded are presented, and the results are extended to the cases of general overlay networks and multiple autonomous systems.

[1]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[2]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[3]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[4]  A. C. Pigou Economics of welfare , 1920 .

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

[6]  L. Shapley,et al.  Potential Games , 1994 .

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

[8]  C. B. Mcguire,et al.  Studies in the Economics of Transportation , 1958 .

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

[10]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[11]  小泉 信三 社会政策の原理 : Pigou, The economics of welfareを読む , 1923 .

[12]  F. Kelly Network routing , 1991, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.

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

[14]  Yin Zhang,et al.  On selfish routing in internet-like environments , 2006, TNET.

[15]  Donald F. Towsley,et al.  Path Selection and Multipath Congestion Control , 2007, INFOCOM.

[16]  Donald F. Towsley,et al.  On the interaction between overlay routing and underlay routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  T. Roughgarden Potential functions and the inefficiency of equilibria , 2006 .

[18]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[19]  John C. S. Lui,et al.  A game-theoretic analysis of the implications of overlay network traffic on ISP peering , 2008, Comput. Networks.

[20]  Randy H. Katz,et al.  Dynamics of Simultaneous Overlay Network Routing , 2003 .

[21]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[22]  Mung Chiang,et al.  Cooperative content distribution and traffic engineering , 2008, NetEcon '08.

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

[24]  Anja Feldmann,et al.  REPLEX: dynamic traffic engineering based on wardrop routing policies , 2006, CoNEXT '06.

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