Selfish caching in distributed systems: a game-theoretic analysis

Authors:
Byung-Gon Chun;Kamalika Chaudhuri;Hoeteck Wee;Marco Barreno;Christos H. Papadimitriou;John Kubiatowicz
Affiliations:
University of California, Berkeley;University of California, Berkeley;University of California, Berkeley;University of California, Berkeley;University of California, Berkeley;University of California, Berkeley
Venue:
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Year:
2004

Citing 28
Cited 31

NetCache architecture and deployment

Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Cooperative facility location games

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Summary cache: a scalable wide-area web cache sharing protocol

IEEE/ACM Transactions on Networking (TON)
OceanStore: an architecture for global-scale persistent storage

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Coordinated En-Route Web Caching

IEEE Transactions on Computers
Squirrel: a decentralized peer-to-peer web cache

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Improved Approximation Algorithms for Metric Facility Location Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network

Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology

HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Strategyproof cost-sharing mechanisms for set cover and facility location games

Proceedings of the 4th ACM conference on Electronic commerce
Near-optimal network design with selfish agents

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The online median problem

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
BRITE: Universal Topology Generation from a User''s Perspective

BRITE: Universal Topology Generation from a User''s Perspective
A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Group Strategyproof Mechanisms via Primal-Dual Algorithms

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks

ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Market sharing games applied to content distribution in ad-hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
The complexity of pure Nash equilibria

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Farsite: federated, available, and reliable storage for an incompletely trusted environment

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Taming aggressive replication in the Pangaea wide-area file system

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2

Computing correlated equilibria in multi-player games

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Overcoming free-riding behavior in peer-to-peer systems

ACM SIGecom Exchanges
Preface: A brief overview of network algorithms

Journal of Computer and System Sciences - Special issue on network algorithms 2005
A Distributed Algorithm for Sharing Web Cache Disk Capacity

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A Pure Nash Equilibrium Guaranteeing Game Theoretical Replica Allocation Method for Reducing Web Access Time

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A Game Theoretic Approach to Power Aware Wireless Data Access

IEEE Transactions on Mobile Computing
Distributed Selfish Replication

IEEE Transactions on Parallel and Distributed Systems
Equilibria in online games

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed Selfish Caching

IEEE Transactions on Parallel and Distributed Systems
A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Computing correlated equilibria in multi-player games

Journal of the ACM (JACM)
A game-theoretic analysis of the implications of overlay network traffic on ISP peering

Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance evaluation for implementations of a network of proxy caches

Decision Support Systems
On Pure and (Approximate) Strong Equilibria of Facility Location Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
How does user heterogeneity affect performance of P2P caching?: evolutionary game theoretic approach

Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses

Management Science
Improved Bounds for Facility Location Games with Fair Cost Allocation

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
On a selfish caching game

Proceedings of the 28th ACM symposium on Principles of distributed computing
On the social cost of distributed selfish content replication

NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Replicating data objects in large distributed database systems: an axiomatic game theoretic mechanism design approach

Distributed and Parallel Databases
The effects of local trust cooperation in multiagent systems

KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
A game theoretic framework for peer-to-peer market economy

International Journal of Grid and Utility Computing
Selfish content replication on graphs

Proceedings of the 23rd International Teletraffic Congress
Cooperative content replication in networks with autonomous nodes

Computer Communications
Local utility aware content replication

NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Content distribution through autonomic content and storage management

WAC'04 Proceedings of the First international IFIP conference on Autonomic Communication
Cache me if you can: capacitated selfish replication games

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A game-theoretic approach for balancing the tradeoffs between data availability and query delay in multi-hop cellular networks

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Distributed Welfare Games

Operations Research
The evolution of cooperation in file sharing p2p systems: first steps

MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Computational Intelligence - Volume Part II
Cooperation policies for efficient in-network caching

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM

Quantified Score

Hi-index	0.00

Visualization

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.