Online Algorithms for Caching Multimedia Streams

Authors:
Matthew Andrews;Kameshwar Munagala
Affiliations:
-;-
Venue:
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Year:
2000

Citing 9
Cited 2

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive paging algorithms

Journal of Algorithms
An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
Various notions of approximations: good, better, best, and more

Approximation algorithms for NP-hard problems
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Page replacement for general caching problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A generalized interval caching policy for mixed interactive and long video workloads

Readings in multimedia computing and networking
Fast fault-tolerant concurrent access to shared objects

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A study of replacement algorithms for a virtual-storage computer

IBM Systems Journal

ABM: Looping Reference-Aware Cache Management Scheme for Media-on-Demand Server

EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Efficient cache management for qos adaptive multimedia streaming services

PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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, andp resent near-optimal on-line algorithms for determining which parts of the streams should be cachedat 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.