Computing rate-distortion optimized policies for streaming media with rich acknowledgments

Jacob Chakareski, Bernd Girod

Research output: Contribution to journalConference articlepeer-review

13 Scopus citations


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, the client periodically sends to the server a single acknowledgment packet, denoted rich acknowledgment, that contains information about all media packets that have arrived at the client by the time the rich acknowledgment is sent. Computing the optimal transmission policy for the server involves estimation of the probability that a single packet will be communicated in error as a function of the expected redundancy (or cost) used to communicate the packet. In this paper, we show how to compute this error-cost function, and thereby optimize the server's transmission policy, in this scenario.

Original languageEnglish (US)
Pages (from-to)202-211
Number of pages10
JournalData Compression Conference Proceedings
StatePublished - 2004
Externally publishedYes
EventProceedings - DCC 2004 Data Compression Conference - Snowbird, UT., United States
Duration: Mar 23 2004Mar 25 2004

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications


Dive into the research topics of 'Computing rate-distortion optimized policies for streaming media with rich acknowledgments'. Together they form a unique fingerprint.

Cite this