CEG5101

Modern Computer Networking

TUTORIAL 1: PROBLEMS &

SOLUTIONS
Lecturer: Assoc. Prof. Mohan
Gurusamy
CEG5101 Tut 1 G.Mohan / NUS 1
Problem 1
 Problem:

It is desired to stream an uncompressed video at full
HD (high definition) resolution 1920×1080 pixels with
30 fps (frames per second). How much bandwidth
(data rate) is required for this purpose?
 Solution:

Generally, a pixel (picture element) is a mix of three
colors (red, green, blue) with each color represented
in the range [0..255]. Thus, we need 3×8=24 bits to
represent a pixel.

Therefore, bandwidth required = 1920×1080×24×30
= 1.49 Gbps

CEG5101 Tut 1 G.Mohan / NUS 2

Problem 2
 Problem:

Suppose a 100 Mbps link is being set up between
the earth and a new lunar colony. The distance from
the moon to the earth is approximately 385,000 km,
and data travels over the link at the speed of light
(3108 m/s). A camera on the lunar base takes
pictures of the earth and saves them in digital
format to disk. Suppose Mission Control on earth
wishes to download the most current image, which
is 25 MB. What is the minimum amount of time that
will elapse between when the request for the data
goes out and the transfer is finished? Determine the
effective throughput for the above case.
CEG5101 Tut 1 G.Mohan / NUS 3
Problem 2 (contd.)
 Solution:

Transmission time = 25 MB / 100 Mbps = 2.097 s

Propagation time from the earth to lunar base
= 385,000 km / (3108 m/s) = 1.283 seconds

RTT = 21.283 = 2.566 seconds.

The transfer time includes the propagation time for the
request to go from the earth to lunar base, image
transmission time, and propagation time from the lunar
base to the earth. Therefore, the transfer requires 1
RTT plus transmission time = 2.566+2.097 = 4.663
seconds.

Effective Throughput = (Message size / Message
transfer time) = 25 MB/ 4.663 = 44.974 Mbps
CEG5101 Tut 1 G.Mohan / NUS 4
Problem 3
 Problem:
 How many 10-Mbps inputs can be multiplexed onto
an 100-Mbps output in cases (i) fixed TDM and (ii)
statistical TDM?

 Solution:

Fixed TDM: At most ten 10-Mbps inputs can be
multiplexed onto an 100-Mbps output


Statistical TDM: There is no limit on the number of
10-Mbps inputs that can be multiplexed onto an
100-Mbps output. It depends on how active the
inputs are and how much buffer is available to
queue the excess traffic when the sum of the input
data rates exceeds the output data rate.
CEG5101 Tut 1 G.Mohan / NUS 5
Problem 4
 Problem:
 A 20km long link is able to hold only 100 bits in
one direction. What is the bandwidth of the link?
Assume that the propagation speed on the link is
2108m/s.
 Solution:
 Number of bits that can be held = (propagation)
delay  bandwidth
 Therefore, bandwidth = (No of bits held on the
link / propagation time) = 100 / (20000/[2108]) =
1 Mbps

CEG5101 Tut 1 G.Mohan / NUS 6

Problem 5
 Problem:
 A disadvantage of a broadcast network is
that the capacity is wasted due to multiple
hosts attempting to access the channel at
the same time. As a simplistic example,
suppose that time is divided into discrete
slots, with each of the n hosts attempting
to use the channel with probability p during
each slot. What fraction of the slots is
wasted due to collisions only?
CEG5101 Tut 1 G.Mohan / NUS 7
Problem 5 (contd.)
 Solution:
 Binomial probability B(n,r): probability of exactly r
successes on n trails (with p the success probability on a
trial)

B(n,r) = nCr pr (1-p)n-r
 p = probability that a host attempts to use the channel in a slot

q0 = probability that no host attempts to use the channel in a slot
= B(n,0)

q1 = probability that exactly one host attempts to use the
channel in a slot = B(n,1)
 q = probability for collision occurrence in a slot
 Collision occurs when two or more hosts attempt to use the
