Presentacion-Conceptos QoSV1.1

Quality of Service
Introducing QoS
© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-1

Outline
 QoS Issues
 QoS and Voice Traffic
 QoS for Unified Communications Networks
 QoS Requirements
 Methods for Implementing QoS Policy
 QoS Models

QoS Issues

Before Converged Networks
Traditional data traffic characteristics:

 Bursty data flow
 First-come, first-served access
 Mostly not time-sensitive—delays acceptable
 Brief outages are survivable
Remote Campus Main Campus
PSTN
Campus
Campus Backbone
Backbone WAN
Order Entry, Finance,

Manufacturing, Human
Resources, Training, Other
After Converged Networks
Remote Campus Main Campus
Campus Campus
Backbone WAN Backbone
Order Entry, Finance,

Manufacturing, Human
Resources, Training, Other
Traffic characteristics
Technology Problem example
Constant small-packet voice flow
Telephony “I cannot understand you; your
competes with bursty data flow
voice is breaking up.”
Critical traffic must get priority
Teleconferencing “The picture is very jerky. Voice is
Voice and video are time-sensitive not synchronized.”
Call Center “Please hold while my screen
Brief outages not acceptable refreshes.”
Quality Issues in Converged Networks
 Lack of bandwidth: Multiple flows compete for a limited

amount of bandwidth.
 End-to-end delay (fixed and variable): Packets have to
traverse many network devices and links that add up to the
overall delay.
 Variation of delay (jitter): Sometimes there is much other
traffic, which results in more delay.
 Packet loss: Packets may have to be dropped when a link is
congested.

Lack of Bandwidth
 Maximum available bandwidth equals the bandwidth of the weakest link.

 Multiple flows are competing for the same bandwidth, resulting in much
less bandwidth being available to one single application.
IP IP IP IP
Bottleneck
256 kb/s 512 kb/s

10 Mb/s 100 Mb/s
Bandwidth maximum = minimum of (10 Mb/s, 256 kb/s, 512 kb/s, 100 Mb/s) = 256 kb/s
Bandwidth available = bandwidth maximum/flows

Ways to Increase or Manage Available
Bandwidth
 Upgrade the link—the best solution but also the most expensive.
 Forward the important packets first.
 Compress the payload of Layer 2 frames (it takes time).
 Compress IP packet headers.
TCP Header Compression

RTP Header Compression
cRTP data
Compress
the header.
IP TCP data
Advanced Queuing
Compress the payload.
Stacker
Compressed Packet Predictor Weighted Fair Queuing (WFQ)
Class-Based Weighted Fair Queuing (CBWFQ)

End-to-End Delay
 End-to-end delay equals a sum of all propagation, processing, and queuing

delays in the path.
 In best-effort networks, propagation delay is fixed, and processing and
queuing delays are unpredictable.
IP IP IP IP
Propagation Propagation Propagation Propagation

Delay (P1) Delay (P2) Delay (P3) Delay (P4)
Processing and Processing and Processing and

Queuing Delay Queuing Delay Queuing Delay
(Q1) (Q2) (Q3)
Delay = P1 + Q1 + P2 + Q2 + P3 + Q3 + P4 = X ms
Types of Delay
 Processing Delay: The time to take the packet from the input interface, examine it,
and put it into the output queue
 Queuing Delay: The time a packet is held in the output queue
 Serialization Delay: The time to place the “bits on the wire”
 Propagation Delay: The time it takes to transmit a packet
Forwarding Serialization
Bandwidth
IP IP IP IP IP IP IP IP IP IP IP IP IP
Processing Queuing
Delay Delay
Propagation Delay

Reducing Delay
 Upgrade the link (best but most expensive solution).

 Forward the important packets first.
 Compress the payload of Layer 2 frames.
 Compress IP packet headers.
TCP Header Compression

RTP Header Compression
cRTP data
Compress
the header.
IP UDP RTP data

Advanced Queuing
Compress the payload.
Stacker Priority Queuing (PQ)

Compressed Packet Predictor Custom Queuing (CQ)
Strict Priority MDRR
Class-Based Low Latency Queuing (CBLLQ)
Packet Loss
 Tail drops occur when the output queue is full. These are common drops,
which happen when a link is congested.
 Many other types of drops exist, usually the result of router congestion,
that are uncommon and may require a hardware upgrade (input drop,
ignore, overrun, frame errors).
Forwarding
IP IP IP IP IP IP IP IP IP IP
Tail Drop

Preventing Packet Loss
 Upgrade the link (best but most expensive solution).

 Guarantee enough bandwidth to sensitive packets.
 Prevent congestion by randomly dropping less-important packets before
congestion occurs.
Weighted Random Early Detection

(WRED)
IP Data
Dropper Advanced Queuing
Custom Queuing (CQ)

Modified Deficit Round Robin (MDRR)
Class-Based Weighted Fair Queuing (CB-
WFQ)
QoS and Voice Traffic

QoS Defined
The ability of the network to provide

better or “special” service to a set of
users and applications to the detriment
of other users and applications
Voice – Video – Data
Consistent,
Predictable Performance

QoS Policy
A networkwide definition of the

specific levels of quality of service ABC Corporation
assigned to different classes of
network traffic Network QoS Policy
Voice Traffic
ABC Corporation example: Absolute Priority
What QoS Security When
ERP System
Voice < 150 ms SRTP over M-F
WAN Critical Priority
ERP High Encrypt 365x24
Manufacturing System
Manufacturing High Cleartext M-F
traffic Critical Priority
HTTP/HTTPS Low HTTP Proxy M-F 6-10pm
Net Surfing
Not allowed during
ERP = Enterprise resource planning
SRTP = Secure Real-Time Transport Protocol business hours

QoS for Cisco Unified
Communications
Networks

QoS for Cisco Unified Communications
Networks
DATA VOICE DATA

1. Identify traffic and its
requirements
Voice Mission- Best-

2. Divide traffic into classes Critical Effort
VOICE DATA DATA
Voice Mission- Best-

Critical Effort
3. Define QoS policies for
Always Always Only
each class first first when
after nothing
voice else
Step 1: Identify Traffic and Its Requirements
 Network audit
– Identify traffic on the
network
Network
 Business audit Statistics
– Determine how each type
of traffic is important for
Service
business
Provider
 Service levels required
– Determine required
response time

Step 2: Divide Traffic into Classes
Differentiated IP Services
Voice Low Latency

Email
Application Mission-
Guaranteed
Traffic Critical
Traffic
Classification
E-Commerce, Transactional Guaranteed Delivery
Web Browsing
Voice Best-Effort No Delivery Guarantee

Step 3: Define Policies for Each Traffic Class
 Set minimum bandwidth guarantee.

 Set maximum bandwidth limits.
 Assign priorities to each class.
 Manage congestion. Policy
Service
Provider

QoS Requirements

QoS Requirements: Voice
 Latency ≤ 150 ms*

 Jitter ≤ 30 ms* Voice
 Loss ≤ 1%*
 17–106 kb/s guaranteed
priority bandwidth per call
 150 b/s (+ Layer 2 overhead)
guaranteed bandwidth for
voice-control traffic per call Smooth
Benign
Drop-Sensitive
Delay-Sensitive
UDP Priority
* One-way requirements

QoS Requirements: Video Telephony
 Latency ≤ 150 ms*

 Jitter ≤ 30 ms* Video
 Loss ≤ 1%*
 Minimum priority bandwidth
guarantee required is:
– Video stream + 20%
– For example, a 384-kb/s
stream would require 460 Bursty
kb/s of priority bandwidth Greedy
Drop-Sensitive
Delay-Sensitive
UDP Priority
* One-way requirements

QoS Requirements: Data
 Different applications have different

traffic characteristics.
 Different versions of the same Data
application can have different
traffic characteristics.
 Classify data into relative-priority
