Article

Selfish caching in distributed systems: a game-theoretic analysis

Authors:

Byung-Gon Chun,

Kamalika Chaudhuri,

Christos H. Papadimitriou,

John KubiatowiczAuthors Info & Claims

PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Pages 21 - 30

https://doi.org/10.1145/1011767.1011771

Published: 25 July 2004 Publication History

Abstract

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.

References

[1]

http://www.mosek.com.

[2]

A. Adya et al. FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In Proc. of USENIX OSDI, 2002.

Digital Library

[3]

E. Anshelevich, A. Dasgupta, E. Tardos, and T. Wexler. Near-optimal Network Design with Selfish Agents. In Proc. of ACM STOC, 2003.

Digital Library

[4]

Y. Chen, R. H. Katz, and J. D. Kubiatowicz. SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network. In Proc. of Intl. Conf. on Pervasive Computing, 2002.

Digital Library

[5]

F. Dabek et al. Wide-area Cooperative Storage with CFS. In Proc. of ACM SOSP, Oct. 2001.

Digital Library

[6]

P. B. Danzig. NetCache Architecture and Deploment. In Computer Networks and ISDN Systems, 1998.

Digital Library

[7]

N. Devanur, M. Mihail, and V. Vazirani. Strategyproof cost-sharing Mechanisms for Set Cover and Facility Location Games. In Proc. of ACM EC, 2003.

Digital Library

[8]

J. R. Douceur and R. P. Wattenhofer. Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System. In Proc. of MASCOTS, 2001.

Digital Library

[9]

A. Fabrikant, C. H. Papadimitriou, and K. Talwar. The Complexity of Pure Nash Equilibria. In Proc. of ACM STOC, 2004.

Digital Library

[10]

L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary Cache: A Scalable Wide-area Web Cache Sharing Protocol. IEEE/ACM Trans. on Networking, 8(3):281--293, 2000.

Digital Library

[11]

M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., 1979.

Digital Library

[12]

M. X. Goemans, L. Li, V. S. Mirrokni, and M. Thottan. Market Sharing Games Applied to Content Distribution in Ad-Hoc Networks. In Proc. of ACM MOBIHOC, 2004.

Digital Library

[13]

M. X. Goemans and M. Skutella. Cooperative Facility Location Games. In Proc. of ACM-SIAM SODA, 2000.

Digital Library

[14]

S. Gribble et al. What Can Databases Do for Peer-to-Peer? In WebDB Workshop on Databases and the Web, June 2001.

[15]

K. P. Gummadi et al. Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. In Proc. of ACM SOSP, October 2003.

Digital Library

[16]

S. Iyer, A. Rowstron, and P. Druschel. Squirrel: A Decentralized Peer-to-Peer Web Cache. In Proc. of ACM PODC, 2002.

Digital Library

[17]

K. Jain and V. V. Vazirani. Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. In Proc. of IEEE FOCS, 1999.

Digital Library

[18]

S. Jamin et al. On the Placement of Internet Instrumentation. In Proc. of IEEE INFOCOM, pages 295--304, 2000.

[19]

S. Jamin et al. Constrained Mirror Placement on the Internet. In Proc. of IEEE INFOCOM, pages 31--40, 2001.

[20]

B.-J. Ko and D. Rubenstein. A Distributed, Self-stabilizing Protocol for Placement of Replicated Resources in Emerging Networks. In Proc. of IEEE ICNP, 2003.

Digital Library

[21]

E. Koutsoupias and C. Papadimitriou. Worst-Case Equilibria. In STACS, 1999.

Digital Library

[22]

J. Kubiatowicz et al. OceanStore: An Architecture for Global-scale Persistent Storage. In Proc. of ACM ASPLOS. ACM, November 2000.

Digital Library

[23]

B. Li, M. J. Golin, G. F. Italiano, and X. Deng. On the Optimal Placement of Web Proxies in the Internet. In Proc.of IEEE INFOCOM, 1999.

Digital Library

[24]

M. Mahdian, Y. Ye, and J. Zhang. Improved Approximation Algorithms for Metric Facility Location Problems. In Proc. of Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2002.

Digital Library

[25]

A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: Universal Topology Generation from a User's Perspective. Technical Report 2001-003, 1 2001.

Digital Library

[26]

R. R. Mettu and C. G. Plaxton. The Online Median Problem. In Proc. of IEEE FOCS, 2000.

Digital Library

[27]

P. B. Mirchandani and R. L. Francis. Discrete Location Theory. Wiley-Interscience Series in Discrete Mathematics and Optimization, 1990.

[28]

M. J. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, 1994.

[29]

M. Pal and E. Tardos. Group Strategyproof Mechanisms via Primal-Dual Algorithms. In Proc. of IEEE FOCS, 2003.

Digital Library

[30]

L. Qiu, V. N. Padmanabhan, and G. M. Voelker. On the Placement of Web Server Replicas. In Proc. of IEEE INFOCOM, 2001.

[31]

M. Rabinovich, I. Rabinovich, R. Rajaraman, and A. Aggarwal. A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service. In Proc. of IEEE ICDCS, 1999.

Digital Library

[32]

A. Rowstron and P. Druschel. Storage Management and Caching in PAST, A Large-scale, Persistent Peer-to-peer Storage Utility. In Proc. of ACM SOSP, October 2001.

Digital Library

[33]

