Scribd
Upload
15 views

Flow CONTROL

Uploaded by

Rachana Kamarthi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views

Flow CONTROL

Uploaded by

Rachana Kamarthi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

FLOW CONTROL

 Data-link layer is responsible for implementation of point-to-point


flow and error control mechanism.
 When a data frame (Layer-2 data) is sent from one host to another
over a single medium, it is required that the sender and receiver should
work at the same speed.
 That is, sender sends at a speed on which the receiver can process and
accept the data.
 What if the speed (hardware/software) of the sender or receiver
differs?
 If sender is sending too fast the receiver may be overloaded,
(swamped) and data may be lost.
FLOW CONTROL PROTOCOLS:

Simplest Protocol
It is very simple. The sender sends a sequence of frames without even
thinking about the receiver. Data are transmitted in one direction only.
Both sender & receiver always ready. Processing time can be ignored.
Infinite buffer space is available. And best of all, the communication
channel between the data link layers never damages or loses frames.
This thoroughly unrealistic protocol, because it does not handle
either flow control or error correction
Stop and Wait
This flow control mechanism forces the sender after transmitting a
data frame to stop and wait until the acknowledgement of the data-
frame sent is received. It is Stop-and-Wait Protocol because the
sender sends one frame, stops until it receives confirmation from the
receiver (okay to go ahead), and then sends the next frame.
Stop-and-Wait Automatic Repeat Request
◦ The following transition may occur in Stop-and-Wait ARQ:
◦ The sender maintains a timeout counter.
◦ When a frame is sent, the sender starts the timeout counter.
◦ If acknowledgement of frame comes in time, the sender
transmits the next frame in queue.
◦ If acknowledgement does not come in time, the sender assumes
that either the frame or its acknowledgement is lost in transit.
◦ Sender retransmits the frame and starts the timeout counter.
◦ If a negative acknowledgement is received, the sender
retransmits the frame.
Go-Back-N ARQ
◦ Stop and wait ARQ mechanism does not utilize the resources at
their best.
◦ When the acknowledgement is received, the sender sits idle and
does nothing.
◦ In Go-Back-N ARQ method, both sender and receiver maintain
a window.
Fig: Go-Back-N ARQ

◦ The sending-window size enables the sender to send multiple


frames without receiving the acknowledgement of the previous
ones.
◦ The receiving-window enables the receiver to receive multiple
frames and acknowledge them.
◦ The receiver keeps track of incoming frame’s sequence number.
◦ When the sender sends all the frames in window, it checks up to
what sequence number it has received positive
acknowledgement.
◦ If all frames are positively acknowledged, the sender sends next
set of frames.
◦ If sender finds that it has received NACK or has not receive any
ACK for a particular frame, it retransmits all the frames after
which it does not receive any positive ACK.
Selective Repeat ARQ
◦ In Go-back-N ARQ, it is assumed that the receiver does not
have any buffer space for its window size and has to process
each frame as it comes.
◦ This enforces the sender to retransmit all the frames which are
not acknowledged.
◦ In Selective-Repeat ARQ, the receiver while keeping track of
sequence numbers, buffers the frames in memory and sends
NACK for only frame which is missing or damaged.
◦ The sender in this case, sends only packet for which NACK is
received.

You might also like