Sliding Window

Sliding Window Algorithm Explained | Built In

Rear power sliding window question. Resolved

[Hot Item] Aluminium Sliding Window and Door accessories  Sliding Spring Lock Handle System

Residential Aluminium Sliding Window

[Hot Item] Aluminium Profile for Aluminum Sliding Window and Door

takeuforward - Best Coding Tutorials for Free

SOLVED:Suppose that we attempt to run the sliding window algorithm with SWS = RWS = 3 and with MaxSeqNum =5 . The Nth packet DATA[ N] thus actually contains N mod 5 in its sequence number field. Give an example in which the algorithm becomes confused; that is, a scenario in which the receiver expects DATA[5] and accepts DATA[0]-which has the same transmitted sequence number-in its stead. No packets may arrive out of order. Note this implies MaxSeqNum ≥6 is necessary as well as sufficient.

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