800 700 600 500 400 300 200 propaga7on transmission

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: 4 4 .. 5 6 7 Acked 5 5 5 2 3 high 3 .. Finished 5 5 Too .. LAS seq. number 216 Sliding Window – Receiver (4) •  If further segments arrive (even in order) we can fill the buffer –  Must drop segments un7l app recvs! W=5 Nothing Acceptable 4 4 4 5 .. 5 6 7 Acked 5 Acked 2 3 high 3 .. Finished 5 4 4 5 5 Too .. LAS seq. number 217 14 11/4/13 Sliding Window – Receiver (5) •  App recv() takes two segments –  Window slides W=5 Acceptable 4 5 5 4 4 .. 3 .. .. 5 6 7 5 5 5 Acked 2 3 Too high Finished LAS seq. number 218 Flow Control •  Avoid loss at receiver by telling sender the available buffer space –  WIN=#Acceptable, not W (from LAS) W=5 Acceptable 4 4 .. 5 6 7 Acked 5 5 5 2 3 high 3 .. Finished 5 5 Too .. LAS seq. number 219 15 11/4/13 Flow Control (2) •  Sender uses the lower of the sliding window and flow control window (WIN) as the effec7ve window size WIN=3 4 4 .. 5 6 7 Acked 5 5 5 2 3 high 3 .. Finished 5 5 Too .. LAS seq. number 220 Flow Control (3) •  TCP- style example –  SEQ/ACK sliding window –  Flow control with WIN –  SEQ + length < ACK+WIN –  4KB buffer at receiver –  Circular buffer of bytes 221 16 11/4/13 Introduc7on to Computer Networks Retransmission Timeouts (§6.5.9) Computer Science & Engineering Retransmissions •  With sliding window, the strategy for detec7ng loss is the 7meout –  Set 7mer when a segment is sent –  Cancel 7mer when ack is received –  If 7mer...
View Full Document

This document was uploaded on 04/04/2014.

Ask a homework question - tutors are online