Congestion Control in Computer Networks

Difficulty Level : Medium " Last Updated: 23 Aug, 2022

Read Discuss

What is congestion?
Astate occurring in network layer when the message traffic is so heavy that it slows
down network response time.

Effects of Congestion
" As delay increases, performance decreases.
" If delay increases, retransmission occurs, making situation worse.

Congestion control algorithms

Congestion Control is a mechanism that controls the entry of data packets into the
network, enabling abetter use of a shared network infrastructure and avoiding
congestive collapse.
Congestive-Avoidance Algorithms (CAA) are implemented at the TCP layer as the
mechanism to avoid congestive collapse in a network.
" There are two congestion control algorithm which are as follows:

Leaky Bucket Algorithm

The leaky bucket algorithm discovers its use in the context of network traffic shaping
or rate-limiting.
" Aleaky bucket execution and a token bucket execution are predominantly used for
traffic shaping algorithms.
This algorithm is used to control the rate at which traffic is sent to the netvwork and
shape the burst traffic to a steady traffic stream.
The disadvantages compared with the leaky-bucket algorithm are the inefficient use of
available network resources.
" The larae area of network resources such as bandwidth is not being used
effectively.
VWe use COokies to onsuro you havo the bestbrowsing expereNCe ON OUr websito. By using our
Got It !
ste you acknowledge that you have read and understoodour Cookie Policy &Privacy Policy
https://www.geeksforgeeks.org/congestion-control-in-computer-networks/ 1/7
 Networks - GeeksforGeeks
Congestion Control in Co,
.6:45 PM

understand
Let us consider an example to
the
bottom.No matter at what rate water enters
Imagine a bucket with a small hole in the
bucket is full with water additional water
bucket. the outflow is at constant rate.When the
enteringspills over the sides and is lost.

Inflow
maybe
bursty

Constant
Outflow

Similarly, each network interface contains a leaky bucket and the following steps are
involved in leaky bucket algorithm:
1. When host wants to send packet, packet is thrown into the bucket.
2. The bucket leaks at aconstant rate, meaningthe network interface transmits packets
at a constant rate.

3. Bursty traffic is convertedto a uniform traffic by the leaky bucket.

4, Inpractice the bucket is a finite queue that outputs at a finite rate.

Token bucket Algorithm

The leaky bucket algorithm has a rigid output design at an average rate independent of
the bursty traffic.
" Insome applications, when large bursts arrive, the output is allowed to speed up. This
calls for a more flexible algorithm, preferably one that never loses information.
Therefore, a token bucket algorithm finds its uses in network traffic shaping or rate
limiting.
" It is a control algorithm that indicates when traffic should be sent. This order comes
based on the display of tokens in the bucket.
" The bucket contains tokens. Each of the tokens defines a packet of predetermined size.
Tokens in the bucket are deleted for the ability to share a packet.
" When tokens are shown, a flow to transmit traffic appears in the display of tokens.
Notoken means no flow sends its packets. Hence, a flow transfers traffic up to its
peak burst rate in good tokens in the bucket.
Ne use cookes to ensure you have the best browSIng experience on our website. By using our
site you acknowledge that you have read and understood our Cookie Policy &Privacy Policy

https:/w.geeksforgeeks.orglcongestion-control-in-computer-networks/ 2/7
 GoekaforGook
Congentlon Contuol in Compute Notwokn

Need of token bucket Algorith:

how
algorithm enforces output pattern at the average rate, no matter
The leaky bucket flexible algorithm
traffic is. So in order to deal with the bursty traffic we need a
bursty the
data is not lost. One such algorithm is token bucket algjorithm.
sothat the

described as follows:
Steps of this algorithm can be

Interview Preparation DataScience

DSA Data Structures Algorithms
Hiring Challenge Trending Now
removed from the bucket, and the packet is
sent.
3. If there is a ready packet, a token is
packet cannot be sent.
4. If there is no token in the bucket, the

Let's understand with an example,

