0% found this document useful (0 votes)
29 views

Congestion Control and Quality of Service: Mcgraw-Hill ©the Mcgraw-Hill Companies, Inc., 2004

Uploaded by

shivias
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
29 views

Congestion Control and Quality of Service: Mcgraw-Hill ©the Mcgraw-Hill Companies, Inc., 2004

Uploaded by

shivias
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 28

Congestion Control

and
Quality of Service

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Data Traffic: 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.

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.1 Traffic descriptors

Traffic Descriptors: these are


qualitative values that represent a data
flow

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Average Data Rate is the no of bits sent
during a period of time, divided by the no of
seconds in that period.
i.e.
Average data rate= amount of data/ time

Peak Data Rate defines the maximum data


rate of the traffic.

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Traffic Profiles
There are three traffic profiles
1. Constant Bit Rate(CBR)
2. Variable Bit Rate(VBR)
3. Bursty

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.2 Constant-bit-rate traffic

Traffic model has a data rate that does


not change . in this case average data
rate and peak data rate are same.

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.3 Variable-bit-rate traffic

In variable bit rate the rate of the data


flow changes in time. The changes are
smooth.

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.4 Bursty traffic

In bursty data , data rate changes


suddenly in a very short time. It may jump
from zero to 1 Mbps in a few microseconds
and vice versa.

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Congestion:
congestion may occur if the load on the
network( no. of packets sent to the
network) is greater than the capacity of
the network.
Congestion control is the mechanism and
techniques to control the congestion and
keep the load below the capacity.

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Causes of Congestion:
1. if suddenly a stream of packets start
coming on three or four input lines which all
need the same output line. Then queue is build
up. If memory capacity is not sufficient to hold
all these packets, some of them will be lost.

Source 1
Same output

Source 2 Router Line

Source 3

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


2. Congestion is caused by slow processors.
This problem can be solved when processor
speed is improved.

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.7 Throughput versus network load

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Principle of congestion Control:
Congestion control is the mechanism
and techniques to control the congestion
and keep the load below the capacity.
Congestion control refers to the
techniques and mechanism which can
either prevent congestion from
happening or remove congestion after
it has taken place.
The open loop control is based on
prevention of congestion whereas
closed loop are removing congestion.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Congestion Control

Open Loop Closed Loop


Re-transmission policy Back pressure

Window Policy
Choke packet
Acknowledgement
policy Implicit
signaling
Discarding Policy
Explicit
Admission Policy Signaling

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.12 Flow characteristics

Quality of Service & Traffic


Management:

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.13 FIFO queue

Techniques to improve QoS:


1. Scheduling

FIFO Queue

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.14 Priority queuing

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.15 Weighted fair queuing

It works on Round Robin Fashion

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Technique to improve QoS: 2. Traffic Shaping:
it is a mechanism to control the amount
and the rate of traffic sent to the network.
There are two techniques that can shape
the traffic:
•Leaky Bucket
•Token Bucket

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.16 Leaky bucket

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.17 Leaky bucket implementation

A leaky bucket algorithm shapes bursty


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

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.18 Token bucket

The token bucket allows bursty traffic at a


regulated maximum rate.
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004
Figure 23.19 Path messages

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.20 Resv messages

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.21 Reservation merging

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.22 Reservation styles

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.23 DS field

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004


Figure 23.24 Traffic conditioner

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

You might also like