State a general rule for the minimum maxseqnum in terms of


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.

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: State a general rule for the minimum maxseqnum in terms of
Reference No:- TGS01392166

Expected delivery within 24 Hours