skip to main content
research-article

Caching Online Video: Analysis and Proposed Algorithm

Published: 12 August 2017 Publication History

Abstract

Online video presents new challenges to traditional caching with over a thousand-fold increase in number of assets, rapidly changing popularity of assets and much higher throughput requirements.
We propose a new hierarchical filtering algorithm for caching online video HiFi. Our algorithm is designed to optimize hit rate, replacement rate and cache throughput. It has an associated implementation complexity comparable to that of LRU.
Our results show that, under typical operator conditions, HiFi can increase edge cache byte hit rate by 5%--24% over an LRU policy, but more importantly can increase the RAM or memory byte hit rate by 80% to 200% and reduce the replacement rate by more than 100 times! These two factors combined can dramatically increase throughput for most caches. If SSDs are used for storage, the much lower replacement rate may also allow substitution of lower-cost MLC-based SSDs instead of SLC-based SSDs.
We extend previous multi-tier analytical models for LRU caches to caches with filtering. We analytically show how HiFi can approach the performance of an optimal caching policy and how to tune HiFi to reach as close to optimal performance as the traffic conditions allow. We develop a realistic simulation environment for online video using statistics from operator traces. We show that HiFi performs within a few percentage points from the optimal solution which was simulated by Belady's MIN algorithm under typical operator conditions

Supplementary Material

a48-akhtar-apndx.pdf (akhtar.zip)
Supplemental movie, appendix, image and software files for, Caching Online Video: Analysis and Proposed Algorithm

References