model with no more than four to
five classes:
– Mission-critical: Locally defined
critical applications
Smooth or Bursty
– Transactional: Interactive
traffic, preferred data service Benign or Greedy
– Best-effort: Internet, email, Drop-Insensitive
unspecified traffic Delay-Insensitive
– Less-than-best-effort TCP Retransmits
(Scavenger): Napster, Kazaa,
peer-to-peer applications
Methods for
Implementing
QoS Policy

Methods for Implementing QoS Policy
 Command-line interface (CLI)

 Modular QoS CLI (MQC)
 AutoQoS
– AutoQoS VoIP (voice QoS)
– AutoQoS for the Enterprise
(voice, video, and data QoS)
 QoS Policy Manager (QPM)
– Suite of management
functions
– Enables networkwide QoS
– Monitoring and reporting

Implementing QoS Traditionally Using CLI
 Traditional method
 Nonmodular
interface Multilink1
 Cannot separate ip address 10.1.61.1 255.255.255.0
traffic classification ip tcp header-compression iphc-format
from policy definitions load-interval 30
custom-queue-list 1
 Used to augment or
ppp multilink
fine-tune newer
ppp multilink fragment-delay 10
AutoQoS method
ppp multilink interleave
multilink-group 1
ip rtp header-compression iphc-format
!

Implementing QoS with MQC
 A command syntax for class-map VoIP-RTP

configuring QoS policy match access-group 100
class-map VoIP-Control
 Reduces configuration
match access-group 101
steps and time policy-map QoS-Policy
 Configure policy, not “raw” class VoIP-RTP
per-interface commands priority 100
class VoIP-Control
 Uniform CLI across major bandwidth 8
Cisco IOS platforms class class-default
 Uniform CLI structure for fair-queue
all QoS features interface serial 0/0
service-policy output QoS-Policy
 Separates classification access-list 100 permit ip any any
engine from the policy precedence 5
access-list 100 permit ip any any dscp ef
access-list 101 permit tcp any host
10.1.10.20 range 2000 2002
10.1.10.20 range 11000 11999

Implementing QoS with AutoQoS
 AutoQoS VoIP supported both in WAN

the LAN and WAN environments
 AutoQoS Enterprise supported AutoQoS VoIP:
on WAN interfaces
auto qos voip [trust]
 Routers can deploy Enterprise
QoS policy treatment for voice, Port
video, and data traffic
 Switches can deploy QoS policy
treatments for voice by a single
command
 The [trust] option indicates that WAN
the DSCP or CoS markings of a
packet are relied upon for
classification AutoQoS Enterprise:
auto discovery qos [trust]
auto qos

Comparing QoS Implementation Methods
AutoQoS AutoQoS
CLI MQC
VoIP Enterprise
Ease of use Poor Easier Simple Simple
Ability to
OK Very good Very good Very good
fine-tune
Time to
Longest Average Shortest Shortest
deploy
Modularity Poor Excellent Excellent Excellent

QoS Models

Three Models for Quality of Service
 Best Effort: No QoS is applied to packets.

 IntServ: Applications signal to the network that they require
special QoS.
 DiffServ: The network recognizes classes that require
special QoS.

Best-Effort Model
 Internet initially based on a

best-effort packet delivery
service
Standard Mail
 The default mode for all traffic
 No differentiation between
It will get there when it gets there.
types of traffic
 Like using standard mail

IntServ Model
 Some applications have special

bandwidth and delay requirements
– Requests specific kind of
service from the network
before sending data
 IntServ guarantees a predictable
behavior of the network for these
applications
 Uses RSVP to reserve network
resources
 Guaranteed delivery: No other It will get there by 10:30 a.m.
traffic can use reserved bandwidth
 Like having your own private
courier plane

DiffServ Model
 Network traffic identified by class

 Network QoS policy enforces
differentiated treatment of traffic
classes
 You choose level of service for
each traffic class
 Like using a package delivery
service
Do you want overnight delivery?
Do you want two-day air delivery?
Do you want three- to seven-day
ground delivery?

QoS Model Evaluation
Model Drawbacks Benefits

DiffServ  No absolute service guarantee  Highly scalable
 Complex mechanisms  Many levels of quality possible
IntServ  Continuous signaling because of  Explicit resource admission
stateful architecture control (end to end)
 Flow-based approach not scalable  Per-request policy admission
to large implementations such as control
ISP networks or the Internet  Signaling of dynamic port
numbers (for example, H.323)
Best effort  No service guarantee  Highly scalable
 No service differentiation  No special mechanisms
required

Quality of Service
Understanding QoS Mechanisms and

Models

Outline
 DiffServ Model
 DSCP Encoding
 DiffServ Per-Hop Behaviors
 DiffServ Class Selector
 DiffServ QoS Mechanisms
 Cisco QoS Baseline Model

DiffServ Model

DiffServ Terminology
 Differentiated services code point (DSCP): A value in the IP header used

to select QoS treatment
 Behavior aggregate (BA): A collection of packets with the same DSCP
(one traffic class)
 Per-hop behavior (PHB): The forwarding behavior (QoS treatment)
applied at a BA by a node
BA 1 BA 2
Voice Voice Voice FTP from A to B FTP from A to B FTP from A to B
DSCP 46 DSCP 46 DSCP 46 DSCP 22 DSCP 22 DSCP 22
Host A
Host B
Apply PHB X to BA 1 Apply PHB Y to BA 1 Apply PHB Z to BA 1

Apply PHB C to BA 2 Apply PHB B to BA 2 Apply PHB A to BA 2

DiffServ Model
 QoS behaviors applied to traffic classes on a per-hop basis.

 Complex traffic classification and conditioning performed at network edge:
– Network traffic is categorized into BAs.
– Each packet belonging to a BA is marked with a DSCP value.
 Network devices in the core use the DSCP value to select a per-hop
behavior for the packet.
Traffic Flow
Classify and
Match DSCP Match DSCP Match DSCP
mark with
and select per- and select per- and select per-
DSCP at
hop-behavior. hop-behavior. hop-behavior.
network edge.

DSCP Encoding

DSCP Encoding
 DS field: The IPv4 header ToS octet or the IPv6 traffic class octet, when
interpreted in conformance with the definition given in RFC 2474
 DSCP: The first six bits of the DS field, used to select a PHB (forwarding
and queuing method)
ToS Header
Version IHL Len ID Flags Offset TTL Proto SA DA
Byte Checksum
IPv4 Packet Header
0 1 2 3 4 5 6 7
IP Precedence D T R ECN IPv4 IP Precedence

DSCP ECN DS Field

DiffServ PHBs

Per-Hop Behaviors
DSCP selects PHB throughout the network.

 Default PHB: (FIFO, tail drop)
 EF: Expedited Forwarding
 AF: Assured Forwarding
 Class-Selector: (IP precedence) PHB
0 1 2 3 4 5
1 0 1 1 1 0 DSCP
000 = Default 000 = Class Selector

101 = Expedited Forwarding
001, 010, 011, or 100 = Assured Forwarding

Expedited Forwarding PHB
 EF PHB:
– Ensures a minimum departure rate
– Guarantees bandwidth (the class is guaranteed an amount
of bandwidth with prioritized forwarding)
– Polices bandwidth (excess traffic is dropped)
 DSCP value 101110:
– Looks like IP precedence 5 to non-DiffServ devices
– Bits 0 to 2: 101 = 5 (same bits as for IP precedence)
– Bits 3 to 4: 11 (same bits as drop probability, fixed value in EF PHB)
– Bit 5: Just 0
0 1 2 3 4 5
1 0 1 1 1 0 DSCP
No Drop
5 Probability
0
Assured Forwarding PHB
 AF PHB:
