Sliding-Window-Protocol
Question 1 |
Consider a network connected two systems located 8000 kilometers apart. The bandwidth of the network is 500 × 106 bits per second. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. Then the minimum size in bits of the sequence number field has to be ___________.
8 | |
7 | |
6 | |
5 |
η=100% n = ?
∴a=Tp/Tn =2/0.02=100
Given Protocol, Go-back-N protocol, So η = w/(1+2a) where w = 2n-1
100/100 = w/(1+2a) ⇒ w = 1+2a
⇒ 2(n-1) = 1+2(100)
⇒ 2n - 1 = 201
⇒ 2n = 202 ⇒ 2n = 28
⇒ n = 8
Question 2 |
Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a one-way latency of 50 msec. To achieve a link utilization of 60%, the minimum number of bits required to represent the sequence number field is ________.
5 | |
6 | |
7 | |
8 |
B = 1.5 Mbps
Tp = 50 ms
η = 60%
Efficiency formula for SR protocol is
η = W/(1+2a) ⇒ 60/100 = W/(1+2a) (∵a = Tp/Tx)
Tx = L/B = 8×103/1.5×106 = 5.3ms
a = Tp/Tx = 50/5.3 = 500/53 = 9.43
⇒ 60/100 = W/19.86 ⇒ W = 11.9 ≈ 12
⇒ W = 2n-1 = 12 ⇒ 2n = 24 ⇒ 2n = 24 ≈ 25 ⇒ n = 5
Question 3 |
Frames of 1000 bits are sent over a 106 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link).
What is the minimum number of bits (l) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
I = 2 | |
I = 3 | |
I = 4 | |
I = 5 |
Maximum number of frames that can be transmit to maximally pack them is = (Tt+2Tp)/Tx = (25+1)/1 = 26 which is window size
Minimum sequence numbers required = 26
Minimum number of bits required for sequence number is 5.
Question 4 |
Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window size that A should use?
20 | |
40 | |
160 | |
320 |
Round trip delay = 2 * Tp = 80 ms (given)
Optimal window size is = (Tt + 2*Tp) / Tt = 82 / 2 = 41
Option is not given, closest option is 40.
Question 5 |
The maximum window size for data transmission using the selective reject protocol with n-bit frame sequence numbers is:
2n | |
2n-1 | |
2n - 1 | |
2n-2 |
For Go-back N, the maximum window size can be 2n - 1.
Question 6 |
Frames of 1000 bits are sent over a 106 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link).
Suppose that the sliding window protocol is used with the sender window size of 2l, where l is the number of bits identified in the earlier part and acknowledgements are always piggy backed. After sending 2l frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time.)
16ms | |
18ms | |
20ms | |
22ms |
From above diagram we can say that Total RTT will be
1ms (transmitting time for first frame)
+ 25ms (propagation delay from S to R)
+ 1ms (transmitting time for piggybacked ACK)
+ 25ms (propagation delay from R to S)
= 52 ms
Also total time for sender needed to transmit 32 frames (22 = 25 = 32) is 32×1ms = 32ms
So sender has to wait for,
(52 - 32)ms
= 20ms
