Scribd
Upload
3 views28 pages

CH 11

Chapter 11 discusses Data Link Control, focusing on framing, flow control, and error control in the data link layer. It explains the processes of byte and bit stuffing, and introduces protocols like Stop-and-Wait ARQ and Point-to-Point Protocol (PPP). The chapter emphasizes the importance of these functions in ensuring reliable data transmission between nodes.

Uploaded by

alsaydia1
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
3 views28 pages

CH 11

Chapter 11 discusses Data Link Control, focusing on framing, flow control, and error control in the data link layer. It explains the processes of byte and bit stuffing, and introduces protocols like Stop-and-Wait ARQ and Point-to-Point Protocol (PPP). The chapter emphasizes the importance of these functions in ensuring reliable data transmission between nodes.

Uploaded by

alsaydia1
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/ 28

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. 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.12
11.13
11.14
11.15
Design of Stop-and-Wait Protocol

11.16
11.17
11.18
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.19
Note

In Stop-and-Wait ARQ, we use sequence


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

11.20
Note

In Stop-and-Wait ARQ, the


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

11.21
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.22
Figure 11.11 Flow diagram for Example 11.3

11.23
Example 11.4

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. What is the bandwidth-delay product?
If the system data frames are 1000 bits in length, what is
the utilization percentage of the link?

Solution
The bandwidth-delay product is

11.24
Example 11.4 (continued)

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. However, the system sends only 1000 bits. We
can say that the link utilization is only 1000/20,000, or 5
percent. For this reason, for a link with a high bandwidth
or long delay, the use of Stop-and-Wait ARQ wastes the
capacity of the link.

11.25
POINT-TO-POINT PROTOCOL (PPP)

One of the most common protocols for point-to-


point access is the Point-to-Point Protocol (PPP).

Today, millions of Internet users who need to


connect their home computers to the server of an
Internet service provider use PPP.

The majority of these users have a traditional


modem; they are connected to the Internet through
a telephone line, which provides the services of the
physical layer

11.26
11.27
11.28

You might also like