EE132B-Final Sample - Sol.

UCLA 2014 Fall

Prof. Izhak Rubin

Problem 1
(a) Use Dijkstras algorithm, showing all steps, to derive the shortest path tree
rooted at node 1 for the network graph with indicated link weights as shown
below.

12

Figure 1: The network graph with indicated link weights

(b) Assume each link to (independently) fail, over a specified period of time, with
probability 0.15. Calculate the probability that the shortest path from node 1
to node 6 stays intact over this period of time.
Ans:
(a)
Step 1:
P = {1}, T = {2, 3, 4, 5, 6}
d(1, 2) = 5
d(1, 3) = 3
d(1, 4) =
d(1, 5) =
d(1, 6) =
Step 2:
i=3
P = {1, 3}, T = {2, 4, 5, 6}
Step 3:
d(1, 2) = min{5, 3 + } = 5
d(1, 4) = min{, 3 + 7} = 10
d(1, 5) = min{, 3 + } =
1

EE132B-Final Sample - Sol. UCLA 2014 Fall

Prof. Izhak Rubin

d(1, 6) = min{, 3 + 12} = 15

Step 2:
i=2
P = {1, 2, 3}, T = {4, 5, 6}
Step 3:
d(1, 4) = min{10, 5 + 4} = 9
d(1, 5) = min{, 5 + 6} = 11
d(1, 6) = min{15, 5 + } = 15
Step 2:
i=4
P = {1, 2, 3, 4}, T = {5, 6}
Step 3:
d(1, 5) = min{11, 9 + 3} = 11
d(1, 6) = min{15, 9 + } = 15
Step 2:
i=5
P = {1, 2, 3, 4, 5}, T = {6}
Step 3:
d(1, 6) = min{15, 11 + 3} = 14
Step 2:
i=6
P = {1, 2, 3, 4, 5, 6}, T =
Nodes
2
3
4
5
6

Preceding node along the shortest path, Shortest distance

(1,5)
(1,3)
(2,9)
(2,11)
(5,14)

EE132B-Final Sample - Sol. UCLA 2014 Fall

Prof. Izhak Rubin

(b)
The shortest path from node 1 to node 6: 1 2 5 6. The probability that
the the path is intact over the period is given by
p = (1 0.15)3 = 0.6141.

(1)

Problem 2
Consider a communications link that employs two (time simultaneously used)
communications channels, Channel 1 and Channel 2, operating at data rate 10 Mbps
and 20 Mbps, respectively. The bit error rates measured across Channel 1 and Channel 2 are equal to 5 105 and 104 , respectively. Each message frame contains
4000 information bits and 400 overhead bits. A Select-and-Repeat ARQ error-control
scheme is employed.
(a) Calculate the maximum throughput rates realized across each channel and
across the link.
(b) For a randomly selected message (that is equally likely to use either channel),
calculate the average number of transmissions incurred until it is correctly received.
(c) Assume that resources are provided to enable the reduction of the bit error rate
of one of the channels by 50%. Determine which channel should be improved
and compute the percentage improvement in link maximum throughput level
that is then achieved.
Ans:
(a)
Under selective repeated ARQ scheme, the throughput rate is given by
=

[K n(h)] (1 PE )R
.
K

(2)

For channel 1, PE1 = 1 (1 5 105 )4400 = 0.1975. The throughput rate of channel
1 is given by
1 =

4000 (1 PE1 ) 10 106

7.3 Mbps.
4400

(3)

For channel 2, PE2 = 1 (1 104 )4400 = 0.3560. The throughput rate of channel
2 is given as
4000 (1 PE2 ) 20 106
11.71 Mbps.
4400
Thus, the throughput rate across the link is given by
2 =

link = 1 + 2 = 19.01 Mbps.

3

(4)

(5)

EE132B-Final Sample - Sol. UCLA 2014 Fall

Prof. Izhak Rubin

(b)

1
1
1
1
1
1
E[NT ] = E[NT1 ] + E[NT2 ] =
+
= 1.4.
2
2
2 1 PE1 2 1 PE2

(6)

(c)


By improving channel 1, we have PE0 1 = 1 1

improved throughput rate is given by
10 =

5105
2

4400

4000 (1 PE0 1 ) 10 106

8.144 Mbps.
4400

= 0.1042 and the

(7)

By improving channel 2, we have PE0 2 = 0.1975 and the improved throughput rate is
given by
20 14.591 Mbps. (better!)

(8)

Thus, the improved throughput rate across the link is given by

0
link
= 1 + 20 21.89 Mbps,

which is improved by 15.16%.

(9)

EE132B-Final Sample - Sol. UCLA 2014 Fall

Prof. Izhak Rubin

Problem 3
(a) Consider the following operation of a transport layer processor at a user terminal as it transmits messages across a TCP transport connection. Assume
messages directed by the application entity for transmission across this transport connection to arrive in accordance with a Poisson point process at a rate
of 420 Kbps. A message transmission time across the transport connection is
assumed to take random time and to follow an exponential distribution. On average, a message contains 6000 bits. Compute the minimum data rate required
for transmission across the connection to ensure the message total average delay
(in waiting and in transmission) to be no higher than 25 msec.
(b) For the system designed in (a), calculate the probability that a message will
have to wait in the FIFO queue for longer than 50 msec.
Ans:
(a)
This is M/M/1 queueing system. E[L] = 6000 bits, =
R
[msg/sec] and = 6000
[msg/sec]. As a result,
E[D] =

1
1
=
=
(1 )

R
6000

1
25 103 .
70

420 kbps
6000 bits/msg

= 70

(10)

Thus, R 660 bps.

(b)

P (W > 50 103 ) = 1 P (W 50 ms)



= 1 1 e(1)50ms
= 0.0861.

(11)

EE132B-Final Sample - Sol. UCLA 2014 Fall

Prof. Izhak Rubin

Problem 4
Consider an access system that connects user sessions to the Internet. The system
uses two outgoing communications lines to connect to the Internet; each line operates
at a data rate of 2 Mbps. Session connection requests arrive at the access system in
accordance with a Poisson process. The system provides for no queuing of requests
for session access. If both outgoing lines are busy, a session access request is blocked.
Once a session requested is granted, the session will occupy the assigned outgoing
line for a random period of time that is assumed to be exponentially distributed.
On the average, a user will transmit across the line an average of 6000 bits before
it terminates the session, freeing the line for use by a future arriving session. The
system designer aims to ensure that the blocking probability of session request is not
higher than 0.1 (so that no more than 10% of session requests are blocked). Calculate
the maximum session arrival rate that the designer should plan to support to assure
clients with his declared session blocking probability objective.
Ans:

R
= 333.33 [msg/sec], f = and = m
. As a
This is an M/M/2/2 QS. = 6000
result, we have
2

f
a2
2
PB = P (2) = P2
=
=
a
+
a
+
a
1+f +
0
1
2
i=0 ai

a2

f2
2

0.1.

(12)

Then, 0.45f 2 0.1f 0.1 0 f 0.5954 0.5954 = 198.46 [msg/sec].