# key3 - 3. (Jason) The probability that contention ends on...

This preview shows page 1. Sign up to view the full content.

Distributed Multimedia Systems Assignment 3 Sample Solutions 1. (Jason) MPEG 2 Trace file for the movie terminator 2 can be found at http://trace.eas.asu.edu/mpeg2/single/T2720_G12B2ffmp/ Details of the max/min/avg sizes of the I/P/B frame can be found here (QP=20): http://trace.eas.asu.edu/mpeg2/single/T2720_G12B2ffmp/T2720_G12B2ffmp20/ ps: Here is a tool to generate trace file: http://gridnet.upc.es/~maguilar/ns2_code_victor/ns2tutorial/node4.html 2. (Yan) You should give the major three algorithmic parts of wavelet-based compression, the three concepts that prevent a straightforward and cost-effective hardware implementation, and the system that the author raised in this paper (brief details about the two optimizations) Use your own word to clarify the new system.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3. (Jason) The probability that contention ends on round k is ) 2 1 1 ( ) 2 / 1 ( 1 1 1 1 k k i i k P If follows that the mean number of rounds per contention period is approximately 1 k k P k . 4. (Yan) http://en.wikipedia.org/wiki/IEEE_802.11 Wiki give good analysis of 802.11a,802.11b,802.11c’s features. 802.11 use the exponential backoff algorithm(Your answer should be complete) • If due to timeout, double contention window (CW) • Else wait until channel is idle plus an additional DIFS • Choose random waiting time between [1 , CW] CW is in units of slot time. And cw cannot exceed maximal units of slot time(default) • Decrement CW when channel is idle • Return when CW = 0...
View Full Document

## This note was uploaded on 11/30/2011 for the course CIS 6930 taught by Professor Staff during the Fall '08 term at University of Florida.

Ask a homework question - tutors are online