Name
Abstract | ||
|---|---|---|
The ephemeral content popularity seen with many content delivery applications can make indiscriminate on-demand caching in edge networks highly inefficient, since many of the content items that are added to the cache will not be requested again from that network. In this paper, we address the problem of designing and evaluating more selective edge-network caching policies. The need for such policies is demonstrated through an analysis of a dataset recording YouTube video requests from users on an edge network over a 20-month period. We then develop a novel workload modelling approach for such applications and apply it to study the performance of alternative edge caching policies, including indiscriminate caching and cache on $k$ th request for different $k$ . The latter policies are found able to greatly reduce the fraction of the requested items that are inserted into the cache, at the cost of only modest increases in cache miss rate. Finally, we quantify and explore the potential room for improvement from use of other possible predictors of further requests. We find that although room for substantial improvement exists when comparing performance to that of a perfect “oracle” policy, such improvements are unlikely to be achievable in practice. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TPDS.2016.2614805 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | Field | DocType |
YouTube,Data collection,Aggregates,Internet,Computers,Metadata,Privacy | Metadata,Data collection,Computer science,Cache,Workload,Enhanced Data Rates for GSM Evolution,Oracle,Computer network,Cache algorithms,Database,Distributed computing,The Internet | Journal |
Volume | Issue | ISSN |
28 | 6 | 1045-9219 |
Citations | PageRank | References |
8 | 0.49 | 26 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Niklas Carlsson | 1 | 585 | 51.31 |
| Derek L. Eager | 2 | 1718 | 304.86 |