Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Online Algorithms for Caching Multimedia Streams Matthew Andrews Kamesh Munagala y
 

Summary: Online Algorithms for Caching Multimedia Streams
Matthew Andrews  Kamesh Munagala y
May 13, 2000
Abstract
We consider the problem of caching multimedia streams in the internet. We use the dynamic
caching framework of Dan et al. [3] and Hofmann et al. [5]. We de ne 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 di erent 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 are able to increase the cache sizes by an O(K) factor. Here K is the
number of caches in the network.
 Bell Laboratories, Murray Hill NJ 07974. Email: andrews@research.bell-labs.com.
y Computer Science Department, Stanford University, Stanford CA94305. Email: kamesh@cs.stanford.edu. Sup-
ported by ONR N00014-98-1-0589. Part of this work was done while the author was visiting Bell Labs.

1 Introduction
In the classical caching problem, requests are made on-line for pages. There is a cache that can
hold a small number of pages. Whenever a request is made for a page we have a cache hit if that

  

Source: Andrews, Matthew - Mathematics of Networks and Systems, Mathematical Sciences Research Center, Bell Laboratories

 

Collections: Mathematics; Computer Technologies and Information Sciences