CEN445 NetworkProtocolsandAlgorithms

Chapter5 NetworkLayer
5.3CongestionControlAlgorithms
Bi. Nostafa Bassan Bahshan
Bepaitment of Computei Engineeiing
College of Computei anu Infoimation Sciences
King Sauu 0niveisity
muahshanksu.euu.sa
http:faculty.ksu.euu.samuahshan
Congestion
When numbei of packets sent is within
subnet caiiying capacity, all aie ueliveieu
As tiaffic incieases, packet loss happens
At veiy high tiaffic, peifoimance collapses
Both tianspoit anu netwoik layeis shaie
iesponsibility of hanuling congestion
Netwoik layei is uiiectly affecteu
In that chaptei, we look at netwoik aspect
2
Congestion
3

Goodput: rate at which useful packets are delivered by the network.

HowCongestionsHappens
Incoming packets fiom multiple inputs neeu
to go to same output line; queue builus up
If insufficient memoiy, packets lost
Auuing memoiy helps to some point
Even with memoiy, congestion gets woise
uelayeu packets timeout, ietiansmitteu
uuplicates inciease loau
Congestion collapse: loau exceeus capacity
4
HowCongestionsHappens
Slow piocessois
CP0 slow in uoing bookkeeping tasks
queues builu up
Low banuwiuth lines
cant foiwaiu packets same as aiiiving speeus
Nismatch between system paits
upgiauing some paits only shifts bottleneck
5
CongestionVSFlowControl
Congestion contiol
make suie subnet is able to caiiy offeieu tiaffic
global, involve behavioi of all hosts
all factois that uiminish caiiying capacity
Flow contiol
tiaffic between a given senuei & given ieceivei
ensuie fast senuei not oveiwhelm slow ieceivei
involve feeuback fiom ieceivei to senuei
6
Example:CongestionVSFlowControl
Flow contiol
fibei optic netwoik with 1uuu ubps
S.Computei tiy to tiansfei file to a PC 1ubps
no congestion
flow contiol neeueu to slow SC
Congestion contiol
netwoik with 1 Nbps lines, 1uuu computeis
half of them tiying to tiansfei 1uu kbps
no oveipoweiing pioblem
but total tiaffic exceeu netwoik capacity
7
ApproachestoCongestionControl
Congestion: loau (tempoiaiily) > iesouices
Two solutions come to minu:
inciease iesouices (avoiu congestion)
ueciease loau (ieact to congestion)
Solutions aie supplieu in uiffeient time scales
8
NetworkProvisioning
Builu netwoik well matcheu to tiaffic
Tuin on spaie iesouices as neeueu
0pgiaue heavily utilizeu iouteis anu links
Scale of months: long teim tienus of tiaffic
9
TrafficAwareRouting
Compute ioutes: take tiaffic into account
Shift tiaffic away fiom congestion hotspots
0seu in eaily Inteinet
Can cause iouting oscillations
Auuing weight only slows uown oscillations
Solutions.
Nultipath iouting
Shift tiaffic slowly enough that it can conveige
10
TrafficAwareRouting
11
AdmissionControl
0nce theies congestion, no moie vCs setup
In telephone: no uial tone
In uata netwoiks: tiaffic is vaiiable (buists)
Reseive iesouices: wasteful
0se statistics of pievious behavioi
Tiaue peifoimance foi acceptable iisk
Noie uetails in Quality of Seivice
12
AdmissionControl
Combineu with tiafficawaie iouting
Reuiaw netwoik without congesteu links
13
TrafficThrottling
Slow uown when congestion is appioaching
Nonitoi iesouice usage
utilization of output links
buffeiing of queueu packets insiue ioutei
numbei packets lost foi lack of buffei space
Packet loss: too late
Aveiage utilization: not account foi buists
Queue uelay uiiectly captuies congestion
14
TrafficThrottling
Naintain goou estimate of queue length:

ncw oId
: sample of instantaneous queue length
: how fast ioutei foigets iecent histoiy
EWNA: Exponentially Weighteu Noving Aveiage
smooth fluctuations
equivalent to lowpass filtei
When : iepoit congestion
15
Example
Suppose measuieu uelays aie 2u, 4u, 2S, S1 ms, iespectively.
The cuiient estimateu uelay is Su ms.
Calculate the estimateu uelay
(a) if o = u.2
J
ncw
= u.2 Su + u.8 2u = 22 ms
J
ncw
= u.2 22 + u.8 4u = S6.4 ms
J
ncw
= u.2 S6.4 + u.8 2S = 27.28 ms
J
ncw
= u.2 27.28 + u.8 S1 = Su.2S6 ms
(b) if o = u.6
J
ncw
= u.6 Su + u.4 2u = 26 ms
J
ncw
= u.6 26 + u.4 4u = S1.6 ms
J
ncw
= u.6 S1.6 + u.4 2S = 28.96 ms
J
ncw
= u.6 28.96 + u.4 S1 = 29.776 ms
16
TrafficThrottling
Choke Packets
most uiiect way, tell senuei uiiectly
senu choke packet back to souice host
oiiginal packet is taggeu, so will not geneiate
anothei choke packet, then foiwaiueu as usual
Bopbyhop backpiessuie
affect eveiy hop it passes thiough
pioviue quick ielief at the point of congestion
17
TrafficThrottling
a) A choke packet that
affects only the souice
b) A choke packet that
affects each hop it
passes thiough
18
LoadShedding
When othei methous fail
Thiow excess packets away
Teim taken fiom electiicity
blacking ceitain aieas to save entiie giiu
on hot summei uays with high uemanu
Choosing packets to uiscaiu
ianuom, may cause ietiansmissions
piioiitybaseu, iequiieu coop fiom senueis
19
LoadShedding
Ranuom Eaily Betection (REB)
uiop packets befoie situation become hopeless
iouteis maintain aveiage queue length
if exceeus thiesholu, line saiu to be congesteu
ioutei cant tell which souice most tiouble
pick packet ianuomly fiom congesteu queue
TCP iesponus to lost packets by slowing
in wiieu netwoiks, loss is iesult of congestion
foim of inuiiect feeuback
in wiieless netwoiks, cannot be useu
20