{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:56Z","timestamp":1750306076226,"version":"3.41.0"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T00:00:00Z","timestamp":1502496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100004356","name":"Nokia","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100004356","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2017,11,30]]},"abstract":"<jats:p>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.<\/jats:p>\n          <jats:p>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.<\/jats:p>\n          <jats:p>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.<\/jats:p>\n          <jats:p>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<\/jats:p>","DOI":"10.1145\/3106157","type":"journal-article","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T12:24:33Z","timestamp":1502713473000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Caching Online Video"],"prefix":"10.1145","volume":"13","author":[{"given":"Shahid","family":"Akhtar","sequence":"first","affiliation":[{"name":"Nokia"}]},{"given":"Andre","family":"Beck","sequence":"additional","affiliation":[{"name":"Nokia"}]},{"given":"Ivica","family":"Rimac","sequence":"additional","affiliation":[{"name":"Nokia"}]}],"member":"320","published-online":{"date-parts":[[2017,8,12]]},"reference":[{"volume-title":"Proceedings of the 2012 IEEE INFOCOM. IEEE.","year":"2011","author":"Adhikari Vijay Kumar","key":"e_1_2_2_1_1"},{"volume-title":"Proceedings of the 23rd ACM International Conference on Multimedia. ACM.","year":"2015","author":"Shahid Akhtar","key":"e_1_2_2_2_1"},{"key":"e_1_2_2_3_1","unstructured":"Bakhtiyari Shahab. 2012. Performance evaluation of the apache traffic server and varnish reverse proxies. MS thesis. University of Oslo Oslo Norway.  Bakhtiyari Shahab. 2012. Performance evaluation of the apache traffic server and varnish reverse proxies. MS thesis. University of Oslo Oslo Norway."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504743"},{"key":"e_1_2_2_5_1","article-title":"A study of replacement algorithms for a virtual-storage computer","volume":"5","author":"Belady Laszlo","year":"1966","journal-title":"IBM Systems Journal"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2014.07.001"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2825236.2825259"},{"volume-title":"INFOCOM, 2010 Proceedings IEEE. IEEE.","year":"2010","author":"Sem Borst","key":"e_1_2_2_8_1"},{"volume-title":"USENIX Symposium on Internet Technologies and Systems. 12","year":"1997","author":"Pei Cao","key":"e_1_2_2_9_1"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.801752"},{"key":"e_1_2_2_11_1","unstructured":"Cherkasova Ludmila. 1998. Improving WWW proxies performance with greedy-dual-size-frequency caching policy. Hewlett-Packard Laboratories.  Cherkasova Ludmila. 1998. Improving WWW proxies performance with greedy-dual-size-frequency caching policy. Hewlett-Packard Laboratories."},{"key":"e_1_2_2_12_1","unstructured":"Cole Gerry. 2000. Estimating drive reliability in desktop computers and consumer electronics systems. Seagate Technology Paper TP 338.  Cole Gerry. 2000. Estimating drive reliability in desktop computers and consumer electronics systems. Seagate Technology Paper TP 338."},{"key":"e_1_2_2_13_1","unstructured":"Comcast CDN. Retrieved from http:\/\/blog.streamingmedia.com\/wp-content\/uploads\/2013\/07\/2013CDNSummit-A102C.pdf.  Comcast CDN. Retrieved from http:\/\/blog.streamingmedia.com\/wp-content\/uploads\/2013\/07\/2013CDNSummit-A102C.pdf."},{"key":"e_1_2_2_14_1","unstructured":"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.  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."},{"volume-title":"Proceedings of the 2014 22nd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE.","year":"2014","author":"Gil Einziger","key":"e_1_2_2_15_1"},{"volume-title":"Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science. ACM.","year":"2016","author":"Andr\u00e9s Ferragut","key":"e_1_2_2_16_1"},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"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.  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.","DOI":"10.17487\/rfc2616"},{"volume-title":"Proceedings of the 2012 6th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS). IEEE","year":"2012","author":"Fofack N. Choungmo","key":"e_1_2_2_18_1"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.03.006"},{"volume-title":"Proceedings of the 20th VLDB Conference.","year":"1994","author":"Theodore Johnson","key":"e_1_2_2_20_1"},{"volume-title":"Proceedings of the 7th International Symposium on Computers and Commuication (ICCC'02)","author":"George Karakostas","key":"e_1_2_2_21_1"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.05.003"},{"volume-title":"Proceedings of the 2004 IEEE International Conference on Performance, Computing, and Communications. IEEE.","year":"2004","author":"Nikolaos Laoutaris","key":"e_1_2_2_23_1"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1084772.1084774"},{"volume-title":"Proceedings of the 2011 IEEE International Conference on Communications (ICC). IEEE","year":"2011","author":"Zhe Li","key":"e_1_2_2_25_1"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566772"},{"key":"e_1_2_2_27_1","unstructured":"Megiddo Nimrod and Dharmendra S. Modha. 2003. ARC: A self-tuning low overhead replacement cache. File and Storage Technologies. Vol. 3. 2003.  Megiddo Nimrod and Dharmendra S. Modha. 2003. ARC: A self-tuning low overhead replacement cache. File and Storage Technologies. Vol. 3. 2003."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITC-28.2016.127"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/954339.954341"},{"volume-title":"Proceedings of the 2013 IEEE International Conference on Communications (ICC). IEEE.","year":"2013","author":"Konstantinos Poularakis","key":"e_1_2_2_30_1"},{"volume-title":"Proceedings of the 2012 46th Annual Conference on Information Sciences and Systems (CISS). IEEE.","year":"2012","author":"Konstantinos Poularakis","key":"e_1_2_2_31_1"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.944339"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062201"},{"key":"e_1_2_2_34_1","unstructured":"Sandvine Report. 2013. Exposing the technical and commercial factors underlying internet quality of experience Sept. 2013.  Sandvine Report. 2013. Exposing the technical and commercial factors underlying internet quality of experience Sept. 2013."},{"key":"e_1_2_2_35_1","unstructured":"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.  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."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.05.003"},{"key":"e_1_2_2_37_1","unstructured":"Traffic Server Documents Retrieved from https:\/\/docs.trafficserver.apache.org\/en\/4.0.x\/admin\/configuring-cache.en.html.  Traffic Server Documents Retrieved from https:\/\/docs.trafficserver.apache.org\/en\/4.0.x\/admin\/configuring-cache.en.html."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6364671"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1218063.1217968"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2010.5466658"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106157","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:04Z","timestamp":1750217404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106157"}},"subtitle":["Analysis and Proposed Algorithm"],"short-title":[],"issued":{"date-parts":[[2017,8,12]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,11,30]]}},"alternative-id":["10.1145\/3106157"],"URL":"https:\/\/doi.org\/10.1145\/3106157","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2017,8,12]]},"assertion":[{"value":"2016-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}