Scribd
Upload
4 views

ch11-data-link-control

Chapter 11 discusses Data Link Control (DLC), which focuses on communication procedures between adjacent nodes, including framing, flow control, and error control. Framing organizes bits into distinguishable frames, while flow and error control manage data transmission and ensure reliability. The chapter also introduces various protocols for noiseless and noisy channels, including the High-level Data Link Control (HDLC) protocol.

Uploaded by

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

ch11-data-link-control

Chapter 11 discusses Data Link Control (DLC), which focuses on communication procedures between adjacent nodes, including framing, flow control, and error control. Framing organizes bits into distinguishable frames, while flow and error control manage data transmission and ensure reliability. The chapter also introduces various protocols for noiseless and noisy channels, including the High-level Data Link Control (HDLC) protocol.

Uploaded by

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

Chapter 11

Data Link Control

11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Data Link

Control (DLC)
 The data link control (DLC) deals with procedures for
communication between two
 adjacent nodes—node-to-node communication—no matter
whether the link is dedicated or broadcast.
 Data link control functions include framing and flow and error
control. In this section, we first discuss framing, or how to organize
the bits that are carried by the physical layer. We then discuss
flow and error control.

11.2
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.3
 Framing in the data-link layer
separates a message from one
source to a destination
 by adding a sender address and a
destination address. The
destination address defines
 where the packet is to go; the
sender address helps the recipient
acknowledge the receipt.
 Frame Size
 In fixed-size framing – ATM WAN
 variable-size framing – CHARATER ORIENTED.

11.4
Figure 11.1 A frame in a character-oriented protocol

11.5
Figure 11.2 Byte stuffing and unstuffing

11.6
Framing : Byte Stuffing

(a) A frame delimited by flag bytes.


(b) Four examples of byte sequences before and after
stuffing.
Note

Byte stuffing is the process of adding 1


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

11.8
Figure 11.3 A frame in a bit-oriented protocol

11.9
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.10
Figure 11.4 Bit stuffing and unstuffing

11.11
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.12
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.13
Note

Error control in the data link layer is


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

11.14
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. To
make our discussions language-free, we have written
in pseudocode a version of each protocol that
concentrates mostly on the procedure instead of
delving into the details of language rules.

11.15
11.16
Figure 11.5 Taxonomy of protocols discussed in this chapter

11.17
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.18
Figure 11.6 The design of the simplest protocol with no flow or error control

11.19
11.20
11.21
Figure 11.7 Flow diagram for Example 11.1

11.22
Figure 11.8 Design of Stop-and-Wait Protocol

11.23
11.24
11.25
Figure 11.9 Flow diagram for Example 11.2

11.26
11.27
11.28
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.29
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.30
Note

In Stop-and-Wait ARQ, we use sequence


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

11.31
Note

In Stop-and-Wait ARQ, the


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

11.32
Figure 11.11 Flow diagram for Example 11.3

11.33
11.3 HDLC
 High-level Data Link Control (HDLC) is a bit-oriented protocol for
communication over point-to-point and multipoint links.
 It implements the Stop-and-Wait protocol we discussed earlier.
 Although this protocol is more a theoretical issue than practical,
most of the concept defined in this protocol is the basis for other
practical protocols such as PPP,

11.34

You might also like