Scribd
Upload
16 views

Data Link Layer

This chapter discusses data link control and framing, flow control, and error control protocols at the data link layer. It introduces fixed-size and variable-size framing and protocols for noiseless and noisy channels, including Stop-and-Wait ARQ, Go-Back-N ARQ, and Selective Repeat ARQ. It also describes the HDLC protocol, including its configurations, transfer modes, and frame formats.

Uploaded by

Jatin Patil
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
16 views

Data Link Layer

This chapter discusses data link control and framing, flow control, and error control protocols at the data link layer. It introduces fixed-size and variable-size framing and protocols for noiseless and noisy channels, including Stop-and-Wait ARQ, Go-Back-N ARQ, and Selective Repeat ARQ. It also describes the HDLC protocol, including its configurations, transfer modes, and frame formats.

Uploaded by

Jatin Patil
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 37

Chapter 11

Data Link Control

11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
11-1 FRAMING

The data link layer needs to pack bits into frames, so


that each frame is distinguishable from another. Our
postal system practices a type of framing. The simple
act of inserting a letter into an envelope separates one
piece of information from another; the envelope serves
as the delimiter.
Topics discussed in this section:
Fixed-Size Framing
Variable-Size Framing

11.2
Figure 11.1 A frame in a character-oriented protocol

11.3
Figure 11.2 Byte stuffing and unstuffing

11.4
Note

Byte stuffing is the process of adding 1


extra byte whenever there is a flag or
escape character in the text.

11.5
Figure 11.3 A frame in a bit-oriented protocol

11.6
Note

Bit stuffing is the process of adding one


extra 0 whenever five consecutive 1s
follow a 0 in the data, so that the
receiver does not mistake
the pattern 0111110 for a flag.

11.7
Figure 11.4 Bit stuffing and unstuffing

11.8
11-2 FLOW AND ERROR 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.

Topics discussed in this section:


Flow Control
Error Control

11.9
Note

Flow control refers to a set of procedures


used to restrict the amount of data
that the sender can send before
waiting for acknowledgment.

11.10
Note

Error control in the data link layer is


based on automatic repeat request,
which is the retransmission of data.

11.11
11-3 PROTOCOLS

Now let us see 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.

11.12
Figure 11.5 Taxonomy of protocols discussed in this chapter

11.13
11-4 NOISELESS CHANNELS

Let us first assume we have an ideal channel in which


no frames are lost, duplicated, or corrupted. We
introduce two protocols for this type of channel.

Topics discussed in this section:


Simplest Protocol
Stop-and-Wait Protocol

11.14
Example 11.1

Figure 11.7 shows an example of communication using


this protocol. It is very simple. The sender sends a
sequence of frames without even thinking about the
receiver. To send three frames, three events occur at the
sender site and three events at the receiver site. Note that
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.

11.15
Figure 11.7 Flow diagram for Example 11.1

11.16
Example 11.2

Figure 11.9 shows an example of communication using


this protocol. It is still very simple. The sender sends one
frame and waits for feedback from the receiver. When the
ACK arrives, the sender sends the next frame. Note that
sending two frames in the protocol involves the sender in
four events and the receiver in two events.

11.17
Figure 11.9 Flow diagram for Example 11.2

11.18
11-5 NOISY CHANNELS

Although the Stop-and-Wait Protocol gives us an idea


of how to add flow control to its predecessor, noiseless
channels are nonexistent. We discuss three protocols
in this section that use error control.

Topics discussed in this section:


Stop-and-Wait Automatic Repeat Request
Go-Back-N Automatic Repeat Request
Selective Repeat Automatic Repeat Request

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

11.20
Note

In Stop-and-Wait ARQ, we use sequence


numbers to number the frames.
The sequence numbers are based on
modulo-2 arithmetic.

11.21
Note

In Stop-and-Wait ARQ, the


acknowledgment number always
announces in modulo-2 arithmetic the
sequence number of the next frame
expected.

11.22
Example 11.3

Figure 11.11 shows 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.

11.23
Figure 11.11 Flow diagram for Example 11.3

11.24
Sliding Window Protocol

11.25
Go-Back-N Automatic Repeat Request

11.26
Selective Repeat Automatic Repeat Request

11.27
Note

In the Go-Back-N Protocol, the sequence


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

11.28
Note

The send window is an abstract concept


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

11.29
Note

The send window can slide one


or more slots when a valid
acknowledgment arrives.

11.30
Note

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.

11.31
Note

In Selective Repeat ARQ, the size of the


sender and receiver window
must be at most one-half of 2m.

11.32
Note

Stop-and-Wait ARQ is a special case of


Go-Back-N ARQ in which the size of the
send window is 1.

11.33
11-6 HDLC

High-level Data Link Control (HDLC) is a bit-oriented


protocol for communication over point-to-point and
multipoint links. It implements the ARQ mechanisms
we discussed in this chapter.

Topics discussed in this section:


Configurations and Transfer Modes
Frames
Control Field

11.34
Figure 11.25 Normal response mode

11.35
Figure 11.26 Asynchronous balanced mode

11.36
Figure 11.27 HDLC frames

11.37

You might also like