Abstract
We consider the problem of caching multimedia streams in the internet. We use the dynamic caching framework of Dan et al. and Hofmann et al.. We define a novel performance metric based on the maximum number of simultaneous cache misses, and present near-optimal on-line algorithms for determining which parts of the streams should be cached at any point in time for the case of a single server and single cache. We extend this model to case of a single cache with different per-client connection costs, and give an 8-competitive algorithm in this setting. Finally, we propose a model for multiple caches in a network and present an algorithm that is O(K)-competitive if we increase the cache sizes by O(K). Here K is the number of caches in the network.
{emandrews@research.bell-labs.com.}
{emkamesh@cs.stanford.edu.}Supported by ONR N00014-98-1-0589. Part of this work was done while the author was visiting Bell Labs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Albers, S. Arora and S. Khanna. Page replacement for general caching problems. Proceedings of the 10th Annual Symposium on Discrete Algorithms, 31–40, 1999.
L. Belady. A study of replacement algorithms for virtual storage computers. IBM System Journal, 5:78–101, 1966.
A. Dan and D. Sitaram. A generalized interval caching policy for mixed interactive and long video environments. Multimedia Computing and Networking, January 1996.
A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator and N. Young. Competitive paging algorithms. Journal of Algorithms, 12:685–699, 1991.
M. Hofmann, T.S.E. Ng, K. Guo, S. Paul and H. Zhang. Caching techniques for streaming multimedia over the internet. Bell Laboratories Technical Memorandum, May 1999.
D. Hochbaum. Various notions of approximations: Good, better, best, and more. In Approximation Algorithms for NP-Hard Problems, D. Hochbaum, Ed. PWS Publishing Company, 1995.
D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 654–663, 1997.
B. Li, M. Golin, G. Italiano, X. Deng and K. Sohraby. On the optimal placement of web proxies in the internet. Proceedings of INFOCOM’ 99, 1282–1290, 1999.
L. McGeoch and D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816–825, 1991.
G. Plaxton and R. Rajaraman. Fast fault-tolerant concurrent access to shared objects. Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 570–579, 1996.
S. Sen, J. Rexford and D. Towsley. Proxy prefix caching for multimedia streams. Proceedings of INFOCOM’ 99, 1310–1319, 1999.
D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62:461–474, 1993.
D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202–208, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andrews, M., Munagala, K. (2000). Online Algorithms for Caching Multimedia Streams. In: Paterson, M.S. (eds) Algorithms - ESA 2000. ESA 2000. Lecture Notes in Computer Science, vol 1879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45253-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-45253-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41004-1
Online ISBN: 978-3-540-45253-9
eBook Packages: Springer Book Archive