Scribd
Upload
31 views28 pages

Data Link Control Protocols

This document discusses various data link control protocols and flow control mechanisms: 1. It describes stop-and-wait and sliding window protocols for frame transmission, including how they control flow and ensure reliable delivery. 2. It also covers fragmentation, error detection using parity and cyclic redundancy checks, and automatic repeat request (ARQ) using stop-and-wait, go-back-N, and selective reject for error control. 3. The key aspects of these link protocols are ensuring data is transmitted reliably from source to destination while preventing buffer overflows through flow control and retransmitting damaged or lost frames.

Uploaded by

Pankaj Yeole
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
31 views28 pages

Data Link Control Protocols

This document discusses various data link control protocols and flow control mechanisms: 1. It describes stop-and-wait and sliding window protocols for frame transmission, including how they control flow and ensure reliable delivery. 2. It also covers fragmentation, error detection using parity and cyclic redundancy checks, and automatic repeat request (ARQ) using stop-and-wait, go-back-N, and selective reject for error control. 3. The key aspects of these link protocols are ensuring data is transmitted reliably from source to destination while preventing buffer overflows through flow control and retransmitting damaged or lost frames.

Uploaded by

Pankaj Yeole
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

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
Model of Frame Transmission
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
Stop and Wait Link Utilization
Bit Length
• B=Rxd/V
• B= Length of Link in bits
• R=data rate of link in bps
• D= Length or Distance in meters
• V= velocity of propogation in m/s
• a=B/L
• A=propogation delay
• L=Length of Frame in bits
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
Example Sliding Window
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
Cyclic Redundancy Check
• For a block of k bits transmitter generates n bit
sequence
• Transmit k+n bits which is exactly divisible by
some number
• Receive divides frame by that number
—If no remainder, assume no error
—For math, see Stallings chapter 7
Error Control
• Detection and correction of errors
• Lost frames
• Damaged frames
• Automatic repeat request (ARQ)
—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
• Source transmits single frame
• Wait for ACK
• If received frame damaged, discard it
—Transmitter has timeout
—If no ACK within timeout, retransmit
• If ACK damaged,transmitter will not recognize it
—Transmitter will retransmit
—Receive gets two copies of frame
—Use ACK0 and ACK1
Stop and Wait -
Diagram
Stop and Wait - Pros and Cons
• Simple
• Inefficient
Go Back N (1)
• Based on sliding window
• If no error, ACK as usual with next frame
expected
• Use window to control number of outstanding
frames
• If error, reply with rejection
—Discard that frame and all future frames until error
frame received correctly
—Transmitter must go back and retransmit that frame
and all subsequent frames
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+1
• Receiver gets frame i+1 out of sequence
• Receiver send reject i
• Transmitter goes back to frame i and
retransmits
Go Back N - Lost Frame (2)
• Frame i lost and no additional frame sent
• Receiver gets nothing and returns neither
acknowledgement nor rejection
• Transmitter times out and sends
acknowledgement frame with P bit set to 1
• Receiver interprets this as command which it
acknowledges with the number of the next
frame it expects (frame i )
• Transmitter then retransmits frame i
Go Back N - Damaged
Acknowledgement
• Receiver gets frame i and send
acknowledgement (i+1) which is lost
• Acknowledgements are cumulative, so next
acknowledgement (i+n) may arrive before
transmitter times out on frame i
• If transmitter times out, it sends
acknowledgement with P bit set as before
• This can be repeated a number of times before
a reset procedure is initiated
Go Back N - Damaged Rejection
• As for lost frame (2)
Go Back N -
Diagram
Selective Reject
• Also called selective retransmission
• Only rejected frames are retransmitted
• Subsequent frames are accepted by the receiver
and buffered
• Minimizes retransmission
• Receiver must maintain large enough buffer
• More complex login in transmitter
Selective Reject -
Diagram
Required Reading
• Stallings chapter 7

You might also like