chapter 24
DESCRIPTION
Congestion Control and Quality of ServiceTRANSCRIPT
![Page 1: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/1.jpg)
24.1
Chapter 24
Congestion Control andQuality of Service
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
![Page 2: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/2.jpg)
24.2
24-1 DATA TRAFFIC24-1 DATA TRAFFIC
The main focus of congestion control and quality of The main focus of congestion control and quality of service is service is data trafficdata traffic. In congestion control we try to . In congestion control we try to avoid traffic congestion. In quality of service, we try to avoid traffic congestion. In quality of service, we try to create an appropriate environment for the traffic. So, create an appropriate environment for the traffic. So, before talking about congestion control and quality of before talking about congestion control and quality of service, we discuss the data traffic itself.service, we discuss the data traffic itself.
Traffic DescriptorTraffic Profiles
Topics discussed in this section:Topics discussed in this section:
![Page 3: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/3.jpg)
24.3
Figure 24.1 Traffic descriptors
![Page 4: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/4.jpg)
24.4
Figure 24.2 Three traffic profiles
![Page 5: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/5.jpg)
24.5
24-2 CONGESTION24-2 CONGESTION
Congestion in a network may occur if the load on the Congestion in a network may occur if the load on the network—the number of packets sent to the network—network—the number of packets sent to the network—is greater than the capacity of the network—the is greater than the capacity of the network—the number of packets a network can handle. Congestion number of packets a network can handle. Congestion control refers to the mechanisms and techniques to control refers to the mechanisms and techniques to control the congestion and keep the load below the control the congestion and keep the load below the capacity.capacity.
Network PerformanceTopics discussed in this section:Topics discussed in this section:
![Page 6: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/6.jpg)
24.6
Figure 24.3 Queues in a router
![Page 7: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/7.jpg)
24.7
Figure Packet delay and throughput as functions of load
![Page 8: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/8.jpg)
24.8
24-3 CONGESTION CONTROL24-3 CONGESTION CONTROL
Congestion control refers to techniques and Congestion control refers to techniques and mechanisms that can either prevent congestion, before mechanisms that can either prevent congestion, before it happens, or remove congestion, after it has it happens, or remove congestion, after it has happened. In general, we can divide congestion happened. In general, we can divide congestion control mechanisms into two broad categories: open-control mechanisms into two broad categories: open-loop congestion control (prevention) and closed-loop loop congestion control (prevention) and closed-loop congestion control (removal).congestion control (removal).
Open-Loop Congestion ControlClosed-Loop Congestion Control
Topics discussed in this section:Topics discussed in this section:
![Page 9: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/9.jpg)
24.9
Figure 24.5 Congestion control categories
![Page 10: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/10.jpg)
24.10
Figure 24.6 Backpressure method for alleviating congestion
![Page 11: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/11.jpg)
24.11
Figure 24.7 Choke packet
![Page 12: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/12.jpg)
24.12
24-4 TWO EXAMPLES24-4 TWO EXAMPLES
To better understand the concept of congestion To better understand the concept of congestion control, let us give two examples: one in TCP and the control, let us give two examples: one in TCP and the other in Frame Relay.other in Frame Relay.
Congestion Control in TCPCongestion Control in Frame Relay
Topics discussed in this section:Topics discussed in this section:
![Page 13: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/13.jpg)
24.13
Figure 24.8 Slow start, exponential increase
![Page 14: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/14.jpg)
24.14
In the slow-start algorithm, the size of the congestion window increases
exponentially until it reaches a threshold.
Note
![Page 15: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/15.jpg)
24.15
Figure 24.9 Congestion avoidance, additive increase
![Page 16: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/16.jpg)
24.16
In the congestion avoidance algorithm, the size of the congestion window
increases additively until congestion is detected.
Note
![Page 17: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/17.jpg)
24.17
An implementation reacts to congestion detection in one of the following ways:❏ If detection is by time-out, a new slow start phase starts.❏ If detection is by three ACKs, a new congestion avoidance phase starts.
Note
![Page 18: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/18.jpg)
24.18
Figure 24.10 TCP congestion policy summary
![Page 19: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/19.jpg)
24.19
Figure 24.11 Congestion example
![Page 20: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/20.jpg)
24.20
Figure 24.12 BECN
![Page 21: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/21.jpg)
24.21
Figure 24.13 FECN
![Page 22: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/22.jpg)
24.22
Figure 24.14 Four cases of congestion
![Page 23: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/23.jpg)
24.23
24-5 QUALITY OF SERVICE24-5 QUALITY OF SERVICE
Quality of service (QoS) is an internetworking issue Quality of service (QoS) is an internetworking issue that has been discussed more than defined. We can that has been discussed more than defined. We can informally define quality of service as something a informally define quality of service as something a flow seeks to attain.flow seeks to attain.
Flow CharacteristicsFlow Classes
Topics discussed in this section:Topics discussed in this section:
![Page 24: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/24.jpg)
24.24
Figure 24.15 Flow characteristics
![Page 25: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/25.jpg)
24.25
24-6 TECHNIQUES TO IMPROVE QoS24-6 TECHNIQUES TO IMPROVE QoS
In Section 24.5 we tried to define QoS in terms of its In Section 24.5 we tried to define QoS in terms of its characteristics. In this section, we discuss some characteristics. In this section, we discuss some techniques that can be used to improve the quality of techniques that can be used to improve the quality of service. We briefly discuss four common methods: service. We briefly discuss four common methods: scheduling, traffic shaping, admission control, and scheduling, traffic shaping, admission control, and resource reservation.resource reservation.
SchedulingTraffic ShapingResource ReservationAdmission Control
Topics discussed in this section:Topics discussed in this section:
![Page 26: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/26.jpg)
24.26
Figure 24.16 FIFO queue
![Page 27: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/27.jpg)
24.27
Figure 24.17 Priority queuing
![Page 28: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/28.jpg)
24.28
Figure 24.18 Weighted fair queuing
![Page 29: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/29.jpg)
24.29
Figure 24.19 Leaky bucket
![Page 30: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/30.jpg)
24.30
Figure 24.20 Leaky bucket implementation
![Page 31: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/31.jpg)
24.31
A leaky bucket algorithm shapes bursty traffic into fixed-rate traffic by averaging the data rate. It may drop the packets if
the bucket is full.
Note
![Page 32: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/32.jpg)
24.32
The token bucket allows bursty traffic at a regulated maximum rate.
Note
![Page 33: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/33.jpg)
24.33
Figure 24.21 Token bucket
![Page 34: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/34.jpg)
24.34
24-7 INTEGRATED SERVICES24-7 INTEGRATED SERVICES
Two models have been designed to provide quality of Two models have been designed to provide quality of service in the Internet: Integrated Services and service in the Internet: Integrated Services and Differentiated Services. We discuss the first model Differentiated Services. We discuss the first model here. here.
SignalingFlow SpecificationAdmissionService ClassesRSVPProblems with Integrated Services
Topics discussed in this section:Topics discussed in this section:
![Page 35: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/35.jpg)
24.35
Integrated Services is a flow-based QoS model designed for IP.
Note
![Page 36: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/36.jpg)
24.36
Figure 24.22 Path messages
![Page 37: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/37.jpg)
24.37
Figure 24.23 Resv messages
![Page 38: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/38.jpg)
24.38
Figure 24.24 Reservation merging
![Page 39: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/39.jpg)
24.39
Figure 24.25 Reservation styles
![Page 40: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/40.jpg)
24.40
24-8 DIFFERENTIATED SERVICES24-8 DIFFERENTIATED SERVICES
Differentiated Services (DS or Diffserv) was Differentiated Services (DS or Diffserv) was introduced by the IETF (Internet Engineering Task introduced by the IETF (Internet Engineering Task Force) to handle the shortcomings of Integrated Force) to handle the shortcomings of Integrated Services. Services.
DS FieldTopics discussed in this section:Topics discussed in this section:
![Page 41: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/41.jpg)
24.41
Differentiated Services is a class-based QoS model designed for IP.
Note
![Page 42: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/42.jpg)
24.42
Figure 24.26 DS field
![Page 43: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/43.jpg)
24.43
Figure 24.27 Traffic conditioner
![Page 44: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/44.jpg)
24.44
24-9 QoS IN SWITCHED NETWORKS24-9 QoS IN SWITCHED NETWORKS
Let us now discuss QoS as used in two switched Let us now discuss QoS as used in two switched networks: Frame Relay and ATM. These two networks networks: Frame Relay and ATM. These two networks are virtual-circuit networks that need a signaling are virtual-circuit networks that need a signaling protocol such as RSVP.protocol such as RSVP.
QoS in Frame RelayQoS in ATM
Topics discussed in this section:Topics discussed in this section:
![Page 45: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/45.jpg)
24.45
Figure 24.28 Relationship between traffic control attributes
![Page 46: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/46.jpg)
24.46
Figure 24.29 User rate in relation to Bc and Bc + Be
![Page 47: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/47.jpg)
24.47
Figure 24.30 Service classes
![Page 48: Chapter 24](https://reader035.vdocuments.us/reader035/viewer/2022081508/558457e1d8b42adf748b5147/html5/thumbnails/48.jpg)
24.48
Figure 24.31 Relationship of service classes to the total capacity of the network