Flow and Error Control I-Basic Data Communication Systems-Lecture Slides, Slides of Digital Systems Design

This lecture is part of lecture series on Data Communication Systems. It was delivered by Prof. Prajin Ahuja at Birla Institute of Technology and Science. Its main points are: Flow, Error, Control, Framing, Distinguishable, Envlope, Separats, Delimiter, Protocol, Layer, Header, Flag

Typology: Slides

2011/2012

Uploaded on 07/26/2012

shakti
shakti 🇮🇳

4.4

(19)

99 documents

1 / 70

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Flow and Error Control
docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46

Partial preview of the text

Download Flow and Error Control I-Basic Data Communication Systems-Lecture Slides and more Slides Digital Systems Design in PDF only on Docsity!

Flow and Error Control

11-1^ FRAMING^ The data link layer needs to pack bits into frames, sothat each frame is distinguishable from another. Ourpostal system practices a type of framing. The simpleact of inserting a letter into an envelope separates onepiece of information from another; the envelope servesas the delimiter.

Figure 11.2^ Byte stuffing and unstuffing

Note Byte stuffing is the process of adding 1extra byte whenever there is a flag orescape character in the text.

Note Bit stuffing is the process of adding oneextra 0 whenever five consecutive 1sfollow a 0 in the data, so that thereceiver does not mistakethe pattern 0111110 for a flag.

Figure 11.4^ Bit stuffing and unstuffing

Note Flow control refers to a set of proceduresused to restrict the amount of datathat the sender can send beforewaiting for acknowledgment.

Note Error control in the data link layer isbased on automatic repeat request,which is the retransmission of data.

Figure^ Taxonomy of protocols discussed in this chapter

NOISELESS CHANNELS Let us first assume we have an ideal channel in whichno^ frames^ are^ lost,^ duplicated,

or^ corrupted.^ We introduce two protocols for this type of channel. Topics discussed in this section: Simplest ProtocolStop-and-Wait Protocol

Figure 11.7 shows an example of communication usingthis^ protocol.^ It^ is^ very

simple.^ The^ sender^ sends

a sequence^ of^ frames^ without

even^ thinking^ about^ the

Example 11.1 receiver. To send three frames, three events occur at thesender site and three events at the receiver site. Note thatthe data frames are shown by tilted boxes; the height ofthe box defines the transmission time difference betweenthe first bit and the last bit in the frame.

Example 11.2Figure 11.9 shows an example of communication usingthis protocol. It is still very simple. The sender sends oneframe and waits for feedback from the receiver. When theACK arrives, the sender sends the next frame. Note thatsending two frames in the protocol involves the sender infour events and the receiver in two events.

  • Figure 11.7 Flow diagram for Example 11.
  • Figure 11.9 Flow diagram for Example 11.