Professional Documents
Culture Documents
Module 7.1-ODC132014 Differentiated Service Model Overview I
Module 7.1-ODC132014 Differentiated Service Model Overview I
Module 7.1-ODC132014 Differentiated Service Model Overview I
In the differentiated service (DiffServ) model, services are described by the traffic
classifier. The flows are classified and marked on the ingress router in the DiffServ
domain. The internal routers perform corresponding PHB according to the
classification marking of the packets and need not perform complex traffic
classification. PHB stands for per-hop behavior. It is the action performed to the traffic
by a router, for example, expedited forwarding, re-marking, and dropping of packets.
The traffic classification marking is contained in the packet header and transmitted in
the network with the data. Therefore, the router need not maintain the status
information for the flows. (In integrated service model, the router must maintain the
status information for each flow.) The service that a packet can obtain is related to the
marking of the packet. The ingress router and egress router of a DiffServ (DS) domain
are connected to other DS domains or non-DS domains through links. Different
administrative domains may apply different QoS policies, so the administrative
domains must negotiate the Service Level Agreement (SLA) and establish the Traffic
Conditioning Agreement (TCA). The inbound traffic to the ingress router and the
outbound traffic to the egress router must comply with the TCA.
RFC 2474, Definition of the Differentiated Services Field (DS Field) in the IPv4 and
IPv6 Header, redefines the TOS field. The first six bits (high-order bits) identifies the
service type. The subsequent two bits (low-order bits) are reserved. Based on this
definition, the service traffic can be classified into 64 categories through DSCP. Each
DSCP value maps to a Behavior Aggregate (BA). Each BA is assigned a PHB (such
as forwarding, dropping, etc.). The PHB is implemented by some QoS mechanisms,
such as traffic policing and queuing mechanism. The DiffServ model defines four
types of PHB: EF PHB, AF PHB , CS PHB, and BE PHB. Expedited Forwarding (EF)
PHB is applicable to preferential services with low delay, low packet loss, and
guaranteed bandwidth. Assured Forwarding (AF) PHB consists of four classes, and
each class has three drop precedence levels. Therefore, the AF PHB can subdivide
services. Its QoS performance is lower than the EF PHB. The class selector (CS)
PHB is derived from the TOS field. It consists of eight classes. The BE PHB (default
PHB) is a special class of CS. The traffic of this class is not guaranteed anything. The
traffic on the current IP network belongs to this class by default.
The default DSCP value is 0, which is compatible with the default value of the IP
precedence 0. DSCP 0 maps the default PHB. The default PHB processes the traffic
by the principle of first in first out (FIFO) and tail drop.
DiffServ defines the Class Selector PHB (CS PHB) and the mapping DSCP value to
ensure the compatibility with the IP precedence. The first three bits map to the IP
precedence value. If a router supports only the IP precedence, it concerns only the
first three bits of the DSCP marking when it receives a packet. Same as the IP
precedence value, a larger DSCP value maps a higher priority. The last three bits of
all the DSCP values in the tables are 000. But for a router that does not support
DSCP, even if these bits are not 000, the meaning is the same. For example, 010000
and 010011 has the same meaning. Therefore, eight DSCP values maybe mapped to
one IP precedence.
EF PHB maps the DSCP value 101110. For a device that does not support DSCP, EF
PHB is equivalent to IP precedence 5. The delay-sensitive data is tagged “101110”.
This types of data should be forwarded as soon as possible and should obtain certain
guaranteed bandwidth. To prevent the data from consuming all bandwidth, the router
drops the extra packets when the traffic exceeds the guaranteed bandwidth. Two
mechanisms must be defined to implement EF PHB. Firstly, a queue scheduling
mechanism is required to ensure fastest scheduling of EF packets. Thus the EF
packets are ensured with lowest delay and jitter. This mechanism can be
implemented through strict priority queue, IP RTP queue, or LLQ queue. These queue
scheduling mechanisms will be described in later courses. Secondly, a traffic policing
policy is required to specify certain bandwidth for the EF traffic. Within the specified
bandwidth, the EF traffic can obtain the service with low delay. However, if the traffic
exceeds the bandwidth, the extra traffic is dropped.
AF PHB (the assured forwarding per-hop behaviors) is defined in RFC 2597. RFC
2597 defines 12 DSCP values, which are classified into four classes (based on the
first three bits): Class1, Class2, Class3, and Class4. each class has three drop
precedence levels (classified based on the fourth and fifth bits): low drop precedence,
medium drop precedence, and high drop precedence. The data marking with DSCP
AF are provided with certain guaranteed bandwidth. If idle bandwidth exists, the data
can occupy the bandwidth. AF PHB is implemented through the queue scheduling
and congestion avoidance mechanisms. Each class corresponds to a queue, which
provides certain guaranteed bandwidth for the traffic of this class. The idle bandwidth
of a class can be used by traffic of other classes. Note that the classes are treated at
the same precedence. For example, Class2 cannot obtain more guarantee than
Class1. The four classes are equal in priority. With a queue, the congestion avoidance
mechanism (such as WRED) is adopted. This mechanism sets two thresholds. When
the number of packets in the queue is less than the lower threshold, no packets are
dropped. When the number of packets is between the lower threshold and higher
threshold, packets are dropped at certain probability. The probability increases with
the increase of packets. When the number of packets exceeds the higher threshold,
the drop probability is 100%. AF PHB is generally implemented through the WFQ
technology. In WFQ, four queues are defined to map four classes. Weighted Random
Early Detection (WRED) is configured for each queue. WFQ and WRED mechanism
will be described in the later courses.