[1]
Vijay Kumar Adhikari, Sourabh Jain, Yingying Chen, and Zhi-Li Zhang. 2011. Vivisecting YouTube: An active measurement study. In Proceedings of the 2012 IEEE INFOCOM. IEEE.
[2]
Akhtar Shahid, Andre Beck, and Ivica Rimac. 2015. Hifi: A hierarchical filtering algorithm for caching of online video. In Proceedings of the 23rd ACM International Conference on Multimedia. ACM.
[3]
Bakhtiyari Shahab. 2012. Performance evaluation of the apache traffic server and varnish reverse proxies. MS thesis. University of Oslo, Oslo, Norway.
[4]
Athula Balachandran, Vyas Sekar, Aditya Akella, and Srinivasan Seshan. 2013. Analyzing the potential benefits of CDN augmentation strategies for internet video workloads. In Proceedings of the 2013 Conference on Internet Measurement Conference. ACM.
[5]
Belady Laszlo A. 1966. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal 5, 2, (1966): 78--101.
[6]
Daniel S. Berger, Philipp Gland, Sahil Singla, and Florin Ciucu. 2014. Exact analysis of TTL cache networks. Performance Evaluation 79 (2014): 2--23.
[7]
Daniel S. Berger, Sebastian Henningsen, Florin Ciucu, and Jens B. Schmitt. 2015. Maximizing cache hit ratios by variance reduction. ACM SIGMETRICS Performance Evaluation Review 43, 2, (2015): 57--59.
[8]
Borst Sem, Varun Gupta, and Anwar Walid. 2010. Distributed caching algorithms for content distribution networks. INFOCOM, 2010 Proceedings IEEE. IEEE.
[9]
Cao Pei and Sandy Irani. 1997. Cost-aware www proxy caching algorithms. USENIX Symposium on Internet Technologies and Systems. 12, 97.
[10]
Che Hao, Ye Tung, and Zhijun Wang. 2002. Hierarchical web caching systems: Modeling, design and experimental results. IEEE Journal on Selected Areas in Communications 20.7 (2002): 1305--1314.
[11]
Cherkasova Ludmila. 1998. Improving WWW proxies performance with greedy-dual-size-frequency caching policy. Hewlett-Packard Laboratories.
[12]
Cole Gerry. 2000. Estimating drive reliability in desktop computers and consumer electronics systems. Seagate Technology Paper TP 338.
[13]
Comcast CDN. Retrieved from http://blog.streamingmedia.com/wp-content/uploads/2013/07/2013CDNSummit-A102C.pdf.
[14]
Simpson Dave. MLC vs. SLC flash for enterprise SSDs, July 2010. Retrieved from http://www.infostor.com/index/articles/display/1169849064/articles/infostor/disk-arrays/disk-drives/2010/july-2010/mlc-vs__slc_flash.html.
[15]
Einziger Gil and Roy Friedman. 2014. Tinylfu: A highly efficient cache admission policy. In Proceedings of the 2014 22nd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE.
[16]
Ferragut Andrés, Ismael Rodríguez, and Fernando Paganini. 2016. Optimizing TTL caches under heavy-tailed demands. In Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science. ACM.
[17]
Roy Fielding, Jim Gettys, Jeffrey Mogul, Henrik Frystyk, Larry Masinter, Paul Leach, and Tim Berners-Lee. 2009. RFC 2616, hypertext transfer protocol http/1.1, 1999. Retrieved from http://www.rfc.net/rfc2616.html.
[18]
N. Choungmo Fofack, Philippe Nain, Giovanni Neglia, and Don Towsley. 2012. Analysis of TTL-based cache networks. In Proceedings of the 2012 6th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS). IEEE, 2012.
[19]
Fofack Nicaise Choungmo et al. Performance evaluation of hierarchical TTL-based cache networks. Computer Networks 65 (2014): 212--231.
[20]
Johnson Theodore and Dennis Shasha. 1994. X3: A low overhead high performance buffer management replacement algorithm. In Proceedings of the 20th VLDB Conference.
[21]
Karakostas George and Dimitrios N. Serpanos. 2002. Exploitation of different types of locality for web caches. In Proceedings of the 7th International Symposium on Computers and Commuication (ICCC'02). IEEE.
[22]
Laoutaris Nikolaos, Hao Che, and Ioannis Stavrakakis. 2006. The LCD interconnection of LRU caches and its analysis. Performance Evaluation 63.7 (2006): 609--634.
[23]
Laoutaris Nikolaos, Sofia Syntila, and Ioannis Stavrakakis. 2004. Meta algorithms for hierarchical web caches. In Proceedings of the 2004 IEEE International Conference on Performance, Computing, and Communications. IEEE.
[24]
Keqiu Li, Hong Shen, Francis Y. L. Chin, and Si Qing Zheng. 2005. Optimal methods for coordinated enroute web caching for tree networks. ACM Transactions on Internet Technology (TOIT) 5, 3 (2005), 480--507.
[25]
Li Zhe, and Gwendal Simon. 2011. Time-shifted TV in content centric networks: The case for cooperative in-network caching. In Proceedings of the 2011 IEEE International Conference on Communications (ICC). IEEE, 2011.
[26]
Jaime Llorca, Antonia M. Tulino, Kyle Guan, Jairo Esteban, Matteo Varvello, Nakjung Choi, and Daniel C. Kilper. 2013. Dynamic in-network caching for energy efficient content delivery. In Proceedings of INFOCOM 2013. IEEE, 2013.
[27]
Megiddo Nimrod and Dharmendra S. Modha. 2003. ARC: A self-tuning, low overhead replacement cache. File and Storage Technologies. Vol. 3. 2003.
[28]
Giovanni Neglia, Damiano Carra, Mingdong Feng, Vaishnav Janardhan, Pietro Michiardi, and Dimitra Tsigkari. 2016. Access-time aware cache algorithms. In Proceedings of the 2016 28th International Teletraffic Congress (ITC 28). 1. IEEE.
[29]
Podlipnig Stefan and Laszlo Böszörmenyi. 2003. A survey of web cache replacement strategies. ACM Computing Surveys (CSUR) 35, 4 (2003), 374--398.
[30]
Poularakis Konstantinos and Leandros Tassiulas. 2013. Optimal algorithms for hierarchical web caches. In Proceedings of the 2013 IEEE International Conference on Communications (ICC). IEEE.
[31]
Poularakis Konstantinos and Leandros Tassiulas. 2012. Optimal cooperative content placement algorithms in hierarchical cache topologies. In Proceedings of the 2012 46th Annual Conference on Information Sciences and Systems (CISS). IEEE.
[32]
Rodriguez Pablo, Christian Spanner, and Ernst W. Biersack. 2001. Analysis of web caching architectures: Hierarchical and distributed caching. IEEE/ACM Transactions on Networking (TON) 9.4 (2001), 404--418.
[33]
Rosensweig Elisha J. and Jim Kurose. 2009. Breadcrumbs: Efficient, best-effort content location in cache networks. In Proceedings of INFOCOM 2009. IEEE.
[34]
Sandvine Report. 2013. Exposing the technical and commercial factors underlying internet quality of experience, Sept. 2013.
[35]
Shah Ketan, Anirban Mitra, and Dhruv Matani. 2010. An O (1) algorithm for implementing the LFU cache eviction scheme. Dhruvbird. com/lfu.pdf (2010): 1--8.
[36]
Wenting Tang, Yun Fu, Ludmila Cherkasova, and Amin Vahdat. Modeling and generating realistic streaming media server workloads. Computer Networks 51, 1 (2007), 336--356.
[37]
Traffic Server Documents Retrieved from https://docs.trafficserver.apache.org/en/4.0.x/admin/configuring-cache.en.html.
[38]
Tatsuhiro Tsutsui, Hiroyuki Urabayashi, Miki Yamamoto, Elisha Rosensweig, and James F. Kurose. 2012. Performance evaluation of partial deployment of breadcrumbs in content oriented networks. In Proceedings of the 2012 IEEE International Conference on Communications (ICC). IEEE.
[39]
Yu Hongliang et al. 2006. Understanding user behavior in large-scale video-on-demand systems. ACM SIGOPS Operating Systems Review 40, 4.
[40]
Zhu Yuncheng, Maoke Chen, and Akihiro Nakao. 2010. Conic: Content-oriented network with indexed caching. In Proceedings of the IEEE Conference on Computer Communications Workshops (INFOCOM 2010). IEEE

Cited By

View all
  • (2023)Boosting Cache Performance by Access Time MeasurementsACM Transactions on Storage10.1145/357277819:1(1-29)Online publication date: 17-Feb-2023
  • (2018)Adaptive Software Cache ManagementProceedings of the 19th International Middleware Conference10.1145/3274808.3274816(94-106)Online publication date: 26-Nov-2018

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Multimedia Computing, Communications, and Applications
ACM Transactions on Multimedia Computing, Communications, and Applications  Volume 13, Issue 4
November 2017
362 pages
ISSN:1551-6857
EISSN:1551-6865
DOI:10.1145/3129737
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 August 2017
Accepted: 01 March 2017
Revised: 01 March 2017
Received: 01 June 2016
Published in TOMM Volume 13, Issue 4

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. GDSF
  2. Hierarchical cache
  3. LFU
  4. LRU
  5. hit-rate
  6. online video

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • Nokia

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)1
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Boosting Cache Performance by Access Time MeasurementsACM Transactions on Storage10.1145/357277819:1(1-29)Online publication date: 17-Feb-2023
  • (2018)Adaptive Software Cache ManagementProceedings of the 19th International Middleware Conference10.1145/3274808.3274816(94-106)Online publication date: 26-Nov-2018

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media