On a selfish caching game

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. Categories and Subject Descriptors: C2.4 [Computer-Communication Networks]: Distributed Systems General Terms: Algorithms, Design, Economics.

• Type: Conference
• Year: 2009
• Where: PODC
• Authors: Pietro Michiardi, Carla-Fabiana Chiasserini, Claudio Casetti, Chi-Anh La, Marco Fiore
• Keywords: Caching Problem, Efficient Caching Strategies, Heterogeneous Wireless Network, Parallel Computing, PODC 2009