Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?
15
With k-bit sequence numbers there are \(2^{k}\) distinct numbers.
\(k = 4\) gives \(2^{4} = 16\) sequence numbers, 0 to 15.
For a go-back-N sliding window the maximum send window is \(2^{k} - 1 = 16 - 1 = 15\), so that a full window can be told apart from a repeated one.
Check: a window of 16 would reuse a sequence number before acknowledgement and cause ambiguity.
Hence, 15.
Sequence the following stages of the sliding window protocol for flow control.
A. Sender move the window to the next set of frames.
B. Sender sends a window of frames.
C. Receiver acknowledge the received frames.
D. If acknowledgment is not received, Sender retransmits the frame.
Choose the correct answer from the options given below:
In Go-back-N protocol, the values of Sf (Send window, the first outstanding packet) =3, Sn (Send window, the next packet to be send) =7, after receiving the packet with AckNo.6, the value of Sn is ________.
Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milliseconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is ________.
A computer modem's rating of 56 K refers to its-
The Solution to Silly Window Syndrome problem is/are:
A. Nagle's Algorithm
B. Clark's Algorithm
C. Jacobson's Algorithm
D. Piggy backing Algorithm
Choose the correct answer from the options given below:
Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2 Mbps, 500 kbps, and 1 Mbps, respectively. All processing delays and propagation delays are negligible. Assume that there is no other background traffic over the path and no other additional overhead to transfer the file.
Which one of the following is the total time (in seconds) to transfer the file?
Note: 1M=$10^6$, 1k=$10^3$
Sequence the following stages of the sliding window protocol for flow control.
A. Sender move the window to the next set of frames.
B. Sender sends a window of frames.
C. Receiver acknowledge the received frames.
D. If acknowledgment is not received, Sender retransmits the frame.
Choose the correct answer from the options given below: