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 ________.
7
In the Go-Back-N ARQ protocol the sender keeps two window variables: Sf points to the first outstanding (sent but unacknowledged) packet and Sn points to the next packet that will be sent. Acknowledgements are cumulative, and the ackNo carried by an ACK is the sequence number of the next packet the receiver expects.
Step 1 — Before the ACK arrives, Sf = 3 and Sn = 7, so packets 3, 4, 5 and 6 are outstanding.
Step 2 — An ACK with ackNo = 6 means packets 3, 4 and 5 have been received correctly. The sender slides the left edge of the window: Sf becomes 6, and packets 3, 4, 5 are purged from its buffer.
Step 3 — Receiving an ACK never sends a new packet, so the pointer to the next packet to be sent does not move: Sn remains 7 (only packet 6 is still outstanding).
The value 6 is the new Sf, not Sn; 5 and 4 are sequence numbers that have just been acknowledged and are no longer part of the window.
7 option is correct.
Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?
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:
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$
Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?