Scribd
Upload
5 views

Mod-2-1

Uploaded by

Neha
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views

Mod-2-1

Uploaded by

Neha
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 51

Module-2

Chapter 1
Error Detection and Correction

By
Syeda Arbeena Kausar
Asst. professor
VVIET Mysore
1.13
1.14
1.15
1.16

Note

Byte stuffing is the process of adding 1


extra byte whenever there is a flag or
escape character in the text.
1.17
Figure 11.3 A frame in a bit-oriented protocol
1.18
1.19

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.
Figure 11.1 A frame in a character-oriented protocol
1.20
Figure 11.2 Byte stuffing and unstuffing
1.21
11-1 FRAMING
1.22

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
Figure 11.4 Bit stuffing and unstuffing
1.23
11-2 FLOW AND ERROR CONTROL
1.24

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
1.25

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

Note

Error control in the data link layer is


based on automatic repeat request,
which is the retransmission of data.
11-3 PROTOCOLS
1.27

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.
Figure 11.5 Taxonomy of protocols discussed in this chapter
1.28
11-4 NOISELESS CHANNELS
1.29

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
Figure 11.6 The design of the simplest protocol with no flow or error control
1.30
Algorithm 11.1 Sender-site algorithm for the simplest protocol
1.31
Algorithm 11.2 Receiver-site algorithm for the simplest protocol
1.32
Example 11.1
1.33
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.
Figure 11.7 Flow diagram for Example 11.1
1.34
Figure 11.8 Design of Stop-and-Wait Protocol
1.35
Algorithm 11.3 Sender-site algorithm for Stop-and-Wait Protocol
1.36
Algorithm 11.4 Receiver-site algorithm for Stop-and-Wait Protocol
1.37
Example 11.2
1.38
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.
Figure 11.9 Flow diagram for Example 11.2
1.39
1.40
Figure 11.24 Design of piggybacking in Go-Back-N ARQ
1.41

You might also like