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.
Author supplied keywords
Cite
CITATION STYLE
Akhtar, Z., Li, Y., Govindan, R., Halepovic, E., Hao, S., Liu, Y., & Sen, S. (2019). AViC: A cache for adaptive bitrate video. In CoNEXT 2019 - Proceedings of the 15th International Conference on Emerging Networking Experiments and Technologies (pp. 305–317). Association for Computing Machinery, Inc. https://doi.org/10.1145/3359989.3365423
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
