0% found this document useful (0 votes)
10 views

neymore secret

The document discusses transmission delay, propagation delay, and round-trip time in the context of networking protocols. It provides calculations for window size and sequence numbers in sliding window protocols, as well as the relationship between transmission and propagation delays for achieving at least 50% efficiency in the Stop-and-Wait protocol. Additionally, it analyzes the maximum efficiency of a channel using Stop-and-Wait protocol with and without faults, highlighting a significant decrease in efficiency due to fault delays.

Uploaded by

soni232vipin
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
0% found this document useful (0 votes)
10 views

neymore secret

The document discusses transmission delay, propagation delay, and round-trip time in the context of networking protocols. It provides calculations for window size and sequence numbers in sliding window protocols, as well as the relationship between transmission and propagation delays for achieving at least 50% efficiency in the Stop-and-Wait protocol. Additionally, it analyzes the maximum efficiency of a channel using Stop-and-Wait protocol with and without faults, highlighting a significant decrease in efficiency due to fault delays.

Uploaded by

soni232vipin
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/ 11

• Transmission Delay (Ttx): Time taken to transmit (push) a packet onto

the network. Depends on the packet size and transmission rate


(bandwidth).
( )
Ttx =
h( )
• Propagation Delay (Tprop): Time taken for a signal to propagate from
sender to receiver through the medium.

• 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,

• Transmission Delay (Ttx) = 1 ms.

• Propagation Delay (Tprop) = 24.5 ms.

Calculate RTT as,

• Round-Trip Time (RTT) = 2 × Tprop= 2 × 24.5 = 49 ms.


In Stop-and-Wait:

• 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.

• This keeps the network busy and improves efficiency.


• If each packet takes 1 ms to transmit, in 49 ms (RTT), you could
transmit:

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:

• Only one timer; receiver only accepts in-order packets.

• Requires sequence numbers at least equal to the window size:

N ≥ W= 49

2. Selective Repeat Protocol:

• 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

• Minimum Sequence Numbers (N):


• Go-Back-N: N=49

• Selective Repeat: N=98


Q.2 Define the relationship between transmission delay and
propagation delay, if the efficiency is at least 50% in stop N wait
protocol. (AKTU 2021-22)

Solution:

• In this protocol, the sender sends one frame and waits for an
acknowledgment before sending the next. So, the total cycle time is:

Total cycle time = Ttx + 2 * Tprop

• Efficiency of Stop and Wait is:


Ttx
η=
Ttx + 2 ∗ Tprop
• We want efficiency η to be at least 0.5:

η ≥ 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

• To achieve at least 50% efficiency in Stop-and-Wait protocol:

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,

Frame size = 4500 bits, Propagation speed = 2.8 x 108 m/s

B.W. of channel = 20kbps, Channel length = 30,000 km

Fault Delay (ACK + error detection) = 0.25 seconds


• Transmission Delay:

= 4500 / 20000 = 0.225 seconds

• Propagation Delay:

= 30,000,000 / 2.8×108 = 0.1071 seconds

• Efficiency of Stop and Wait (without Fault) is:


Ttx
η=
Ttx + 2 ∗ Tprop
0.225
η= = 51.22%
0.225 + 2 ∗ 0.1071
• Efficiency of Stop and Wait (with fault) is:
Ttx
η=
Ttx + 2 ∗ Tprop + Fault Delay
0.225
η= = 32.64%
0.225 + 2 ∗ 0.1071 + 0.25
• Efficiency Drop Due to Fault:

51.22% − 32.64% = 18.58% decrease

You might also like