Question: Suppose that we run the sliding window algorithm with SWS = 5 and RWS = 3, and no out-of-order arrivals. (a) Find the smallest value
Suppose that we run the sliding window algorithm with SWS = 5 and RWS = 3, and no out-of-order arrivals.
(a) Find the smallest value for MaxSeqNum. You may assume that it suffices to find the smallest MaxSeqNum such that if DATA[MaxSeqNum] is in the receive window, then DATA[0] can no longer arrive.
(b) Give an example showing that MaxSeqNum − 1 is not sufficient.
(c) State a general rule for the minimum MaxSeqNum in terms of SWS and RWS.
Step by Step Solution
3.40 Rating (159 Votes )
There are 3 Steps involved in it
The sliding window algorithm is a method for managing data transfer in networks which involves a sen... View full answer
Get step-by-step solutions from verified subject matter experts
