Cooperation policies for efficient in-network caching

Authors:
Liang Wang;Suzan Bayhan;Jussi Kangasharju
Affiliations:
University of Helsinki, Helsinki, Finland;HIIT, Aalto University, Helsinki, Finland;University of Helsinki, Helsinki, Finland
Venue:
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Year:
2013

Citing 3
Cited 0

Selfish caching in distributed systems: a game-theoretic analysis

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Networking named content

Proceedings of the 5th international conference on Emerging networking experiments and technologies
Selfish content replication on graphs

Proceedings of the 23rd International Teletraffic Congress

Quantified Score

Hi-index	0.00

Visualization

Abstract

Caching is a key component of information-centric networking, but most of the work in the area focuses on simple en-route caching with limited cooperation between the caches. In this paper we model cache cooperation under a game theoretical framework and show how cache cooperation policy can allow the system to converge to a Pareto optimal configuration. Our work shows how cooperation impacts network caching performance and how it takes advantage of the structural properties of the underlying network.