Selfish caching in distributed systems: a game-theoretic analysis

We analyze replication of resources by server nodes that act selfishly, using a game-theoretic approach. We refer to this as the selfish caching problem. In our model, nodes incur either cost for replicating resources or cost for access to a remote replica. We show the existence of pure strategy Nash equilibria and investigate the price of anarchy, which is the relative cost of the lack of coordination. The price of anarchy can be high due to undersupply problems, but with certain network topologies it has better bounds. With a payment scheme the game can always implement the social optimum in the best case by giving servers incentive to replicate.

[1]  Csaba D. Tóth,et al.  Uncoordinated Load Balancing and Congestion Games in P2P Systems , 2004, IPTPS.

[2]  Adrian Vetta,et al.  Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

[4]  Anukool Lakhina,et al.  BRITE: Universal Topology Generation from a User''s Perspective , 2001 .

[5]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[6]  Martin Skutella,et al.  Cooperative facility location games , 2000, SODA '00.

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

[8]  Peter B. Danzig.  NetCache Architecture and Deployment , 1998, Comput. Networks.

[9]  Nikhil R. Devanur,et al.  Strategyproof cost-sharing mechanisms for set cover and facility location games , 2005, Decis. Support Syst..

[10]  Vijay V. Vazirani,et al.  Primal-dual approximation algorithms for metric facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[11]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[12]  Roger Wattenhofer,et al.  Large-scale simulation of replica placement algorithms for a serverless distributed file system , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[13]  Mohammad Mahdian,et al.  Improved Approximation Algorithms for Metric Facility Location Problems , 2002, APPROX.

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

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

[16]  Dan Suciu,et al.  What Can Database Do for Peer-to-Peer? , 2001, WebDB.

[17]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[18]  Bo Li,et al.  On the Optimal Placement of Web Proxies in the Internet: The Linear Topology , 1998, HPN.

[19]  Divyakant Agrawal,et al.  A game theoretic framework for incentives in P2P systems , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[20]  Antony I. T. Rowstron,et al.  Squirrel: a decentralized peer-to-peer web cache , 2002, PODC '02.

[21]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[22]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[23]  Magnus Karlsson,et al.  Taming aggressive replication in the Pangaea wide-area file system , 2002, OPSR.

[24]  Éva Tardos,et al.  Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

[26]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[27]  C. Greg Plaxton,et al.  The online median problem , 1999, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[28]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[29]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[30]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[32]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[33]  Xueyan Tang,et al.  Coordinated En-Route Web Caching , 2002, IEEE Trans. Computers.

[34]  Marina Thottan,et al.  Market sharing games applied to content distribution in ad hoc networks , 2004, IEEE Journal on Selected Areas in Communications.

[35]  Rajmohan Rajaraman,et al.  A dynamic object replication and migration protocol for an Internet hosting service , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[36]  Dan Rubenstein,et al.  Distributed self-stabilizing placement of replicated resources in emerging networks , 2005, IEEE/ACM Transactions on Networking.

[37]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[38]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[39]  Jacob R. Lorch,et al.  Farsite: federated, available, and reliable storage for an incompletely trusted environment , 2002, OSDI '02.

[40]  Randy H. Katz,et al.  SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network , 2002, Pervasive.

[41]  Éva Tardos,et al.  Near-optimal network design with selfish agents , 2003, STOC '03.