Respuesta :
The optimal number of receiver buffers required for a sliding window
protocol With 4 bits, the number of sequence numbers possible = 16
How do you calculate optimal window size in sliding window protocol?
- Maximum window size = 1 + 2*a where a = Tp/Tt Minimum sequence numbers required = 1 + 2*a.
- All the packets in the current window will be given a sequence number.
- Although the Stop and Wait ARQ provides error and flow control, it may have serious performance implications because the sender always waits for acknowledgment even when the next packet is prepared to be sent.
- Consider a scenario in which you have a high bandwidth connection and a high propagation delay (you are connected to a server in another country via a high-speed connection), but you are unable to utilize this full speed due to stop-and-wait restrictions.
- This efficiency issue is resolved by the sliding window protocol by sending multiple packets with a larger sequence number at once. Similar to pipelining in architecture, the concept.
- A flow control protocol is the sliding window protocol.
- The sender is able to send several frames before the acknowledgments become necessary.
so the answer is the optimal number of 4 sequence numbers is 16
To learn more about the Sliding window protocol, refer
to https://brainly.com/question/25922327
#SPJ4