tokens, with five packets waiting to be

Infigure (A) we see a bucket holding three
capture and destroy one token. In
transmitted. For a packet to be transmitted, it must
gotten through, but the other two are
figure (B) We see that three of the five packets have
stuck waiting for more tokens to be generated.

bucket: The leaky bucket algorithm

Ways in which token bucket is superior to leaky
network, but it is very
controls the rate at which the packets are introduced in the
token bucket algorithm. In the
conservative in nature. Some flexibility is introduced in the
a certain limit). For an
token bucket, algorithm tokens are generated at each tick (up to
transmission takes
incomingpacket to be transmitted, it must capture a token and the
transmitted at the same rate
place at the same rate. Hence some of the busty packets are
if tokens are available and thus introduces some amount of flexibility in the system.

Formula: M*s=C+p*swhere S- is time taken M- Maximum output rate p- Token

arrival rate C- Capacity of the token bucket in byte

Let's understand with an example,

We use cookies to ensure you have the best browsing experience on our website. By using our
site you acknowledge that you have read and understood our Cookie Policy &Privacy Policy
https://www.geeksforgeeks.org/congestion-control-in-computer-networks/ 3/7
123, 645PM
Congestion Control in Computer
Networks -
GeeksforGeeks
Host
Host
Computer Computer
DO00
One token is
added to the The
bucket at bucket
every AT holds to
kin
O00

Network Network
(a) Before (b) After
Link to question on leaky bucket algorithm:
networks-set-8/ https:/ www.geckstorgecks.orgcomputer
This article is contributed by Vikash
Kumar. Please write comments if you find anything
incorrect,or you want to share more information about the topic discussed above
100

Related Articles
1. Congestion Control techniques in Computer Networks

2. Difference between Flow Control and CongestionControl

3 TCP Congestion Control

4. Congestion Control in Datagram Subncts

5. Slow Start Restart Algorithm For Congestion Control

6. What is DCCP (Datagram Congestlon Control Protocol)?

7. Accoss Control Tactics in Computer Networks

Prograrm to find the final slze of Congestion Window n ICP Reno

3. Viorking of Explicit Congestlon Notiflcatlon

10. What is FCHIEZolicit Convestlon Notitlcatlon)?

6:46PM What is Congestion Control Algonthm

What is Congestion Control Algorithm?

