Professional Documents
Culture Documents
Chapter 3 Outline
Chapter 3 Outline
3.6 Principles of
3.4 Principles of
reliable data transfer congestion control
3.7 TCP congestion
control
Congestion:
informally: “too many sources sending too much
data too fast for network to handle”
different from flow control!
manifestations:
lost packets (buffer overflow at routers)
long delays (queueing in router buffers)
a top-10 problem!
receivers
unlimited shared
one router,
Host B
output link buffers
infinite buffers
no retransmission
maximum
out
achievable
in R/2 in R/2
throughput
Transport Layer 3-3
Causes/costs of congestion: scenario 2
one router,finite buffers
sender retransmission of lost packet
Host A
in : original data out
R/3
out
out
out
R/4
a. b. c.
“costs” of congestion:
more work (retrans) for given “goodput”
unneeded retransmissions: link carries multiple copies of pkt
Host B
Host B
3.6 Principles of
3.4 Principles of
reliable data transfer congestion control
3.7 TCP congestion
control
c o n g e s tio n
w in d o w
congestion window size
2 4 K b y te s
Saw tooth
behavior: probing
1 6 K b y te s
for bandwidth
8 K b y te s
time
tim e
RTT
first loss event:
two segm
double CongWin every ents
RTT
done by incrementing
CongWin for every ACK four segm
ents
received
Summary: initial rate
is slow but ramps up
exponentially fast time
Implementation:
Variable Threshold (ssthresh)
At loss event, Threshold is set
to 1/2 of CongWin just before
loss event
1.22 MSS
RTT L
Wow
➜ L = 2·10-10
New versions of TCP for high-speed
TCP connection 1
bottleneck
TCP
router
connection 2
capacity R
Connection 1 throughput R