Scribd
Upload
5 views4 pages

Tutorial 3

The document outlines a tutorial for ECE F343 focusing on communication networks, specifically addressing packet transmission delays and queuing delays. It includes two main questions that require calculations related to the timing of packet arrivals and the average queuing delay for multiple packets. The tutorial emphasizes understanding the movement of packet bits through the network and the implications of simultaneous packet arrivals on queuing delays.

Uploaded by

Siddharth Sangai
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views4 pages

Tutorial 3

The document outlines a tutorial for ECE F343 focusing on communication networks, specifically addressing packet transmission delays and queuing delays. It includes two main questions that require calculations related to the timing of packet arrivals and the average queuing delay for multiple packets. The tutorial emphasizes understanding the movement of packet bits through the network and the implications of simultaneous packet arrivals on queuing delays.

Uploaded by

Siddharth Sangai
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

ECE F343 – Communication

Networks
Tutorial 3
• Q1. Consider the network topology shown below. Assume that the
processing delay at all the nodes is negligible.

• The sender sends two 1000-byte data packets back-to-back with a


negligible inter-packet delay. The queue has no other packets. What is
the time delay between the arrival of the first bit of the second
packet and the first bit of the first packet at the receiver?
• Hints: Please trace the movement of the first and last bit of each
packet over each link and time involved in all these movements.
• Specifically, see if asking the following questions to yourself helps.
a. If the sender starts transmitting the first bit of the first packet at 𝑡 =
0, at what time the sender will transmit the first bit of the second
packet?
b. At what times the first and last bits of the first packet reach the
switch and the receiver?
c. At what times does the switch receive and transmit the first bit of
the second packet?
If your timeline is correct, so will be your answer..!!
• Q2. Solve the following questions on the queuing delay.
a. Suppose 𝑁 packets arrive simultaneously to a link at which no packets are
currently being transmitted or queued. Each packet is of length 𝐿 and the
link has transmission rate 𝑅. Calculate the average queuing delay for the 𝑁
packets.
Hint: 𝑁 packets arrive simultaneously to an empty queue. Think what should
be queuing delay of the first packet, second packet, and so on.
𝐿𝑁
b. Now suppose that 𝑁 such packets arrive to the link every seconds.
𝑅
Calculate the average queuing delay for a packet.
𝑁𝐿
Hint: A batch of 𝑁 packets arrive every seconds. Will the first packet of
𝑅 𝑡ℎ
any batch face a queuing delay from the 𝑁 packet of the previous batch?
𝑁−𝑘 𝐿
c. If the last batch of 𝑁 packets arrive after seconds after the previous
𝑅
batch, calculate the average queuing delay faced by the 𝑁 packets of the last
batch, where 0 ≤ 𝑘 ≤ 𝑁 − 1.

You might also like