Consider the sliding window algorithm with SWS = 6 and RWS = 4 and assume that...

Transcribed Image Text:

Consider the sliding window algorithm with SWS = 6 and RWS = 4 and assume that medium does not re-arrange frames. (a) Find the smallest value for the Max SeqNum such that the receiver never places frames out of order. Note that it suffices to find the smallest Max SeqNum such that if DATA[MaxSeqNum] is in the receive window, then DATA[0] can no longer arrive (Without loss of generality, assume that the first frame is numbered with zero.) (b) Demonstrate via an example realization of frame losses (in a timing diagram) that if the Max SeqNum is reduced by one compared to your answer in (a), then the receiver places frames out of sequence. Consider the sliding window algorithm with SWS = 6 and RWS = 4 and assume that medium does not re-arrange frames. (a) Find the smallest value for the Max SeqNum such that the receiver never places frames out of order. Note that it suffices to find the smallest Max SeqNum such that if DATA[MaxSeqNum] is in the receive window, then DATA[0] can no longer arrive (Without loss of generality, assume that the first frame is numbered with zero.) (b) Demonstrate via an example realization of frame losses (in a timing diagram) that if the Max SeqNum is reduced by one compared to your answer in (a), then the receiver places frames out of sequence.

Answer rating: 100% (QA)

a smallest value for the maximum sequence numberN N SWS RWS 1 641 9 b Sender sends fi... View the full answer