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 is 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.
Pleae explain/show steps on each. Confused on how to start.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
