Scribd
Upload
11 views

TCP congestion avoidance

The document discusses TCP congestion avoidance mechanisms that prevent congestion before it occurs by predicting potential congestion and reducing data transmission rates. It details two primary mechanisms: the DEC bit, which notifies end nodes of impending congestion through a binary bit in packet headers, and Random Early Detection (RED), which drops packets based on queue length to signal congestion. Both methods aim to manage network traffic effectively and maintain optimal performance.

Uploaded by

kumari2004ramesh
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
11 views

TCP congestion avoidance

The document discusses TCP congestion avoidance mechanisms that prevent congestion before it occurs by predicting potential congestion and reducing data transmission rates. It details two primary mechanisms: the DEC bit, which notifies end nodes of impending congestion through a binary bit in packet headers, and Random Early Detection (RED), which drops packets based on queue length to signal congestion. Both methods aim to manage network traffic effectively and maintain optimal performance.

Uploaded by

kumari2004ramesh
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/ 8

TCP CONGESTION AVOIDANCE

Congestion avoidance mechanisms prevent congestion before it


actually occurs.
These mechanisms predict when congestion is about to happen
and then to reduce the rate at which hosts send data just before
packets start being discarded.
Routers help the end nodes by intimating when congestion is likely
to occur.
Congestion-avoidance mechanisms are:
o DEC bit - Destination Experiencing Congestion Bit
o RED - Random Early Detection
Dec Bit - Destination Experiencing Congestion Bit
 The first mechanism developed for use on the Digital Network
Architecture (DNA).
 The idea is to evenly split the responsibility for congestion control
between the routers and the end nodes.
 Each router monitors the load it is experiencing and explicitly
notifies the end nodes when congestion is about to occur.
 This notification is implemented by setting a binary congestion bit

in the packets that flow through the router; hence the name

DECbit.
 The destination host then copies this congestion bit into the ACK it
sends back to the source.
 The Source checks how many ACK has DEC bit set for previous window
packets.
 If less than 50% of ACK have DEC bit set, then source increases its
congestion window by 1 packet
 Otherwise, decreases the congestion window by 87.5%.
 Finally, the source adjusts its sending rate so as to avoid congestion.
 Increase by 1, decrease by 0.875 rule was based on AIMD for
 A single congestion bit is added to the packet header.
 Using a queue length of 1 as the trigger for setting the
congestion bit.
 A router sets this bit in a packet if its average queue length
is greater than or equal to 1 at the time the packet arrives.
Computing average queue length at a router using DEC bit

•Average queue length is measured over a time interval that


includes the
last busy + last idle cycle + current busy cycle
•It calculates the average queue length by dividing the curve
area with time interval.
Red - Random Early Detection
 The second mechanism of congestion avoidance is called as
Random Early Detection (RED).
 Each router is programmed to monitor its own queue length, and when
it detects that there is congestion, it notifies the source to adjust its
congestion window.
 RED differs from the DEC bit scheme by two ways:
a. In DECbit, explicit notification about congestion is sent to source,
whereas RED implicitly notifies the source by dropping a few packets.
b. DECbit may lead to tail drop policy, whereas RED drops packet
based on drop probability in a random manner. Drop each arriving
packet with some drop probability whenever the queue length exceeds
some drop level. This idea is called early random drop.
Computation of average queue length using RED

 AvgLen = (1 − Weight) X AvgLen + Weight X SampleLen


• where 0 < Weight < 1 and
• SampleLen – is the length of the queue when a
sample measurement is made.
 The queue length is measured every time a new packet
arrives at the gateway.

RED has two queue length thresholds that trigger certain


activity: MinThreshold and MaxThreshold
• When a packet arrives at a gateway it compares Avglen with these
two values according to the following rules

You might also like