Scribd
Upload
7 views

Quiz 1

The document contains three questions regarding communication networks. Question 1 has three parts regarding end-to-end delay calculations for different routing and queuing scenarios. Question 2 has two parts regarding sequence number ranges and incorrect operation for Go-Back-N and Selective Repeat protocols. Question 3 asks to calculate average long-term throughput for a file transfer using Go-Back-N over a lossy link.

Uploaded by

fun world
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
7 views

Quiz 1

The document contains three questions regarding communication networks. Question 1 has three parts regarding end-to-end delay calculations for different routing and queuing scenarios. Question 2 has two parts regarding sequence number ranges and incorrect operation for Go-Back-N and Selective Repeat protocols. Question 3 asks to calculate average long-term throughput for a file transfer using Go-Back-N over a lossy link.

Uploaded by

fun world
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
You are on page 1/ 2

1

Quiz 1
Communication Networks (EE 706), Spring’23
Feb. 2, 2023; Total: 10 marks; Time: 50 minutes
Note:
• You are allowed to use any result discussed in class without proof. For all other results, a
proof needs to be provided.
• You are allowed to use one A4 sheet with handwritten notes on both sides.

Q UESTION 1 (1 + 1.5 + 1.5 = 4 MARKS )

(a) Consider two end systems– a sender and a receiver– connected via three intermediate routers.
Each router uses store-and-forward routing. The rate of each of the four links on the sender-
to-receiver path is 1 Gbps. Each link has a propagation delay of 10 µs. Processing times
are negligible at all nodes and there are no queuing delays. Find the end-to-end delay of a
single packet of size 5000 bits.
(b) Redo part (a) with the change that each router uses cut-through routing: it begins transmitting
the packet on the outgoing link after the first 128 bits have been received on the incoming
link.
(c) Redo parts (a) and (b) with the change that at the instant the sending end system starts the
packet transmission, the transmission of a packet of size 50000 bits starts on the fourth link
on the sender-to-receiver path.

Q UESTION 2 (1 + 1 = 2 MARKS )

For both parts, assume that data packets or ACKs may be delayed by arbitrary amounts,
corrupted or lost, but not re-ordered. The two parts are independent of each other.
(a) Consider a sender-receiver pair that uses Go-Back-N with window size 5 and an infi-
nite sequence number space. Suppose that when the receiver’s expected sequence number
(expectednum) is 30, it receives a data packet from the sender. Find the minimum and
maximum possible values of the sequence number field in this packet. Justify your answer.
2

(b) Consider the Selective Repeat protocol with the change that the receiver does not send an
ACK packet for data packets with sequence numbers that are not in the receiver’s window.
Give an example of incorrect operation.

Q UESTION 3 (4 MARKS )

Consider a sender-receiver pair connected by a dedicated bidirectional link with bandwidth


R bps in each direction. The one-way propagation delay is tprop . Assume that data packets or
ACKs are not lost and that ACKs are not corrupted. Suppose each data packet is independently
corrupted with probability Pf . The length of each data packet is L bits and the lengths of ACKs
are negligible. A large file is transferred from the sender to the receiver using Go-Back-N with
2Rtprop
window size N = 3. Assume that L
+ 1 > 3 (thus, the sender can get blocked). Find the
average long-term throughput.

You might also like