channel during a slot. Therefore, q = B(n,2)+B(n,3)+…+B(n,n)
q = 1 – [ q 0 + q1 ]
= 1 – [ (1-p)n + n  p  (1-p)n-1 ]

CEG5101 Tut 1 G.Mohan / NUS 8

Problem 6
 Calculate the total time required to transfer a
1000 KB file in the following cases, assuming
an RTT of 100 ms, a packet size of 1 KB of data,
and an initial 2×RTT of “handshaking” before
data is sent.


(a) The bandwidth is 1.5 Mbps, and data packets
can be sent continuously.


(b) The bandwidth is 1.5 Mbps, but after we finish
sending each data packet we must wait one RTT
before sending the next.
CEG5101 Tut 1 G.Mohan / NUS 9
Problem 6 (Contd.) Tt

 Number of packets = 1000, RTT = 100 ms

 Packet transmission time Tt = 1KB/1.5 Mbps = 5.461 ms
 (a) Total time (T) required is initial RTTs plus transmission
time of 1000 packets plus propagation time (for 1000th
packet) from sender to receiver plus propagation time from
receiver to sender (for acknowledgement). Therefore, T = 2
RTT+ 10005.461 ms + RTT = 5.761 seconds.
 2RTT+Tt +Tt + Tt +…+Tt+ RTT

CEG5101 Tut 1 G.Mohan / NUS 10

Problem 6 (Contd.)
 (b) T = 2 RTTs + 1000  packet
transmission time + 1000 RTTs
= (2  100)+(1000  5.461)+(1000  100) ms
= 105.661 seconds.
 2RTT+Tt +RTT+Tt +RTT+…+Tt+ RTT

CEG5101 Tut 1 G.Mohan / NUS 11

Problem 7
 Problem: Calculate the latency (from first bit sent to
last bit received) for the following:
a) A packet of 5000 bits is sent over a 10 Mbps Ethernet
from node A to node B through four store-and-forward
switches in the path as shown in the following figure.
Assume that each link introduces a propagation delay of
10 s, and that the switch begins retransmitting
immediately after it has finished receiving the packet.
 Solution:

Packet transmission time Tt = 5000bits/10Mbps = 500
s.

Propagation delay on one link Tp = 10 s.

The packet traverses 5 links. It needs to be transmitted
at 5 nodes (1 source and 4 switches). Therefore, latency
= 510 + 5500 s = 2.55 ms.
Tt Tt Tt Tt Tt
A S1 S2 S3 S4 B

Tp Tp Tp Tp Tp
CEG5101 Tut 1 G.Mohan / NUS 12
Problem 7 (contd.)

Problem: Calculate the latency (from first bit sent to last bit
received) for the following:
b) Same as (a), but 5000 bits are sent in 5 packets each
carrying 1000 bits. The packets are transmitted
continuously with no time gap between two consecutive
packet transmissions.
 Solution:
 Packet transmission time Tt = 1000bits/10Mbps = 100 s.
 Propagation delay on one link Tp = 10 s.
 Node A completes transmission of last packet at 5100 =
500s. The last packet needs to transmitted at each of the
4 switches. This packet experiences propagation delay at
each of the 5 links.

5Tt latency
Therefore, Tt = 500Tt+ 4100
Tt+ 510 s
Tt= 950 s
A S1 S2 S3 S4 B
Tp Tp Tp Tp Tp
CEG5101 Tut 1 G.Mohan / NUS 13
Problem 7 (contd.)
 Problem: Calculate the latency (from first bit sent
to last bit received) for the following:
c) Same as (a), but assume that each switch
implements “cut-through” switching: It is able to
begin retransmitting the packet immediately after
receiving the first 200 bits.
 Solution:

The packet is delayed for a period of “packet
transmission” time (Tt=500 s) at the source A and is
delayed for a period of 200 bits time at each of the 4
switches. The packet experiences propagation delay (Tp
= 10 s) at each of the five links.

200 bit delay (T200) = 200bits/10Mbps = 20 s
 Tt = 500 T+200420T+
latency 200510 T 200= 630Ts
s 200
A S1 S2 S3 S4 B
Tp Tp Tp Tp Tp
CEG5101 Tut 1 G.Mohan / NUS 14