Peterson Davie 2.35c

Question

Suppose that we run the sliding window algorithm with $SWS = 5$ and $RWS = 3$, and no out-of-order arrivals.

(c) State a general rule for the minimum MaxSeqNum in terms of $SWS$ and $RWS$.

Answer 1

Max Sequence Number>=SWS+RWS