On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media

  • Authors:
  • Martin Röder;Jean Cardinal;Raouf Hamzaoui

  • Affiliations:
  • -;-;-

  • Venue:
  • DCC '04 Proceedings of the Conference on Data Compression
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of rate-distortion optimal streaming of packetizedmedia with sender-driven transmission over a single-QoS network using feedback and retransmissions. For a single data unit, we prove that the problem isNP-hard and provide efficient branch and bound algorithms that are in practice much faster than the best known solution. For a group of interdependentdata units, we show how to compute optimal solutions with branch and boundalgorithms. The branch and bound algorithms for a group of data units areslower than the current state of the art, the heuristic sensitivity adaptation algorithm, but provide a significantly better rate-distortion performance in manyreal-world situations.