Scribd
Upload
4 views30 pages

Congestion Control

Uploaded by

jayamaala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views30 pages

Congestion Control

Uploaded by

jayamaala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 30

Chapter 24

Congestion Control and


Quality of Service

24.1
Time Bytes
Figure 24.1 Traffic descriptors Instance generated
1 10
2 10
3 5
4 5
5 15
6 15
7 15

24.2
Figure 24.2 Three traffic profiles

24.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

24.4
Figure 24.3 Queues in a router

24.5
Figure Packet delay and throughput as functions of load

24.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

24.7
Figure 24.5 Congestion control categories

24.8
Figure 24.6 Backpressure method for alleviating congestion

24.9
Figure 24.7 Choke packet

24.10
24-4 TWO EXAMPLES

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

24.11
Figure 24.8 Slow start, exponential increase

24.12
Note

In the slow-start algorithm, the size of


the congestion window increases
exponentially until it reaches a
threshold.

24.13
Figure 24.9 Congestion avoidance, additive increase

24.14
Note

In the congestion avoidance algorithm,


the size of the congestion window
increases additively until
congestion is detected.

24.15
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.16
Figure 24.10 TCP congestion policy summary

24.17
Figure 23.26 Fast retransmission

23.18
Figure 24.11 Congestion example

24.19
24-5 QUALITY OF SERVICE

Quality of service (QoS) is an internetworking issue


that has been discussed more than defined. We can
informally define quality of service as something a
flow seeks to attain.

Topics discussed in this section:


Flow Characteristics
Flow Classes

24.20
Figure 24.15 Flow characteristics

24.21
24-6 TECHNIQUES TO IMPROVE QoS

In Section 24.5 we tried to define QoS in terms of its


characteristics. In this section, we discuss some
techniques that can be used to improve the quality of
service. We briefly discuss four common methods:
scheduling, traffic shaping, admission control, and
resource reservation.
Topics discussed in this section:
Scheduling
Traffic Shaping
Resource Reservation
Admission Control

24.22
Figure 24.16 FIFO queue

24.23
Figure 24.17 Priority queuing

24.24
Figure 24.18 Weighted fair queuing

24.25
Figure 24.19 Leaky bucket

24.26
Figure 24.20 Leaky bucket implementation

24.27
Note

A leaky bucket algorithm shapes bursty


traffic into fixed-rate traffic by averaging
the data rate. It may drop the packets if
the bucket is full.

24.28
Note

The token bucket allows bursty traffic at


a regulated maximum rate.

24.29
Figure 24.21 Token bucket

24.30

You might also like