Y. Saito, C. Karamanolis, M. Karlsson, and M. Mahalingam. Taming Aggressive Replication in the Pangaea Wide-Area File System. In Proc. of USENIX OSDI, 2002.

Digital Library

[34]

X. Tang and S. T. Chanson. Coordinated En-route Web Caching. In IEEE Trans. Computers, 2002.

Digital Library

[35]

A. Vetta. Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing, and Auctions. In Proc. of IEEE FOCS, 2002.

Digital Library

[36]

E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proc. of IEEE INFOCOM, 1996.

Digital Library

Cited By

Etesami SChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Distributed Data Placement and Content Delivery in Web Caches with Non-Metric Access CostsProceedings of the ACM Web Conference 202410.1145/3589334.3645654(4340-4351)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645654
Feng HGuo SLiu DYang Y(2022)Mean-Field Game Theory Based Optimal Caching Control in Mobile Edge ComputingIEEE Transactions on Mobile Computing10.1109/TMC.2022.3193764(1-15)Online publication date: 2022
https://doi.org/10.1109/TMC.2022.3193764
Dhamal SBen-Ameur WChahed TAltman ESunny APoojary S(2022)Strategic Investments in Distributed Computing: A Stochastic Game PerspectiveJournal of Parallel and Distributed Computing10.1016/j.jpdc.2022.07.012Online publication date: Aug-2022
https://doi.org/10.1016/j.jpdc.2022.07.012
Show More Cited By

Index Terms

Selfish caching in distributed systems: a game-theoretic analysis
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Recommendations

How Bad is Selfish Caching?
Mobihoc '19: Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing

Caching networks can reduce the routing costs of accessing contents by caching contents closer to users. However, cache nodes may belong to different entities and behave selfishly to maximize their own benefits, which often lead to performance ...
Selfish bin coloring

The bin packing problem, a classical problem in combinatorial optimization, has recently been studied from the viewpoint of algorithmic game theory. In this bin packing game each item is controlled by a selfish player minimizing its personal cost, which ...
Intrinsic robustness of the price of anarchy
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computing

The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a game and that of an optimal outcome. This measure implicitly assumes that ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

July 2004

422 pages

ISBN:1581138024

DOI:10.1145/1011767

General Chair:
Soma Chaudhuri
Iowa State University
,
Program Chair:
Shay Kutten
Technion

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC04

Sponsor:

PODC04: Principles of Distributed Computing 2004

July 25 - 28, 2004

Newfoundland, St. John's, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

109
Total Citations
View Citations
1,544
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Etesami SChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Distributed Data Placement and Content Delivery in Web Caches with Non-Metric Access CostsProceedings of the ACM Web Conference 202410.1145/3589334.3645654(4340-4351)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645654
Feng HGuo SLiu DYang Y(2022)Mean-Field Game Theory Based Optimal Caching Control in Mobile Edge ComputingIEEE Transactions on Mobile Computing10.1109/TMC.2022.3193764(1-15)Online publication date: 2022
https://doi.org/10.1109/TMC.2022.3193764
Dhamal SBen-Ameur WChahed TAltman ESunny APoojary S(2022)Strategic Investments in Distributed Computing: A Stochastic Game PerspectiveJournal of Parallel and Distributed Computing10.1016/j.jpdc.2022.07.012Online publication date: Aug-2022
https://doi.org/10.1016/j.jpdc.2022.07.012
Rajalakshmi DK. M(2021)An Efficient Selfishness Control Mechanism for Mobile Ad hoc NetworksHandbook of Research on Innovations and Applications of AI, IoT, and Cognitive Technologies10.4018/978-1-7998-6870-5.ch030(432-449)Online publication date: 2021
https://doi.org/10.4018/978-1-7998-6870-5.ch030
Ma QYeh EHuang J(2021)Selfish Caching Games on Directed GraphsIEEE/ACM Transactions on Networking10.1109/TNET.2020.304794029:2(709-722)Online publication date: Apr-2021
https://doi.org/10.1109/TNET.2020.3047940
Bhattacharya PGuo M(2020)An Incentive Compatible Mechanism for Replica Placement in Peer-Assisted Content DistributionInternational Journal of Software Science and Computational Intelligence10.4018/IJSSCI.202001010412:1(47-67)Online publication date: Jan-2020
https://doi.org/10.4018/IJSSCI.2020010104
Zheng GFriderikos V(2020)Fair Cache Sharing Management for Multi-Tenant Based Mobile Edge NetworksProceedings of the ACM MobiArch 2020 The 15th Workshop on Mobility in the Evolving Internet Architecture10.1145/3411043.3412514(1-7)Online publication date: 21-Sep-2020
https://dl.acm.org/doi/10.1145/3411043.3412514
Etesami S(2020)Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over NetworksSIAM Journal on Optimization10.1137/19M124252530:1(885-914)Online publication date: 12-Mar-2020
https://doi.org/10.1137/19M1242525
Kim HPark JBennis MKim SDebbah M(2020)Mean-Field Game Theoretic Edge Caching in Ultra-Dense NetworksIEEE Transactions on Vehicular Technology10.1109/TVT.2019.295313269:1(935-947)Online publication date: Jan-2020
https://doi.org/10.1109/TVT.2019.2953132
Ma QYeh EHuang J(2019)How Bad is Selfish Caching?Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing10.1145/3323679.3326499(11-20)Online publication date: 2-Jul-2019
https://dl.acm.org/doi/10.1145/3323679.3326499
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten