Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2486001.2491713 | SIGCOMM |
Keywords | Field | DocType |
efficient in-network caching,underlying network,cache cooperation policy,limited cooperation,cooperation impacts network,simple en-route,cache cooperation,game theoretical framework,pareto optimal configuration,key component,information-centric network,game theory | Cache,Computer science,Computer network,False sharing,Pareto optimal,Game theory,Distributed computing | Conference |
Volume | Issue | ISSN |
43 | 4 | 0146-4833 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Wang | 1 | 1567 | 158.46 |
| Suzan Bayhan | 2 | 280 | 22.72 |
| Jussi Kangasharju | 3 | 1180 | 102.31 |