Decbit,Red
Decbit,Red
24.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
2 4 - 1 DATATRAF F IC
24.2
Figure 24.1 Traffic descriptors
24.3
Figure 24.2 Three traffic profiles
24.4
2 4 - 2 CONGESTION
24.5
Figure 24.3 Queues in a router
24.6
Figure Packet delay and throughput as functions of load
24.7
2 4 - 3 CONGESTIONCONTROL
24.8
Figure 24.5 Congestion control categories
24.9
Figure 24.6 Backpressure method for alleviating congestion
24.10
Figure 24.7 Choke packet
24.11
2 4 - 4 TWOEXAMPLES
24.12
Figure 24.8 Slow start, exponential increase
24.13
No
te
In the slow-start algorithm, the size of
the congestion window increases
exponentially until it reaches a
threshold.
24.14
Figure 24.9 Congestion avoidance, additive increase
24.15
Note
24.16
Note
•An implementation reacts to congestion
detection in one of the following ways:
• ❏ If detection is by time-out, a new slow
start phase starts.
• ❏ If detection is by three ACKs, a new
congestion avoidance phase starts.
24.17
Figure 24.10 TCP congestion policy summary
24.18
Figure 24.1 Congestion example
24.19
Figure 24.12 BECN Backward Explicit Congestion Notification
(BECN)
24.20
Figure 24.13 FECN Forward Explicit Congestion Notification
(FECN)
24.21
Figure 24.14 Four cases of congestion
24.22
(Destination Experiencing Congestion Bit)