Frames of are sent over a bps duplex link between two hosts. The propagation time is . Frames are to be transmitted into this link to maximally pack them in transit (within the link).
Let be the minimum number of bits that will be required to represent the sequence numbers distinctly assuming that no time gap needs to be given between transmission of two frames.
Suppose that the sliding window protocol is used with the sender window size of , where is the numbers of bits as mentioned earlier and acknowledgements are always piggy backed. After sending frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time)
View worked solution
Answer: C
To find the waiting time of the sender, we first determine the value of and then calculate the timeline of transmission and acknowledgment.
Step 1: Find the number of bits
- Transmission time of a frame () =
- Propagation delay () =
The maximum number of frames that can be in transit (within the link in one direction) is given by the bandwidth-delay product:
To represent these frames distinctly, we need bits such that:
Step 2: Calculate the waiting time
The sender window size is frames.
- Transmission of 32 frames: The sender starts transmitting frame at and finishes transmitting the frame (frame ) at .
- Arrival of the first ACK:
- Frame transmission finishes at .
- It reaches the receiver at .
- Since acknowledgements are piggybacked, the reverse frame (carrying the ACK) takes to transmit, finishing at .
- The ACK arrives back at the sender at .
The sender must wait from the moment it finishes transmitting the window () until it receives the first ACK ():
Free practice · Your answers on this page are not saved.
