Computing Rate-Distortion Optimized Policies for Streaming Media with Rich Acknowledgments

  • Authors:
  • Jacob Chakareski;Bernd Girod

  • 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 optimized streaming of packetized media over the Internet from a server to a client using rich acknowledgments. Instead of separately acknowledging each media packet as it arrives, theclient periodically sends to the server a single acknowledgment packet, denotedrich acknowledgment, that contains information about all media packets thathave arrived at the client by the time the rich acknowledgment is sent. Computing the optimal transmission policy for the server involves estimation of theprobability that a single packet will be communicated in error as a functionof the expected redundancy (or cost) used to communicate the packet. In thispaper, we show how to compute this error-cost function, and thereby optimizethe server's transmission policy, in this scenario.