where W1 is the set of frames that require data unit l for formation. In addition, because rich acknowledgment decoding, i is the frame index, and ti is the decoding packets also provide NACKs, there is less ambiguity for deadline for frame i. The quantity E(H), ti) is the proba- the server to resolve. In the case of conventional feed- bility that data unit l does not arrive by deadline ti. As back, a nonacknowledged transmission may be due to before, p(1) is the expected number of times data unit l a lost media packet or to a lost acknowledgment packet. is transmitted under policy TT. In (3.5.5) the quantity Vti, given Vti = AB1' S1,ti by is anal- logous to the reciprocal of X' in (3.5.4). Note that the 3.5.4 Multiple deadlines sensitivity term S1.t is also indexed by the deadline. It is the sensitivity of the overall distortion to the arrival of In the RaDiO framework described in Section 3.5.2, ADI data unit l by deadline ti. is the expected distortion reduction if data unit l is Figure 3.5-7 shows performance gains due to the decodable by its deadline. It was assumed that a data multiple deadline formulation in the case when ARD unit l must arrive by its specific deadline in order for its is implemented in a streaming video client. PSNR- distortion reduction ADI to be realized and in order for versus-rate results are shown for the Foreman sequence data units dependent on l to be decoded. Late data units streamed in a low-latency application in which the preroll are discarded. Often, however, a data unit arriving after delay is 100 ms. In the simulation experiments, frames of its deadline is still useful for decoding. video were due for decoding 100 ms after they became As an example, consider the case of bidirectional available for transmission at the server. The packet loss prediction with a sequence of frames I-B-B-B-P. In the rate was 20% in both directions, and delays for packets RaDiO framework, the deadline for the P-frame would not lost were independent, identically distributed (iid) be determined by t