Data Link Control Protocols: Flow Control, Error Detection and Correction, and HDLC, Slides of Data Communication Systems and Computer Networks

An in-depth exploration of various data link control protocols, focusing on flow control, error detection and correction, and high-level data link control (hdlc). Topics include stop-and-wait, sliding windows, error detection methods like parity and cyclic redundancy check, and error control techniques such as automatic repeat request (arq).

Typology: Slides

2012/2013

Uploaded on 04/25/2013

baidehi
baidehi 🇮🇳

4.4

(14)

101 documents

1 / 45

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Chapter 7
Data Link Control Protocols
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

Partial preview of the text

Download Data Link Control Protocols: Flow Control, Error Detection and Correction, and HDLC and more Slides Data Communication Systems and Computer Networks in PDF only on Docsity!

Chapter 7

Data Link Control Protocols

Flow Control

  • Ensuring the sending entity does not overwhelm the receiving entity —Preventing buffer overflow
  • Transmission time —Time taken to emit all bits into medium
  • Propagation time —Time for a bit to traverse the link

Stop and Wait

  • Source transmits frame
  • Destination receives frame and replies with acknowledgement
  • Source waits for ACK before sending next frame
  • Destination can stop flow by not send ACK
  • Works well for a few large frames

Fragmentation

  • Large block of data may be split into small frames —Limited buffer size —Errors detected sooner (when whole frame received) —On error, retransmission of smaller frames is needed —Prevents one station occupying medium for long periods
  • Stop and wait becomes inadequate

Sliding Windows Flow Control

  • Allow multiple frames to be in transit
  • Receiver has buffer W long
  • Transmitter can send up to W frames without ACK
  • Each frame is numbered
  • ACK includes number of next frame expected
  • Sequence number bounded by size of field (k) —Frames are numbered modulo 2k

Sliding Window Diagram

Sliding Window Enhancements

  • Receiver can acknowledge frames without permitting further transmission (Receive Not Ready)
  • Must send a normal acknowledge to resume
  • If duplex, use piggybacking —If no data to send, use acknowledgement frame —If data but no acknowledgement to send, send last acknowledgement number again, or have ACK valid flag (TCP)

Error Detection

  • Additional bits added by transmitter for error detection code
  • Parity —Value of parity bit is such that character has even (even parity) or odd (odd parity) number of ones —Even number of bit errors goes undetected

Error Control

  • Detection and correction of errors
  • Lost frames
  • Damaged frames
  • Automatic repeat request —Error detection —Positive acknowledgment —Retransmission after timeout —Negative acknowledgement and retransmission

Automatic Repeat Request

(ARQ)

  • Stop and wait
  • Go back N
  • Selective reject (selective retransmission)

Stop and Wait -

Diagram

Stop and Wait - Pros and Cons

  • Simple
  • Inefficient

Go Back N - Damaged Frame

  • Receiver detects error in frame i
  • Receiver sends rejection-i
  • Transmitter gets rejection-i
  • Transmitter retransmits frame i and all subsequent

Go Back N - Lost Frame (1)

  • Frame i lost
  • Transmitter sends i+
  • Receiver gets frame i+1 out of sequence
  • Receiver send reject i
  • Transmitter goes back to frame i and retransmits