Abstract
Video on Demand (VoD) services allow users to select and locally consume remotely stored content. We investigate the use of caching to solve the scalability issues of several existing VoD providers. We propose metrics and goals that define the requirements of a caching framework for CDNs of VoD systems. Using data logs collected from Motorola equipment from Comcast VoD deployments we show that several classic caching solutions do not satisfy the proposed goals. We address this issue by developing novel techniques for predicting future values of several metrics of interest. We rely on computed predictions to define the penalty imposed on the system, both network and caching sites, when not storing individual items. We use item penalties to devise novel caching and static content placement strategies. We use the previously mentioned data logs to validate our solutions and show that they satisfy all the defined goals.
Supplemental Material
Available for Download
This is the original published article as published with errors. As of October 6, 2014 the Corrected Version of Record is available as the main PDF for this citation. The errata were also published separately in the September 2014 issue of TOMM as .
- Adamson, B., Bormann, C., Handley, M., and Macker, J. 2009. NACK-oriented reliable multicast (NORM) transport protocol. Internet Engineering Task Force (IETF) RFC 5740.Google Scholar
- Amble, M., Parag, P., Shakkottai, S., and Ying, L. 2011. Content aware caching and traffic management in content distribution networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies.Google Scholar
- Borst, S. C., Gupta, V., and Walid, A. 2010. Distributed caching algorithms for content distribution networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies. Google Scholar
Digital Library
- Cao, P. and Irani, S. 1997. Cost-aware WWW proxy caching algorithms. In Proceedings of the USENIX Symposium on Internet Technologies and Systems. Google Scholar
Digital Library
- Carbunar, B., Potharaju, R., Pearce, M., and Vasudevan, V. 2012. Network aware caching for video on demand systems. In Proceedings of the 13th International Symposium on a World of Wireless, Mobile and Multimedia Networks.Google Scholar
- Dabek, F., Cox, R., Kaashoek, F., and Morris, R. 2004. Vivaldi: A decentralized network coordinate system. ACM SIGCOMM Comput. Comm. Rev. 34, 15--26. Google Scholar
Digital Library
- Dahlin, M. D., Wang, R. Y., Anderson, T. E., and Patterson, D. A. 1994. Cooperative caching: using remote client memory to improve file system performance. In Proceedings of the 1st USENIX Symposium on Operating Systems Design and Implementation. Google Scholar
Digital Library
- Kangasharju, J., Roberts, J. W., and Ross, K. W. 2002. Object replication strategies in content distribution networks. Comput. Commun. 25, 4. Google Scholar
Digital Library
- Karlsson, M. and Mahalingam, M. 2002. Do we need replica placement algorithms in content delivery networks? In Proceedings of the 7th International Web Content Caching and Distribution Workshop.Google Scholar
- Laoutaris, N., Smaragdakis, G., Bestavros, A., Matta, I., and Stavrakakis, I. 2007. Distributed selfish caching. IEEE Trans. Parallel Distrib. Syst. 18, 10, 1361--1376. Google Scholar
Digital Library
- Leff, A., Wolf, J. L., and Yu, P. S. 1993. Replication algorithms in a remote caching architecture. IEEE Trans. Parallel Distrib. Syst. 4, 11, 1185--1204. Google Scholar
Digital Library
- Leong, B., Liskov, B., and Morris, R. 2007. Greedy virtual coordinates for geographic routing. In Proceedings of the IEEE International Conference on Network Protocols. IEEE, 71--80.Google Scholar
- Miner, M. 2012. A new cable deal for Chicago. http://www.chicagoreader.com/Bleader/archives/2012/05/02/a-new-cable-deal-for-chicago.Google Scholar
- Motorola. 2012a. B-1 Video Server. http://www.motorola.com/Video-Solutions/US-EN/Products-and-Services/Video-Infrastructure/On-Demand-Systems/B-1_US-EN.Google Scholar
- Motorola. 2012b. B-3: Motorola expands on demand platform to enhance support for rapidly growing on demand libraries. http://mediacenter.motorola.com/content/Detail.aspx?ReleaseID=10874&NewsAreaID=2.Google Scholar
- Park, S.-H., Lim, E.-J., and Chung, K.-D. 2001. Popularity-based partial caching for vod systems using a proxy server. In Proceedings of the 15th International Parallel and Distributed Processing Symposium. Google Scholar
Digital Library
- Qiu, L., Padmanabhan, V. N., and Voelker, G. M. 2001. On the placement of web server replicas. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies. 1587--1596.Google Scholar
- Ramesh, S., Rhee, I., and Guo, K. 2001. Multicast with cache (mcache): An adaptive zero-delay video-on-demand service. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies. 85--94.Google Scholar
- Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. 2001. A scalable content-addressable network. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'01). ACM, New York, 161--172. Google Scholar
Digital Library
- Ratnasamy, S., Karp, B., Yin, L., Yu, F., Estrin, D., Govindan, R., and Shenker, S. 2002. GHT: A geographic hash table for data-centric storage. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA'02). ACM, New York, 78--87. Google Scholar
Digital Library
- Rowstron, A. I. T. and Druschel, P. 2001. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms. Springer, 329--350. Google Scholar
Digital Library
- Sen, S., Rexford, J., and Towsley, D. 1999. Proxy prefix caching formultimedia streams. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies.Google Scholar
- Sorento. Solution architectures for cable video-on-demand. Sorento Networks, http://www.cascaderange.org/presentations/Solution_Architectures_for_Cable_Video_on_Demand.pdf.Google Scholar
- Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., and Balakrishnan, H. 2003. Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11, 1, 17--32. Google Scholar
Digital Library
- Thatcher, J., Coughlin, T., Handy, J., and Ekker, N. 2009. Nand flash solid state storage for the enterprise, an in-depth look at reliability. In Solid State Storage Initiative (SSSI) of the SNIA.Google Scholar
- Wang, B., Sen, S., Adler, M., and Towsley, D. 2004. Optimal proxy cache allocation for efficient streaming media distribution. IEEE Trans. Multimedia. Google Scholar
Digital Library
- Wauters, T., Coppens, J., De Turck, F., Dhoedt, B., and Demeester, P. 2006. Replica placement in ring based content delivery networks. Comput. Commun. 29, 16, 3313--3326. Google Scholar
Digital Library
- Wu, K.-L., Yu, P. S., and Wolf, J. L. 2001. Segment-based proxy caching of multimedia streams. In Proceedings of the International World Wide Web Conference. Google Scholar
Digital Library
- Wujuan, L., Yong, L. S., and Leong, Y. K. 2006. A client-assisted interval caching strategy for video-on-demand systems. Comput. Comm. 29, 18. Google Scholar
Digital Library
- Zaman, S. and Grosu, D. 2011. A distributed algorithm for the replica placement problem. IEEE Trans. Parallel Distrib. Syst. 22, 9, 1455--1468. Google Scholar
Digital Library
- Zhao, B., Kubiatowicz, J., and Joseph, A. 2001. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. rep. UCB/CSD-01-1141, University of California, Berkeley. Google Scholar
Digital Library
- Zhuo, J., Li, J., Wu, G., and Xu, S. 2008. Efficient cache placement scheme for clustered time-shifted tv servers. IEEE Trans. Consum. Electron. 54, 4, 1947--1955. Google Scholar
Digital Library
Index Terms
A framework for network aware caching for video on demand systems
Recommendations
Criticality aware tiered cache hierarchy: a fundamental relook at multi-level cache hierarchies
ISCA '18: Proceedings of the 45th Annual International Symposium on Computer ArchitectureOn-die caches are a popular method to help hide the main memory latency. However, it is difficult to build large caches without substantially increasing their access latency, which in turn hurts performance. To overcome this difficulty, on-die caches ...
Cache-centric video recommendation: an approach to improve the efficiency of YouTube caches
MMSys '13: Proceedings of the 4th ACM Multimedia Systems ConferenceIn this paper, we take advantage of the user behavior of requesting videos from the related list provided by YouTube and the user behavior of requesting videos from the top of this related list to improve the performance of YouTube's caches. We ...
Modeling LRU cache with invalidation
Least Recently Used (LRU) is a very popular caching replacement policy. It is very easy to implement and offers good performance, especially when data requests are temporally correlated, as in the case of web traffic.When the data content can change ...






Comments