Exercise on Sliding Window Protocol
Readings:
1.
http://authors.phptr.com/tanenbaumcn4/samples/section03_04.pdf
2.
Animation
Assignment:
The time
diagram below shows the exchange of frames between two stations Node 1 and
Node 2 using the following counters:
V(R) -
sequence number representing frame_expected
V(S) - sequence number representing next_frame_to_send
A (R) - sequence number representing ack_expected
N(R) - (Receive Sequence Number) representing acknowledgment field of the
packet header.
N(S) - (Send Sequence Number) representing sequence # field of the packet header.
I - Packet payload (remains empty).
What
kind of sliding window mechanism does this trace represent?
Comment
the decisions on receiving of each packet. Please note that during the
transmission a checksum failure occurs. Fill out the missing values of the
counters. The length of the bold arrow represents the time-out period,
which defines the time after each send (for Node 1 and for Node
2) in which an acknowledgment should be received.
Second Example
