Scribd
Upload
14 views14 pages

Lecture 5 - Data Link Control

This document discusses data link control and protocols, including error control, flow control, and automatic repeat request (ARQ) protocols. It provides examples of the simplest protocol and stop-and-wait protocol for noiseless channels. For noisy channels, it discusses stop-and-wait ARQ and provides an example flowchart. It also provides examples calculating bandwidth-delay product and link utilization for a stop-and-wait ARQ system.

Uploaded by

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

Lecture 5 - Data Link Control

This document discusses data link control and protocols, including error control, flow control, and automatic repeat request (ARQ) protocols. It provides examples of the simplest protocol and stop-and-wait protocol for noiseless channels. For noisy channels, it discusses stop-and-wait ARQ and provides an example flowchart. It also provides examples calculating bandwidth-delay product and link utilization for a stop-and-wait ARQ system.

Uploaded by

B
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Computer Networks

Lecture 5
Data Link Control &
Protocols

3rd Grade

Assist. Lect. Alnawar J. Mohammed

1
Data Link Control & Protocols

DATA LINK CONTROL


Error control in the data link layer is the
retransmission of data.
Flow control used to restrict the amount of
data that the sender can send.
2.2
Taxonomy of protocols

2.3
NOISELESS CHANNELS

• An ideal channel in which no frames are lost,


duplicated, or corrupted.
• This means the channel is error-free.
• Here are two protocols for these types of
channels:
1- Simplest Protocol
2- Stop-and-Wait Protocol

2.4
Simplest Protocol
Example
• The sender sends a sequence of frames without
even thinking about the receiver.
• To send three frames in this example, three events
occur at the sender site and three events at the
receiver site.

2.5
Note:

• In the previous example, the data frames are


shown by tilted boxes.
• The height of the box defines the transmission
time difference between the first bit and the last
bit in the frame.

2.6
Stop-and-Wait Protocol
Example
• If two frames are supposed to be sent by Stop-
and-Wait Protocol
• The sender sends one frame and waits for
feedback from the receiver.
• When the ACK arrives, the sender sends the next
frame.

2.7
NOISY CHANNELS
• In real life the noiseless channels are
nonexistent.
• We discuss here one example of these
protocols in this section that use error
control:

Stop-and-Wait Automatic Repeat Request

2.8
Stop-and-Wait Automatic Repeat Request

Example
Draw a flowchart for the Stop-and-Wait ARQ with
the following conditions:
1. Frame 0 is sent and acknowledged.
2. Frame 1 is lost and resent after the time-out.
3. The resent frame 1 is acknowledged and the
timer stops.
4. Frame 0 is sent and acknowledged, but the
acknowledgment is lost.

2.9
Solution:

2.10
Note

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.

2.11
Example
Assume that, in a Stop-and-Wait ARQ system,
the bandwidth of the line is 1 Mbps, and 1 bit
takes 20 ms to make a round trip.

1- What is the bandwidth-delay product?


2- If the system data frames are 1000 bits in
length, what is the utilization percentage of
the link?

2.12
Solution:

The system can send 20,000 bits during the time it takes
for the data to go from the sender to the receiver and then
back again.

2.13
Example
For the pervious example, calculate the utilization
percentage of the link if the system can send up to
15 frames before stopping and worrying about the
acknowledgments?

Solution:

2.14

You might also like