Consider the figure below. Similar to our discussion of Figure 9.1. Suppose that video is encoded at a fixed bit rate, and thus each video block contains video frames that are to be played out over the same fixed amount of time, ˆ†. The server transmits the first video block at t₀, the second block at t₀+ ˆ†, the third block at t₀+ 2ˆ†, and so on. Once the client begins play out, each block should be played out ˆ† time units after the previous block.

a. Suppose that the client begins play out as soon as the first block arrives at t₁. In the figure below, how many blocks of video (including the first block) will have arrived at the client in time for their play out? Explain how you arrived at your answer.

b. Suppose that the client begins play out now at t₁ + ˆ†. How many blocks of video (including the first block) will have arrived at the client in time for their play out? Explain how you arrived at your answer.

c. In the same scenario at (h) above, what is the largest number of blocks that is ever stored in the client buffer, awaiting play out? Explain how you arrived at your answer.

d. What is the smallest play out delay at the client, such that every video block has arrived in time for its play out? Explain how you arrived at your answer.

Figure 9.1

Transcribed Image Text:

Constant bit rate video transmission by servek- Video reception at client 8- 6- 5- ΙΔΙΔΙΔΙΔΙΔΙΔΙΔΙΔΙΔΙ t1 to i Time Video block number 12 Constant bit 11 rate video 10 transmission Video by server- reception at client- Constant bit rate video playout by client Variable -network- Client -playout- delay delay to to+24 to+A t1 t2 t3 Time t,+A t3+A Video block number