On the scale and performance of cooperative Web proxy caching
Proceedings of the seventeenth ACM symposium on Operating systems principles
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Selfish Replication
IEEE Transactions on Parallel and Distributed Systems
Should internet service providers fear peer-assisted content distribution?
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Distributed caching algorithms for content distribution networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cache-to-Cache: Could ISPs Cooperate to Decrease Peer-to-Peer Content Distribution Costs?
IEEE Transactions on Parallel and Distributed Systems
The Peer's Dilemma: A general framework to examine cooperation in pure peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cooperation policies for efficient in-network caching
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
| Hi-index | 0.00 |
Replication games are a model of the problem of content placement in computer and communication systems, when the participating nodes make their decisions such as to maximize their individual utilities. In this paper we consider replication games played over arbitrary social graphs; the social graph models limited interaction between the players due to, e.g., the network topology. We show that in replication games there is an equilibrium object placement for arbitrary social graphs. Nevertheless, if all nodes follow a myopic strategy to update their object placements then they might cycle arbitrarily long before reaching an equilibrium if the social graph is non-complete. We give sufficient conditions under which such cycles do not exist, and propose an efficient distributed algorithm to reach an equilibrium over a non-complete social graph.