0% found this document useful (0 votes)
121 views31 pages

Unit 4 Topic 27-29 Congestion Control and QoS

1) Congestion control and quality of service (QoS) techniques aim to avoid network congestion and create an appropriate environment for different types of network traffic. 2) Congestion occurs when the load on the network exceeds its capacity, leading to increased delays and packet loss. Congestion control algorithms like TCP use additive increase and multiplicative decrease to gradually increase transmission rates while avoiding congestion. 3) QoS can be improved through techniques like scheduling, traffic shaping, resource reservation, and admission control to prioritize certain flows based on their reliability, delay, bandwidth, and jitter requirements.

Uploaded by

ashok_it87
Copyright
© © All Rights Reserved
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)
121 views31 pages

Unit 4 Topic 27-29 Congestion Control and QoS

1) Congestion control and quality of service (QoS) techniques aim to avoid network congestion and create an appropriate environment for different types of network traffic. 2) Congestion occurs when the load on the network exceeds its capacity, leading to increased delays and packet loss. Congestion control algorithms like TCP use additive increase and multiplicative decrease to gradually increase transmission rates while avoiding congestion. 3) QoS can be improved through techniques like scheduling, traffic shaping, resource reservation, and admission control to prioritize certain flows based on their reliability, delay, bandwidth, and jitter requirements.

Uploaded by

ashok_it87
Copyright
© © All Rights Reserved
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/ 31

CS 1302 Computer Networks

Congestion control and QoS


Topics to be covered
• Data Traffic
• Congestion
• Congestion Control
• Example
– Congestion control in TCP
• Quality of Service
• Techniques to Improve QoS
• Integrated Services
The main focus
Applicable for all layers

• Congestion control
– try to avoid traffic congestion
• Quality of Service
– create an appropriate environment for the traffic
Data traffic

• peak data rate : max data rate of the traffic


• average data rate = (amount of data)/time
• Maximum Burst size: max. length of time the traffic is
generated at peak rate
• effective bandwidth – the bandwidth the network needs
to allocate for the flow of traffic; F(ADR,PDR or MBS)
Traffic profiles
• Constant-bit-rate traffic
– ADR=PDR No MBS

• Variable-bit-rate traffic
– ADR !=PDR Small MBS

• Bursty traffic
– ADR & PDR Very different
– MBS significant
– main cause of congestion
Congestion
• Appears if the load on the network is greater than the
capacity of the network
– load: the number of packets sent to the network
– capacity: the number of packets a network can handle
• Why congestion occurs?
– Because routers and switches have queues that hold the
packets before and after processing
• Congestion control: keep the load below capacity
Congestion (cnt’d)

1. the packet is put at the end of the input queue


2. the processing module moves the packet from the
queue and forwards the packet
3. the packet is put in an appropriate output queue
Network performance (measured by
delay and throughput)
• delay versus load

…+ queuing delay

transmission delay +
processing delay +
propagation delay

• delay is composed of…?


Network performance (cnt’d)
• Throughput versus network load

• throughput:
number of packets passing
through the network

packets discarded and retransmitted


Congestion control
• Open-loop congestion control
– prevent congestion before it happens
• retransmission policy
– retransmission timers must optimize efficiency & prevent
congestion
• window policy
– Selective Repeat window is better than Go-back-N
• acknowledgement policy
– if not every packet is ACKed the sender may slow down
• discarding policy
– Example: in audio transmission – discard less sensitive
packets (quality of sound still preserved)
• admission policy
– QoS mechanism; switches (routers) first check resource
requirements of a flow before admitting it to the network
Congestion control (cnt’d)

• Closed-loop congestion control


– back pressure
• congested router informs previous upstream router to reduce
the outgoing traffic
– choke point
• a packet sent by a router to the source (similar to ICMP
source quench) to inform it of congestion
– implicit signaling
• the delay in receiving an ACK can be a signal that a network
is congested
– explicit signaling
• a router can explicitly send a special bit (flag) in the packet to
the source or the destination
Congestion control in TCP
• TCP assumes that the cause of lost segment is due to congestion in
the network

