EE132B-HW Set #4

UCLA 2014 Fall

Prof. Izhak Rubin

Problem 1
Consider an ARQ stop-and-wait scheme between stations A and B.
(a) If station A intends to transmit a single data frame, what is the average number
of retransmissions required for the successful transport of data frames? (Hint:
Let p denote the probability that the transmit frame is received with error.
Express the average number of retransmissions in terms of p.)
(b) If station a intends to transmit M data-frames, where M 2, what is the
probability that the number of retransmissions NR (M) is equal to 2? (Hint:
Express the probability in terms of M and p.)

Problem 2
Consider an ARQ stop-and-wait scheme which is similar to the scheme described
in Problem 1 but a distinct feature: suppose that an acknowledgement can be lost
during its transmissions with probability q. If an acknowledgement is lost, station A
will retransmit the data-frame after time-out. Such retransmission process continues
until station A receives an acknowledgement.
(a) If station A intends to transmit a single data frame, what is the average number
of retransmissions required for the successful delivery of data frames? (Hint:
Express the average number of retransmissions in terms of p and q.)
(b) Find the probability that station A retransmits exactly twice. (Hint: express
the probability in terms of p and q. You do not need to simplify your answer.)

Problem 3
Let T and S denote two independent exponentially distributed random variables
with parameter T and S , respectively.
(a) Show that the random variable T is memoryless (i.e., P (T t | T > s) =
P (T t s), t s 0).
(b) Set Y = min{T, S}. Show that the random variable Y is exponentially distributed, and find its parameter.
(c) Let X denotes a Poisson random variable with parameter T , where T is an exponentially distributed random variable with parameter T . Find the distribution
for X (i.e., P (X = n), for n = 0, 1, . . . ).

Problem 4
Figure ?? illustrates the first two messages exchanged in the course of a telephone
call from user A to user B. extend this diagram to include the following messages (with
1

EE132B-HW Set #4

UCLA 2014 Fall

Prof. Izhak Rubin

first two already illustrated: A Off-Hook; Dial Tone to A; Dialed digits from A; Called
Request signals; Call Accept signal; Conversation with B answering, A responding,
and one more response from B; B On-Hook, Disconnect signals (originating from
location of first user to hang up); and finally A On-hook. (This is an arbitrary choice
of the order of actions during disconnect; for example, either user could equally well
hang up first.)
Local Loop
User A

Telephone network

Network interface

Local loop

Network interface

User B

Off-hook signal

Dial tone

Dialed digits

Figure 1: The first two messages exchanged in the course of a telephone call from
user A to user B

Problem 5
Compare virtual circuit and datagram service with respect to the following:
(a) Ability to survive link or node failure.
(b) Ability to deal with congestion in the network.
(c) Applicability for use with the following types of traffic: (i) voice, (ii) interactive
data traffic, and (iii) file transfer.

Problem 6
(a) Compute the total delays to transfer a message 10000 (eight bit) characters long
across the three hop communications path under the following timing assumptions. Assume that all links operate at 4800 bps, with a 20 msec delay per link
for propagation delays plus reaction time at the receiver. (Timings given are
typical, though they are so highly variable that results of this problem should
be treated with caution.)

EE132B-HW Set #4

UCLA 2014 Fall

Prof. Izhak Rubin

(i) For circuit switching assume 3 sec per link connection delay (time hunting
for an outgoing trunk, or dialing and associated delays) and 100 msec
durations of call request or accept signal (times to put signals on the
communications lines, for example, number of bits divided by line rate
in bps).
(ii) For message switching, assume 50 bytes per message of header (routing
information, identification, sequencing information, and so forth) and (arbitrarily) 300 msec processing plus queuing time at each node.
(iii) for packet switching, assume the message is divided into 20 equal length
packets with 50 bytes of header information per packet, 300 msec processing plus queuing time at each node and 20 msec between packets.
(c) Discussing your results and indicate reasonable conditions under which the relative rankings of the delays might change.