– Guarantees bandwidth
– Allows access to extra bandwidth, if available
 Four standard classes (af1, af2, af3, and af4)
 DSCP value range: aaadd0
– Where aaa is a binary value of the class
– Where dd is drop probability
0 1 2 3 4 5
1 0 0 1 1 0 DSCP
aaa dd 0
Assured Forwarding PHB (Cont.)
 Each AF class uses three DSCP values.

 Each AF class is independently forwarded with its guaranteed bandwidth.
 Congestion avoidance is used within each class (drop probability).
0 0 1 0 1 0 DSCP = AF11
Class Value
AF1 001 dd 0
Drop
AF2 010 dd 0 Probability Value
AF
Value
(dd)
AF3 011 dd 0
Low 01 AF11
AF4 100 dd 0 Medium 10 AF12
High 11 AF13
Assured Forwarding PHB (Cont.)
 AF PHB does not follow the “bigger-is-better” logic

– For example: AF11 (decimal 10) and AF13 (decimal 14)
 Same queuing class, but AF11 “better” due to lower drop
Drop
Class AF1 Class AF2 Class AF3 Class AF4
Probability
Low drop AF11 AF21 AF31 AF41
probability 001010 010010 011010 100010
Decimal: 10 Decimal: 18 Decimal: 26 Decimal: 34
Medium drop AF12 AF22 AF32 AF42
probability 001100 010100 011100 100100
High drop AF13 AF23 AF33 AF43

probability 001110 010110 011110 100110

DiffServ Class Selector

DiffServ Class Selector
 Class-Selector xxx000 DSCP

 Backward compatibility with IP precedence
– Maps IP precedence to DSCP
 Differentiates probability of timely forwarding
– (xyz000) >= (abc000) if xyz > abc
– If a packet has DSCP 011000, it has a greater probability
of timely forwarding than a packet with 001000.
0 1 2 3 4 5
x x x 0 0 0 DSCP
IP Precedence
IPv4 IP Precedence
Class
Selector
DiffServ QoS
Mechanisms

QoS Mechanisms
 Classification: Each class-oriented QoS mechanism has to

support some type of classification.
 Marking: Used to mark packets based on classification,
metering, or both.
 Congestion management: Each interface must have a
queuing mechanism to prioritize transmission of packets.
 Congestion avoidance: Used to drop packets early to avoid
congestion later in the network.
 Policing and shaping: Used to enforce a rate limit based on
the metering (excess traffic is either dropped, marked, or
delayed).
 Link efficiency: Used to improve bandwidth efficiency through
compression, link fragmentation, and interleaving.

Classification
 Classification is the identifying and splitting of traffic into

different classes.
 Traffic can be classed by various means, including the
DSCP.
 Modular QoS CLI allows classification to be implemented as
a building block.
Voice
Mission-Critical
Transactional
Transactional
Transactional
Transactional
Transactional
IP
IP
IP IP
Service
Provider
Input Output
Interface Interface

Marking
 Marking each packet as a member of a network class

– Allows instant recognition throughout the network
– Also called coloring
Voice
33 11
1Voice
33
Mission-Critical Mission-Critical
111
Transactional
33 11
Transactional
Service
Provider
Input Output
Interface Interface

Congestion Management
 Evaluates packet marking to determine in which queue to place

packets
 Sophisticated queuing technologies ensure that time-sensitive
packets (voice) are prioritized, such as WFQ and LLQ
Voice Queue (First Out)
Voice Marked
Mission-Critical Mission-Critical Queue (40% bandwidth)
Packets
Transactional
Transactional Queue (20% bandwidth)
Service
Provider
Input Output
Interface Interface

Congestion Avoidance
 Random packet drop from selected queues when previously defined

limits are reached
 Helps prevent bottlenecks downstream in the network
 Can be implemented without drop using explicit congestion notification
(ECN)
– Two remaining bits in ToS field
Voice Queue (First Out)
Mission-Critical Queue (40% bandwidth)
Transactional Queue (20% bandwidth)
Service
Provider
Input Output
Interface Interface

Policing
 Dropping or marking of packets when a predefined limit is

reached
 Protection of other traffic classes to ensure that they do not
starve
Voice 121
Mission-Critical 200 LIMIT 200 REACHED!

Drop Packets
Transactional 156
IP
IP
IP IP
Service
Provider
Input Output
Interface Interface

Shaping
 Queuing of packets when a predefined limit is reached

 Forwarding of temporary bursts that would have to dropped
as above-the-threshold if long-term average limit not
exceeded
Voice 121
Mission-Critical
Mission-Critical 199 UNDER LIMIT AGAIN
Mission-Critical (Use Buffered Packets)
Buffer Transactional 156
Service
Provider
Input Output
Interface Interface

Compression
 Reducing the overhead associated with voice transport

– Mapping of IP/UDP/RTP header to 2-octet index
– Optional 2-octet checksum
 Bandwidth-saving mechanism to support large amount of traffic
over a slow link
Reduce Voice Header to 2 or 4 Bytes

Voice Header VH Voice Data
2 or 4 Bytes 20 Bytes
Service
Provider
Input Output
Interface Interface

Link Fragmentation and Interleaving (LFI)
 Breaks long data packets apart

 Interleaves delay-sensitive packets so that they are timely
forwarded rather than being clogged behind large data
packets
 Reduces jitter for delay-sensitive traffic (voice)
Fragment Data packets and interleave Voice packets.

Voice
Mission-Critical
Transactional
Queue
Service
Provider
Input Output
Interface Interface

Applying QoS to Input and Output Interfaces
Service
Provider
Input Output
Interface Interface
Classify Congestion
Management
(As close to the Mark (Always)
source as possible) Mark
Congestion (High-speed to
Avoidance low-speed links or
aggregation points)
Shaping
(Coming from a Policing Policing
higher-speed link or
aggregation) Compression
Fragmentation (Low-speed
and Interleaving WAN links)

Cisco QoS
Baseline Model

Cisco Baseline Classification
Traffic Class Description
Routing Network control traffic, such as routing protocols

Voice Interactive voice-bearer traffic
Video Conferencing Interactive video data traffic
Streaming Video Streaming media traffic
Mission-Critical Data Applications with critical importance to enterprise
Call Signaling Call signaling and control traffic
Transactional Data Database applications, transactional in nature
Network Management Network management traffic
Bulk Data Bulk data transfers, web traffic, general data
Scavenger Casual entertainment, rogue traffic, less-than-best-effort
Best Effort Default class, all noncritical traffic

Cisco Baseline Marking
L3 Classification L2
Application
IPP PHB DSCP CoS
Routing 6 CS6 48 6
Voice 5 EF 46 5
Video Conferencing 4 AF41 34 4
Streaming Video 4 CS4 32 4
Mission-Critical Data 3 AF31 26 3
Call Signaling 3 CS3 24 3
Transactional Data 2 AF21 18 2
Network Management 2 CS2 16 2

Bulk Data 1 AF11 10 1
Scavenger 1 CS1 8 1
Best Effort 0 0 0 0

Cisco Baseline Mechanisms
Application Recommended Action
Routing Rate-based queuing + RED

Voice CAC + priority queuing
Video Conferencing CAC + rate-based queuing + WRED
Streaming Video CAC + rate-based queuing + WRED
Mission-Critical Data Rate-based queuing + WRED
Call Signaling Rate-based queuing + RED
Transactional Data Rate-based queuing + WRED
Network Management Rate-based queuing + RED
Bulk Data Rate-based queuing + WRED
Scavenger No bandwidth guarantee + RED
Best Effort Bandwidth guarantee (rate-based queuing + RED)

Expansion/Reduction of Class Model
3-Class Model 5-Class Model 8-Class Model Baseline Model

Voice Voice
High- Real-Time Interactive Video
Priority Video
Streaming Video
Traffic
Call Signaling Call Signaling Call Signaling
Network IP Routing
Control Network Mgmt
Critical
Data Critical Data Mission Critical
Critical Data
Transactional
Bulk Data Bulk Data
Best Best Effort Best Effort Best Effort
Effort Scavenger Scavenger Scavenger
Model selection based on enterprise requirements
Quality of Service
Explaining Classification, Marking,

and Link Efficiency Mechanisms

Outline
 Modular QoS CLI

 Configuring Classification
 Configuring Class-Based Marking
 Trust Boundaries
 Mapping CoS to Network Layer QoS
 Link Efficiency Mechanisms Overview
 Link Speeds and QoS Implications
 Link Fragmentation and Interleaving
 Configuring MLP with Interleaving
 Configuring Class-Based Header Compression

Modular QoS CLI

Modular QoS CLI
 The MQC provides a

modular approach to Class A Class B Class C
configuration of QoS
mechanisms.
 First, build modules defining
Policy 1 Policy 2
classes of traffic.
 Then, build modules defining
QoS policies and assign
classes to policies.
 Finally, assign the policy Interface Y Interface Z
modules to interfaces.

MQC Components
Define Overall QoS Policy
1 2 3
Class Map Policy Map Service Policy
Define Classes Define QoS Policies Apply a Service

of Traffic for Classes Policy
“What traffic do we “What will be done to this “Where will this
care about?” traffic?” policy be
implemented?”
Each class of traffic Defines a policy map, which
is defined using a configures the QoS features Attaches a service
class map. associated with a traffic class policy configured
previously identified using a with a policy map to
class map. an interface.

Configuring
Classification

Classification Overview
 The component of a QoS feature that recognizes and

distinguishes between different traffic streams
 Most fundamental QoS building block
– A QoS service class is a logical grouping of packets that
are to receive a similar level of applied quality.
– A QoS service class can be any of these:
 Single user: MAC address, IP address…
 Department, customer: Subnet, interface…
 Application: Port numbers, URL…
 Without classification, all packets treated the same
 Preparatory stage for marking

MQC Classification Options
 Classification options configured in a class map

 Requires a referring policy map to be useful
 MQC classification options include the following:
– Access list – IEEE 802.1Q/ISL
– IP precedence value CoS/priority values
– IP DSCP value – Input interface
– QoS group number – Source MAC address
– MPLS experimental bits – Destination MAC address
– Protocol (including NBAR)  RTP (UDP) port range
– Using another class map – Any packet
– Frame Relay DE bit

Class Map Matching Options
 Match all requires all conditions to return a positive answer. If one

condition is not met, the class map will return a “no match” result.
 Match any requires at least one condition to return a positive
answer. If no condition is met, the class map returns a “no match.”
Match all Yes

conditions? Match
Match All
Class Map Match No
Name mode? Yes
Match Any Match at

least one No Match
condition? No

Configuring Classification with MQC
router(config)#
class-map [match-any | match-all] class-map-name
 Enters the class map configuration mode.
 Names can be a maximum of 40 alphanumeric characters.
 match-all is the default matching strategy.
router(config-cmap)#
match condition
 Uses at least one condition to match packets.

match class-map class-map
 One class map can use another class map for classification.
 Nested class maps allow generic template class maps to be
used in other class maps.
Configuring Classification with MQC (Cont.)
match not match-criteria
 The not keyword inverts the condition.
match any
 The any keyword can be used to match all packets.
match access-group {number | name} [name]
 Attaches an ACL to a class map.
class-map Well-known-services
class-map All-services
match any
access-list 100 permit tcp any any lt 1024
Configuring Classification Using Input
Interface and RTP Ports
match input-interface interface-name
 All packets received through the selected input interface are matched
by this class map.
match ip rtp starting-port-number port-range
 Matches UDP packets with source or destination port numbers
within the specified range.
 Range is between the starting port (values from 2000 to 65535) and
the sum of the starting port and the port-range (values from 0 to
16383).
class-map match-any FastEthernets

match input-interface FastEthernet1/0
match input-interface FastEthernet1/1
class-map RTP
match ip rtp 16384 16383
Configuring Classification Using Marking
match cos cos-value [cos-value cos-value cos-value]
match ip precedence ip-prec-value [ip-prec [ip-prec ]]
match [ip] dscp ip-dscp-value [ip-dscp-value ...]
 First command classifies using Layer 2 CoS (802.1Q or ISL):
– Select up to four CoS or priority values. Range 0 to 7.
 Second command classifies based on the IP precedence
– Matches any packet with one of four IP precedence values
 Third command classifies using DSCP
– Matches packet with any of the specified DSCP values
class-map Low-priority
match cos 0 1 2 3
!
class-map VoIP
match ip precedence 5
!
class-map Voice
match ip dscp ef cs5
Configuring Class-Based
Marking

Marking
 The QoS feature component that “colors” a packet (frame) so

that it can be identified and distinguished from other packets
(frames) in QoS treatment.
 Packets can be marked with one of these:
– IP precedence
– IP DSCP
– QoS group
– MPLS experimental bits
– IEEE 802.1Q, or ISL CoS or priority bits
– Frame Relay DE bit
– ATM CLP bit

Class-Based Marking Overview
 Class-based allows static per-class marking of packets.

– Can mark inbound or outbound packets
– Can be combined with any other QoS feature on output
– Can be combined with class-based policing on input
 Cisco Express Forwarding is required on the interface before
the class-based packet marking feature can be used.

Configuring Class-Based Marking
router(config)#
policy-map policy-map-name
 Creates a policy map and enters policy map configuration mode
router(config-pmap-c)#
set cos cos-value
set ip precedence ip-precedence-value
set [ip] dscp ip-dscp-value
set mpls experimental mpls-experimental-value
 Marks packets in traffic class using CoS, IP precedence, DSCP, or MPLS
EXP
 CoS option available for interfaces with ISL/802.1Q encapsulation
router(config-if)#
service-policy {input | output} policy-map-name
 Associates the policy map to an input or output interface

Class-Based Marking Configuration Example
class-map RTP_subnet_10_1_1
!
!
policy-map Set-EF-PHB
class RTP_subnet_10_1_1
set dscp ef
!
access-list 100 permit udp 10.1.1.0 0.0.0.255 range 8766 35000
any range 8766 35000
!
interface FastEthernet 0/0
service-policy input Set-EF-PHB

Implement QoS Policies

Modular QoS CLI
 Predominant methodology on Cisco IOS, Cisco IOS XE, and Cisco IOS
XR Software
 Great scalability of method
 Uniform CLI structure for all QoS features
 Separates classification engine from the policy
 There are three steps to configure QoS using MQC:
1. Classify traffic by class maps.
2. Define QoS policies (priority and bandwidth rules and actions) for
identified traffic classes via policy maps.
3. Apply the QoS policy.

MQC Configuration Steps Example
Traffic1 Traffic2
access-list 100 permit ip any any access-list 101 permit tcp any host
dscp ef 10.1.10.20 range 2000 2002
10.1.10.20 range 11000 11999
Class1 Class2
Step 1 class-map Class1 class-map Class2
match access-group 100 match access-group 101
Policy1
policy-map Policy1
class Class1
Step 3
priority 100 Interface1
Step 2 class Class2
interface GigabitEthernet 0/0/1/9
bandwidth 8
service-policy output Policy1
class class-default

Applying QoS Mechanisms on Interface
Output Policy
Input Policy
class-map g1
match qos-group 1
class-map c1 Classification class g2
match dscp ef match qos-group 2
class-map c2 Classification class g3
match dscp af31 match qos-group 3
class-map c3 policy-map out-policy
match dscp be class g1
policy-map in-policy Congestion priority level 1
class c1
set qos-group 1
management police average 20 percent
class g2
class c2
set qos-group 2
Marking bandwidth percent 20
class class-default
class c3 Shaping shape average 20 mbps
set qos-group 3
random-detect default
police rate percent 10 Policing Congestion
avoidance
service-policy input in-policy service-policy output out-policy

Hierarchical QoS
• Specifies QoS behavior at different policy levels
• Provides high degree of granularity in traffic management
• service-policy command is used to apply policy to another policy and a
policy to an interface
• Child policy is applied to a class of parent policy
Three-level hierarchical policy:
Bottom-Level Policy Middle-Level Policy Top-Level Policy
Grandparent
Child Policy Parent Policy
Policy

Hierarchical QoS Example
There are two levels of
hierarchy: Cisco IOS XR Software Example
 Child policy enforces LLQ
mechanism on three traffic policy-map CHILD_QOS
classes class voice
police rate 5 mbps
 Parent policy shapes all Child priority level 1
Policy class gold
traffic to 30 Mb/s bandwidth rate 10 mbps
class silver
 Child policy is applied on bandwidth rate 7 mbps
class-default of parent
policy policy-map PARENT_QOS

class class-default
Parent shape average 30 mbps
service-policy CHILD_QOS
Policy
service-policy output PARENT_QOS

Maintain QoS Policies

QoS Policy Modification
The modification of a QoS policy
can be accomplished at any step
during MQC configuration. Traffic1 Traffic2 Traffic3
Modification of class: If you want to add more Class1 Class2

traffic into the class.
Modification of policy: If you want to apply a Policy1 Policy2

different policy on some traffic classes.
Modification of the place where you apply the Interface1 Interface2 Interface3
policy: If you want to apply a policy on a different
interface.

MQC on Cisco IOS, Cisco IOS XE, and
Cisco IOS XR Software
Cisco IOS XR Software
• MQC configuration differs on Cisco IOS, Cisco
IOS XE, and Cisco IOS XR Software. class-map match-all premium
match dscp ef
• Cisco IOS XE Software and Cisco IOS Software end-class-map
QoS configuration are the same. !
class-map match-all gold
match dscp af31
Cisco IOS and Cisco IOS XE end-class-map
Software !
policy-map Policy1
class-map match-all premium match class premium
dscp ef bandwidth 15 mbps
class-map match-all gold !
match dscp af31 class gold
! bandwidth 10 mbps
policy-map Policy1 !
class premium class class-default
bandwidth 15000 !
class gold end-policy-map
bandwidth 10000 !
interface Gigabit 0/1/0 interface GigabitEthernet0/0/0/1
service-policy output Policy1 service-policy output Policy1

Monitor QoS Policies and Statistics

Monitor and Troubleshoot QoS
policy-map QueueOut
Configuration Example: Egress Queuing class VoIPQueue
priority
police rate percent 10
!
service-policy output QueueOut
RP/0/RP0/CPU0:CRS# show qos interface gigabitEthernet 0/1/0/3 output hw

Interface GigabitEthernet0_1_0_3 -- output policy
Total number of classes: 5
-------------------------------------------------------
LEVEL1 class: classid = 0x1
class name = VoIPQueue
No explicit weight assigned for this class
Sharq Queue ID = 18
This Q belongs to Group = 13 Maximum bandwidth equals
Queue Max. BW. = 999936 kbps interface bandwidth
Default queue limit:
TailDrop Threshold(bytes)= 1249920 10 ms × 1 Gbps / 8
WRED not configured for this class
Policer slot # = 224
Policer avg. kbps = 100097 kbps Policing to 10% of
interface bandwidth
Policer peak kbps = 0 kbps
Policer conform burst configured = 0 Kbits
Policer conform burst programmed = 2097120 bytes
Policer conform action = Just TX
Policer conform action value = 0
Policer exceed action = DROP PKT
Policer exceed action value = 0
Policy Map Display
 Verification of configured policy map applied on the interface
 Verification of running configuration
 Verification of packet counters in policy map
RP/0/RSP0/CPU0:PE#show policy-map interface GigabitEthernet 0/0/0/0
GigabitEthernet0/0/0/0 input: Mark-Ingress
Class Customer-Control-in
Classification statistics (packets/bytes) (rate - kbps)
Matched : 0/0 0
Transmitted : N/A
Total Dropped : N/A
Class Customer-Real-Time-in
Matched : 10/1180 0
Transmitted : N/A
Total Dropped : N/A
Class class-default
Matched : 38/3384 0
Transmitted : N/A
Total Dropped : N/A
GigabitEthernet0/0/1/0 direction output: Service Policy not installed

Trust Boundaries

Trust Boundary Classification
 Frame CoS may or may not be trusted by the network.

 Classification close to the edge improves scalability.
 End hosts cannot be trusted to tag a packet priority correctly.
 The outermost trusted device represents the trust boundary.
 1 and 2 are optimal, 3 is acceptable.
Endpoints Access Distribution Core WAN Agg.
Trust Boundary

Trust Boundary Marking
 For scalability, marking should be done as close to the

source as possible.
Personal Computer IP Phone Access Layer Distribution Layer

 Frames are typically  Marks voice as Layer 2  Based on  Example:
unmarked (CoS = 0) CoS (default) or Layer 3 switch Catalyst 6000
unless NIC is ToS or DSCP capabilities
802.1p- or  Mark traffic
 Reclassifies incoming PC  Accept or
802.1Q-capable data frames  Accept CoS/ToS
remap here
 If marked, IP phone  Typically:  Remap CoS to
Trust Boundary?
Trust Boundary?
Trust Boundary?
can (and by default – Voice: ToS or DSCP
does) reclassify
 CoS = 5
CoS but not DSCP
 ToS = 5
 DSCP = EF
– PC:
 Reclassify
 CoS = 0
Configuring Trust Boundary
switch(config-if)#
mls qos trust [cos [pass-through dscp] | dscp]
mls qos trust device cisco-phone
 Configures the port to trust state on an interface
 If CoS is trusted:
– CoS is used to select the ingress and egress queues
– No pass-through DSCP:
 DSCP modified according to the CoS-to-DSCP mapping
– Pass-through DSCP:
 Original DSCP retained from ingress to egress
 If DSCP is trusted, the DSCP field is retained.
– CoS modified according to the DSCP-to-CoS map
– For non-IP packets CoS set to 0, and DSCP-to-CoS map not applied
 device cisco-phone enables the Cisco Discovery Protocol trusted boundary
feature.
– Otherwise, disables the trusted setting on the switch port to prevent misuse of
the priority queue
Trust Boundary Configuration Example
mls qos
Traffic sent from the IP interface Fastethernet0/1
description To Phone1
phone to the switch is switchport mode access
trusted to ensure that mls qos trust cos
voice traffic is properly switchport voice vlan 110
switchport access vlan 10
prioritized. interface Fastethernet0/16
description To Distribution Switch
switchport mode trunk
mls qos trust dscp
Auxiliary VLAN = 110 PC VLAN = 10

COS = 5 (PVID)
COS = 0 COS = 7
Cat 6000 IP Phone

10.1.110.3 Desktop PC
171.1.10.3
802.1Q Trunk with Untrusted: Phone ASIC Native VLAN (PVID);

802.1p Layer 2 CoS Will Rewrite CoS 0 No Configuration
Changes Needed on PC
Mapping CoS to
Network Layer QoS

Mapping Layer-2 CoS to Layer-3 QoS
ToS is not used when IP IP Header Data

header is encapsulated
in an Ethernet frame.
Ethernet Header
Data
(802.1Q/ISL)
ToS bits can be mapped ToS bits can also be

to CoS bits and vice mapped to MPLS EXP
versa. bits and vice versa.
Ethernet
Label EXP S TTL
Header

Default LAN Switch Configuration
Typical default values on Cisco Catalyst switches

(may differ on some models):
 Port CoS value: 0
 Port trust state: untrusted
 CoS and DSCP values set for all incoming packets: 0
 Different settings for ingress and egress queues
 CoS assignment can be modified

Mapping CoS and IP Precedence to DSCP
 During classification, configurable mapping tables are used:

– To derive a corresponding DSCP or CoS value
– From a received CoS, DSCP, or IP precedence value
Default CoS-to-DSCP Map

CoS value 0 1 2 3 4 5 6 7
DSCP value 0 8 16 24 32 40 48 56
Default IP Precedence-to-DSCP Map

IP precedence value 0 1 2 3 4 5 6 7
DSCP value 0 8 16 24 32 40 48 56

CoS-to-DSCP Mapping Example
CoS value 0 1 2 3 4 5 6 7
DSCP value 0 8 16 24 32 40 48 56
mls qos trust cos
CoS 5 = PQ
Service
Provider
1. Packet sourced from IP phone arrives on ingress switch.

Packet
Flow 2. Switch trusts the CoS frame marking.
3. Switch maps received CoS to DSCP.
4. Switch overwrites the original DSCP with the CoS-mapped DSCP.
802.1Q IP UDP RTP VOICE PAYLOAD

CoS = 5 DSCP = EF
(46)
ETH IP UDP RTP VOICE PAYLOAD
DSCP = 40
DSCP-to-CoS Mapping Example
DSCP values 0 8, 10 16, 18 24, 26 32, 34 40, 46 48 56
CoS values 0 1 2 3 4 5 6 7
CoS 5 = PQ
Service
Provider
2950
Packet flow
802.1Q IP UDP RTP VOICE PAYLOAD

CoS = 5 DSCP = 40
1. VoIP packet arrives on switch with DSCP 40

2. Packet processed and placed in output queue
3. Switch maps DSCP to CoS
4. Switch encapsulates packet in 802.1Q, using the mapped CoS value
5. Switch forwards the frame
Configuring Mapping
switch(config-if)#
mls qos cos {default-cos | override}
 Sets CoS for all incoming packets that are untagged
 override option overwrites the received CoS, even if port is trusted
switch(config)#
mls qos map cos-dscp dscp1...dscp8
 Defines eight DSCP values that correspond to CoS values 0 to 7
 Mapping performed only on ports that trust incoming CoS
switch(config)#
mls qos map dscp-cos dscp-list to cos
 Maps dscp-list (up to 13 DSCP values) to the corresponding CoS
value (range from 0 to 7)

Mapping Example
802.1Q trunk
(VLAN 11,111) Tagged 802.1Q (Voice VLAN 111)
Fast 0/1 Fast0/2
Untagged 802.3 (Native VLAN 11)
mls qos
mls cos map cos-dscp 0 10 18 26 34 46 48 56
!
interface Fastethernet0/1
switchport mode trunk
mls qos trust cos
!Map to DSCP using the mapping table
!
interface Fastethernet0/2
switchport mode access
mls qos cos 1
!Untagged frames get CoS=1 instead of default 0
mls qos trust cos
!Packets from IP phone are mapped using CoS-DSCP table
Link Speeds and
QoS Implications

Link Speeds and QoS Implications
Slow Link Medium-Speed High-Speed

Characteristics
(< 768 kb/s) (768–2048 kb/s) (> 2048 kb/s)
Support for Not Yes Yes
interactive video recommended
LFI Mandatory Not required Not
recommended
cRTP Recommended Optional Not
recommended
Recommended 3–5 classes 3–5 classes 5–11 classes
class model

Link Fragmentation
and Interleaving

Link Fragmentation and Interleaving
 Splits packets into smaller fragments and interleaves them

with other packets
– Required on slow links (< 768 kb/s)
 Cisco IOS Software LFI mechanisms include:
– Multilink PPP with interleaving
 PPP links
Without LFI Voice Data Voice
With LFI Data Data Data Voice Data Voice
Fragment Size

Fragment Size Recommendation
Recommended
Link 10 ms 20 ms 30 ms 40 ms 50 ms 100 ms 200 ms
(kb/s) (Bytes) (Bytes) (Bytes) (Bytes) (Bytes) (Bytes) (Bytes)
56 70 140 210 280 350 700 1400
64 80 160 240 320 400 800 1600
128 160 320 480 640 800 1600 3200
256 320 640 960 1280 1600 3200 6400
512 640 1280 1920 2560 3200 6400 12800
768 1000 2000 3000 4000 5000 10000 20000
Link speed in b/s

Fragment size (bytes) = x Serialization Delay in sec
8 bits

Configuring MLP
with Interleaving

MLP with Interleaving Configuration Overview
Configuration steps:
 Enable MLP on an interface (using a multilink group interface)
 Enable MLP interleaving on the multilink interface
 Specify maximum fragment size by setting the maximum delay
on the multilink interface

Configuring MLP with Interleaving
router(config-if)#
ppp multilink
 Enables MLP
router(config-if)#
 Enables interleaving of frames with fragments
router(config-if)#
ppp multilink fragment delay delay
 Configures maximum fragment delay in milliseconds or microseconds
 Router calculates the maximum fragment size from the interface bandwidth
and the maximum fragment delay
 Fragment size = interface bandwidth * max fragment delay
 Default maximum fragment delay is 30 ms

MLP with Interleaving Example
Serial 0/0
WAN
Encapsulation PPP
interface Multilink1
ip address 172.22.130.1 255.255.255.252
ppp multilink
ppp multilink group 1
ppp multilink fragment delay 10
bandwidth 128
service-policy output llq-policy
!
interface Serial0/0
no ip address
encapsulation ppp
ppp multilink
ppp multilink group 1

Class-Based RTP
Header Compression

Header Compression Overview
 RTP header compression:

– Maps IP, UDP, and RTP headers to an index
 40 bytes (20 + 8 + 12) to 2 or 4 (with checksum)
 By default, 2 bytes (checksum off)
– Used to reduce delay and increase throughput for RTP
– Most effective on slow links (< 768 kb/s)
– Enabled on a link-by-link basis

RTP Header Compression Example
 Link parameters: PPP (6 bytes overhead), 64 kb/s

 VoIP: G.729 (50 samples per second, 20 bytes per sample)
6 20 8 12 20 6 2 20
PPP IP UDP RTP Voice PPP cRTP Voice
46 20 8 20
Overhead = 46 / (46 + 20) = 70% Overhead = 8 / (8 + 20) = 29%
Delay = (46 + 20) / 64 kb/s * 8 = 8 ms Delay = (8 + 20) / 64 kb/s * 8 = 3.5 ms
Bandwidth = (46 + 20) * 50 * 8 = 26.4 kb/s Bandwidth = (8 + 20) * 50 * 8 = 11.2 kb/s
2 voice sessions / 64 kb/s 5 voice sessions / 64 kb/s
PPP PPP Layer 2+ Layer 2+ with

Voice Layer 2+
Codec Layer 2+ Bandwidth with cRTP
Bandwidth Overhead
Bandwidth cRTP Overhead
G.711 64 kb/s 82.4 kb/s 22% 67.2 kb/s 5%
G.729 8 kb/s 26.4 kb/s 70% 11.2 kb/s 29%

Configuring Class-Based Header
Compression
compression header ip [rtp | tcp ]
 Enables RTP or TCP IP header compression:
– In a policy map
– For a specific traffic class
 If the rtp or tcp option is not specified, both RTP and TCP
header compressions are configured.
 The number of concurrent compressed connections is
automatically determined based on interface bandwidth.
 Can be used at any level in the policy map hierarchy
configured with MQC.

Class-Based RTP Header Compression
Configuration Example
Serial 0/0
WAN
Encapsulation PPP
class-map voip
match protocol rtp
!
policy-map cust1
class voip
priority 384
compression header ip rtp
!
<output omitted>
!
interface serial0/0
service-policy output cust1
<output omitted>

Quality of Service
Managing Congestion and Rate

Limiting

Outline
 Congestion and Its Solutions

 Policing and Shaping
 Measuring Traffic Rates
 Class-Based Policing
 Configuring Class-Based Policing
 Class-Based Shaping
 Configuring Class-Based Shaping
 Low-Latency Queuing
 Configuring LLQ
 Calculating Bandwidth for LLQ

Congestion and
Its Solutions

Congestion and Queuing: Speed Mismatch
 Speed mismatches are the most typical causes of congestion.

 Possibly persistent when going from LAN to WAN.
 Usually transient when going from LAN to LAN.
IP IP IP IP IP
1000 Mb/s 2 Mb/s

WAN
IP IP IP IP IP
1000 Mb/s
Direction of Data Flow

Congestion and Queuing: Aggregation
IP IP IP IP IP
N * 1 Mb/s
HQ
1 Mb/s 2 Mb/s
WAN
Chokepoint
Remote
IP IP IP IP IP
1000 Mb/s
1000 Mb/s
Chokepoint
Direction of Data Flow

Queuing Components
 Congestion:
– Hardware queue is full
– Hardware queue always FIFO
 No congestion:
– Packets bypass software queue and go directly into hardware queue
Hardware Hardware
queue full? No Queue (TxQ)
Yes
Software
Queue

Software Interfaces
 Software-only interfaces cannot perform queuing

– Primarily subinterfaces and tunnels
– Have no concept of departure rate
– No hardware directly tied to them
 Solution: hierarchical MQC
 Shaper limits aggregate bandwidth
 Software interfaces mapped to classes within the shaper
BW
Sub-If .1 Add/Drop Queue 1
Interface
Shaper Hardware
Queue
BW
Sub-If .2 Add/Drop Queue 2
MQC Policy

Policing and Shaping

Policing and Shaping Overview
 These mechanisms must classify packets before policing or shaping the

traffic rate.
 Traffic shaping queues excess packets to stay within the desired traffic rate.
 Traffic policing drops or marks excess traffic to stay within a traffic rate limit.
3
1
2
Transmit, drop, or
Classify Policer mark, then transmit
the packets.
3
1
2
Buffer
Classify Shaper exceeding
packets.

Policing and Shaping Comparison
Policing Shaping
Incoming and outgoing directions Outgoing direction only
Out-of-profile packets are dropped Out-of-profile packets are queued until a
Dropping causes TCP retransmits buffer gets full
Supports packet marking or Buffering minimizes TCP retransmits
re-marking Marking or re-marking not supported
Less buffer usage (shaping requires an Shaping supports interaction with Frame
additional shaping queuing system) Relay congestion indication
Traffic Rate Traffic Rate

Traffic
Traffic
Time Time
Policing Shaping

Measuring Traffic Rates

Single Token Bucket Operations
Bc of tokens are added to the

bucket at regular intervals, every Tc.
Number of tokens
Outgoing Packet sufficient for Hardware
packet size? Queue
Interface
Bucket size = Bc + Be (bytes)

Each forwarded packet consumes tokens (equal to packet size).
On average, Bc of data is transmitted every Tc.
Occasionally, Bc + Be of data can be transmitted if unused tokens have
been accumulated in previous intervals.
Bc = Committed burst (amount of data guaranteed to be delivered in one time interval)

Be = Exceed burst (additional amount of data attempted to be delivered if no
congestion)

Single Token Bucket
 If sufficient tokens are available (conform action):

– Tokens equivalent to the packet size are removed from
the bucket.
– The packet is transmitted.
Token Bucket
700
Bytes
Conform
500 Bytes 500 Bytes
Transmit

Single Token Bucket (Cont.)
 If sufficient tokens are not available (exceed action):

– Drop (or mark) the packet
Token Bucket
200
Bytes
Remain
Exceed
3300 Bytes
300
00 By
By tes
30
tes Drop
0
By
tes

Class-Based Policing

Single Token Bucket Class-Based Policing
 Bc is normal burst size

 Tc is the time interval
 CIR is the committed information rate
 CIR = Bc / Tc
Token Arrival Excess tokens

Rate (CIR) are discarded
Token bucket
Bc

Dual Token Bucket Single-Rate, Class-Based
Policing
 Bc is the normal burst size.

 Tc is the time interval.
 CIR is the committed information rate.
 CIR = Bc / Tc
Overflow
Token Arrival Excess tokens
Rate (CIR) are discarded.
Bc Be
Packet of No No
B < TC B < TE
Size B
Yes Yes
Conform Exceed Violate

Dual-Rate Class-Based Policing
 Tc: Tokens in CIR bucket

 Tp: Tokens in PIR bucket
 Enforce traffic policing according to two separate rates:
– Committed information rate
– Peak information rate
Token Arrival Token Arrival
Rate (PIR) Rate (CIR)
Tp Tc
Packet No No
B > Tp B > Tc
of Size B
Yes Yes
Violate Exceed Conform
Policing

Class-Based Policing Implementation
Feature Description
Configuration MQC
method
Implementations Single or dual token bucket, single or dual rate
Conditions Conform, exceed, violate
Actions Drop, set (remark), transmit
Multiactions Applying two or more set parameters as a conform
or exceed or violate action

Configuring Class-Based Policing
police {cir cir} [bc conform-burst] {pir pir} [be peak-
burst] [conform-action action] [exceed-action action]
[violate-action action]
 Specifies both the CIR and the PIR for two-rate traffic
policing
 CIR = committed information rate (b/s)
 PIR = peak information rate (b/s)
 The Bc and Be keywords and their associated arguments
(conform-burst and peak-burst, respectively) are optional.
– bc default: 1500 bytes or CIR / 32, whichever is higher
– be default: Equal to Bc

Class-Based Policing Example:
Single Rate, Single Token Bucket
www.123.com
Fast 0/0
Police incoming traffic
www.456.com from the web servers.
class-map www.123.com
match source-address mac 000d.dddf.0480
!
match source-address mac 000d.dddc.ad21
!
policy-map ServerFarm
class www.123.com
police 512000 conform-action transmit exceed-action drop
class www.456.com
police 256000 conform-action transmit exceed-action drop
!
service-policy input ServerFarm

Class-Based Policing Example:
Single Rate, Dual Token Bucket
www.123.com
Fast 0/0
Police incoming traffic
www.456.com from the web servers.
match source-address mac 000d.dddf.0480
!
match source-address mac 000d.dddc.ad21
!
policy-map ServerFarm
class www.123.com
police 512000 conform-action set-prec-transmit 4 exceed-action
set-prec-transmit 3 violate-action drop
class www.456.com
police 256000 conform-action set-prec-transmit 4 exceed-action
set-prec-transmit 3 violate-action drop
!
service-policy input ServerFarm
Class-Based Shaping

Two Traffic Shaping Methods
Shaping to Average Rate Shaping to Peak Rate

Characteristics Forwarding packets at the Forwarding packets at the peak
configured average rate rate of up to Bc + Be of traffic at
(Bc of traffic at every Tc). every Tc. However, traffic sent
Allowed bursts up to Be above the CIR may be dropped
when extra tokens during network congestion.
available.
Recommended Conservative. Network has additional
use More common method. bandwidth available.
Application tolerates occasional
packet loss.

Shaping

Configuring Class-Based Shaping
shape {average | peak} average-bit-rate [Bc] [Be]
shape {average | peak} percent [Bc] [Be]
 Configures shaper in b/s or percent
 Recommended to omit the Bc and Be to let Cisco IOS
Software select optimal values

Class-Based Shaping Example
Shaping to 16 kb/s
Serial 0/0
IP WAN
Serial 0/1
Shaping to 32 kb/s
class-map Shape
match protocol citrix
!
policy-map ShapeAvg
class Shape
shape average 16000 Cisco IOS Software calculated values:
! Bc = Be = 8000 bits, Tc = 500 ms
policy-map ShapePeak
class Shape
shape peak 16000 Peak rate = Avg. rate * (1 + Be / Bc)
! = 16000 * (1 + 8000 / 8000)
interface Serial0/0
= 32000 b/s
service-policy output ShapeAvg
!
interface Serial0/1
service-policy output ShapePeak

Hierarchical Class-Based Shaping with
CBWFQ Example
 Moves the bottleneck to the local interface

– To manage congestion and prevent uncontrolled drop in WAN
 Divides the aggregate bandwidth among classes
– Can be used to map packets from software interfaces
Child
Policy Map
Shape policy-map child-cbwfq
cust1 384 kb/s class subclass-x
bandwidth percent 50
class subclass-y
class subclass-z
subclass-x subclass-y subclass-z bandwidth percent 10
!
50% 20% 10% policy-map shape-all
class class-default
Parent shape average 384000
service-policy child-cbwfq
Policy Map
!
interface Serial 0/0
service out cust-policy

Low-Latency Queuing

Class-Based Weighted Fair Queuing
and Low-Latency Queuing
CBWFQ:
 Mechanism that is used to guarantee bandwidth to classes
– Each class has a reserved queue
– Each class can perform WRED to avoid congestion
– Each class gets more than reserved bandwidth when there is no
congestion
 Unused bandwidth allocated proportionally to guarantees
LLQ:
 Adds priority queue to CBWFQ for real-time traffic
 High-priority class:
– Low-latency propagation of packets
– Guaranteed bandwidth
– Policing to guaranteed bandwidth when congestion occurs
LLQ Architecture
 Priority queue served first within guaranteed bandwidth

 CBWFQ classes protected from starvation by policing of the
priority queue
Forwarded Packets
Priority BW Priority
class? Policing Queue
Interface
CBWFQ Hardware
Queue
Tail Drop BW
Class1? Queue 1
(WRED)
CBWFQ
Schedule
r
Class Tail Drop Default BW
default? (WRED) Queue
MQC Classification MQC Policy

LLQ Benefits
 High-priority classes are guaranteed:

– Low-latency propagation of packets
– Bandwidth
 Consistent configuration and operation across all media types
 Entrance criteria to a class can be defined by an ACL:
– Defines trust boundary to ensure simple classification and
entry to a queue
 Supports DiffServ EF and AF PHBs:
– Priority queue implements EF PHB
– CBWFQ with WRED implements AF PHBs

Configuring LLQ

Configuring LLQ
priority bandwidth [burst]
priority percent percentage [burst]
 Declares a class within policy map as LLQ class
 Allocates a fixed amount of bandwidth (in kb/s) or percentage of configured or default
interface bandwidth
 Traffic exceeding the specified bandwidth is dropped if congestion exists
 Default burst size based on 200-ms interval and LLQ bandwidth
– Burst defines how much data is sent at once
bandwidth {bw-kbps | remaining percent percentage |
percent percentage}
 Allocates a fixed amount of bandwidth to a class, in kb/s or percent of the configured
(or default) interface bandwidth—CBWFQ portion of LLQ system
 Remaining percent allocates a percentage of available bandwidth

LLQ Configuration Example
class-map voip
match ip precedence 5
!
class-map mission-critical
match ip precedence 3 4
!
class-map transactional
match ip precedence 1 2
!
policy-map Policy1
class voip
priority percent 10
class mission-critical
random-detect
class transactional
random-detect
class class-default
fair-queue
random-detect

Monitoring LLQ
router#
show policy-map interface interface
 Displays packet statistics of all classes that are configured for all
service policies on the specified interface or subinterface
router# show policy-map interface Fastethernet 0/0
FastEthernet0/0
Service-policy output: LLQ
Class-map: LLQ (match-any)
0 packets, 0 bytes
5 minute offered rate 0 bps, drop rate 0 bps
Match: any
Weighted Fair Queueing
Strict Priority
Output Queue: Conversation 264
Bandwidth 1000 (kbps) Burst 25000 (Bytes)
(pkts matched/bytes matched) 0/0
(total drops/bytes drops) 0/0
Class-map: class-default (match-any)
0 packets, 0 bytes
5 minute offered rate 0 bps, drop rate 0 bps
Match: any

Calculating
Bandwidth for LLQ

Calculating Bandwidth for LLQ
Bandwidth reservation should include overhead:

 Bandwidth used for guarantees and policing with LLQ
 For proper operation, it should include Layer 3 and Layer 2
overhead, otherwise it guarantees less than expected
 Example: setting up priority queue to support 10 x G.729
calls (20-ms packetization) on MLPPP link
G.729 Layer 3+ Layer 2

Payload Overhead Overhead
LLQ priority bandwidth = 10 x (20 bytes + 40 bytes + 13 bytes) x 50 p/s x 8 bits/byte

= 10 x 29.2 kb/s = 292 kb/s
LLQ priority bandwidth rounded up to 300 kb/s
router(config-pmap-c)# priority 300

Calculating Bandwidth for LLQ (Cont.)
Packetization Voice Packets per Layer 2 Headers [Bytes]
Codec
Period Payload Second 802.3 Ethernet 18
G.711 20 ms 160 bytes 50 802.1Q Ethernet 18+4
G.711 30 ms 240 bytes 33 PPP 6-9
G.729 20 ms 20 bytes 50 Multilink PPP with 13
Interleaving
G.729 30 ms 30 bytes 33
Frame Relay 6
Frame Relay with 8
FRF.12
Example: 10 G.711 calls, 20-ms packetization, FRF.12:

G.711 Layer 3+ Layer 2
Payload Overhead Overhead
LLQ priority bandwidth = 10 x (160 bytes + 40 bytes + 8 bytes) x 50 p/s x 8 bits/byte

= 10 x 83.2 kb/s = 832 kb/s
LLQ priority bandwidth rounded up to 840 kb/s
router(config-pmap-c)# priority 840


Presentacion-Conceptos QoSV1.1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Presentacion-Conceptos QoSV1.1

Uploaded by

Copyright:

Available Formats

Quality of Service

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-1

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-2

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-3

Traditional data traffic characteristics:

Order Entry, Finance,

Order Entry, Finance,

 Lack of bandwidth: Multiple flows compete for a limited

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-6

 Maximum available bandwidth equals the bandwidth of the weakest link.

256 kb/s 512 kb/s

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-7

TCP Header Compression

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-8

 End-to-end delay equals a sum of all propagation, processing, and queuing

Propagation Propagation Propagation Propagation

Processing and Processing and Processing and

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-10

 Upgrade the link (best but most expensive solution).

TCP Header Compression

IP UDP RTP data

Stacker Priority Queuing (PQ)

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-12

 Upgrade the link (best but most expensive solution).

Weighted Random Early Detection

Custom Queuing (CQ)

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-14

The ability of the network to provide

Voice – Video – Data

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-15

A networkwide definition of the

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-16

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-17

DATA VOICE DATA

Voice Mission- Best-

Voice Mission- Best-

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-19

Voice Low Latency

Voice Best-Effort No Delivery Guarantee

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-20

 Set minimum bandwidth guarantee.

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-21

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-22

 Latency ≤ 150 ms*

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-23

 Latency ≤ 150 ms*

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-24

 Different applications have different

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-26

 Command-line interface (CLI)

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-27

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-28

 A command syntax for class-map VoIP-RTP

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-29

 AutoQoS VoIP supported both in WAN

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-30

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-31

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-32

 Best Effort: No QoS is applied to packets.

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-33

 Internet initially based on a

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-34

 Some applications have special

© 2010 Cisco Systems, Inc. All rights reserved. CVOICE v8.0—6-35