• Retransmission of the lost packets does not solve congestion


problem – it aggravates it

• In flow control, sender window size determined by the receiver


window – no information about the network congestion

• If the network cannot deliver data to the receiver due to congestion,


it has to inform the sender to slow down

• Congestion window: min (receiver window size, congestion window size)


Congestion avoidance in TCP
1. Slow Start (SS) & Additive Increase (AI) (AI=Congestion Avoidance)
• start with the congestion window (cwnd) = max segment size
• for each successfully received ACK increase the cwnd size by 1 until
the cwnd = threshold value; (exponential increase)
• after that, for each successfully received ACK, increase the window
size by 1/n segments up to a size of the receiver window.
n=current congestion window (cwnd) size
Multiplicative
Congestion
Decrease
Avoidance
2. Multiplicative Decrease (MD)
• if a time-out occurs the
threshold is set to one
maximum segment size
(TCP Tahoe, TCP Reno).
• if 3 duplicated ACKs received
the threshold is set to a half Slow Start
of the cwnd size
(TCP Reno)
Slow Start
w=1 Host A Host B
for (each new ACK received)
w = w+1 one se
gm ent
until (loss detected or w >= ssthresh)

RTT
two se
gm ents

four s
egmen
ts

Time
Slow Start
• Not so slow
– Exponential increase in transmission rate.
• Continues until:
– Loss detected or…
– w > ssthresh
• At first, we don’t know what ssthresh is.
– Will continue until a loss is detected.
– ssthresh = w / 2
– Restart slowstart.
• Hopefully makes it to ssthresh before another loss.
Congestion Avoidance
• When w >= ssthresh. Host A Host B

for (each new ACK received) w=4


w = w + (1/floor(w))

RTT
until (loss detected)

w = 4.25
w = 4.5
w = 4.75
w=5
On average, w increases
by 1 every RTT during
congestion avoidance.

Time
Fairness
Assume that the transmission rate in each of the links is R bps.

A congestion-control mechanism is said to be fair if the average


transmission rate of each of the N connections is approximately R/N.
Quality of Service
• “The collective effect of service performance which
determines the degree of satisfaction of a user of the
service.” (ITU-T)
– service: A set of functions offered to a user by an organization.
– user: Any entity external to the network which utilizes
connections through the network for communication.
Flow characteristics

• Reliability – if lacking means that packets or ACKs are lost


– more important with FTP, SMTP than with audio conferencing
• Delay – source to destination delay
– telephony, audio & video conferencing more prone to delay
• Jitter – variation in delay for packets belonging to the same flow
– real-time audio & video cannot tolerate high jitter
• Bandwidth
QoS requirements
Techniques to improve QoS
• Scheduling
• Traffic shaping
• Resource reservation
• Admission control
Techniques to improve QoS
• Scheduling
• Traffic shaping
• Resource reservation
• Admission control
Scheduling

FIFO queuing

Priority queuing
starvation problem
Scheduling (cnt’d)

• weighted fair queuing


Techniques to improve QoS
• Scheduling
• Traffic shaping
• Resource reservation
• Admission control
Traffic shaping
• “Mechanism to control the amount and the rate of the
traffic sent to the network.”
• Leaky bucket
Traffic shaping (cnt’d)
• Token bucket – to speed up transmission when large
bursts arrive
– future credits accumulated in the form of tokens
Techniques to improve QoS
• Scheduling
• Traffic shaping
• Resource reservation
• Admission control
Resource reservation
• “A flow of data needs resources such as buffer,
bandwidth, CPU time..”
• The quality can be improved by reserving these
resources in beforehand
– The flow doesn’t need to compete with other flows
Techniques to improve QoS
• Scheduling
• Traffic shaping
• Resource reservation
• Admission control
Admission control
• mechanism used by a router or a switch to accept or
reject a flow based on flow specifications

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy