Online algorithms for caching multimedia streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1879, Issue , 2000, Pages 64-75

  Andrews, Matthew ^a   Munagala, Kamesh ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MISS; CONNECTION-COSTS; DYNAMIC CACHING; MULTIMEDIA STREAM; NEAR-OPTIMAL; ON-LINE ALGORITHMS; PERFORMANCE METRICES; SINGLE SERVER; CACHE SIZE;

MEDIA STREAMING; ALGORITHMS;

MEDIA STREAMING;

EID: 84927136342     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_7     Document Type: Article

References (13)

1. 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.
2. L. Belady. A study of replacement algorithms for virtual storage computers. IBM System Journal, 5:78-101, 1966.
3. A. Dan and D. Sitaram. A generalized interval caching policy for mixed interactive and long video environments. Multimedia Computing and Networking, January 1996.
4. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator and N. Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991.
5. 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, 1999.
6. 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.
7. 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.
8. 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.
9. L. McGeoch and D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816-825, 1991.
10. 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.
11. S. Sen, J. Rexford and D. Towsley. Proxy prefix caching for multimedia streams. Proceedings of INFOCOM ’99, 1310-1319, 1999.
12. D. Shmoys and ´E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62:461-474, 1993.
13. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985.