Suppose that we run the sliding window algorithm with SWS = 5 and RWS = 3, and

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 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.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Computer Networks A Systems Approach

ISBN: 9780128182000

6th Edition

Authors: Larry L. Peterson, Bruce S. Davie

Question Posted: