Professional Documents
Culture Documents
Quality of
Service
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 30: QoS
30.1 DATA-FLOW CHARACTERISTICS
Applications Sensitivity to reliability, delay,
jitter, and bandwidth.
30.2 FLOW CONTROL TO IMPLEMENT QoS
oTraffic Shaping/Policing: leaky/token bucket
oScheduling (traffic shaping):
FIFO, priority , and weighted fair queuing .
oService Classes:
Quantitative– Guaranteed, an application
specifies the amount of delay and data rate.
Qualitative – Controlled-Load, tolerate some
delay but sensitive to overloaded networks and
packet loss; as Email, FTP, HTTP applications
requesting the possibility of no or low loss.
oResource Reservation (RSVP) for connection-oriented protocol:
Reserve in advance the requested resources by a data flow.
30.3
30.4 DIFFERENTIATED SERVICES (DiffServ)
oDifferentiated Services:
Priorities Applications classes.
oTraffic Conditioners:
Used to implement DiffServ.
30.4
30-1 DATA FLOW CHARACTERISTICS
30.7
Table 30.1: Sensitivity of applications to flow characteristics
30.8
30.30.3 Flow Classes
Based on the flow characteristics, we can
classify flows into groups, with each group
having the required level of each characteristic.
30.11
Figure 30.1 : FIFO queue
30.12
Figure 30.2 : Priority queuing
Q1
*
*
*
Qn
30.13
Figure 30.3 : Weighted fair queuing
30.14
30.2.2 Traffic Shaping or Policing
To control the amount and the rate of traffic.
30.15
Bursty Traffic Policing VS. Shaping:
(http://www.cisco.com/c/en/us/support/docs/quality-of-
service-qos/qos-policing/19645-policevsshape.html#traffic)
The following diagram illustrates the key difference.
Traffic Policing propagates bursts. When the traffic rate reaches the
configured maximum rate, excess traffic is dropped (or remarked).
The result is an output rate that appears as a saw-tooth with crests
and troughs.
30.17
Leaky Bucket
A water bucket leaks (outputs) in a constant rate
of water regardless of the input flow of water.
30.18
Figure 30.4: Leaky bucket
2 Mbps
7 8 9 10
30.19
Figure 30.5: Leaky bucket implementation
30.21
(http://www.cisco.com/c/en/us/td/docs/ios/12_2/qos/configuration/guide/fqos_c/qcfpolsh.html#wpxref22120)
The bucket gets tokens at a certain rate (data unit per sec, du/s).
If not enough tokens are in the bucket to send a packet, the
packet either:
o queued waiting until the bucket has enough tokens
(in the case of a shaper), OR
o discard/marked-down (in the case of a policer).
If the bucket fills to its specified capacity (max burst size) , newly
arriving tokens are discarded.
30.23
Example 30.2
Let assume that the bucket capacity is 10,000 tokens and
tokens are added at the rate of 1000 tokens per second. If the
system is idle for 10 seconds (or more), the bucket collects
10,000 tokens and becomes full. Any additional tokens will
be discarded. The maximum average rate is shown below.
30.24
30.2.3 Resource Reservation
30.25
30.2.4 Admission Control
30.27
30.3.1 Flow Specification
30.29
30.3.3 Service Classes
30.30
30.3.4 RSVP
30.32
Figure 30.8 : Resv messages
30.33
Figure 30.9 : Reservation merging
30.34
30.3.5 Problems with Integrated Services
30.35
30-3 DIFFERENTIATED SERVICES (DIFFSERV)
30.36
30.4.1 DS Field
30.37
Figure 30.10 : DS field
30.38
30.4.2 Per-Hop Behavior
30.39
Figure 30.11: Traffic conditioner
30.40