Congestion Control Algorithms

• General Principles of Congestion Control

• Congestion Prevention Policies
• Congestion Control in Virtual-Circuit Subnets
• Congestion Control in Datagram Subnets
• Load Shedding
• Jitter Control
 Congestion

When too much traffic is offered, congestion sets in and

performance degrades sharply.
General Principles of Congestion Control

A. Monitor the system .

– detect when and where congestion occurs.
B. Pass information to where action can be taken.
C. Adjust system operation to correct the problem.
Congestion Prevention Policies

5-26

Policies that affect congestion.

Congestion Control in Virtual-Circuit
Subnets: Admission control

(a) A congested subnet. (b) A redrawn subnet, eliminates

congestion and a virtual circuit from A to B.
 Hop-by-Hop
Choke Packets
(in high speed
nets)
It takes 30 ms for a choke

(a) A choke packet that affects only

the source.

(b) A choke packet that affects

each hop it passes through.
 Dropping packets
Load shedding:

drop new packets (keep old); good for file transfer

drop old packets (keep new); good for mulitmedia

Random Early Detection

When the average queue length exceeds a threshold,
packets are picked at random from the queue and discarded.
 Requirements

5-30

How stringent the quality-of-service requirements are.

ATM networks classify flows in four broad categories wrt
their QoS demand:

1. Constant bit rate (e.g., telephony)

2. Real-time variable bit rate (e.g., video conferencing)
3. Non-real-time variable bit rate (e.g., video streaming)
4. Available bit rate (e.g., file transfer)
 Traffic Shaping
The Leaky Bucket Algorithm

(a) A leaky bucket with water. (b) a leaky bucket with packets.
 The Token Bucket Algorithm

5-34

(a) Before. (b) After.

Token bucket allows some burstiness (up to the number of token the
bucket can hold)
 Packet Scheduling
If a router handling multiple flows uses first-come first-served
method to process packets, there is possibility of some flows being
starved.
●
Fair queuing
●
Weighted fair queuing

(a) A router with five packets queued for line O.

(b) Finishing times for the five packets.
 Integrated Services (IntServ)
A flow-based approach to QoS using resource reservation.

Set of protocols aimed at streaming multimedia and standardized by

the IETF.

Allows both unicast and multicast transmissions.

Resource reSerVation Protocol (RSVP) is used to reserve the

resources at intermediate routers between sender and receivers.

RSVP allows:
●
Multiple senders to transmit to multiple groups of receivers
●
Permits individual users to switch channels freely
●
Optimises bandwidth utilization while simultaneously eliminating
congestion.
 Label Switching and MPLS
Vendors, developed label switching/tag switching now called
MPLS (MulitProtocol Label Switching) by the IETF.
Idea is to apply labels to every packet and route using these labels.

Transmitting a TCP segment using IP, MPLS,

and PPP (router-to-router).
 Label Switching and MPLS
Comparison with virtual circuit techniques:

Similarities:
- Both used tags/circuit ids.
- Both lookup routing tables based on these tags.
- Tags have link local significance only.

Difference:
- There is no setup phase in MPLS.
- MPLS tags routes and not end-point processes (no transport
id), so greater aggregation is possible. All MPLS circuits to a
host can use the same tags. In ATM, only cells to the same
application can use the same tag.