On the Social Cost of Distributed Selfish Content Replication

  • Gerasimos G. Pollatos
  • Orestis A. Telelis
  • Vassilis Zissimopoulos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4982)


We study distributed content replication networks formed voluntarily by selfish autonomous users, seeking access to information objects that originate from distant servers. Each user caters to minimization of its individual access cost by replicating locally (up to constrained storage capacity) a subset of objects, and accessing the rest from the nearest possible location. We show existence of stable networks by proving existence of pure strategy Nash equilibria for a game-theoretic formulation of this situation. Social (overall) cost of stable networks is measured by the average or by the maximum access cost experienced by any user. We study socially most and least expensive stable networks by means of tight bounds on the ratios of the Price of Anarchy and Stability respectively. Although in the worst case the ratios may coincide, we identify cases where they differ significantly. We comment on simulations exhibiting occurence of cost-efficient stable networks on average.


Social Cost Access Cost Pure Strategy Nash Equilibrium General Network Model Pure Equilibrium 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Wessels, D., Claffy, K.: ICP and the Squid web cache. IEEE Journal on Selected Areas in Communications 16(3) (1998)Google Scholar
  2. 2.
    Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking 8(3), 281–293 (2000)CrossRefGoogle Scholar
  3. 3.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)CrossRefGoogle Scholar
  4. 4.
    Leff, A., Wolf, J., Yu, P.S.: Replication Algorithms in a Remote Caching Architecture. IEEE Transactions on Parallel and Distributed Systems 4(11), 1185–1204 (1993)CrossRefzbMATHGoogle Scholar
  5. 5.
    Baev, I., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks. In: Proceedings of the ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), pp. 661–670 (2001)Google Scholar
  6. 6.
    Nash, J.F.: Non-Cooperative ganes. Annals of Mathematics 54, 286–295 (1951)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Osborne, M.J., Rubinstein, A.: A course in game theory. MIT Press, Cambridge (1994)zbMATHGoogle Scholar
  8. 8.
    Chun, B., Chaudhuri, K., Wee, H., Barreno, M., Papadimitriou, C.H., Kubiatowicz, J.: Selfish caching in distributed systems: a game-theoretic analysis. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) (2004)Google Scholar
  9. 9.
    Koutsoupias, E., Papadimitriou, C.H.: Worst-case Equilibria. In: Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS), pp. 404–413 (1999)Google Scholar
  10. 10.
    Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-optimal network design with selfish agents. In: Proceedings of the ACM Annual Symposium on Theory of Computing (STOC), pp. 511–520 (2003)Google Scholar
  11. 11.
    Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, E., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: Proceedings of IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 295–304 (2004)Google Scholar
  12. 12.
    Laoutaris, N., Telelis, O.A., Zissimopoulos, V., Stavrakakis, I.: Distributed Selfish Replication. IEEE Transactions on Parallel and Distributed Systems 17(12), 1401–1413 (2006)CrossRefGoogle Scholar
  13. 13.
    Fabrikant, A., Luthra, A., Maneva, E.N., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the ACM Symposium on Principle of Distributed Computing (PODC), pp. 347–351 (2003)Google Scholar
  14. 14.
    Chen, H., Roughgarden, T., Valiant, G.: Designing networks with good equilibria. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) (to appear, 2008)Google Scholar
  15. 15.
    Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)Google Scholar
  16. 16.
    GNU Linear Programming Kit,

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Gerasimos G. Pollatos
    • 1
  • Orestis A. Telelis
    • 2
  • Vassilis Zissimopoulos
    • 1
  1. 1.Department of Informatics and TelecommunicationsUniversity of AthensGreece
  2. 2.Department of Computer ScienceUniversity of AarhusDenmark

Personalised recommendations