Scribd
Upload
33 views

Quick Review of Sliding Window (Go-Back-N) : CS 681 Tutorial

This document provides a quick review of the sliding window (Go-Back-N) protocol. It discusses how sliding window protocols allow multiple frames to be "in-flight" using sequence numbers and acknowledgments to track the frames. Go-Back-N specifically is explained, including that it allows the sender to transmit multiple frames without waiting for ACKs, but requires retransmitting back to the last successfully received frame if an error occurs. Diagrams and examples are provided to illustrate how the sliding windows work at the sender and receiver in Go-Back-N.

Uploaded by

Senthil Nathan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
33 views

Quick Review of Sliding Window (Go-Back-N) : CS 681 Tutorial

This document provides a quick review of the sliding window (Go-Back-N) protocol. It discusses how sliding window protocols allow multiple frames to be "in-flight" using sequence numbers and acknowledgments to track the frames. Go-Back-N specifically is explained, including that it allows the sender to transmit multiple frames without waiting for ACKs, but requires retransmitting back to the last successfully received frame if an error occurs. Diagrams and examples are provided to illustrate how the sliding windows work at the sender and receiver in Go-Back-N.

Uploaded by

Senthil Nathan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 19

Quick Review of Sliding Window (Go-Back-N)

CS 681 Tutorial

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


Time for a bit to traverse the link

Propagation time

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

Stop and Wait Link Utilization

rdt3.0: stop-and-wait operation


sender first packet bit transmitted, t = 0 receiver

last packet bit transmitted, t = L / R

RTT

first packet bit arrives last packet bit arrives, send ACK

ACK arrives, send next packet, t = RTT + L / R

sender

L/ R RTT + L / R

.008
30.008

0.00027 microsec onds

Pipelined protocols
Pipelining: sender allows multiple, in-flight, yet-to-beacknowledged pkts

range of sequence numbers must be increased buffering at sender and/or receiver

Two generic forms of pipelined protocols: go-Back-N, selective repeat

Pipelining: increased utilization


sender first packet bit transmitted, t = 0 last bit transmitted, t = L / R receiver

RTT

first packet bit arrives last packet bit arrives, send ACK last bit of 2nd packet arrives, send ACK last bit of 3rd packet arrives, send ACK

ACK arrives, send next packet, t = RTT + L / R

Increase utilization by a factor of 3!

= sender

3* L/ R RTT + L / R

.024
30.008

0.0008 microsecon ds

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

Go Back-N: Sender sliding window

11.7

Go-Back_N: Receiver sliding window

11.8

GBN: Control variables

11.9

Go-Back-N ARQ, normal operation

11.10

Go-Back-N ARQ, lost frame

11.11 Go-Back-N ARQ: sender window size

Note:
In Go-Back-N ARQ, the size of the sender window must be less than 2m; the size of the receiver window is always 1.

GBN in action

You might also like