technique ensuring the sending entity does not overwhelm the receiving entity (i.e. the receiver’s data buffer does not fill up and overflow)
temporal parameters used for transmission control: transmission time (emit) & propagation time (traverse)
resides in the Data Link OSI layer
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
Stop-and-Wait Flow Control Protocol
Algorithm & Characteristics
A
Algorithm: 1. Source transmits a frame 2. Destination receives frame and replies back with an acknowledgement (ACK) for that frame 3. Source waits for ACK before sending next frame
Characteristics:
destination can stop the data flow by not sending ACK
works well for large frames (use of frame fragmentation = large block split into smaller frames)
inefficient
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
Sliding Window Flow Control
general characteristics
A
allows for multiple frames to be in transit on the link
efficient algorithm for full duplex links and speedy transmissions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
Sliding Window Flow Control
Algorithm
A
receiver has buffer W long
transmitter can send up to W frames without waiting for ACK
each frame is numbered by the sender to keep track of ACK frames
the receiver sends ACK frame, including number of next frame expected
sequence number is bounded by the size of control field in the frame (k), so frames are numbered modulo 2^k
sender maintains a list with the sequence numbers it is allowed to transmit
receiver maintains a list with the sequence numbers it is prepared to receive