Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Flow control mechanism, Assignments of Mechanics

DLLFlow control is a technique that allows two stations working at different speeds to communicate with each other. It is a set of measures taken to regulate the amount of data that a sender sends so that a fast sender does not overwhelm a slow receiver. In data link layer, flow control restricts the number of frames

Typology: Assignments

2020/2021

Uploaded on 05/30/2021

saba-afrin
saba-afrin 🇮🇳

1 document

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ASSIGNMENT
Explain Flow control Mechanism used in DLL
with the help of diagram.
Flow control is a technique that allows two stations working at different speeds to
communicate with each other. It is a set of measures taken to regulate the amount of
data that a sender sends so that a fast sender does not overwhelm a slow receiver. In
data link layer, flow control restricts the number of frames the sender can send before it
waits for an acknowledgment from the receiver.
Flow control can be broadly classified into two categories –
Feedback based Flow Control - In these protocols, the sender sends frames after it has
received acknowledgments from the user. This is used in the data link layer.
Rate based Flow Control - These protocols have built in mechanisms to restrict the rate
of transmission of data without requiring acknowledgment from the receiver. This is used
in the network layer and the transport layer.
Data link layer uses feedback based flow control mechanisms. There are two main
techniques –
Stop and Wait
This protocol involves the following transitions −
The sender sends a frame and waits for acknowledgment.
Once the receiver receives the frame, it sends an acknowledgment frame back to the
sender.
On receiving the acknowledgment frame, the sender understands that the receiver is
ready to accept the next frame. So it sender the next frame in queue.
pf3
pf4
pf5

Partial preview of the text

Download Flow control mechanism and more Assignments Mechanics in PDF only on Docsity!

ASSIGNMENT

Explain Flow control Mechanism used in DLL

with the help of diagram.

Flow control is a technique that allows two stations working at different speeds to communicate with each other. It is a set of measures taken to regulate the amount of data that a sender sends so that a fast sender does not overwhelm a slow receiver. In data link layer, flow control restricts the number of frames the sender can send before it waits for an acknowledgment from the receiver. Flow control can be broadly classified into two categories –  Feedback based Flow Control - In these protocols, the sender sends frames after it has received acknowledgments from the user. This is used in the data link layer.  Rate based Flow Control - These protocols have built in mechanisms to restrict the rate of transmission of data without requiring acknowledgment from the receiver. This is used in the network layer and the transport layer. Data link layer uses feedback based flow control mechanisms. There are two main techniques –

Stop and Wait

This protocol involves the following transitions −  The sender sends a frame and waits for acknowledgment.  Once the receiver receives the frame, it sends an acknowledgment frame back to the sender.  On receiving the acknowledgment frame, the sender understands that the receiver is ready to accept the next frame. So it sender the next frame in queue.

Sliding Window

This protocol improves the efficiency of stop and wait protocol by allowing multiple frames to be transmitted before receiving an acknowledgment. The working principle of this protocol can be described as follows −  Both the sender and the receiver has finite sized buffers called windows. The sender and the receiver agrees upon the number of frames to be sent based upon the buffer size.  The sender sends multiple frames in a sequence, without waiting for acknowledgment. When its sending window is filled, it waits for acknowledgment. On receiving acknowledgment, it advances the window and transmits the next frames, according to the number of acknowledgments received. Error Control When data-frame is transmitted, there is a probability that data-frame may be lost in the transit or it is received corrupted. In both cases, the receiver does not receive the correct data-frame and sender does not know anything about any loss.In such case, both sender and receiver are equipped with some protocols which helps them to detect transit errors such as loss of data-frame. Hence, either the sender retransmits the data-frame or the receiver may request to resend the previous data-frame. Requirements for error control mechanism:  Error detection - The sender and receiver, either both or any, must ascertain that there is some error in the transit.  Positive ACK - When the receiver receives a correct frame, it should acknowledge it.  Negative ACK - When the receiver receives a damaged frame or a duplicate frame, it sends a NACK back to the sender and the sender must retransmit the correct frame.

o 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. 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.