skip to main content
10.1145/1582716.1582767acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
short-paper

On a selfish caching game

Published: 10 August 2009 Publication History

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]
B. G. Chun and K. Chaudhuri and H. Wee and M. Barreno and C.H. Papadimitriou and J. Kubiatowicz, "Selfish caching in distributed systems: a game-theoretic analysis", ACM PODC, 2004.
[2]
W. L. Tan, F. Lam and W. C. Lau, "An Empirical Study on the Capacity and Performance of 3G Networks", IEEE Transactions on Mobile Computing, 2007
[3]
P. Gupta and P. R. Kumar, "The Capacity of Wireless Networks," IEEE Transactions on Information Theory, 2000.

Cited By

View all
  • (2012)A game-theoretic approach for balancing the tradeoffs between data availability and query delay in multi-hop cellular networksProceedings of the 9th Annual international conference on Theory and Applications of Models of Computation10.1007/978-3-642-29952-0_46(487-497)Online publication date: 16-May-2012
  • (2010)A Lightweight Distributed Solution to Content Replication in Mobile Networks2010 IEEE Wireless Communication and Networking Conference10.1109/WCNC.2010.5506349(1-6)Online publication date: Apr-2010
  • (2010)No-regret learning for cost constrained resource selection game2010 Sixth International Conference on Natural Computation10.1109/ICNC.2010.5582356(2921-2925)Online publication date: Aug-2010

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing
August 2009
356 pages
ISBN:9781605583969
DOI:10.1145/1582716

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. caching
  2. game theory

Qualifiers

  • Short-paper

Conference

PODC '09

Acceptance Rates

PODC '09 Paper Acceptance Rate 27 of 110 submissions, 25%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2012)A game-theoretic approach for balancing the tradeoffs between data availability and query delay in multi-hop cellular networksProceedings of the 9th Annual international conference on Theory and Applications of Models of Computation10.1007/978-3-642-29952-0_46(487-497)Online publication date: 16-May-2012
  • (2010)A Lightweight Distributed Solution to Content Replication in Mobile Networks2010 IEEE Wireless Communication and Networking Conference10.1109/WCNC.2010.5506349(1-6)Online publication date: Apr-2010
  • (2010)No-regret learning for cost constrained resource selection game2010 Sixth International Conference on Natural Computation10.1109/ICNC.2010.5582356(2921-2925)Online publication date: Aug-2010

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media