Host is sending data to host over a full duplex link. and are using the sliding window protocol for flow control. The send and receive window sizes are packets each. Data packets (sent only from to ) are all bytes long and the transmission time for such a packet is . Acknowledgment packets (sent only from to ) are very small and require negligible transmission time. The propagation delay over the link is . What is the maximum achievable throughput in this communication?
View worked solution
Answer: B
To find the maximum achievable throughput, we need to determine how much data the sender can transmit in one complete cycle (round-trip time).
1. Identify the Given Parameters
- Send Window Size (): packets
- Packet Size: bytes
- Transmission Time ():
- Propagation Delay ():
- Acknowledgment Transmission Time (): (negligible)
2. Calculate the Total Cycle Time ()
The total time required for a packet to be transmitted and its acknowledgment to be received is:
3. Determine the Maximum Data Sent in One Cycle
With a send window size of , the sender can transmit at most packets before waiting for an acknowledgment.
The total transmission time for packets is:
Since the total transmission time () is less than the cycle time (), the sender will finish transmitting all packets and then wait for the acknowledgment of the first packet to arrive. Thus, the communication is window-limited, and the sender can transmit exactly packets every .
4. Calculate the Throughput
Therefore, the maximum achievable throughput is Bps.
Free practice · Your answers on this page are not saved.
