Go-Back-N - Go­Back­N (GBN) Yan Gao Feb. 17, 2006...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Go­Back­N (GBN) Yan Gao Feb. 17, 2006 Go­Back­N protocol Concept Introduce a window of size n Can inject n packets into net before hearing an ACK Sliding window Label each packet with a sequence number A window is a collection of adjacent sequence numbers The size of the collection is the sender’s window size Example Example Example Receive Window Maintenance Receiver keeps a similar window Receiver has a finite buffer Let window edge is first packet receiver wants to see Right window edge is last packet it can hold Packets < left edge or > right edge dropped Other packets are queued, allowing for fixing up out­of­order packets Example Go­Back­N Sender has to buffer all unacknowledged packets, because they may require retransmission. Receiver may be able to accept out­of­ order packets, but only up to its buffer limits. The sender needs to set timers in order to know when to retransmit a packet that may have been lost ...
View Full Document

Page1 / 8

Go-Back-N - Go­Back­N (GBN) Yan Gao Feb. 17, 2006...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online