Tutorial 1 Answers
Tutorial 1 Answers
Tutorial 1
Problems
1. What are two reasons for using layered protocols? What is one possible disadvantage of
using layered protocols? [1, prob. 10]
One advantage with protocol layering is that it allows protocol designers break up each
layer into smaller manageable pieces so that they can focus on each layer
independently.
Another advantage of protocol layering is that any layer can be easily replaced with a
different implementation due to the separation of responsibilities of each layer.
A disadvantage is that each layer potentially imposes overhead both in terms of
processing time and control information stored in protocol headers.
2. Which of the layers in the reference model reviewed in lecture handles each of the
following:
a. Dividing the transmitted bit stream into frames.
Data Link Layer
b. Determining which route through the subnet to use. [1, prob. 16]
Network Layer
3. Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the
two hosts are separated by m meters, and suppose the propagation speed along the link
is s meters/sec. Host A is to send a packet of size L bits to Host B.
a. Express the propagation delay, dprop, in terms of m and s.
dprop = m/s seconds
c. Ignoring processing and queuing delays, obtain an expression for the end-to-end
delay.
dend-to-end = dprop + dtrans = (m/s + L/R) seconds
d. Suppose Host A begins to transmit the packet at time t = 0. At time t= dtrans , where is
the last bit of the packet?
The bit is just leaving host A.
e. Suppose dprop is greater than dtrans . At time t= dtrans , where is the first bit of the
packet?
The first bit is in the link and has not reached host B.
f. Suppose dprop is less than dtrans. At time t= dtrans , where is the first bit of the packet?
The first bit has reached host B.
g. Suppose s = 2.5 × 108, L=120 bits, and R=56 kbps. Find the distance m so that dprop
equals dtrans .
𝐿 120
m = 𝑅 𝑠𝑠 = 56 × 103 (2.5 × 108 ) = 536 𝑘𝑚
4. Consider a packet of length L which begins at end system A and travels over three links
to a destination end system. These three links are connected by two packet switches.
Let di, si, and Ri denote the length, propagation speed, and transmission rate of link i,
for i=1, 2, 3. The packet switch delays each packet by dproc. Assuming no queuing delays,
in terms of di, si, Ri, (i=1, 2, 3), and L, what is the total end-to-end delay for the packet?
Suppose now the packet is 1,500 bytes the propagation speed on all three links is 𝑠𝑠 =
2.5 × 108 m/s, the transmission rates of all three links are 2 Mbps, the packet switch
processing delay is 3 msec, the length of the first link is 5,000 km, the length of the
second link is 4,000 km, and the length of the last link is 1,000 km. For these values,
what is the end-to-end delay?
𝐿 𝐿 1 2𝐿 3 𝑑 𝑑 𝑑
= 𝑅 + 𝑅 + 𝑅 + 𝑠 + 𝑠 + 𝑠 + 2(𝑑𝑝𝑟𝑜𝑐 )
1 2 3 1 2 3
5. Suppose two hosts, A and B, are separated by 20,000 km and are connected by a direct
link of R=2 Mbps. Suppose the propagation speed over the link is 2.5 × 108 m/s.
a. Calculate the bandwidth-delay product, R∙dprop.
m
R x dprop = R ×
s
= 2 × 10 ×
6 20,000 ×1000m
2 .5 ×108
= 160,000 bits
b. Consider sending a file of 800,000 bits from Host A to Host B. Suppose the file is
sent continuously as one large message. What is the maximum number of bits that
will be in the link at any given time?
The link can only carry a maximum of 160,000 bits at any given time.
c. Provide an interpretation of the bandwidth-delay product.
The Bandwidth-delay product is the max number of bits that can be in the link at any
time.
d. What is the width (in meters) of a bit in the link? Is it longer than a football field
(100 m)?
𝐿𝑒𝑛𝑔𝑡ℎ 𝑜𝑓 𝑙𝑖𝑛𝑘
Width =
𝐵𝑎𝑛𝑑𝑤𝑖𝑑𝑡ℎ 𝐷𝑒𝑙𝑎𝑦 𝑃𝑟𝑜𝑑𝑢𝑐𝑡
20,000 ×1000𝑚
=
160,000 𝑏𝑖𝑡𝑠
e. Derive a general expression for the width of a bit in terms of the propagation speed
s, the transmission rate R, and the length of the link m.
𝐿𝑒𝑛𝑔𝑡ℎ 𝑜𝑓 𝑙𝑖𝑛𝑘
Width =
𝐵𝑎𝑛𝑑𝑤𝑖𝑑𝑡ℎ 𝐷𝑒𝑙𝑎𝑦 𝑃𝑟𝑜𝑑𝑢𝑐𝑡
𝑚
=𝑅×𝑑
𝑝𝑟𝑜𝑝
𝑚1
= 𝑚1 �𝑠
𝑅×
𝑠
=𝑅