Question: . Consider the sliding window algorithm with SWS=RWS=7 and cumulative acks. What is the smallest possible value for MaxSeqNum? ___ 14 Use 0, 1, 2,

. Consider the sliding window algorithm with SWS=RWS=7 and cumulative acks.

  • What is the smallest possible value for MaxSeqNum? ___ 14

Use 0, 1, 2, 15 (i.e., assume MaxSeqNum=16) for sequence numbers. Assume the following events occur: frames 0, 1, 2, 3, 4, 1, 2 are sent and the receiver gets the frames below in the order shown. Under each received frame, indicate the ack number sent when each frame is received.

received frames: 0 4 2 1 3 1

ack number: ___ ___ ___ ___ ___ ___ 0 0 0 2 4 4

  • What is LastFrameReceived (LFR) after receiving all 6 frames above? 4
  • What is LargestAcceptableFrame (LAF) after receiving all 6 frames above? 11
  • What is LastAcknowledgmentReceived (LAR) after receiving all 6 acks above? 4
  • What is LastFrameSent (LFS) after receiving all 6 acks above? 4
  • what new frames can be sent? 5, 6

how these questions have been answered.. I am looking for a detailed explanation.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!