0% found this document useful (0 votes)
39 views23 pages

Data Link Layer Flow Control Protocols

Uploaded by

harshvir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
39 views23 pages

Data Link Layer Flow Control Protocols

Uploaded by

harshvir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Data Link

Layer
Flow Control
FLOW CONTROL
• The most important responsibilities of the
data link layer are flow control and error
control. Collectively, these functions are
known as data link control.
• Flow control refers to a set of procedures
used to restrict the amount of data that the
sender can send before waiting for
acknowledgment
Flow Control Protocols
• How the data link layer can combine framing, flow
control, and error control to achieve the delivery of data
from one node to another.

• The protocols are normally implemented in software by


using one of the common programming languages.
Types of protocols
NOISELESS
CHANNELS
•Let us first assume we have an
ideal channel in which no frames
are lost, duplicated, or corrupted.

•Two protocols for this type of


channel.

• Simplest Protocol
• Stop-and-Wait Protocol
The design of the simplest protocol
with no flow or error control
Sender-site algorithm for the simplest protocol

Receiver-site algorithm for the simplest protocol


• No flow or error control

Simplest
protocol :Flo
w diagram
Design of Stop-and-Wait Protocol

Sender-site algorithm for the stop and wait

Receiver-site algorithm for the stop and wait


Stop-and-Wait Protocol :Flow diagram

• The sender sends one frame


and waits for feedback from
the receiver.

• When the ACK arrives, the


sender sends the next frame.

• Sending two frames in the


protocol involves the sender
in four events and the
receiver in two events.
NOISY CHANNELS
• Noiseless channels are nonexistent.

• Three protocols that use error


control.
• Stop-and-Wait Automatic Repeat Request
• Go-Back-N Automatic Repeat Request
• Selective Repeat Automatic Repeat Request
 Error correction in Stop-and-Wait ARQ is
done by keeping a copy of the sent frame
and retransmitting of the frame when the
timer expires.
Stop-and-Wait
Automatic  In Stop-and-Wait ARQ, sequence numbers
to number the frames is used. The sequence
Repeat
numbers are based on modulo-2 arithmetic.
Request
 In Stop-and-Wait ARQ, the acknowledgment
number always announces in modulo-2
arithmetic the sequence number of the next
frame expected.
Design of the Stop-and-Wait ARQ Protocol
Flow diagram

An example of Stop-and-Wait ARQ.

• Frame 0 is sent and acknowledged.


• Frame 1 is lost and resent after the
time-out.
• The resent frame 1 is acknowledged
and the timer stops.
• Frame 0 is sent and acknowledged,
but the acknowledgment is lost.
• The sender has no idea if the frame or
the acknowledgment is lost, so after
the time-out, it resends frame 0,
which is acknowledged.
Send window for Go-Back-N ARQ

• In the Go-Back-N Protocol,


the sequence numbers
are modulo 2m, where m
is the size of the sequence
number field in bits.

• The send window is an


abstract concept defining
an imaginary box of size
2m − 1 with three
variables: Sf, Sn, and Ssize.

• The send window can


slide one or more slots
when a valid
acknowledgment arrives.
Receive window
for Go-Back-N
ARQ
• The receive window is an
abstract concept defining
an imaginary box of size 1
with one single variable Rn.

• The window slides when a


correct frame has arrived;
sliding occurs one slot at a
time.
Design of
Go-Back-N
ARQ
Window size
for Go-Back-N
ARQ

•In Go-Back-N ARQ, the


size of the send window
must be less than 2m; the
size of the receiver
window
is always 1.
Send window for Selective Repeat ARQ
Receive window for Selective Repeat ARQ
Design of
Selective
Repeat ARQ
Selective Repeat ARQ, window size

In Selective Repeat
ARQ, the size of the
sender and receiver
window must be at
most one-half of 2m.

Delivery of data in Selective Repeat ARQ


Design of
piggybacking in
Go-Back-N ARQ
• In real life, data frames are normally flowing
in both directions: from node A to node B and
from node B to node A.

• The control information also needs to flow in


both directions. A technique called
piggybacking is used to improve the
efficiency of the bidirectional protocols

• Each node now has two windows: one send


window and one receive window. Both also
need to use a timer.
• Both are involved in three types of events:
request, arrival, and time-out.
In Go-Back-N window, when the timer of the packet
times out, several packets have to be resent even
some may have arrived safe. Whereas in Selective
Repeat window, the sender resends ___________
A. Packet which are not lost
Question B. Only those packets which are lost or corrupted
C. Packet from starting
D. All the packets

You might also like