Scribd
Upload
22 views

Computer Network2.4

This document discusses various data link control protocols for frame transmission including simplex, stop and wait, and sliding window protocols. It provides details on how each protocol handles frame transmission and acknowledgments, especially in error prone channels, to maximize bandwidth utilization and prevent buffer overflow at the receiver. Sliding window protocols allow multiple frames to be in transit using sequence numbers and acknowledgments to keep track of frames. Various error recovery techniques like go-back-n and selective reject are discussed for lost or damaged frames within the sliding window.

Uploaded by

Akshay Mehta
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
22 views

Computer Network2.4

This document discusses various data link control protocols for frame transmission including simplex, stop and wait, and sliding window protocols. It provides details on how each protocol handles frame transmission and acknowledgments, especially in error prone channels, to maximize bandwidth utilization and prevent buffer overflow at the receiver. Sliding window protocols allow multiple frames to be in transit using sequence numbers and acknowledgments to keep track of frames. Various error recovery techniques like go-back-n and selective reject are discussed for lost or damaged frames within the sliding window.

Uploaded by

Akshay Mehta
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 22

Data link control

Model of Frame
Transmission

Simplex protocol
Tx expects that Rx is always ready to accept
the frame ,whatever may be frame interval
(too short or too long)
Rx should be provided with buffer capability,
since it needs time to process a frame.
Channel assumed to be errorless so no chance
of frame corrupted or missing
If too long ,leads to poor bandwidth utilization
If too short Rx suffers by flooding

Protocol for Half/full duplex


Both

prevents flooding of the Rx


Larger buffer space at Rx is required
in sliding window
Tx informed about successful
transmission of a frame by means of
acknowedgement
Variations leads to improved
bandwidth utilization

Stop and Wait

Stop and Wait Link


Utilization

Max. possible link


utilizatization
Tprop =propagation time between end1 and end2
Tframe=time required to put all frame bits
Tproc=processing time to react to an event
tack= time to transmit ack

Time to send a frame=tprop


+ tframe +tproc+ tprop+tack+tproc
frame=t
Assuming ack frame << and tproc negligible
Tf= 2 tprop+ tframe
If n frame were transmitted T=nxTf =n(2 tprop+ tframe)
Line utilization U=time spent for actual data/ total time
=n tframe / n x(2 tprop +t frame)
If a =tprop/tframe ; then U= 1 / 1+ 2a
a= d/v where d=link distance,v=velocity,l=frame length
,r=datarate
l/ r

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

Sender Sliding Window

Receiver Sliding Window

Sliding Window Example

Damaged Frame in stop & wait

Stop & wait with ARQ in error prone


channel
If frame get corrupted nack is sent and tx repeats the
same frame so tx should also have a buffer to hold the
copy of the frame till pack arrives.
Tx tied up in infinite waiting loop
if frame is lost completely, Rx will not send the ack
while tx is waiting for pack or nack
if pack /nack is lost
So Tx is provided of timer with preset waiting time ,if
ack doesnot arrive within set-time,Tx repeats the frame
if frame was arrived successfully earlier ,Rx gets
duplicated frame so it should ignore it(for this frame
numbering reqd) otherwise accept it.

Sliding window:Go-back-to n
If any frame/s missed of a window while tx is
transmitting exhaustively , Rx discards all
successive
frames till it gets the awaited frame.
So Tx has to retransmit all the frames discarded by
rx including the frames missed earlier.

Dam.frame go back to n

Lost Frame-go back to n

Sliding window-selective reject


Rx is provided with capability to
rearrange the frames belonging to a
window and then pass on to network
layer.
so if any frames missed only those
require to repeat.

Selective Reject

Line utilization in sliding window

Line utilization = L /(L +B R)


Where L= bits in frame,
B= channel capacity in bits/sec
R= round trip propagation delay in sec
If B R<< line utilization would be 100%
(more than 50%)
If B R>> line utilization would be less than
50%

You might also like