neymore secret
neymore secret
• Round-Trip Time (RTT): Time to send a packet to the receiver and get
the ACK back.
Q.1 find out window size and minimum sequence number in sliding
window protocol if transmission delay is 1 ms, propagation delay is
24.5 ms. (AKTU 2021-22)
Solution: Given,
• You send 1 packet, wait ~49 ms (RTT), then send the next one.
• If each packet takes only 1 ms to transmit, the line is idle for most of the time
→ low efficiency.
In Sliding Window:
• You can send multiple packets in a row (up to window size W) before
stopping to wait for ACKs.
W=RTT / Ttx
W =49 / 1
W =49 packets
So, to fully utilize the link and not leave it idle, you need a window size
of at least 49 packets.
For Sequence number:
1. Go-Back-N Protocol:
N ≥ W= 49
• Receiver accepts out-of-order packets, stores them until missing ones arrive.
• To avoid confusion between old and new packets (wrapping around), it needs:
W ≤ N/2 ⇒ N≥2W = 98
Final answer:
• Minimum Window Size (W) = 49 packets
Solution:
• In this protocol, the sender sends one frame and waits for an
acknowledgment before sending the next. So, the total cycle time is:
η ≥ 0.5
Ttx
≥ 0.5
Ttx + 2 ∗ Tprop
⇒ Ttx ≥ 0.5(Ttx+ 2 * Tprop)
⇒ Ttx ≥ 0.5 Ttx+ Tprop
⇒ 0.5 Ttx ≥ Tprop
⇒ Ttx ≥ 2 * Tprop
Ttx ≥ 2 * Tprop
Q.3 a channel has a bit rate of 20kbps. the stop and wait protocol with frame
size 4500 bits is used. the delay for error detection and sending ACK by the
receiver is 0.25 seconds because of a fault. find the maximum efficiency of the
channel if the destination is 30000 km away and the speed of propagation of
the signal is 2.8 x 108 m/s. find the decrease in efficiency due to the fault.
(AKTU 2018-19)
Solution: Given,
• Propagation Delay: