计算机代考程序代写 1. Recall the simple model for HTTP streaming shown as follows. B denotes the size of the client’s application buffer, and Q denotes the number of bits that must be buffered before the client application begins playout. Suppose the buffer size is infinite but the server sends bits at variable rate x(t). Specifically, suppose x(t) has the following saw-tooth shape. The rate is initially zero at time t = 0 and linearly climbs to H at time t = T. It then repeats this pattern again and again, as shown in the figure below.

1. Recall the simple model for HTTP streaming shown as follows. B denotes the size of the client’s application buffer, and Q denotes the number of bits that must be buffered before the client application begins playout. Suppose the buffer size is infinite but the server sends bits at variable rate x(t). Specifically, suppose x(t) has the following saw-tooth shape. The rate is initially zero at time t = 0 and linearly climbs to H at time t = T. It then repeats this pattern again and again, as shown in the figure below.
(1). What is the server’s average send rate? H/2
(2). Now suppose Q > 0. Q 2r and Q = HT/2. Prove there will be no freezing after the initial playout delay. Start to play at T.
In [T, T+t], t