network operations & administration cs 4592 lecture 15
DESCRIPTION
Network Operations & administration CS 4592 Lecture 15. Instructor: Ibrahim Tariq. Data Link Layer. Protocols (Contd.). Flow diagram for simplest (NOISLESS). Noisy Channels. We discuss three protocols in this section that use error control. Stop & Wait Automatic Repeat Request - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/1.jpg)
Network Operations & administration CS 4592
Lecture 15
Instructor: Ibrahim Tariq
![Page 2: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/2.jpg)
Data Link Layer
![Page 3: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/3.jpg)
3
Protocols (Contd.)
![Page 4: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/4.jpg)
11.4
Flow diagram for simplest (NOISLESS)
![Page 5: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/5.jpg)
5
Noisy Channels
• We discuss three protocols in this section that use error control.– Stop & Wait Automatic Repeat Request– Go-Back-N Automatic Repeat Request– Selective Repeat Automatic Repeat Request
![Page 6: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/6.jpg)
6
Stop-and-Wait Automatic Repeat Request
• Simplest flow and error control mechanism• The sending device keeps a copy of the last frame
transmitted until it receives an acknowledgement– identification of duplicate transmission (lost or delayed ACK)
• a damaged or lost frame is treated in the same way• timers introduced• positive ACK sent only for frames received safe & sound
![Page 7: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/7.jpg)
11.7
Flow diagram for Example 11.2
![Page 8: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/8.jpg)
11.8
Error correction in Stop-and-Wait ARQ is done by keeping a copy of the sent frame and retransmitting
of the frame when the timer expires.
Note
![Page 9: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/9.jpg)
11.9
In Stop-and-Wait ARQ, we use sequence numbers to number the frames.
The sequence numbers are based on modulo-2 arithmetic.
Note
![Page 10: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/10.jpg)
10
A Simplex Stop-and-Wait ARQ
1. Normal operation2. The frame is lost3. The ACK is lost4. The ACK is delayed
![Page 11: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/11.jpg)
11
Stop-and-Wait ARQ -Normal operation-
The sender will not send the next piece of data until it is sure that the current one is correctly received
sequence number necessary to check for duplicated packets
No NACK – when packet is corrupted – duplicate ACKs instead
![Page 12: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/12.jpg)
12
Stop-and-Wait ARQ -Lost or damaged frame-
roundtrip delay + processing in the receiver
![Page 13: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/13.jpg)
13
Stop-and-Wait ARQ -Lost ACK-
Importance of numbering
![Page 14: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/14.jpg)
14
Stop-and-Wait ARQ -Delayed ACK-
Importance of ACK numbering
![Page 15: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/15.jpg)
15
Duplex Stop-and-Wait ARQ• Piggybacking
– combine data with ACK (less overhead saves bandwidth)
![Page 16: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/16.jpg)
11.16
Flow diagram for Example 11.3
![Page 17: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/17.jpg)
17
Drawbacks of Stop-and-Wait ARQ
• After each frame sent the host must wait for an ACK– inefficient use of bandwidth
• To improve efficiency ACK should be sent after multiple frames
• Alternatives: Sliding Window protocols1.Go-back-N ARQ2.Selective Repeat ARQ
![Page 18: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/18.jpg)
18
Pipelining
• One task begins before the other one ends– increases efficiency in transmission
• There is no pipelining in Stop-and-Wait ARQ
![Page 19: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/19.jpg)
19
Sliding Window Protocols• Sequence numbers
– sent frames are numbered sequentially – number of frames stored in the header
• if the number of bits in the header is m than sequence number goes from 0 to 2^m-1
• Sliding window– to hold the unacknowledged
outstanding frames– the receiver window size always 1
sequence number
frame
acknowledged frames
![Page 20: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/20.jpg)
20
Go-back-N-Control variables-
• S- holds the sequence number of the recently sent frame• SF – holds sequence number of the first frame in the window• SL – holds the sequence number of the last frame• R – sequence number of the frame expected to be received
![Page 21: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/21.jpg)
21
The name of Go-back-N: why?• Re-sending frame
– when the frame is damaged the sender goes back and sends a set of frames starting from the last one ACKn’d
– the number of retransmitted frames is N
• Example:
• The window size is 4. • A sender has sent frame 6 and the timer expires
for frame 3 (frame 3 not ACKn’d). The sender goes back and re-sends the frames 3, 4, 5 and 6.
![Page 22: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/22.jpg)
22
Go-back-N -normal operation-
How many frames can be transmitted without acknowledgment?
ACK1 – not necessary if ACK2 is sent Cumulative ACK
expected sequence number
![Page 23: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/23.jpg)
23
Go-back-N -damaged or lost frame-
damaged frames are discarded!
Why are correctly received packets not buffered?
What is the disadvantage of this?
![Page 24: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/24.jpg)
24
Go-back-N -sender window size-
sequence number
![Page 25: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/25.jpg)
11.25
Flow diagram for Example 11.6
![Page 26: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/26.jpg)
11.26
Flow diagram for Example 11.7
![Page 27: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/27.jpg)
27
Go-back-N• Inefficient
– all out of order received packets are discarded• This is a problem in a noisy link
– many frames must be retransmitted -> bandwidth consuming
• Solution– re-send only the damaged frames
• Selective Repeat ARQ – avoid unnecessary retransmissions
![Page 28: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/28.jpg)
28
Stop-and-Wait ARQ is a special case of Go-Back-N ARQ in which the size of the send window is
1.
Note
![Page 29: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/29.jpg)
29
Selective Repeat ARQ• Processing at the receiver more complex• The window size is reduced to one half of 2m
• Both the transmitter and the receiver have the same window size
• Receiver expects frames within the range of the sequence numbers
![Page 30: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/30.jpg)
30
Selective Repeat ARQ-lost frame-
Note: retransmission triggered with NACK and not with expired timer
![Page 31: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/31.jpg)
31
Selective Repeat ARQ-sender window size-
![Page 32: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/32.jpg)
QUIZ
Q1)The timer of a system using the Stop-and-Wait ARQ Protocol has a time-out of 2 ms. Draw the flow graph for four frames if the round trip delays is 4ms. Assume no data frame or control frame is lost or damaged.
![Page 33: Network Operations & administration CS 4592 Lecture 15](https://reader033.vdocuments.us/reader033/viewer/2022051118/56816323550346895dd39ea9/html5/thumbnails/33.jpg)