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.
On a selfish caching game
PODC 2009, 28th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, August 10-12, 2009, Calgary, Canada
© ACM, 2009. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in PODC 2009, 28th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, August 10-12, 2009, Calgary, Canada http://dx.doi.org/10.1145/1582716.1582767
PERMALINK : https://www.eurecom.fr/publication/2759