Lifecycle-Aware Online Video Caching

被引:24
作者
Li, Tong [1 ]
Braud, Tristan [1 ]
Li, Yong [2 ]
Hui, Pan [3 ,4 ]
机构
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Syst & Media Lab SyMLab, Sai Kung, Hong Kong, Peoples R China
[2] Tsinghua Univ, Dept Elect Engn, Beijing Natl Res Ctr Informat Sci & Technol, Beijing, Peoples R China
[3] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Syst & Media Lab SyMLab, Hong Kong, Peoples R China
[4] Univ Helsinki, Dept Comp Sci, Helsinki 00014, Finland
基金
北京市自然科学基金; 芬兰科学院;
关键词
Shape; Programming; Mobile computing; Optimization; Threshold voltage; Clustering algorithms; Video caching; video lifecycles; caching policy; cache damage; edge networks; CONTENT POPULARITY; HEAVY TAILS; EDGE; COMMUNICATION; DISTRIBUTIONS; STORAGE;
D O I
10.1109/TMC.2020.2984364
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The current explosion of video traffic compels service providers to deploy caches at edge networks. Nowadays, most caching systems store data with a high programming voltage corresponding to the largest possible 'expiry date', typically on the order of years, which maximizes the cache damage. However, popular videos rarely exhibit lifecycles longer than a couple of months. Consequently, the programming voltage can instead be adapted to fit the lifecycle and mitigate the cache damage accordingly. In this paper, we propose LiA-cache, a Lifecycle-Aware caching policy for online videos. LiA-cache finds both near-optimal caching retention times and cache eviction policies by optimizing traffic delivery cost and cache damage cost conjointly. We first investigate temporal patterns of video access from a real-world dataset covering 10 million online videos collected by one of the largest mobile network operators in the world. We next cluster the videos based on their access lifecycles and integrate the clustering into a general model of the caching system. Specifically, LiA-cache analyzes videos and caches them depending on their cluster label. Compared to other popular policies in real-world scenarios, LiA-cache can reduce cache damage up to 90 perce, while keeping a cache hit ratio close to a policy purely relying on video popularity.
引用
收藏
页码:2624 / 2636
页数:13
相关论文
共 48 条
[1]  
[Anonymous], 2012, Proceedings of the 21st international conference on world wide web, WWW '12, DOI DOI 10.1145/2187836.2187871
[2]  
[Anonymous], 2013, Proceedings of the 5th USENIX Conference on Hot Topics in Storage and File Systems. HotStorage'13
[3]  
[Anonymous], 2013, P INT C TEL ICT CS M, DOI DOI 10.1109/ICTEL.2013.6632164
[4]   A View of Cloud Computing [J].
Armbrust, Michael ;
Fox, Armando ;
Griffith, Rean ;
Joseph, Anthony D. ;
Katz, Randy ;
Konwinski, Andy ;
Lee, Gunho ;
Patterson, David ;
Rabkin, Ariel ;
Stoica, Ion ;
Zaharia, Matei .
COMMUNICATIONS OF THE ACM, 2010, 53 (04) :50-58
[5]   The origin of bursts and heavy tails in human dynamics [J].
Barabási, AL .
NATURE, 2005, 435 (7039) :207-211
[6]   Cache-enabled small cell networks: modeling and tradeoffs [J].
Bastug, Ejder ;
Bennis, Mehdi ;
Kountouris, Marios ;
Debbah, Merouane .
EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2015,
[7]   Living on the Edge: The Role of Proactive Caching in 5G Wireless Networks [J].
Bastug, Ejder ;
Bennis, Mehdi ;
Debbah, Merouane .
IEEE COMMUNICATIONS MAGAZINE, 2014, 52 (08) :82-89
[8]   A Learning-Based Approach to Caching in Heterogenous Small Cell Networks [J].
Bharath, B. N. ;
Nagananda, K. G. ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (04) :1674-1686
[9]   A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks [J].
Bilal, Muhammad ;
Kang, Shin-Gak .
IEEE ACCESS, 2017, 5 :1692-1701
[10]  
Blasco P, 2014, IEEE ICC, P1897, DOI 10.1109/ICC.2014.6883600