EE132B-HW Set #5

UCLA 2014 Fall

Prof. Izhak Rubin

Problem 1
Consider a selective-repeat ARQ in which the window size N is equal to 4 (i.e.,
the time out duration allows the transmission of four data frames, including itself).
Assume that the originating node wishes to transmit 10 data frames which are labeled
D1 , D2 , . . . , D10 . In this particular session, frames D3 , D4 , D8 , D10 are retransmitted
once, while Frame D2 is retransmitted three times. Other frames do not require
retransmission. Draw a simple time diagram demonstrating the correct sequence of
events, identifying the timeout threshold used.

Problem 2
In a sequence of frame transmissions, data frame D0 has just been positively acknowledged. Four more frames - D1 , D2 , D3 , and D4 - are transmitted. The next
returned transmission, received after D4 has been transmitted, is a negative acknowledgement to D2 . Assume that this implicitly acknowledges any previously transmitted
but unacknowledged data frames.
(a) What action does a go-back-N protocol take?
(b) What action does a selective-repeat-N protocol take?

Problem 3
Compute the throughput rate attained across a communications link when using
a stop-and-wait ARQ scheme assuming the following parameters: a 64 kbps link, all
characters are eight bits long, 200 data characters per frame, six characters for data
frame headers and for acknowledgement frames, 10 msec (one way) propagation time
and 20 msec turn-around time, and a bit error rate of 104 .

Problem 4
A 1 MByte file is to be transmitted over a 1 Mbps communication line that has a
bit error rate of p = 106 .
(a) What is the probability that the entire file is transmitted without errors? Note:
For n large and p very small, we have: (1 p)n enp .
(b) The file is broken up into N equal-sized blocks that are transmitted separately.
What is the probability that all the blocks arrive without error? Was it useful
to divide the file into blocks?
(c) Suppose that the propagation delay is negligible and the ACK packet size is
negligible. Explain how the stop-and-wait ARQ scheme can help deliver the file
in an error-free form. On the average, how long does it take to deliver the file
if the whole file is transmitted once and the ARQ scheme causes the entire file
to be retransmitted if there is error?
1

EE132B-HW Set #5

UCLA 2014 Fall

Prof. Izhak Rubin

(d) Now consider breaking up the file into N blocks. (Neglect the overhead for the
header and CRC bits.) On the average how long does it take to deliver the
file if the ARQ transmits the blocks one at a time? Evaluate your answer for
N = 80, 800, and 8000.
(e) Explain qualitatively to the impact on the answer to part (d) when frame overhead is taken into account.

Problem 5
Use Dijkstras algorithm, showing all steps, to derive the shortest path tree rooted
at node A for the network graph with indicated link weights as shown in Figure. 1.

12

E
3

Figure 1: The network graph with indicated link weights