Streaming cache placement problems: complexity and algorithms

  • Authors:

  • Carlos A. S. Oliveira;Panos M. Pardalos;Oleg A. Prokopyev;Mauricio G. C. Resende

  • Affiliations:

  • 2 Research Way, Princeton Consultants, Princeton, NJ, 08540, USA.;Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA.;Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA.;Internet and Network Systems Research, AT&T Labs Research, 180 Park Avenue, Room C241, Florham Park, NJ 07932, USA

  • Venue:
  • International Journal of Computational Science and Engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multicast networks are used to distribute live content, such as video or audio streams, to a potentially large number of destinations. Streaming caches are deployed in these multicast systems to allow content distribution without network overload. We consider two related problems that arise in multicast networks: the tree cache placement and the flow cache placement problems. These problems are shown to be NP-hard, and we give a proof of hardness of approximation using a gap-preserving reduction. We also present approximation algorithms, as well as special cases where these problems can be solved in polynomial time.