On a selfish caching game

ABSTRACT

In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast the caching problem as an anti-coordination game. We start by defining the social optimum in the general case and then focus on a two-player game to obtain insights into the design of efficient caching strategies. Based the theoretical findings, our current work focuses on the development of strategies to be implemented in a practical network setting.

REFERENCES

• 1: Byung-Gon Chun , Kamalika Chaudhuri , Hoeteck Wee , Marco Barreno , Christos H. Papadimitriou , John Kubiatowicz, Selfish caching in distributed systems: a game-theoretic analysis, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, July 25-28, 2004, St. John's, Newfoundland, Canada [doi>10.1145/1011767.1011771]
• 2: Wee Lum Tan , Fung Lam , Wing Cheong Lau, An Empirical Study on the Capacity and Performance of 3G Networks, IEEE Transactions on Mobile Computing, v.7 n.6, p.737-750, June 2008 [doi>10.1109/TMC.2007.70788]
• 3: P. Gupta and P. R. Kumar, "The Capacity of Wireless Networks," IEEE Transactions on Information Theory, 2000.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems
          Subjects: Distributed applications

General Terms:
Algorithms, Design, Economics

Keywords:
caching, game theory