Abstract | ||
---|---|---|
Video dominates Internet traffic today. Users retrieve on-demand video from Content Delivery Networks (CDNs) which cache video chunks at front-ends. In this paper, we describe AViC, a caching algorithm that leverages properties of video delivery, such as request predictability and the presence of highly unpopular chunks. AViC's eviction policy exploits request predictability to estimate a chunk's future request time and evict the chunk with the furthest future request time. Its admission control policy uses a classifier to predict singletons --- chunks evicted before a second reference. Using real world CDN traces from a commercial video service, we show that AViC outperforms a range of algorithm including LRU, GDSF, AdaptSize and LHD. In particular LRU requires up to 3.5× the cache size to match AViC's performance. Further, AViC has low time complexity and has memory complexity comparable to GDSF.
|
Year | DOI | Venue |
---|---|---|
2019 | 10.1145/3359989.3365423 | CoNEXT |
Keywords | Field | DocType |
HTTP Adaptive Bitrate Video, Caching, Content Delivery Networks | Predictability,Admission control,CPU cache,Computer science,Cache,Computer network,Exploit,Classifier (linguistics),Time complexity,Internet traffic | Conference |
ISBN | Citations | PageRank |
978-1-4503-6998-5 | 0 | 0.34 |
References | Authors | |
0 | 7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zahaib Akhtar | 1 | 27 | 2.29 |
Yaguang Li | 2 | 177 | 10.43 |
ramesh govindan | 3 | 15430 | 2144.86 |
Emir Halepovic | 4 | 280 | 24.78 |
Shuai Hao | 5 | 2 | 1.03 |
Yan Liu | 6 | 2551 | 189.16 |
Oliver Spatscheck | 7 | 197 | 9.42 |