ongestion causes choking of the communication medium. When too many packets are
enlaved in a method of (he subnel, (he subnel's performance degrades. Hence, a network's
ommunication channel is called congested if packets are traversing the path and experience
elays mainly over the path's propagalion delay.
as follows:
here is two Congestioncontrol algorithm which is

eaky Bucket
network traffic shaping or rate
The leaky bucket algorithm discovers its use in the context of
record is injected into a network and
limiting.The algorithm allows controlling the rate at which a
managingburstiness in the data rate.
bucket execution are predominantly used for traffic
Aleaky bucket execution and a token
control the rate at which traffic is sent to the
shaping algorithms. This algorithm is used to
stream.
network and shape the burst trafficto a steady traffic

The figure shows the leaky bucket algorithm.

Leaky Bucket Algorithm
Incoming Packets

Outgoing Packets

the Notes bottom is

algorithm, a bucket with a volume of, say, b bytes and a hole in
In this
bucket is null, means b bytes are available as storage. A packet with a size
considered. If the
size increases by
than b bytes arrives at the bucket and will forward it. If the packet's
smaller that the bucket
b bytes, it will either be discarded or queued. It is also considered
more than second.
a constant rate of r bytes per
leaks through the hole in its bottom at
and zero when it is
outflow is considered constant when there is any packet in the bucket
The the hrl
if data flows into the bucket faster than data flows out throgh
(Otutorialspoint
empty. This defines that
the bucket overflows. 1/2
https://www.tutorialspoint.com/what-is-congestion-control-algorithm
p23.
646PAM What is Congestion Control Algorithm

The
dsadvantages compared with the leaky-bucket algorithm are the inefficient use of available
netvorkresources. The leak rate is a fixed parameter. In the case of the traffiC, volume is
deficient, the large area of network resources
such as bandwidth is not being used effectively.

Theleaky-bucket
algorithm does not allow individual flows to burst up to port speed to effectively
when there would not be resource contention in the network.
Consume network resources

Token Bucket Algorithm

at the average rate independent of the
The leaky bucket algorithm has a rigid output design
arrive, the output is allowed to speed up.
hursty traffic. In some applications, when large bursts
that never loses information. Therefore. a
This calls for a more flexible algorithm, preferably one
shaping or rate-limiting.
token bucket algorithm finds its uses in network traffic
should be sent. This order comes based on
It is acontrol algorithm that indicates when traffic
contains tokens. Each of the tokens defines a
the display of tokens in the bucket. The bucket
deleted for the ability to share a packet.
packet of predetermined size. Tokens in the bucket are
the display of tokens. No token
When tokens are shown, a flow to transmit traffic appears in
to its peak burst rate in go0d
means no flow sends its packets. Hence, a flow transfers traffic up
tokens in the bucket.

1/r seconds. The volume of

Thus, the token bucket algorithm adds a token to the bucket each
complete, the token is
the bucket is b tokens. When a token appears, and the bucket is
packet is
discarded. If a packet of n bytes appears and n tokens are deleted from the bucket, the
forwarded to the network.

are
When a packet of n bytes appears but fewer than n tokens are available. No tokens
removed from the bucket in such a case, and the packet is considered non-conformant. The

non-conformant packets can either be dropped or queued for subsequent transmission when
sufficient tokens have accumulated in the bucket.

They can also be transmitted but marked as being non-conformant. The possibility is that they
may be dropped subsequently if the network isoverloaded.

So tutorialspoint
https:/ www.tutorialspoint.com/what-is-congestion-control-algorithm 2/2
 What is Congestion Control? Describe the Congestion Control Algorithn cornmonly used-Computer Notes
23649
P

EMenu

What is
181WOTKINg iUIorraIs Home » Networking » COmmunication »
Congestion Control? Describe the Congestion
Control Algorithm commonly used
Network- Home

Network- Uses
What is
,Network -Advantages Congestion
Network -Classification Control? Describe the
Network -
ArchitectureType Congestion Control Algorithm
Nework - Networks
Vs commonly used
By Dinesh Thakur
Comms

stwerking Devices FREE ON-DEMAND TRAINING

Network - Modem Culturing

Network - Routers Types Human
Network - Bluetooth Intestinal
Network- RS-232C Organoids
Network -Hub
Network - Devices ACCESSNOW

Network- Bridges
arise in packet
Network - Repeaters Congestion is an important issue that can
Network -Routers switched network. Congestion is a situation in
Network -Switching Hubs Communication Networks in which too many packets are
degrades.
Network - Transceiver present in a part of the subnet, performance
Congestion in a network may occur when the load on the
Network -Multiplexer
network (i.e. the number of packets sent to the network) is
Network - Gateway greaterthan the capacity of the network (.e. the number of
Network - BNC Connector packets a network can handle.). Network congestion occurs
Network - Optical Connectors in case of traffic overloadina.

s Network - NICs In other words when too much traffic is offered, congestion
sets in and performance degrades sharply
Networking Protocol
Delivered
Package
Maximym Carrying Perfect
Protocol - Definition Capacity of subnet
Protocol - IP Desirable
Protocol - Aloha
Protocol - MAC Layer Congested
Protocol -Sliding Window
Protocol - Stop & Wait
Protocol -Network Protocols Packet sent
Protocol - Token Passing Concept of Congestion
 What is Congestion Control? Describe the
Congestion Control Algorithm commonly used - Computer Notes

EMenu

Polocol
- PPp

Phases
- PPP
Prolocol. Huce Discounts Available Up to
Offon MCAfee's Antrus Iirte
Prolocol-L DP
Offer
Protocol-MPLS
Protocol - MPOA
Protocol- HDLC
MCAfee
Vector
DroBocol - Distance

srouting tutorial:
Protocol - IGMP
We'll be covering the following topics in this

Protocol - ICMP
1. Causing of Congestion:
Protocol -SLIP 2. How to correct the Congestion Problem:
Protocol - DVMRP 3. Open Loop Congestion Control
Protocol - SDLC
4. Closed Loop Congestion Control
Protocol - Routing
5. Congestion control algorithms
6. Leaky Bucket Algorithm
Protocol - UDP 7. Token bucket Algorithim
Protocol -ARP and RARP

Protocol - Link-State Causing of Congestion:

Protocol -ARP Table
subnet are:
The various causes of congestion in a
. Protocol - RTP
capacity of the output
Protocol -NHRP "The input traffic rate exceeds the
start arriving on three or
lines. If suddenly, a stream of packet
output line. In this
four input lines and all need the same
Vetwork Addressing is insufficient memory
case, a queue will be built up. If there
lost. Increasing the
to hold all the packets, the packet will be
the problem, This is
Addressing - Home memory to unlimited size does not solve
they
Addressing - SubNetting because, by the time packets reach front of the queue,
When
Addressing - Classless
have already timed out (as they waited the queue).
packet that are also
timer goes off source transmits duplicate
Addressing - Classes or added again and
added to the queue. Thus same packets are
all the way to the
again, increasing the load
Classful

Addressing - IPV4 vs IPV6 destination.

Addressing - IPv6
Input Lines 1
Addressing - Subnet Mask

Addressing - MAC Address Input Lines 2 Output Line

Addressing - Supernetting
Input Lines 3 Router
Addressing - Private IP

Addressing - IPy4 Data from three input lines at same time

Addressing - Public IP

Addressing- Multihomed
" The routers are too slow to perform bookkeeping tasks
(queuing buffers, updating tables, etc.).
Addressing - Indirect
" The routers' buffer is too limited.
Addressing .Connntion in a cuhnot oan o c u r if tho nroraccore ora

htps:lecomputernotes.com/computernetworkingnotes/communication-networks/what-is-congestion-control-describe-the-congestion-control-alg.. 2/10
 What is Congestion Control?
Describe the Congestion Control
Algorithm cornmonly used - Conputer Notes
EMenu

essing-ierarchical
alwavs the case. Sometimes increase in link bandwidth can
AoUtng further deteriorate the congestion problem as higher speed
Addressing- Routing
links may make the network more unbalanced.Congestion
Addressing-Distributed can make itself worse. If a route!" does not have free buffers.
it start ignoring/discarding the newly arriving packets. When
,Routing
Routing
these packets are discarded, the sender may retransmit thern
Addressing - Data after the timer goes off. Such packets are transnitted byy the
Addressing - Services
sender again and again until the source gets the
,Addressing - IP forwardina acknowledgement of these packets. Therefore multiple
transmissions of packets will force the congestion to take
Addressing -Aging
Addressing Algorithm CR
place at the sending end.

Nstworking Medla
Free Virtual Training:
Transmission - Home Culturing Mouse
. Transmission - Modes Intestinal Organoids
Transmission - Media

Transmission - System REGISTER NOW >

Transmission - Bound

Transmission -Unbound

. Transmission - Baseband
Transmission - Wired
SSTEMCELL
Transmission - Fiber Benfits

Transmission - Infrared How to correct the Congestion Problem:

Transmission -UnGuided
Congestion Control refers to techniques and mechanisms
Transmission -Microwave
that can either prevent congestion, before it happens, or
" Transmission - Infrared
remove congestion, after it has happened. Congestion
Transmission - Radio Wave
control mechanisms are divided into two categories, one
Transmission - Network category prevents the congestion from happening and the
Transmission - Digital Signal other category removes congestion after it has taken place.
Transmission - Data Congosson
control

Transmission - Asynchronous
Transmission - Sync Vs Opon iop Cosed loop

Async
" Cable - Twisted-Pair Rovangission |dnooonT Adrriswcn Bsck Lmpsca ELolict
Pclicy Policy Poicy |Pesste Packel SioLalio Signsing
Cable -Coaxial
Ciscadog
Puley Pclcy
Cable -UTP and STP
Types of Congeslon Control Mathods
Cable - Fiber Optics

Cable -Gigabit Ethernet These two categories are:

Cable - Fast Ethernet
1.Open loop

https:l ecomputernotes.com/computernetworkingnotes/communication-networks/what-is-congestion-control-describe-the-congestion-control-alg. 3/10

Jhat is Congestion Control? Describe the
Congestion Control Algorithm cornrnonly used- Computer Notes

EMenu

. In this melhod, policies are used to prevent the congestion

before it happens.
the
"Congestion control is handled either by the source or by
destination.
loop congestion control
.The various methods used for open
are:

Retransmission Policy

that the packet it

retransmits a packet, if it feels
" The sender
corrupted.
has sent is lost or
increase the
However retransmission in general may
" implement good
need to
congestion in the network. But we
congestion.
retransmission policy to prevent
retransmission timers
The retransmission policy and the
" the same
optimize efficiency and at
need to be designed to
time prevent the congestion.

Window Policy
window
implement window policy, selective reject
To
control.
method is used for congestion

Antivirus softn

Special Savings. Down

Protection For Multiple

Go-back-n
method is preferred over
" Selective Reject
method, when timer for a packet
window as in Go-back-n
resent, although some may
times out, several packets are
Thus, this duplication may
have arrived safely at the receiver.
make congestion worse.
sends only the specific lost or
" Selective reject method
damaged packets.

Acknowledgement Policy

The acknowledgement policy imposed by

the receiver may
also affect congestion.
 What is Congostion Control? Doscribo tho Congostion Control Algorithm cornmonly us0d- Cormputor Notos
6:48 PM

iElEMonu

Models -CDMA can be usod:

"Toimplement it, several approaches
Models- STDM acknowledgement only if it has a
1. Arecelver may send an
Models - FDMA
packet lo besent.
Models - TDMA
acknowledgement when a timer
Models - SDH
2. A recelver may send an
Oxpires.
Models - CDM
acknowledge only N packets
Models - Multiplexing
3. Arecelver may also decide to
al a time.
Models -Reference
Models - Random Access Discarding Policy
Methods sensitive packets when
A router may discard less
Models- TCP/IP Architecture congestion is likely to happen.
Models - FDM and at the
" Such a discarding policy may prevent congestion
Models - IP Header transmission.
same time may not harm the integrity of the
Models - OTN
Admission Policy
Models - Amplitude Levels
Models - MIMO " An admission policy, which is a quality-of-service
Models - Plesiochronous mechanism, can also prevent congestion in virtual circuit
networks.
Media

Models - Half Duplex "Switches in a flow first check the resource requirement of a
Models - ISO Architecture
flow before admitting it to the network.

Models -Data-Link Layer "A router can deny establishing avirtual circuit connection if
Models -WDM there is congestion the "network or if there is a possibility
of future congestion.
Models - Duplex
Models -Ethernet FDSE Closed Loop Congestion Control

NewgrrE 8rithing "Closed loop congestion control mechanisms try to remove

"zhnigusa the congestion after it happens.

Svwitching - Home
Sitching- Techniques
Switching - Packet
Antivirus softw
Switching- Circuit
Switching -Message Special Savings. Down
Protection For Mul tiple
Switching - Packet Vs virtual
Circuit
Switching - Cell
Switching - ATM Cell
The various methods used for closed loop congestion
Structure
control are:
Syitching- Virtual Circuit Vs

hitps:llecomputernotes.comlcormputernetworkingnotes/communication-networks/whatis-congestion-control-describe-the-congestion-control-alg.. 5/10

9/10
 What is Congcstion Conlrol? Describe tho Corngestion Control Algorithm commonly Used -Gornputer Notes
6:48 PM

EMenu

Switching- VC Vs PVC Dostination

Switching- Packet and Source

Dotallov Downstreorn
Upstream
Circuit

Switching- VPC
Backpressure Method

" Switching - IP virtual

" The backpressure
technique can be applied only to
Switching - Logical Channels node knows the
circuit each
circuit networks. In such virtual
.Switching- TDM is coming.
upstream node from which a data flow
Switching - FDM
control, the congested node
" In this method of congestion
immediate upstream node or
Nstwork Codes
stops receiving data from the
nodes.
on nodes to become
"This may cause the upstream node
Codes -CRC upstream
congested, and they, in turn, reject data from their
Codes - Error Correction and
node or nodes.

"As shown in fig node 3 is congested and it stops receiving

Detection
Node
Codes -Hamming packets and informs its upstream node 2 to slow down.
1 slow
to
Codes -Piggybacking 2 in turns may be congested and informs node
Codes - Encoding down. Now node 1may create congestion and informs the
is
SOurce node to slow down. In this way the congestion
Techniques
alleviated. Thus, the pressure on node 3 is moved backward
Codes - Error Control
to the source to remove the congestion.
Codes -Parity Check
Choke Packet
Codes -Parity bit
Codes - Bit Error
" In this method of congestion control, congested router or
Codes - CRC
node sends a special type of packet called choke packet to
Codes- Transmission Errors the source to inform it about the congestion.
Codes -Error Detection and " Here, congested node does not inform its upstream node
Correction about the congestion as in backpressure method.
" In choke packet method, congested node sends a warning
Network directly to the source station i.e. the intermediate nodes
Oomnunlcation through which the packet has traveled are not warned.

Communication -Home
Communication - Satellite

Communication -Wireless Choke Packot mellod

Communication - Data Type

Communication - Congestion Implicit Signaling
Control

" Communication - Network

"In implicit signaling, there is no communication between the
congested node or nodes and the source.
Communication - Data
" The source guesses that there is congestion somewhere in
" Communication - Software
the network when it does not receive any acknowledgment.
 648 PM What is Congestion Control? Describe the Congestion Control Algorithrn comnonly used - Computer Noles

=Menu

Signal -Analog "In this method, the congested nodes explicitly send a signal
"Signal - Digital to the source destination to inform about the congestion.
"Signal - AnalogVs Digital "Explicit signaling is different from the choke packet method.
"Signal -Digitization In choke packed method, a separate packet is used for this
purpose whereas in explicit signaling method, the signal is
Nehvork Sscurlty included in the packets that carry data.
Explicit signaling can occur in either the forward direction or
" Security Home the backward direction .

Security - Requirements "In backward signaling, a bit is set in a packet moving in the
Security- Threats direction opposite to the congestion. This bit warns the
Security -Services source about the congestion and informs the source to slow
down.

Oihsr Links
" In forward signaling, a bit is set in a packet moving in the
direction of congestion. This bit warns the destination about
Networking - PDF Version the congestion. The receiver in this case uses policies such
as slowing down the acknowledgements to remove the
congestion.

Congestion control algorithms

Leaky Bucket Algorithm

"It is a traffic shaping mechanism that controls the amount

and the rate of the traffic sent to the network.
"A leaky bucket algorithm shapes bursty traffic into fixed rate
traffic by averaging the data rate.
" Imagine a bucket with a small hole at the bottom,

"The rate at which the water is poured into the bucket is not
fixed and can vary but it leaks from the bucket at a constant
rate. Thus (as long as water is present in bucket), the rate at
which the water leaks does not depend on the rate at which
the water is input to the bucket.

T Host
computer
Buist low
(ranable
(ate) Packets
Interlace Unregulated
conlalning Ilow
loaky
Bucket
Leaky Bucets
Bucket holds
packots

Flxod flow
(constant Regulated
rate) llow
latwork
 Cornputer Notos
Congestion Control Algorithm conmonly used -
Whal is Congest1on Control? Descibe the
6:48 PM

EMenu
packets in tne network.
can De appiled to
Ine same concept variable
coming from the source at
Consider that data is Mbps for 4
Suppose that a source sends data at 12
speeds. The source
data for 3 seconds.
seconds. Then there is no
for 2 seconds.
a rate of 10 Mbps
again transmits data at data has been
of9 seconds, 68 Mb
Thus, in a time span
transmitted.
flow will be 8
algorithm is used, the data
If a leaky bucket
constant flow is maintained.
Mbps for 9 seconds. Thus

12 D5
10
10

data
Rate
fied
and
Data
Bursty

8mb:

Tme
Fued raedata

Token bucket Algorithm

an average
" The leaky bucket algorithm allows only
is that it cannot
(constant) rate of data flow. Its major problem
deal with bursty data.
idle time of
"A leaky bucket algorithm does not consider the
idle for 10 seconds and
the host. For example, if the host was
speed for another
now it is willing to sent data at a very high
divided into 20
10 seconds, the total data transmission will be
The host
seconds and average data rate will be maintained.
is having no advantage of sitting idle for 10 seconds.
used.
" To overcome this problem, atoken bucket algorithm is
Atoken bucket algorithm allows bursty data transfers.

"A token bucket algorithm is a modification of leaky bucket in

which leaky bucket contains tokens.

" In this algorithm, a token(s) are generated at every clock

Eor a nacket to he tranemitted cvetem muct remoVe
tick

pWorkswhat_ic -Control-describe-the-congestion-control-ala. 8/10

 cormmornly used - Cornputer Notes
Congeslion Control? Describe the Congestion Control Algorithm
What is
,6.48PM

EMenu
one CIOCK
generates TuUtOKens in
For exampie, IT asystem
" contain
ticks. The bucket will
for 100
tick and the host is idle
10,000 tokens.
consume all
wants to send bursty data, it can
Now, if the host cells or bytes.
for sending 10,000
10,000 tokens at once
bucket is not
can send bursty data as long as
Thus a host
empty.

Ono lokcn oddad

per tick

Ono loken temovEd and

dlccardod por cou
imnsmission

No +Deparlure
Processor
AtNal Ful?
FFOQuQUe

Discard

Token bucket algorithm

You'll also like:

Describe the Three Styles of ComboBox

Describe the logic of atable lookup
Physical
Describe the MIS Structure Based on the
Components
Describe Difference Between Top-Down & Bottom up
Coding Techniques for Programming
.Describe Private, Protected and Public - the differences
and give examples

Fl
in

About Dinesh Thakur

httos:llecomputernotes. com/computernetworkingnotes/communication-networks/what-is-congestion-control-describe-the-congestion-control-alg... 9/10

6 49 PM Whal is Congestion Control? Describe the Congestion Control Algorilthm cornmonly Used -Computer Notes

E EMenu

generates TuU tOKens In one CIOCK

" ror exampie, IT asystem
The bucket will contain
tick and the host is idle for 100 ticks.
10,000 tokens.
data, it can consume all
Now, if the host wants to send bursty
cells or bytes.
10,000 tokens at once for sending 10,000
long as bucket is not
Thus a host can send bursty data as
empty.

One token oddad

por tick

!Onu loken 1omoved and

dlecardod por cou
Iransmission

Procossot Deoarluro
AThal Fu1?

FIFO Qucue
yos

Discard

Token buckel algorihnn

You'll also like:

Describe the Three Styles of ComboBox

Describe the logic of atable lookup
Describe the MIS Structure Based on the Physical
Components
Describe Difference Between Top-Down & Bottom up
Coding Techniques for Programming
Describe Private, Protected and Public the differences
and give examples

in

About Dinesh Thakur

uternetworkingnotes/communication-networks/what-is-congestion-control-describe-the-congestion-control-alg.. 9/10