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 ________.
10
To keep the link busy, a sliding-window sender must have enough packets outstanding to cover one round trip, i.e. the window should equal the bandwidth–delay product divided by the packet size.
Step 1 — Bandwidth–delay product: \(64\,000 \times 0.040 = 2560 \text{ bits}\).
Step 2 — Packet size: \(32 \times 8 = 256 \text{ bits}\).
Step 3 — Window: \(\dfrac{2560}{256} = 10\) packets.
A window of 20, 30 or 40 packets would match round-trip times of 80, 120 or 160 ms at this bandwidth; with a 40 ms round trip those windows only queue extra packets at the bottleneck without raising throughput.
10 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:
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 ________.
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 ?