The main focus of congestion control and quality of
service is data traffic. In congestion control we try to
avoid traffic congestion. In quality of service, we try to
create an appropriate environment for the traffic. So,
before talking about congestion control and quality of
service, we discuss the data traffic itself.
Topics discussed in this section:
Traffic Descriptor
Traffic Profiles
23.1
Figure 24.1 Traffic descriptors
23.2
Figure 24.2 Three traffic profiles
23.3
24-2 CONGESTION
Congestion in a network may occur if the load on the
network—the number of packets sent to the network—
is greater than the capacity of the network—the
number of packets a network can handle. Congestion
control refers to the mechanisms and techniques to
control the congestion and keep the load below the
capacity.
Topics discussed in this section:
Network Performance
23.4
Figure 24.3 Queues in a router
23.5
Figure Packet delay and throughput as functions of load
23.6
24-3 CONGESTION CONTROL
Congestion control refers to techniques and
mechanisms that can either prevent congestion, before
it happens, or remove congestion, after it has
happened. In general, we can divide congestion
control mechanisms into two broad categories: open-
loop congestion control (prevention) and closed-loop
congestion control (removal).
Topics discussed in this section:
Open-Loop Congestion Control
Closed-Loop Congestion Control
23.7
Figure 24.5 Congestion control categories
23.8
Figure 24.6 Backpressure method for alleviating congestion
23.9
Figure 24.7 Choke packet
23.10
24-4 TWO EXAM PLES
To better understand the concept of congestion
control, let us give two examples: one in TCP and the
other in Frame Relay.
Topics discussed in this section:
Congestion Control in TCP
Congestion Control in Frame Relay
23.11
Figure 24.8 Slow start, exponential increase
23.12
Figure 24.8 Slow start, exponential increase
23.13
Note
In the slow-start algorithm, the size of
the congestion window increases
exponentially until it reaches a
threshold.
23.14
Figure 24.9 Congestion avoidance, additive increase
23.15
Note
In the congestion avoidance algorithm,
the size of the congestion window
increases additively until
congestion is detected.
23.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.
23.17
Figure 24.10 TCP congestion policy summary
23.18
Figure 24. 1 Congestion example
23.19
Figure 24.12 BECN
23.20
Figure 24.13 FECN
23.21
Figure 24.14 Four cases of congestion
23.22
