draft-ietf-diffserv-pib-04.txt   draft-ietf-diffserv-pib-05.txt 
Network Working Group M. Fine Internet Engineering Task Force M. Fine
Internet Draft K. McCloghrie Diffserv Working Group K. McCloghrie
Expires January 2002 Cisco Systems Internet-Draft Cisco Systems
J. Seligson draft-ietf-diffserv-pib-05.txt J. Seligson
K. Chan Expires May 2002 K. Chan
Nortel Networks Nortel Networks
S. Hahn S. Hahn
C. Bell C. Bell
Intel Intel
A. Smith A. Smith
Allegro Networks Allegro Networks
Francis Reichmeyer F. Reichmeyer
PFN PFN
July 20, 2001 November 2001
Differentiated Services Quality of Service Policy Information Base Differentiated Services Quality of Service Policy Information Base
draft-ietf-diffserv-pib-04.txt
Status of this Memo Status of this Memo
This document is an Internet-Draft and is in full conformance with all This document is an Internet-Draft and is in full conformance with
provisions of Section 10 of RFC2026. Internet-Drafts are working all provisions of Section 10 of [RFC2026].
documents of the Internet Engineering Task Force (IETF), its areas, and
its working groups. Note that other groups may also distribute working
documents as Internet-Drafts.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are working documents of the Internet Engineering
and may be updated, replaced, or obsoleted by other documents at any Task Force (IETF), its areas, and its working groups. Note that
time. It is inappropriate to use Internet-Drafts as reference material other groups may also distribute working documents as Internet-
or to cite them other than as ``work in progress.'' Drafts. Internet-Drafts are draft documents valid for a maximum of
six months and may be updated, replaced, or obsoleted by other
documents at any time. It is inappropriate to use Internet-Drafts as
reference material or to cite them other than as "work in progress."
To view the current status of any Internet-Draft, please check the The list of current Internet-Drafts can be accessed at
``1id-abstracts.txt'' listing contained in an Internet-Drafts Shadow http://www.ietf.org/ietf/1id-abstracts.txt
Directory, see http://www.ietf.org/shadow.html. The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html.
This document is a product of the IETF's Differentiated Services
Working Group. Comments should be addressed to WG's mailing list at
diffserv@ietf.org. The charter for Diffserv may be found at
http://www.ietf.org/html.charters/diffserv-charter.html.
Copyright c The Internet Society (2001). All Rights Reserved.
Distribution of this memo is unlimited.
1. Glossary 1. Glossary
PRC Provisioning Class. A type of policy data. PRC Provisioning Class. A type of policy data.
PRI Provisioning Instance. An instance of a PRC. PRI Provisioning Instance. An instance of a PRC.
PIB Policy Information Base. The database of policy information. PIB Policy Information Base. The database of policy information.
PDP Policy Decision Point. See [RAP-FRAMEWORK]. PDP Policy Decision Point. See [RAP-FRAMEWORK].
PEP Policy Enforcement Point. See [RAP-FRAMEWORK]. PEP Policy Enforcement Point. See [RAP-FRAMEWORK].
PRID Provisioning Instance Identifier. Uniquely identifies an PRID Provisioning Instance Identifier. Uniquely identifies an
instance of a a PRC. instance of a PRC.
2. Introduction 2. Introduction
[SPPI] describes a structure for specifying policy information that can [SPPI] describes a structure for specifying policy information that
then be transmitted to a network device for the purpose of configuring can then be transmitted to a network device for the purpose of
policy at that device. The model underlying this structure is one of configuring policy at that device. The model underlying this
well defined policy rule classes and instances of these classes residing structure is one of well-defined policy rule classes and instances
in a virtual information store called the Policy Information Base (PIB). of these classes residing in a virtual information store called the
Policy Information Base (PIB).
This document specifies a set of policy rule classes specifically for This document specifies a set of policy rule classes specifically
configuring QoS Policy for Differentiated Services [DSARCH]. for configuring QoS Policy for Differentiated Services [DSARCH].
One way to provision policy is by means of the COPS protocol [COPS] with One way to provision policy is by means of the COPS protocol [COPS]
the extensions for provisioning [COPS-PR]. This protocol supports with the extensions for provisioning [COPS-PR]. This protocol
multiple clients, each of which may provision policy for a specific supports multiple clients, each of which may provision policy for a
policy domain such as QoS. The PRCs defined in this DiffServ QoS PIB specific policy domain such as QoS. The PRCs defined in this
are intended for use by the COPS-PR QoS client type. Furthemore, these DiffServ QoS PIB are intended for use by the COPS-PR QoS client
PRCs are in addition to any other PIBs that may be defined for the QoS type. Furthermore, these PRCs are in addition to any other PIBs
client type in the future, as well as the PRCs defined in the Framework that may be defined for the QoS client type in the future, as well
PIB [FR-PIB]. as the PRCs defined in the Framework PIB [FR-PIB].
3. Relationship to the Diffserv Informal Management Model 3. Relationship to the Diffserv Informal Management Model
This PIB is designed according to the Differentiated Services Informal This PIB is designed according to the Differentiated Services
Management Model documented in [MODEL]. The model describes the way that Informal Management Model documented in [MODEL]. The model describes
ingress and egress interfaces of an 'n'-port router are modelled. It the way that ingress and egress interfaces of an 'n'-port router are
describes the configuration and management of a Diffserv interface in modeled. It describes the configuration and management of a Diffserv
terms of a Transmission Control Block (TCB) which contains, by interface in terms of a Traffic Conditioning Block (TCB) which
definition, zero or more classifiers, meters, actions, algorithmic contains, by definition, zero or more classifiers, meters, actions,
droppers, queues and schedulers. These elements are arranged according algorithmic droppers, queues and schedulers. These elements are
arranged according to the QoS policy being expressed, always in that
to the QoS policy being expressed, always in that order. Traffic may be order. Traffic may be classified; classified traffic may be metered;
classified; classified traffic may be metered; each stream of traffic each stream of traffic identified by a combination of classifiers
identified by a combination of classifiers and meters may have some set and meters may have some set of actions performed on it; it may have
of actions performed on it; it may have dropping algorithms applied and dropping algorithms applied and it may ultimately be stored into a
it may ultimately be stored into a queue before being scheduled out to queue before being scheduled out to its next destination, either
its next destination, either onto a link or to another TCB. When the onto a link or to another TCB. When the treatment for a given packet
treatment for a given packet must have any of those elements repeated in must have any of those elements repeated in a way that breaks the
a way that breaks the permitted sequence {classifier, meter, action, permitted sequence {classifier, meter, action, algorithmic dropper,
algorithmic dropper, queue, scheduler}, this must be modelled by queue, scheduler}, this must be modeled by cascading multiple TCBs.
cascading multiple TCBs.
The PIB represents this cascade by following the "Next" attributes of The PIB represents this cascade by following the "Next" attributes
the various elements. They indicate what the next step in Diffserv of the various elements. They indicate what the next step in
processing will be, whether it be a classifier, meter, action, Diffserv processing will be, whether it be a classifier, meter,
algorithmic dropper, queue, scheduler or a decision to now forward a action, algorithmic dropper, queue, scheduler or a decision to now
packet. forward a packet.
The PIB models the individual elements that make up the TCBs. The The PIB models the individual elements that make up the TCBs. The
higher level concept of a TCB is not required in the parameterization or higher level concept of a TCB is not required in the
in the linking together of the individual elements, hence it is not used parameterization or in the linking together of the individual
in the PIB itself and only mentioned in the text for relating the PIB elements, hence it is not used in the PIB itself and only mentioned
with the [MODEL]. The actual distinguishing of which TCB a specific in the text for relating the PIB with the [MODEL]. The actual
element is a part of is not needed for the instructmentation of a device distinguishing of which TCB a specific element is a part of is not
to support the functionalities of DiffServ, but it is useful for needed for the instrumentation of a device to support the
conceptual reasons. By not using the TCB concept, this PIB allows any functionalities of DiffServ, but it is useful for conceptual
grouping of elements to construct TCBs, using rules indicated by the reasons. By not using the TCB concept, this PIB allows any grouping
[MODEL]. This will minimize changes to this PIB if rules in [MODEL] of elements to construct TCBs, using rules indicated by the [MODEL].
change. This will minimize changes to this PIB if rules in [MODEL] change.
The notion of a Data Path is used in this PIB to indicate the DiffServ The notion of a Data Path is used in this PIB to indicate the
processing a packet may experience. This Data Path is distinguished DiffServ processing a packet may experience. This Data Path is
based on the Role Combination and the Direction of the flow the packet distinguished based on the Role Combination and the Direction of the
is part of. A Data Path Table Entry indicates the first of possibly flow the packet is part of. A Data Path Table Entry indicates the
multiple elements that will apply DiffServ treatment to the packet. first of possibly multiple elements that will apply DiffServ
treatment to the packet.
3.1. PIB Overview 3.1. PIB Overview
This PIB is structured based on the need to configure the sequential This PIB is structured based on the need to configure the sequential
DiffServ treatments being applied to a packet, and the parameterization DiffServ treatments being applied to a packet, and the
of these treatments. These two aspects of the configuration are kept parameterization of these treatments. These two aspects of the
separate throughout the design of the PIB, and are fulfilled using configuration are kept separate throughout the design of the PIB,
separate tables and data definitions. and are fulfilled using separate tables and data definitions.
In addition, the PIB includes tables describing the capabilities and In addition, the PIB includes tables describing the capabilities and
limitations of the device using a general extensible framework. These limitations of the device using a general extensible framework.
tables are reported to the PDP and assist the PDP with the configuration These tables are reported to the PDP and assist the PDP with the
of functional elements that can be realized by the device. configuration of functional elements that can be realized by the
device.
In this PIB, the ingress and egress portions of a router are configured This capabilities and limitations exchange allows a single or
independently but in the same manner. The difference is distinguished by multiple devices to support many different variations of a
an attribute in a table describing the start of the data path. Each functional datapath element. Allowing diverse methods of providing
interface performs some or all of the following high-level functions: a general functional datapath element.
In this PIB, the ingress and egress portions of a router are
configured independently but in the same manner. The difference is
distinguished by an attribute in a table describing the start of the
data path. Each interface performs some or all of the following
high-level functions:
o Classify each packet according to some set of rules o Classify each packet according to some set of rules
o Determine whether the data stream the packet is part of is within o Determine whether the data stream the packet is part of is
or outside its rate within or outside its metering parameters
o Perform a set of resulting actions such as application of an oPerform a set of resulting actions such as counting and marking of the
appropriate drop policy and marking of the traffic with a traffic with aDifferentiated Services Code Point (DSCP) as defined
Differentiated Services Code Point (DSCP) as defined in [DSFIELD]. in[DSFIELD].
o Enqueue the traffic for output in the appropriate queue, whose o Apply appropriate drop policy, either simple or complex
scheduler may shape the traffic or simply forward it with some algorithmic drop functionality.
Enqueue the traffic for output in the appropriate queue, whosescheduler
may shape the traffic or simply forward it with some
minimum rate or maximum latency. minimum rate or maximum latency.
The PIB therefore contains the following elements: The PIB therefore contains the following elements:
Data Path Table Data Path Table
This describes the starting point of DiffServ data paths within a This describes the starting point of DiffServ data paths within a
single DiffServ device. This table descibes interface role single DiffServ device. This table describes interface role
combination combination and interface direction specific data paths.
and interface direction specific data paths.
Classifier Tables Classifier Tables
A general extensible framework for specifying a group of filters. A general extensible framework for specifying a group of filters.
Meter Tables Meter Tables
A general extensible framework and one example of a A general extensible framework and one example of a
parameterization table - TBParam table, applicable for Simple Token parameterization table - TBParam table, applicable for Simple
Bucket Meter, Average Rate Meter, Single Rate Three Color Meter, Token Bucket Meter, Average Rate Meter, Single Rate Three Color
Two Rate Three Color Meter, and Sliding Window Three Color Meter. Meter, Two Rate Three Color Meter, and Sliding Window Three
Color Meter.
Action Tables Action Tables
A general extensible framework and examples of parameterization A general extensible framework and examples of parameterization
tables for Absolute Drop, Mark and Count actions. The tables for Mark actions. The
"multiplexer" and "null" actions described in [MODEL] are "multiplexer" and "null" actions described in [MODEL] are
accomplished implicitly by means of the Prid structures accomplished implicitly by means of the Prid structures of the
of the other elements. other elements.
Queue, Scheduler and Algorithmic Dropper Tables Algorithmic Dropper Tables
A general extensible framework for describing the dropper
functional datapath element. This includes the absolute dropper
and other queue measurement dependent algorithmic droppers.
Queue and Scheduler Tables
A general extensible framework for parameterizing queuing and A general extensible framework for parameterizing queuing and
scheduler systems. The queue measurement dependent algorithmic scheduler systems. Notice Shaper is considered as a type of
droppers are also described here. scheduler and is included here.
Capabilities Tables Capabilities Tables
A general extensible framework for defining the capabilities and A general extensible framework for defining the capabilities and
limitations of the elements listed above. The capability tables limitations of the elements listed above. The capability tables
allow intelligent configuration of the elements by a PDP. allow intelligent configuration of the elements by a PDP.
4. Structure of the PIB 4. Structure of the PIB
4.1. General Conventions 4.1. General Conventions
The PIB consists of classes that represent functional elements in the The PIB consists of classes that represent functional elements in
data path (e.g. classifiers, meters, actions), and classes that specify the data path (e.g. classifiers, meters, actions), and classes that
parameters that apply to a certain type of functional element (e.g. a specify parameters that apply to a certain type of functional
Token Bucket meter or a Mark action). Parameters are typically element (e.g. a Token Bucket meter or a Mark action). Parameters
specified in a separate PRC to enable the use of parameter classes by are typically specified in a separate PRC to enable the use of
multiple policies. parameter classes by multiple policies.
Functional element PRC's use the Prid TC (defined in [SPPI]) to indicate Functional element PRCs use the Prid TC (defined in [SPPI]) to
indirection. A Prid is a object identifier that is used to specify an indicate indirection. A Prid is an object identifier that is used
instance of a PRC in another table. A Prid is used to point to to specify an instance of a PRC in another table. A Prid is used to
parameter PRC that applies to a functional element, such as which filter point to parameter PRC that applies to a functional element, such as
should be used for a classifier element. A Prid is also used to which filter should be used for a classifier element. A Prid is also
specify an instance of a functional element PRC that describes what used to specify an instance of a functional element PRC that
treatment should be applied next for a packet in the data path. describes what treatment should be applied next for a packet in the
data path.
Note that the use of Prid's to specify parameter PRC's allows the same Note that the use of Prids to specify parameter PRCs allows the same
funtional element PRC to be extended with a number of different types of functional element PRC to be extended with a number of different
parameter PRC's. In addition, using Prids to indicate the next types of parameter PRC's. In addition, using Prids to indicate the
functional datapath element allows the elements to be ordered in any next functional datapath element allows the elements to be ordered
way. in any way.
4.2. DiffServ Data Paths 4.2. DiffServ Data Paths
This part of the PIB provides instrumentation for connecting the This part of the PIB provides instrumentation for connecting the
DiffServ Functional Elements within a single DiffServ device. Please DiffServ Functional Elements within a single DiffServ device.
refer to the [MODEL] for discussions on the valid sequencing and Please refer to the [MODEL] for discussions on the valid sequencing
grouping of DiffServ Functional Elements. Given some basic information, and grouping of DiffServ Functional Elements. Given some basic
information, e.g. the interface capability, role combination and
e.g. the interface role combination and direction, the first DiffServ direction, the first DiffServ Functional Element is determined.
Functional Element is determined. Subsequent DiffServ Functional Subsequent DiffServ Functional Elements are provided by the "Next"
Elements are provided by the "Next" pointer attribute of each entry of pointer attribute of each entry of data path tables. A description
data path tables. A description of how this "Next" pointer is used in of how this "Next" pointer is used in each table is provided in
each table is provided in their respective DESCRIPTION clauses. their respective DESCRIPTION clauses.
4.2.1. Data Path PRC 4.2.1. Data Path PRC
The Data Path PRC provides the DiffServ treatment starting points for The Data Path PRC provides the DiffServ treatment starting points
all packets of this DiffServ device. Each instance of this PRC specifies for all packets of this DiffServ device. Each instance of this PRC
the interface type, role combination and direction for the packet flow. specifies the interface capability, role combination and direction
There should be at most two entries for each (interface type, role for the packet flow. There should be at most two entries for each
combination) pair, one for ingress and one for egress. Each instance (interface type, role combination) pair, one for ingress and one for
provides the first DiffServ Functional Element each packet at a specific egress. Each instance provides the first DiffServ Functional
interface (identified by the roles assigned to the interface) traveling Element each packet at a specific interface (identified by the roles
in a specific relative direction should experience. Notice this table assigned to the interface) traveling in a specific relative
is interface specific, with the use of interface type and direction should experience. Notice this table is interface
RoleCombination. To indicate explicitly that there are no Diffserv specific, with the use of interface type and RoleCombination. To
treatments for a particular interface type, role combination and indicate explicitly that there are no Diffserv treatments for a
direction, an instance of the Data Path PRC can be created with particular interface type, role combination and direction, an
zeroDotZero in the qosDataPathStart attribute. This situation can also instance of the Data Path PRC can be created with zeroDotZero in the
be indicated implicitly by not supplying an instance of a Data Path PRC qosDataPathStart attribute. This situation can also be indicated
for that particular interface type, role combination and direction. The implicitly by not supplying an instance of a Data Path PRC for that
particular interface type, role combination and direction. The
explicit/implicit selection is up to the implementation. This means explicit/implicit selection is up to the implementation. This means
that the PEP should perform normal IP device processing when zeroDotZero that the PEP should perform normal IP device processing when
is used in the qosDataPathStart attribute, or when the entry does not zeroDotZero is used in the qosDataPathStart attribute, or when the
exist. Normal IP device processing will depend on the device, for entry does not exist. Normal IP device processing will depend on the
example, this can be forwarding the packet. device; for example, this can be forwarding the packet.
Based on implementation experience of network devices where data path
functional elements are implemented in separate physical processors or
application specific integrated circuits, separated by switch fabric, it
seems that more complex notions of data path are required within the
network device to correlate the different physically separate data path
functional elements. For example, ingress processing may have determined
a specific ingress flow that gets aggregated with other ingress flows at
an egress data path functional element. Some of the information
determined at the ingress data path functional element may need to be
used by the egress data path functional element. In numerous
implementations, such information has been carried by adding it to the
frame/memory block used to carry the flow within the network device,
some implementers have called such information a "preamble" or a "frame
descriptor". Different implementations use different formats for such
information. Initially one may think such information are implementation
details within the network device that does not need to be exposed Based on implementation experience of network devices where data
outside of the network device. But from Policy Control point of view, path functional elements are implemented in separate physical
such information will be very useful in determining network resource processors or application specific integrated circuits, separated by
usage feedback from the network device to the policy server. Such switch fabric, it seems that more complex notions of data path are
information may also help in provisioning of some data path functional required within the network device to correlate the different
elements, e.g. virtual output queuing methods of queue/scheduler/shaper physically separate data path functional elements. For example,
implementations. A new PRC is being defined to carry such information, ingress processing may have determined a specific ingress flow that
using Data Path, Mark Action, Classifier, and possibly other data path gets aggregated with other ingress flows at an egress data path
functional elements to implement the mechanism. functional element. Some of the information determined at the
ingress data path functional element may need to be used by the
egress data path functional element. In numerous implementations,
such information has been carried by adding it to the frame/memory
block used to carry the flow within the network device; some
implementers have called such information a "preamble" or a "frame
descriptor". Different implementations use different formats for
such information. Initially one may think such information is
implementation details within the network device that does not need
to be exposed outside of the network device. But from Policy Control
point of view, such information will be very useful in determining
network resource usage feedback from the network device to the
policy server. This is accomplished by using the Internal Label
Marker and Filter PRCs defined in [FR-PIB].
4.3. Classifiers 4.3. Classifiers
The classifier and classifier element tables determine how traffic is The classifier and classifier element tables determine how traffic
sorted out. They identify separable classes of traffic, by reference to is sorted out. They identify separable classes of traffic, by
appropriate filters, which may select anything from an individual micro- reference to appropriate filters, which may select anything from an
flow to aggregates identified by DSCP. individual micro-flow to aggregates identified by DSCP.
The classification is used to send these separate streams to appropriate The classification is used to send these separate streams to
Meter, Action, Algorithmic Dropper, Queue and Scheduler elements. For appropriate Meter, Action, Algorithmic Dropper, Queue and Scheduler
example, to indicate a multi-stage meter, sub-classes of traffic may be elements. For example, to indicate a multi-stage meter, sub-classes
sent to different meter stages: e.g. in an implementation of the Assured of traffic may be sent to different meter stages: e.g. in an
Forwarding (AF) PHB [AF-PHB], AF11 traffic might be sent to the first implementation of the Assured Forwarding (AF) PHB [AF-PHB], AF11
meter, AF12 traffic might be sent to the second and AF13 traffic sent to traffic might be sent to the first meter, AF12 traffic might be sent
the second meter stage's out-of-profile action. to the second and AF13 traffic sent to the second meter stage's out-
of-profile action.
The concept of a classifier is the same as described in [MODEL]. The The concept of a classifier is the same as described in [MODEL].
structure of the classifier and classifier element tables, is the same The structure of the classifier and classifier element tables, is
as the classifier described in [MODEL]. Classifier elements have an the same as the classifier described in [MODEL]. Classifier
associated precedence order solely for the purpose of resolving elements have an associated precedence order solely for the purpose
ambiguity between overlapping filters. Filter with higher values of of resolving ambiguity between overlapping filters. Filter with
precedence are compared first; the order of tests for entries of the higher values of precedence are compared first; the order of tests
same precedence is unimportant. for entries of the same precedence is unimportant.
A datapath may consist of more than one classifier. There may be A datapath may consist of more than one classifier. There may be
overlap of filter specification between filters of different overlap of filter specification between filters of different
classifiers. The first classifier functional datapath element classifiers. The first classifier functional datapath element
encountered, as determined by the sequencing of diffserv functional encountered, as determined by the sequencing of diffserv functional
datapath elements, will be used first. datapath elements, will be used first.
An important form of classifier is "everything else": the final stage of An important form of classifier is "everything else": the final
the classifier i.e. the one with the lowest precedence, must be stage of the classifier i.e. the one with the lowest precedence,
"complete" since the result of an incomplete classifier is not must be "complete" since the result of an incomplete classifier is
necessarily deterministic - see [MODEL] section 4.1.2. not necessarily deterministic - see [MODEL] section 4.1.2.
When a classifier PRC is instantiated at the PEP, it should always
have at least one classifier element table entry, the "everything
else" classifier element, with its filter matching all IP packets.
This "everything else" classifier element should be created by the
PDP as part of the classifier setup. The PDP have full control of
all classifier PRIs instantiated at the PEP.
The definition of the actual filter to be used by the classifier is The definition of the actual filter to be used by the classifier is
referenced via a Prid: this enables the use of any sort of filter table referenced via a Prid: this enables the use of any sort of filter
that one might wish to design, standard or proprietary. No filters are table that one might wish to design, standard or proprietary. No
defined in this PIB. However, standard filters for IP packets are filters are defined in this PIB. However, standard filters for IP
defined in the Framework PIB [FR-PIB]. packets are defined in the Framework PIB [FR-PIB].
4.3.1. Classifier PRC 4.3.1. Classifier PRC
Classifiers, used in various ingress and egress interfaces, are Classifiers, used in various ingress and egress interfaces, are
organized by the instances of the Classifier PRC. A data path entry organized by the instances of the Classifier PRC. A data path entry
points to a classifier entry. A classifier entry identifies a list of points to a classifier entry. A classifier entry identifies a list
classifier elements. A classifier element effectively includes the of classifier elements. A classifier element effectively includes
filter entry, and points to a "next" classifier entry or other data path the filter entry, and points to a "next" classifier entry or other
functional element. data path functional element.
4.3.2. Classifier Element PRC 4.3.2. Classifier Element PRC
Classifier elements point to the filters which identify various classes Classifier elements point to the filters which identify various
of traffic. The separation between the "classifier element" and the classes of traffic. The separation between the "classifier element"
"filter" allows us to use many different kinds of filters with the same and the "filter" allows us to use many different kinds of filters
essential semantics of "an identified set of traffic". The traffic with the same essential semantics of "an identified set of traffic".
matching the filter corresponding to a classifier element is given to The traffic matching the filter corresponding to a classifier
the "next" data path functional element identified in the classifier element is given to the "next" data path functional element
element. identified in the classifier element.
The definition of the actual filter to be used by the classifier is An example of a filter that may be pointed to by a Classifier
referenced via a Prid: this enables the use of any sort of filter table Element PRI is the frwkIpFilter PRC, defined in [FR-PIB].
that one might wish to design, standard or proprietary. An example of a
filter that may be pointed to by a Classifier Element PRI is the
frwkIpFilter PRC, defined in [FR-PIB].
4.4. Meters 4.4. Meters
A meter, according to [MODEL] section 5, measures the rate at which A meter, according to [MODEL] section 5, measures the rate at which
packets making up a stream of traffic pass it, compares this rate to packets making up a stream of traffic pass it, compares this rate to
some set of thresholds and produces some number (two or more) of some set of thresholds and produces some number (two or more) of
potential results. A given packet is said to "conform" to the meter if, potential results. A given packet is said to "conform" to the meter
at the time that the packet is being looked at, the stream appears to be if, at the time that the packet is being looked at, the stream
within the meter's profile. PIB syntax makes it easiest to define this appears to be within the meter's profile. PIB syntax makes it
easiest to define this as a sequence of one or more cascaded
as a sequence of one or more cascaded pass/fail tests, modeled here as pass/fail tests, modeled here as if-then-else constructs. It is
if-then-else constructs. It is important to understand that this way of important to understand that this way of modeling does not imply
modelling does not imply anything about the implementation being anything about the implementation being "sequential": multi-
"sequential": multi-rate/multi-profile meters e.g. those designed to rate/multi-profile meters e.g. those designed to support [SRTCM],
support [SRTCM], [TRTCM], or [TSWTCM] can still be modeled this way even [TRTCM], or [TSWTCM] can still be modeled this way even if they, of
if they, of necessity, share information between the stages: the stages necessity, share information between the stages: the stages are
are introduced merely as a notational convenience in order to simplify introduced merely as a notational convenience in order to simplify
the PIB structure. the PIB structure.
4.4.1. Meter PRC 4.4.1. Meter PRC
The generic meter PRC is used as a base for all more specific forms of The generic meter PRC is used as a base for all more specific forms
meter. The definition of parameters specific to the type of meter used of meter. The definition of parameters specific to the type of
is referenced via a pointer to an instance of a PRC containing those meter used is referenced via a pointer to an instance of a PRC
specifics. This enables the use of any sort of specific meter table containing those specifics. This enables the use of any sort of
that one might wish to design, standard or proprietary. The specific specific meter table that one might wish to design, standard or
meter table may be, but does not need to be, defined in this PIB module. proprietary. One specific meter table is defined in this PIB module.
Other meter tables may be defined in other PIB modules.
4.4.2. Token-Bucket Parameter PRC 4.4.2. Token-Bucket Parameter PRC
This is included as an example of a common type of meter. Entries in This is included as an example of a common type of meter. Entries
this table are referenced from the qosMeterSpecific attributes of meter in this table are referenced from the qosMeterSpecific attributes of
PRC instances. The parameters are represented by a rate qosTBParamRate, meter PRC instances. The parameters are represented by a rate
a burst size qosTBParamBurstSize, and an interval qosTBparamInterval. qosTBParamRate, a burst size qosTBParamBurstSize, and an interval
The type of meter being parameterized is indicated by the qosTBParamType qosTBparamInterval. The type of meter being parameterized is
attribute. This is used to determine how the rate, burst and rate indicated by the qosTBParamType attribute. This is used to
interval parameters are used. Additional meter parameterization classes determine how the rate, burst and rate interval parameters are used.
can be defined in this or another PIB when necessary. Additional meter parameterization classes can be defined in other
PIBs when necessary.
4.5. Actions 4.5. Actions
Actions include "no action", "mark the traffic with a DSCP" or "specific Actions include "no action", "mark the traffic with a DSCP" or
action". Other tasks such as "shape the traffic" or "drop based on some "specific action". Other tasks such as "shape the traffic" or "drop
algorithm" are handled elsewhere as queueing mechanisms, rather than based on some algorithm" are handled in other functional datapath
actions, consistent with [MODEL]. The "multiplexer", "replicator" and elements rather than in actions. The "multiplexer", "replicator"
"null" actions described in [MODEL] are accomplished implicitly through and "null" actions described in [MODEL] are accomplished implicitly
various combinations of the other elements. through various combinations of the other elements.
This PIB uses the Action PRC qosActionTable to organize one Action's This PIB uses the Action PRC qosActionTable to organize one Action's
relationship with the element(s) before and after it. It allows Actions relationship with the element(s) before and after it. It allows
to be cascaded to enable multiple Actions be applied to a single traffic Actions to be cascaded to enable multiple Actions be applied to a
stream by using each entry's qosActionNext attribute. The qosActionNext single traffic stream by using each entry's qosActionNext attribute.
attribute of the last action entry in the chain points to the next The qosActionNext attribute of the last action entry in the chain
element in the TCB, if any, e.g. a Queueing element. It may also point points to the next element in the TCB, if any, e.g. a Queueing
at a next TCB. element. It may also point at a next TCB.
The parameters needed for the Action element will depend on the type of The parameters needed for the Action element will depend on the type
Action to be taken. Hence the PIB allows for specific Action Tables for of Action to be taken. Hence the PIB allows for specific Action
the different Action types. This flexibility allows additional Actions Tables for the different Action types. This flexibility allows
be specified in future revisions of this PIB, or in other PIBs and also additional Actions be specified in other PIBs and also allows for
allows for the use of proprietary Actions without impact on those the use of proprietary Actions without impact on those defined here.
defined here.
The absolute drop action is handled elsewhere by the algo dropper with One may consider packet dropping as an Action element. Packet
the qosAlgDropType attribute set to alwaysDrop(5). This element silently dropping is handled by the Algorithm Dropper datapath functional
discards all traffic presented to it. element.
4.5.1. DSCP Mark Action PRC 4.5.1. DSCP Mark Action PRC
This Action is applied to traffic in order to mark it with a Diffserv This Action is applied to traffic in order to mark it with a
Codepoint (DSCP) value, specified in the qosDscpMarkActTable. Other Diffserv Codepoint (DSCP) value, specified in the
marking actions might be specified elsewhere - these are outside the qosDscpMarkActTable.
scope of this PIB.
4.6. Queueing Elements 4.6. Queueing Elements
These include Algorithmic Droppers, Queues and Schedulers which are all These include Algorithmic Droppers, Queues and Schedulers, which are
inter-related in their use of queueing techniques. all inter-related in their use of queueing techniques.
4.6.1. Algorithmic Dropper PRC 4.6.1. Algorithmic Dropper PRC
Algorithmic Droppers are represented in this PIB by instances of the Algorithmic Droppers are represented in this PIB by instances of the
Algorithmic Dropper PRC. An Algorithmic Dropper is assumed to operate Algorithmic Dropper PRC. An Algorithmic Dropper is assumed to
indiscriminately on all packets that are presented at its input, all operate indiscriminately on all packets that are presented at its
traffic separation should be done by classifiers and meters preceding input, all traffic separation should be done by classifiers and
it. meters preceding it.
Algorithmic Dropper includes many types of droppers, from the simple
always dropper to the more complex random dropper. This is
indicated by the qosAlgDropType attribute.
Algorithmic Droppers have a close relationship with queuing, each Algorithmic Droppers have a close relationship with queuing, each
Algorithmic Dropper Table entry contains a qosAlgDropQMeasure attribute, Algorithmic Dropper Table entry contains a qosAlgDropQMeasure
indicating which queue's state affects the calculation of the attribute, indicating which queue's state affects the calculation of
the Algorithmic Dropper. Each entry also contains a qosAlgDropNext
attribute which indicates to which queue the Algorithmic Dropper
sinks its traffic.
Algorithmic Dropper. Each entry also contains a qosAlgDropNext Algorithmic Droppers may also contain a pointer to specific detail
attribute which indicates to which queue the Algorithmic Dropper sinks of the drop algorithm, qosAlgDropSpecific. This PIB defines the
its traffic. detail for three drop algorithms: Tail Drop, Head Drop and Random
Drop; other algorithms are outside the scope of this PIB module but
the general framework is intended to allow for their inclusion via
other PIB modules.
Algorithmic Droppers may also contain a pointer to specific detail of One generally-applicable parameter of a dropper is the specification
the drop algorithm, qosAlgDropSpecific. This PIB defines the detail for of a queue-depth threshold at which some drop action is to start.
three drop algorithms: Tail Drop, Head Drop and Random Drop; other This is represented in this PIB, as a base attribute,
algorithms are outside the scope of this PIB module but the general qosAlgDropQThreshold, of the Algorithmic Dropper entry. The
framework is intended to allow for their inclusion via other PIB attribute, qosAlgDropQMeasure, specifies which queue's depth
modules. qosAlgDropQThreshold is to compare against.
One generally-applicable parameter of a dropper is the specification of o An Always Dropper drops every packet presented to it. This type
a queue-depth threshold at which some drop action is to start. This is of dropper does not require any other parameter.
represented in this PIB, as a base attribute, qosAlgDropQThreshold, of
the Algorithmic Dropper entry. The attribute, qosAlgDropQMeasure,
specifies which queue's depth qosAlgDropQThreshold is to compare
against.
o A Tail Dropper requires the specification of a maximum queue depth o A Tail Dropper requires the specification of a maximum queue
threshold: when the queue pointed at by qosAlgDropQMeasure depth threshold: when the queue pointed at by qosAlgDropQMeasure
reaches that depth threshold, qosAlgDropQThresh, any new reaches that depth threshold, qosAlgDropQThresh, any new
traffic arriving at the dropper is discarded. This algorithm uses traffic arriving at the dropper is discarded. This algorithm uses
only parameters that are part of the qosAlgDropEntry. only parameters that are part of the qosAlgDropEntry.
o A Head Dropper requires the specification of a maximum queue depth o A Head Dropper requires the specification of a maximum queue
threshold: when the queue pointed at by qosAlgDropQMeasure depth threshold: when the queue pointed at by qosAlgDropQMeasure
reaches that depth threshold, qosAlgDropQThresh, traffic reaches that depth threshold, qosAlgDropQThresh, traffic
currently at the head of the queue is discarded. This algorithm currently at the head of the queue is discarded. This algorithm
uses only parameters that are part of the qosAlgDropEntry. uses only parameters that are part of the qosAlgDropEntry.
o Random Droppers are recommended as a way to control congestion, in o Random Droppers are recommended as a way to control congestion,
[QUEUEMGMT] and called for in the [AF-PHB]. Various implementations in [QUEUEMGMT] and called for in the [AF-PHB]. Various
exist, which agree on marking or dropping just enough traffic to implementations exist, which agree on marking or dropping just
communicate with TCP-like protocols about congestion avoidance, but enough traffic to communicate with TCP-like protocols about
differ markedly on their specific parameters. This PIB attempts to congestion avoidance, but differ markedly on their specific
offer a minimal set of controls for any random dropper, but expects parameters. This PIB attempts to offer a minimal set of controls
that vendors will augment the PRC with additional controls and for any random dropper, but expects that vendors will augment the
status in accordance with their implementation. This algorithm PRC with additional controls and status in accordance with their
requires additional parameters on top of those in implementation. This algorithm requires additional parameters on
qosAlgDropEntry; these are discussed below. top of those in qosAlgDropEntry; these are discussed below.
4.6.2. Random Dropper PRC 4.6.2. Random Dropper PRC
One example of a random dropper is a RED-like dropper. An example of the One example of a random dropper is a RED-like dropper. An example of
representation chosen in this PIB for this element is shown in Figure 1. the representation chosen in this PIB for this element is shown in
Figure 1.
Random droppers often have their drop probability function described as Random droppers often have their drop probability function described
a plot of drop probability (P) against averaged queue length (Q). as a plot of drop probability (P) against averaged queue length (Q).
(Qmin,Pmin) then defines the start of the characteristic plot. Normally (Qmin, Pmin) then defines the start of the characteristic plot.
Pmin=0, meaning with average queue length below Qmin, there will be no Normally Pmin=0, meaning with average queue length below Qmin, there
drops. (Qmax,Pmax) defines a "knee" on the plot, after which point the will be no drops. (Qmax, Pmax) defines a "knee" on the plot, after
drop probability become more progressive (greater slope). (Qclip,1) which point the drop probability become more progressive (greater
defines the queue length at which all packets will be dropped. Notice slope). (Qclip, 1) defines the queue length at which all packets
this is different from Tail Drop because this uses an averaged queue will be dropped. Notice this is different from Tail Drop because
length. Although it is possible for Qclip = Qmax. this uses an averaged queue length. Although it is possible for
Qclip = Qmax.
In the PIB module, qosRandomDropMinThreshBytes and In the PIB module, qosRandomDropMinThreshBytes and
qosRandomDropMinThreshPkts represent Qmin. qosRandomDropMaxThreshBytes qosRandomDropMinThreshPkts represent Qmin.
and qosRandomDropMaxThreshPkts represent Qmax. qosAlgDropQThreshold QosRandomDropMaxThreshBytes and qosRandomDropMaxThreshPkts represent
represents Qclip. qosRandomDropProbMax represents Pmax. This PIB does Qmax. QosAlgDropQThreshold represents Qclip. qosRandomDropProbMax
not represent Pmin (assumed to be zero unless otherwise represented). represents Pmax. This PIB does not represent Pmin (assumed to be
In addition, since message memory is finite, queues generally have some zero unless otherwise represented).
upper bound above which they are incapable of storing additional
traffic. Normally this number is equal to Qclip, specified by In addition, since message memory is finite, queues generally have
qosAlgDropQThreshold. some upper bound above which they are incapable of storing
additional traffic. Normally this number is equal to Qclip,
specified by qosAlgDropQThreshold.
Each random dropper specification is associated with a queue. This Each random dropper specification is associated with a queue. This
allows multiple drop processes (of same or different types) to be allows multiple drop processes (of same or different types) to be
associated with the same queue, as different PHB implementations may associated with the same queue, as different PHB implementations may
require. This also allows for sequences of multiple droppers if require. This also allows for sequences of multiple droppers if
necessary. necessary.
AlgDrop Queue AlgDrop Queue
+-----------------+ +-------+ +-----------------+ +-------+
--->| Next ---------+--+------------------->| Next -+--> ... --->| Next --------- -- + +---------------->| Next -+-->
| QMeasure -------+--+ | ... | | QMeasure -------+--+ | ... |
| QThreshold | RandomDrop +-------+ | QThreshold | RandomDrop +-------+
| Type=randomDrop | +----------------+ | Type=randomDrop | +----------------+
| Specific -------+---->| MinThreshBytes | | Specific -------+-->| MinThreshBytes |
+-----------------+ | MaxThreshBytes | +-----------------+ | MaxThreshBytes |
| ProbMax | | ProbMax |
| InvWeight | | InvWeight |
| SamplingRate | | SamplingRate |
+----------------+ +----------------+
Figure 1: Example Use of the RandomDropTable for Random Droppers Figure 1: Example Use of the RandomDropTable for Random Droppers
The calculation of a smoothed queue length may also have an important The calculation of a smoothed queue length may also have an
bearing on the behavior of the dropper: parameters may include the important bearing on the behavior of the dropper: parameters may
sampling interval or rate, and the weight of each sample. The include the sampling interval or rate, and the weight of each
performance may be very sensitive to the values of these parameters and sample. The performance may be very sensitive to the values of these
a wide range of possible values may be required due to a wide range of parameters and a wide range of possible values may be required due
link speeds. Most algorithms include a sample weight, represented here to a wide range of link speeds. Most algorithms include a sample
by qosRandomDropWeight. The availability of qosRandomDropSamplingRate weight, represented here by qosRandomDropWeight. The availability
as readable is important, the information provided by Sampling Rate is of qosRandomDropSamplingRate as readable is important, the
essential to the configuration of qosRandomDropWeight. Having Sampling information provided by Sampling Rate is essential to the
Rate be configurable is also helpful, as line speed increases, the configuration of qosRandomDropWeight. Having Sampling Rate be
ability to have queue sampling be less frequent than packet arrival is configurable is also helpful, as line speed increases, the ability
needed. Note however that there is ongoing research on this topic, see to have queue sampling be less frequent than packet arrival is
e.g. [ACTQMGMT] and [AQMROUTER]. needed. Note however that there is ongoing research on this topic,
see e.g. [ACTQMGMT] and [AQMROUTER].
Additional parameters may be added in an enterprise PIB module, e.g. by Additional parameters may be added in an enterprise PIB module, e.g.
using AUGMENTS on this table, to handle aspects of random drop by using AUGMENTS on this table, to handle aspects of random drop
algorithms that are not standardized here. algorithms that are not standardized here.
NOTE: Deterministic Droppers can be viewed as a special case of Random NOTE: Deterministic Droppers can be viewed as a special case of
Droppers with the drop probability restricted to 0 and 1. Hence Random Droppers with the drop probability restricted to 0 and 1.
Deterministic Droppers might be described by a Random Dropper with Pmin Hence Deterministic Droppers might be described by a Random Dropper
= 0, Pmax = 1, Qmin = Qmax = Qclip, the averaged queue length at which with Pmin = 0, Pmax = 1, Qmin = Qmax = Qclip, the averaged queue
dropping occurs. length at which dropping occurs.
4.6.3. Queues and Schedulers 4.6.3. Queues and Schedulers
The Queue PRC models simple FIFO queues, as described in [MODEL] section The Queue PRC models simple FIFO queues, as described in [MODEL]
7.1.1. The Scheduler PRC allows flexibility in constructing both simple section 7.1.1. The Scheduler PRC allows flexibility in constructing
and somewhat more complex queueing hierarchies from those queues. Of both simple and somewhat more complex queueing hierarchies from
course, since TCBs can be cascaded multiple times on an interface, even those queues. Of course, since TCBs can be cascaded multiple times
more complex hierarchies can be constructed that way also. on an interface, even more complex hierarchies can be constructed
that way also.
Queue PRC instances are pointed at by the "next" attributes of the Queue PRC instances are pointed at by the "next" attributes of the
upstream elements e.g. qosMeterSucceedNext. Note that multiple upstream upstream elements e.g. qosMeterSucceedNext. Note that multiple
elements may direct their traffic to the same Queue PRI. For example, upstream elements may direct their traffic to the same Queue PRI.
the Assured Forwarding PHB suggests that all traffic marked AF11, AF12 For example, the Assured Forwarding PHB suggests that all traffic
or AF13 be placed in the same queue, after metering, without reordering. marked AF11, AF12 or AF13 be placed in the same queue, after
This would be represented by having the qosMeterSucceedNext of each metering, without reordering. This would be represented by having
upstream meter point at the same Queue PRI. the qosMeterSucceedNext of each upstream meter point at the same
Queue PRI.
NOTE: Queue and Scheduler PRIs are for data path description, they both
use Scheduler Parameterization Table entries for diffserv treatment
parameterization.
Queue Table entries specify the scheduler it wants service from by use NOTE: Queue and Scheduler PRIs are for data path description, they
of its Next pointer. both use Scheduler Parameterization Table entries for diffserv
treatment parameterization.
Each Scheduler Table entry represents the algorithm in use for servicing Queue Table entries specify the scheduler it wants service from by
the one or more queues that feed it. The [MODEL] section 7.1.2 describes use of its Next pointer.
a scheduler with multiple inputs: this is represented in the PIB by
having the scheduling parameters be associated with each input. In this
way, sets of Queues can be grouped together as inputs to the same
Scheduler. This table serves to represent the example scheduler
described in the [MODEL]: other more complex representations might be
created outside of this PIB.
Both the Queue PRC and the Scheduler PRC use instances of the Scheduler Each Scheduler Table entry represents the algorithm in use for
Parameterization PRC to specify diffserv treatment parameterization. servicing the one or more queues that feed it. The [MODEL] section
Scheduler Parameter PRC instances are used to parameterize each input 7.1.2 describes a scheduler with multiple inputs: this is
that feeds into a scheduler. The inputs can be a mixture of Queue PRI's represented in the PIB by having the scheduling parameters be
and Scheduler PRI's. Scheduler Parameter PRI's can be used/reused by associated with each input. In this way, sets of Queues can be
one or more Queue and/or Scheduler Table entries. grouped together as inputs to the same Scheduler. This table serves
to represent the example scheduler described in the [MODEL]: other
more complex representations might be created outside of this PIB.
For representing a Strict Priority scheduler, each scheduler input is Both the Queue PRC and the Scheduler PRC use instances of the
assigned a priority with respect to all the other inputs feeding the Scheduler Parameterization PRC to specify diffserv treatment
same scheduler, with default values for the other parameters. A higher- parameterization. Scheduler Parameter PRC instances are used to
priority input which contains traffic that is not being delayed for parameterize each input that feeds into a scheduler. The inputs can
shaping will be serviced before a lower-priority input. be a mixture of Queue PRI's and Scheduler PRI's. Scheduler
Parameter PRI's can be used/reused by one or more Queue and/or
Scheduler Table entries.
For Weighted Scheduling methods e.g. WFQ, WRR, the "weight" of a given For representing a Strict Priority scheduler, each scheduler input
scheduler input is represented with a Minimum Service Rate leaky-bucket is assigned a priority with respect to all the other inputs feeding
profile which provides guaranteed minimum bandwidth to that input, if the same scheduler, with default values for the other parameters. A
required. This is represented by a rate qosAssuredRateAbs; the higher-priority input which contains traffic that is not being
classical weight is the ratio between that rate and the interface speed, delayed for shaping will be serviced before a lower-priority input.
or perhaps the ratio between that rate and the sum of the configured
rates for classes. The rate may, alternatively, be represented by a
relative value, as a fraction of the interface's current line rate,
qosAssuredRateRel to assist in cases where line rates are variable or
where a higher-level policy might be expressed in terms of fractions of
network resources. The two rate parameters are inter-related and
changes in one may be reflected in the other.
For weighted scheduling methods, one can say loosely, that WRR focuses For Weighted Scheduling methods e.g. WFQ, WRR, the "weight" of a
on meeting bandwidth sharing, without concern for relative delay amongst given scheduler input is represented with a Minimum Service Rate
the queues; where WFQ control both queue service order and amount of leaky-bucket profile which provides guaranteed minimum bandwidth to
traffic serviced, providing meeting bandwidth sharing and relative delay that input, if required. This is represented by a rate
qosMinRateAbsolute; the classical weight is the ratio between that
rate and the interface speed, or perhaps the ratio between that rate
and the sum of the configured rates for classes. The rate may,
alternatively, be represented by a relative value, as a fraction of
the interface's current line rate, qosMinRateRelative to assist in
cases where line rates are variable or where a higher-level policy
might be expressed in terms of fractions of network resources. The
two rate parameters are inter-related and changes in one may be
reflected in the other.
ordering amongst the queues. For weighted scheduling methods, one can say loosely, that WRR
focuses on meeting bandwidth sharing, without concern for relative
delay amongst the queues; where WFQ control both queue service order
and amount of traffic serviced, providing meeting bandwidth sharing
and relative delay ordering amongst the queues.
A queue or scheduled set of queues (which is an input to a scheduler) A queue or scheduled set of queues (which is an input to a
may also be capable of acting as a non-work-conserving [MODEL] traffic scheduler) may also be capable of acting as a non-work-conserving
shaper: this is done by defining a Maximum Service Rate leaky-bucket [MODEL] traffic shaper: this is done by defining a Maximum Service
profile in order to limit the scheduler bandwidth available to that Rate leaky-bucket profile in order to limit the scheduler bandwidth
input. This is represented by a rate qosShapingRateAbs; the classical available to that input. This is represented by a rate
weight is the ratio between that rate and the interface speed, or qosMaxRateAbsolute; the classical weight is the ratio between that
perhaps the ratio between that rate and the sum of the configured rates rate and the interface speed, or perhaps the ratio between that rate
for classes. The rate may, alternatively, be represented by a relative and the sum of the configured rates for classes. The rate may,
value, as a fraction of the interface's current line rate, alternatively, be represented by a relative value, as a fraction of
qosShapingRateRel. There was discussion in the working group about the interface's current line rate, qosMaxRateRelative. There was
alternative modeling approaches, such as defining a shaping action or a discussion in the working group about alternative modeling
shaping element. We did not take this approach because shaping is in approaches, such as defining a shaping action or a shaping element.
fact something a scheduler does to its inputs, (which we model as a We did not take this approach because shaping is in fact something a
queue with a maximum rate or a scheduler whose output has a maximum scheduler does to its inputs, (which we model as a queue with a
rate) and we felt it was simpler and more elegant to simply describe it maximum rate or a scheduler whose output has a maximum rate) and we
in that context. felt it was simpler and more elegant to simply describe it in that
context.
Other types of priority and weighted scheduling methods can be defined Other types of priority and weighted scheduling methods can be
using existing parameters in qosAssuredRateEntry. NOTE: defined using existing parameters in qosMinRateEntry. NOTE:
qosSchedulerMethod uses OBJECT IDENTIFIER syntax, with the different qosSchedulerMethod uses OBJECT IDENTIFIER syntax, with the different
types of scheduling methods defined as OBJECT-IDENTITY. Future types of scheduling methods defined as OBJECT-IDENTITY. Future
scheduling methods may be defined in other PIBs. This requires an scheduling methods may be defined in other PIBs. This requires an
OBJECT-IDENTITY definition, a description of how the existing objects OBJECT-IDENTITY definition, a description of how the existing
are reused, if they are, and any new objects they require. objects are reused, if they are, and any new objects they require.
NOTE: hierarchical schedulers can be parameterized using this PIB by NOTE: hierarchical schedulers can be parameterized using this PIB by
having Scheduler Table entries feeds into Scheduler Table entry. having Scheduler Table entries feeds into Scheduler Table entry.
4.7. Specifying Device Capabilities 4.7. Specifying Device Capabilities
The Diffserv PIB uses the Base PRC classes frwkPrcSupportTable and The Diffserv PIB uses the Base PRC classes frwkPrcSupportTable and
frwkCompLimitsTable defined in [FR-PIB] to specify what PRC's are frwkCompLimitsTable defined in [FR-PIB] to specify what PRC's are
supported by a PEP and to specify any limitations on that support. The supported by a PEP and to specify any limitations on that support.
PIB also uses the capability PRC's frwkIfCapSetTable and The PIB also uses the capability PRC's frwkIfCapSetTable and
frwkIfCapSetRoleComboTable defined in [FR-PIB] to specify the device's frwkIfRoleComboTable defined in [FR-PIB] to specify the device's
interface types and role combinations. Each instance of the capability interface types and role combinations. Each instance of the
PRC frwkIfCapSetTable contains an OID that points to an instance of a capability PRC frwkIfCapSetTable contains an OID that points to an
PRC that describes some capability of that interface type. The Diffserv instance of a PRC that describes some capability of that interface
PIB defines several of these capability PRCs, which assist the PDP with type. The Diffserv PIB defines several of these capability PRCs,
the configuration of Diffserv functional elements that can be which assist the PDP with the configuration of Diffserv functional
elements that can be implemented by the device. Each of these
implemented by the device. Each of these capability PRCs contains a capability PRCs contains a direction attribute that specifies the
direction attribute that specifies the direction for which the direction for which the capability applies. This attribute is
capability applies. This attribute is defined in a base capability PRC, defined in a base capability PRC, which is extended by each specific
which is extended by each specific capability PRC. capability PRC.
Classification capabilities, which specify the information elements the Classification capabilities, which specify the information elements
device can use to classify traffic, are reported using the the device can use to classify traffic, are reported using the
qosIfClassificationCaps PRC. Metering capabilities, which indicate what qosIfClassificationCaps PRC. Metering capabilities, which indicate
the device can do with out-of-profile packets, are specified using the what the device can do with out-of-profile packets, are specified
qosIfMeteringCaps PRC. Scheduling capabilities, such as the number of using the qosIfMeteringCaps PRC. Scheduling capabilities, such as
inputs supported, are reported using the qosIfSchedulingCaps PRC. the number of inputs supported, are reported using the
Algorithmic drop capabilities, such as the types of algorithms qosIfSchedulingCaps PRC. Algorithmic drop capabilities, such as the
supported, are reported using the qosIfAlgDropCaps PRC. Queue types of algorithms supported, are reported using the
capabilities, such as the maximum number of queues, are reported using qosIfAlgDropCaps PRC. Queue capabilities, such as the maximum
the qosIfQueueCaps PRC. Shaper capabilities, such as the number of number of queues, are reported using the qosIfQueueCaps PRC.
rates supported, are reported using the qosIfShaperCaps table. Maximum Rate capabilities, such as the maximum number of max rate
Levels, are reported using the qosIfMaxRateCaps PRC.
Two PRC's are defined to allow specification of the element linkage Two PRC's are defined to allow specification of the element linkage
capabilities of the PEP. The qosIfElmDepthCaps PRC indicates the capabilities of the PEP. The qosIfElmDepthCaps PRC indicates the
maximum number of functional datapath elements that can be linked maximum number of functional datapath elements that can be linked
consecutively in a datapath. The qosIfElmLinkCaps PRC indicates what consecutively in a datapath. The qosIfElmLinkCaps PRC indicates
functional datapath elements are may follow a specific type of element what functional datapath elements may follow a specific type of
in a datapath. element in a datapath.
The capability reporting classes in the DiffServ and Framework PIB are The capability reporting classes in the DiffServ and Framework PIB
meant to allow the PEP to indicate some general guidelines about what are meant to allow the PEP to indicate some general guidelines about
the device can do. They are intended to be an aid to the PDP when it what the device can do. They are intended to be an aid to the PDP
constructs policy for the PEP. These classes do not necessarily allow when it constructs policy for the PEP. These classes do not
the PEP to indicate every possible configuration that it can or cannot necessarily allow the PEP to indicate every possible configuration
support. If a PEP receives a policy that it cannot implement, it must that it can or cannot support. If a PEP receives a policy that it
notify the PDP with a failure report. cannot implement, it must notify the PDP with a failure report.
5. PIB Usage Example 5. PIB Usage Example
This section provides some examples on how the different table entries This section provides some examples on how the different table
of this PIB may be used together for a Diffserv Device, with the usage entries of this PIB may be used together for a Diffserv Device. The
of each individual attribute be defined within the PIB module itself. usage of each individual attribute is defined within the PIB module
For the figures, all the PIB table entry and attribute names are assumed itself. For the figures, all the PIB table entry and attribute names
to have "qos" as their first common initial part of name, with the table are assumed to have "qos" as their first common initial part of the
entry name assumed to be their second common initial part of name. name, with the table entry name assumed to be their second common
"0.0" is being used to mean zeroDotZero. And for Scheduler Method "= X" initial part of the name. "0.0" is being used to mean zeroDotZero.
means "using the OID of qoxSchedulerX".
5.1. Model's Example
As an example, when this PIB's structures are used for the hypothetical
configuration in [MODEL] section 8.1, the result is shown in Figure 2,
3, and 4. The parameterization table entries' values are not specified
in detail here, they can be obtained from [MODEL] section 8.1.
+---------------------+ +------------------------> Q_EF
|DataPath | |
| IfCapSet="If1" | |
| Roles = "A+B" | | +--------------+
| IfDirection=Ingress | +------+ | +--->|Action |
| Start --------------+--->|Clfr | | | | Id=EF2 |
+---------------------+ | Id=1 | | | | Next=0.0 |
+------+ | | | Specific=0.0 |
| | | Type=AbsDrop |
| | +--------------+
| |
| |
| |
+------------+ +--------------+ | |
|ClfrElement | +-->|Meter | | |
| Id=EF | | | Id=EF | | |
| ClfrId=1 | | | SucceedNext -+-+ |
| Order=NA | | | FailNext ----+----+
| Next ------+--+ | Specific -+ |
| Specific --+-+ +-----------+--+
+------------+ | |
| |
| |
| +--------+ | +---------+
+-->|FilterEF| +-->|TBMeterEF|
+--------+ +---------+
+------------+ +--------------+
|ClfrElement | +-------------------->|AlgDrop |
| Id=AF11 | | | Id=AF11 |
| ClfrId=1 | | | Type=tailDrop|
| Order=NA | | | Next --------+--+-> Q_AF1
| Next ------+--+ | QMeasure ----+--+
| Specific --+-+ | QThreshold |
+------------+ | | Specific=0.0 |
| +--------------+
|
| +----------+
+->|FilterAF11|
+----------+
Figure 2: Example from Model Section 8.1 part 1
+------------+ +--------------+ And for Scheduler Method "= X" means "using the OID of
|ClfrElement | +-->|Meter | qoxSchedulerX".
| Id=AF21 | | | Id=AF21 |
| ClfrId=1 | | | SucceedNext -+----------> Q_AF2
| Order=NA | | | FailNext + |
| Next ------+--+ | Specific --+ |
| Specific --+-+ +----------+-+-+
+------------+ | | |
| | |
| | |
| +----------+ | | +-----------+
+->|FilterAF21| | +->|TBMeterAF21|
+----------+ | +-----------+
|
-----+
|
| +-----------+
+->|Action |
| Id=AF21F2 |
| Next -----+------> Q_AF2
| Specific -+-+
| Type=Spcf | |
+-----------+ |
|
| +---------------+
+->|DscpMarkActAF22|
+---------------+
+------------+ 5.1. Data Path Example
|ClfrElement | +-----------------------------------------> Q_BE
| Id=WildCard| |
| ClfrId=1 | |
| Order=NA | |
| Next ------+--+ +--------------+
| Specific --+------>|FilterMatchAll|
+------------+ +--------------+
Figure 3: Example from Model Section 8.1 part 2
+-------------+ Notice Each entry of the DataPath table is used for a specific
Q_EF--->|Q | interface type handling a flow in a specific direction for a
| Id=EF +--+--------------------------+ specific functional role-combination. For our example, we just
| Next ----+ | +-----------+ | define one of such entry.
| SchdParam --+-->|SchdParamEF| |
+-------------+ +-----------+ |
|
+-------------+ | +----------------+
Q_AF1-->|Q | +->|Scheduler |
| Id=AF1 +--+--------------------------+ | Id=Diffserv |
| Next ----+ | +------------+ | | Next=0.0 |
| SchdParam --+-->|SchdParamAF1| | | Method=Priority|
+-------------+ +------------+ | | SchdParam=0.0 |
| +----------------+
+-------------+ |
Q_AF2-->|Q | |
| Id=AF2 +--+--------------------------+
| Next ----+ | +------------+ |
| SchdParam --+-->|SchdParamAF2| |
+-------------+ +------------+ |
|
+-------------+ |
Q_BE--->|Q | |
| Id=BE +--+--------------------------+
| Next ----+ | +-----------+
| SchdParam --+-->|SchdParamBE|
+-------------+ +-----------+
Figure 4: Example from Model Section 8.1 part 3 +---------------------+
|DataPath |
| IfName ="IfCap1" |
| Roles = "A+B" |
| IfDirection=Ingress | +---------+
| Start --------------+--->|Clfr |
+---------------------+ | Id=Dept |
+---------+
5.2. Additional Data Path Example Figure 2: DataPath Usage Example
5.2.1. Data In Figure 2, we are using IfCap1 to indicate interface type with
capability set 1 handling ingress flow for functional roles of
_A+B_. We are using classifier for departments to lead us into
the Classifier Example below.
The example in Figure 5 shows a single qosDataPathTable entry feeding 5.2. Classifier and Classifier Element Example
into a single Classifier entry, with three Classifier Element and Filter
Table entry pairs belonging to this Classifier 1. Notice the three
Filters used here must completely classify all the traffic presented to
this data path.
Another level of classification can be defined that follows the Action We want to show how a multilevel classifier can be built using the
classifier tables provided by this PIB. Notice we didn't go into
details of the filters because they are not defined by this PIB.
Continuing from the Data Path example from the previous section, let
say we want to perform the following classification functionality to
do flow separation based on department and application type:
functional DataPath elements in Figure 5. This multi-level if (Dept1) then take Dept1-action
classification allow the construction of traffic separations and
specific actions at each level, like:
if (dept1) then take dept1-action
{ {
if (appl1) then take dept1-appl1-action. if (Appl1) then take Dept1-Appl1-action.
if (appl2) then take dept1-appl2-action. if (Appl2) then take Dept1-Appl2-action.
if (appl3) then take dept1-appl3-action. if (Appl3) then take Dept1-Appl3-action.
} }
if (dept2) then take dept2-action if (Dept2) then take Dept2-action
{ {
if (appl1) then take dept2-appl1-action. if (Appl1) then take Dept2-Appl1-action.
if (appl2) then take dept2-appl2-action. if (Appl2) then take Dept2-Appl2-action.
if (appl3) then take dept2-appl3-action. if (Appl3) then take Dept2-Appl3-action.
} }
if (dept3) then take dept3-action if (Dept3) then take Dept3-action
{ {
if (appl1) then take dept3-appl1-action. if (Appl1) then take Dept3-Appl1-action.
if (appl2) then take dept3-appl2-action.
if (appl3) then take dept3-appl3-action. if (Appl2) then take Dept3-Appl2-action.
if (Appl3) then take Dept3-Appl3-action.
} }
Minimally, the filters for appl1, appl2, appl3 may be reused for the The above classification logic is translated into PIB table entries
above setup. below, with two levels of classifications.
+---------------------+ First for department:
|DataPath | +---------+
| IfCapSet="If1" | |Clfr |
| Roles="A+B" | | Id=Dept |
| IfDirection=Ingress | +------+ +---------+
| Start --------------+--->|Clfr |
+---------------------+ | Id=1 |
+------+
+------------+ +--------------+ +-------------+ +-----------+
|ClfrElement | +-->|Meter | |ClfrElement | +-->|Clfr |
| Id=101 | | | Id=101 | | Id=Dept1 | | | Id=D1Appl |
| ClfrId=1 | | | SucceedNext -+--->... | ClfrId=Dept | | +-----------+
| Order=NA | | | FailNext ----+--->... | Preced=NA | |
| Next ------+--+ | Specific -+ | | Next -------+--+ +------------+
| Specific --+-+ +-----------+--+ | Specific ---+----->|Filter Dept1|
+------------+ | | +-------------+ +------------+
| +-------+ | +--------+
+-->|Filter1| +-->|TBMeter1|
+-------+ +--------+
+------------+ +--------------+ +-------------+ +-----------+
|ClfrElement | +-->|Meter | |ClfrElement | +-->|Clfr |
| Id=102 | | | Id=102 | | Id=Dept2 | | | Id=D2Appl |
| ClfrId=1 | | | SucceedNext -+->... | ClfrId=Dept | | +-----------+
| Order=NA | | | FailNext ----+->... | Preced=NA | |
| Next ------+--+ | Specific -+ | | Next -------+--+ +------------+
| Specific --+-+ +-----------+--+ | Specific ---+----->|Filter Dept2|
+------------+ | | +-------------+ +------------+
| +-------+ | +--------+
+-->|Filter2| +-->|TBMeter2|
+-------+ +--------+
+------------+ +--------------+ +-------------+ +-----------+
|ClfrElement | +-->|Meter | |ClfrElement | +-->|Clfr |
| Id=103 | | | Id=103 | | Id=Dept3 | | | Id=D3Appl |
| ClfrId=1 | | | SucceedNext -+->... | ClfrId=Dept | | +-----------+
| Order=NA | | | FailNext ----+->... | Preced=NA | |
| Next ------+--+ | Specific -+ | | Next -------+--+ +------------+
| Specific --+-+ +-----------+--+ | Specific ---+----->|Filter Dept3|
+------------+ | | +-------------+ +------------+
| +-------+ | +--------+
+-->|Filter3| +-->|TBMeter3|
+-------+ +--------+
Figure 5: Additional Data Path Example Part 1 Second for application:
+-------------+ +-----------------+
| Id=EF | | | Id=Diffserv |
| Next -------+-----------------------+ | Next=0.0 |
| SchdParam -+| | | Method=Priority |
+------------++ | | SchdParam=0.0 |
| | +-----------------+
+------------+ |
| |
| +-----------+ |
+->|SchdParamEF| |
+-----------+ +---------------------+
|
+----------------+ +-------------+ |
| Id=AF11 | | | Id=AF1 | +-------------+ |
| Type=randomDrop| | | Next -------+--->|Scheduler | |
| Next ----------+-+--+ | SchdParam -+| | Id=AF | |
| QMeasure ------+-+ | +------------++ | Next -------+--+
| QThreshold | | | | Method=WFQ |
| Specific -+ | | +------------+ | SchdParam --+--+
+-----------+----+ | | +-------------+ |
| | | +------------+ |
+-----------+ | +->|SchdParamAF1| +----------------+
| +--------------+ | +------------+ |
+->|RandomDropAF11| | | +-----------+
+--------------+ | +->|SchdParamAF|
| +-----------+
+----------------+ |
| Id=AF12 | |
| Type=randomDrop| |
| Next ----------+-+--+
| QMeasure ------+-+
| QThreshold |
| Specific -+ |
+-----------+----+
|
+-----------+ +-----------+
| +--------------+ |Clfr |
+->|RandomDropAF12| | Id=D1Appl |
+--------------+ +-----------+
Figure 6: Additional Data Path Example Part 2 +---------------+ +--------------+
|ClfrElement | +----------------->|Meter |
| Id=D1Appl1 | | | Id=D1A1Rate1 |
| ClfrId=D1Appl | | | SucceedNext -+--->...
| Preced=NA | | | FailNext ----+--->...
| Next ---------+--+ +------------+ | Specific ----+--->...
5.2.2. Meter | Specific -----+---->|Filter Appl1| +--------------+
+---------------+ +------------+
A simple Meter that can be parameterized by a single TBMeter entry is +---------------+ +--------------+
shown here. For Metering types that require multiple TBMeter entries |ClfrElement | +----------------->|Meter |
for parameterization, a second level Meter and TBMeter table entries may | Id=D1Appl2 | | | Id=D1A2Rate1 |
be used. For example, for [TRTCM], with the first level TBMeter entry | ClfrId=D1Appl | | | SucceedNext -+--->...
used for Peak Information Token Bucket, the first level SucceedNext | Preced=NA | | | FailNext ----+--->...
points to the second level Meter entry, with second level TBMeter entry | Next ---------+--+ +------------+ | Specific ----+--->...
used for Committed Information Token Bucket. | Specific -----+---->|Filter Appl2| +--------------+
+---------------+ +------------+
5.2.3. Queue +---------------+ +--------------+
|ClfrElement | +----------------->|Meter |
| Id=D1Appl3 | | | Id=D1A3Rate1 |
| ClfrId=D1Appl | | | SucceedNext -+--->...
| Preced=NA | | | FailNext ----+--->...
| Next ---------+--+ +------------+ | Specific ----+--->...
| Specific -----+---->|Filter Appl3| +--------------+
+---------------+ +------------+
Example in Figure 6 shows three classified input traffic streams, EF, Figure 3: Classifier Usage Example
AF11, and AF12, feeding into their respective queue and algorithmic
droppers. After their respective dropping process, the AF traffic
streams feed into the same queue, QAF1X.
A Scheduler, AF, is shown in Figure 6, as the sink for AF1X queue The application classifiers for department 2 and 3 will be very much
traffic, servicing AF1X queue with scheduling parameters indicated by like the application classifier for department 1 shown above.
SchdParamAF1X. This scheduler is used to service traffic from AF1X, Notice in this example, Filters for Appl1, Appl2, and Appl3 are
AF2X, AF3X queues using weighted fair queuing method. The AF2X and AF3X reusable across the application classifiers.
queues are not shown in Figure 6, they can be very much like AF1X queue
setup.
Another traffic stream, EF, is handled by the EF queue. Scheduler This classifier and classifier element example assumes the next
Diffserv services output of EF queue using SchdParamEF, and output of AF differentiated services functional datapath element is Meter and
scheduler using SchdParamAF, with Priority Queue scheduling method. lead us into the Meter Example section.
Notice all the diffserv traffic may go out on a link with traffic 5.3. Meter Example
shaping. The traffic shaping can be parameterize using the Shaping
| Scheduler in Figure 6. For shaping, the qosShapingRate attributes A single rate simple Meter may be easy to envision, hence we will do
should be used. The Shaping Scheduler is indicated as the last diffserv a Two Rate Three Color [TRTCM] example, using two Meter table
functional element of this data path by using its Next pointer with entries and two TBParam table entries.
value of zeroDotZero.
+--------------+ +---------+ +--------------+ +----------+
|Meter | +->|Action | +->| Meter | +->|Action |
| Id=D1A1Rate1 | | | Id=Green| | | Id=D1A1Rate2 | | | Id=Yellow|
| SucceedNext -+ + + - ---------+ | | SucceedNext -+-+ +----------+
| FailNext ----+-----------------+ | FailNext ----+--+ +-------+
| Specific -+ | | Specific -+ | +->|Action |
+-----------+--+ +-----------+--+ | Id=Red|
| | +-------+
| +------------+ | +------------+
+->|TBMeter | +->|TBMeter |
| Type=TRTCM | | Type=TRTCM |
| Rate | | Rate |
| BurstSize | | BurstSize |
| Interval | | Interval |
+------------+ +------------+
Figure 4: Meter Usage Example
For [TRTCM], the first level TBMeter entry is used for Committed
Information Rate and Committed Burst Size Token Bucket, and the
second level TBMeter entry is used for Peak Information Rate and
Peak Burst Size Token Bucket.
The other meters needed for this example will depend on the service
class each classified flow uses. But their construction will be
similar to the example given here. The TBMeter table entries can be
shared by multiple Meter table entries.
In this example the differentiated services functional datapath
element following Meter is Action, detailed in the following
section.
5.4. Action Example
Typically Mark Action will be used, we will continue using the
_Action, Id=Green_ branch off the Meter example.
Recall this is the D1A1Rate1 SucceedNext branch, meaning the flow
belongs to Department 1 Application 1, within the committed rate and
burst size limits for this flow. We would like to Mark this flow
with a specific DSCP and also with a device internal label.
+-----------+ +-----------+ +--->AlgDropAF11
|Action | +----------------->|Action | |
| Next -----+--+ +------------+ | Next -----+--+ +-------------+
| Specific -+---->|DscpMarkAct | | Specific -+--->|ILabelMarker |
+-----------+ | Dscp=AF11 | +-----------+ | ILabel=D1A1 |
+------------+ +-------------+
Figure 5: Action Usage Example
This example uses the frwkILabelMarker PRC defined in [FR-PIB],
showing the device internal label being used to indicate the micro
flow that feeds into the aggregated AF flow. This device internal
label may be used for flow accounting purposes and/or other data
path treatments.
5.5. Dropper Examples
The Dropper examples below will continue from the Action example
above for AF11 flow. We will provide three different dropper
setups, from simple to complex. The examples below may include some
queuing structures, they are here only to show the relationship of
the droppers to queuing and are not complete. Queuing Example are
provided in later sections.
5.5.1. Tail Dropper Example
The Tail Dropper is one of the simplest. For this example we just
want to drop part of the flow that exceeds the queue's buffering
capacity, 2 Mbytes.
+--------------------+ +------+
|AlgDrop | +->|Q AF1 |
| Id=AF11 | | +------+
| Type=tailDrop | |
| Next --------------+-+--+
| QMeasure ----------+-+
| QThreshold=2Mbytes |
| Specific=0.0 |
+--------------------+
Figure 6: Tail Dropper Usage Example
5.5.2. Single Queue Random Dropper Example
Use of Random Dropper will introduce the usage of qosRandomDropEntry
as in the example below.
+-----------------+ +------+
|AlgDrop | +->|Q AF1 |
| Id=AF11 | | +------+
| Type=randomDrop | |
| Next -----------+-+--+
| QMeasure -------+-+
| QThreshold | +----------------+
| Specific -------+-->|RandomDrop |
+-----------------+ | MinThreshBytes |
| MinThreshPkts |
| MaxThreshBytes |
| MaxThreshPkts |
| ProbMax |
| Weight |
| SamplingRate |
+----------------+
Figure 7: Single Queue Random Dropper Usage Example
Notice for Random Dropper, qosAlgDropQThreshold contains the maximum
average queue length, Qclip, for the queue being measured as
indicated by qosQMeasure, the rest of the Random Dropper parameters
are specified by qosRandomDropEntry as referenced by qosSpecific.
In this example, both qosNext and qosQMeasure references the same
queue. This is the simple case but qosQMeasure may reference
another queue for PEP implementation supporting this feature.
5.5.3. Multiple Queue Random Dropper Example
When network device implementation requires measuring multiple
queues for determining the behavior of a drop algorithm, the
existing PRCs defined in this PIB will be sufficient for the simple
case, as indicated by this example.
+-------------+ +------+
|AlgDrop | +----------------+-------------------+->|Q_AF1 |
| Id=AF11 | | | | +------+
| Type=mQDrop | | | |
| Next -------+-+ +------------+ | +------------+ |
| QMeasure ---+-->|MQAlgDrop | | +->|MQAlgDrop | |
| QThreshold | | Id=AF11A | | | | Id=AF11B | |
| Specific | | Type | | | | Type | |
+-------------+ | Next ------+-+ | | Next ------+-+
| ExceedNext +---+ | ExceedNext | +------+
| QMeasure --+-+ | QMeasure --+-->|Q AF2 |
| QThreshold | | | QThreshold | +------+
| Specific + | | | Specific + |
+----------+-+ | +----------+-+
| | +---+
+------+ | +------+ |
| +->|Q AF1 | |
| +------+ |
| |
| +----------------+ | +----------------+
+->|RandomDrop | +->|RandomDrop |
| MinThreshBytes | | MinThreshBytes |
| MinThreshPkts | | MinThreshPkts |
| MaxThreshBytes | | MaxThreshBytes |
| MaxThreshPkts | | MaxThreshPkts |
| ProbMax | | ProbMax |
| Weight | | Weight |
| SamplingRate | | SamplingRate |
+----------------+ +----------------+
Figure 8: Multiple Queue Random Dropper Usage Example
For this example, we have two queues, Q_AF1 and Q_AF2, sharing the
same buffer resources. We want to make sure the common buffer
resource is sufficient to service the AF11 traffic, and we want to
measure the two queues for determining the drop algorithm for AF11
traffic feeding into _Q_AF1_. Notice mQDrop is used for
qosAlgDropType of qosAlgDropEntry to indicate Multiple Queue
Dropping Algorithm.
The common shared buffer resource is indicated by the use of
qosAlgDropEntry, with their attributes used as follows:
- qosAlgDropType indicates the algorithm used, mQDrop.
- qosAlgDropNext is used to indicate the next functional data path
element to handle the flow when no drop occurs.
- qosAlgDropQMeasure is used as the anchor for the list of
qosMQAlgDropEntry, one for each queue being measured.
- qosAlgDropQThreshold is used to indicate the size of the shared
buffer pool.
- qosAlgDropSpecific can be used to reference instance of additional
PRC (not defined in this PIB) if more parameters are required to
describe the common shared buffer resource.
For this example, there are two subsequent qosMQAlgDropEntry, one
for each queue being measured, with its attributes used as follows:
- qosMQAlgDropType indicates the algorithm used, for this example,
both qosMQAlgDropType uses randomDrop.
- qosMQAlgDropQMeasure indicates the queue being measured.
- qosMQAlgDropNext indicates the next functional data path element
to handle the flow when no drop occurs.
- qosMQAlgDropExceedNext is used to indicate the next queue's
qosMQAlgDropEntry. With the use of zeroDotZero to indicate the
last queue.
- qosMQAlgDropQMeasure is used to indicate the queue being measured.
For this example, _Q AF1_ and _Q_AF2_ are the two queues used.
- qosAlgDropQThreshold is used as in single queue Random Dropper.
- qosAlgDropSpecific is used to reference the PRID that describes
the dropper parameters as in its normal usage. For this example
both qosAlgDropSpecific reference qosRandomDropEntrys.
Notice the anchoring qosAlgDropEntry and the two qosMQAlgDropEntrys
all have their Next attribute pointing to Q_AF1. This indicates:
- If the packet does not need to be checked with the individual
queue's drop processing because of abundance of common shared
buffer resources, then the packet is sent to Q_AF1.
- If the packet is not dropped due to current Q_AF1 conditions, then
it is sent to Q_AF1.
- If the packet is not dropped due to current Q_AF2 conditions, then
it is sent to Q_AF1.
This example also uses two qosRandomDropEntry for the two queues it
measures. Their attribute usage is the same as if for single queue
random dropper.
Other more complex result combinations can be achieved by specifying
a new PRC and referencing this new PRC with qosAlgDropSpecific of
the anchoring qosAlgDropEntry. More simple usage can also be
achieved when a single set of drop parameters are used for all
queues being measured. This again can be referenced by the
anchoring qosAlgDropSpecific. These are not defined in this PIB.
5.6. Queue and Scheduler Example
The queue and scheduler example will continue from the dropper
example in previous section. Concentrating in the queue and
scheduler Diffserv datapath functional elements. Notice a shaper is
constructed using queue and scheduler with MaxRate parameters.
+------------+ +-----------------+
---->|Q | +->|Scheduler |
| Id=EF | | | Id=Diffserv |
| Next ------+------------------------+ | Next=0.0 |
| MinRate ---+--+ | | Method=Priority |
| MaxRate -+ | | +----------+ | | MinRate=0.0 |
+----------+-+ +-->|MinRate | | | MaxRate=0.0 |
| | Priority | | +-----------------+
+----------+ | Absolute | |
| | Relative | |
| +-----------+ +----------+ |
+->|MaxRate | |
| Level | |
| Absolute | |
| Relative | |
| Threshold | |
+-----------+ +-------------+
|
+----------+ +------------+ |
---->|Q | +-->|Scheduler | |
| Id=AF1 | | | Id=AF | |
| Next ----+--------------------+ | Next ------+--+
| MinRate -+-+ | | Method=WRR |
| MaxRate | | +----------+ | | MinRate -+ |
+----------+ +->|MinRate | | | MaxRate | |
| Priority | | +----------+-+
| Absolute | | |
| Relative | | +----------+
+----------+ | |
+----------+ | | +------------+
---->|Q | | +->|MinRate |
| Id=AF2 | | | Priority |
| Next ----+--------------------+ | Absolute |
| MinRate -+-+ | | Relative |
| MaxRate | | +----------+ | +------------+
+----------+ +->|MinRate | |
| Priority | |
| Absolute | |
| Relative | |
+----------+ |
+----------+ |
---->|Q | |
| Id=AF3 | |
| Next ----+--------------------+
| MinRate -+-+
| MaxRate | | +----------+
+----------+ +->|MinRate |
| Priority |
| Absolute |
| Relative |
+----------+
Figure 9: Queue and Scheduler Usage Example
This example shows the queuing system for handling EF, AF1, AF2, and
AF3 traffic. It is assumed AF11, AF12, and AF13 traffic feeds into
Queue AF1. And likewise for AF2x and AF3x traffic.
The AF1, AF2, and AF3 Queues are serviced by the AF Scheduler using
a Weighed Round Robin method. The AF Scheduler will service each of
the queues feeding into it based on the minimum rate parameters of
each queue.
The AF and EF traffic are serviced by the DiffServ Scheduler using a
Strict Priority method. The DiffServ Scheduler will service each of
its inputs based on their priority parameter.
Notice there is an upper bound to the servicing of EF traffic by the
DiffServ Scheduler. This is accomplished with the use of maximum
rate parameters. DiffServ Scheduler uses both the maximum rate and
priority parameters when servicing the EF Queue.
The DiffServ Scheduler is the last Diffserv datapath functional
element in this datapath. It uses zeroDotZero in its Next
attribute.
6. Summary of the DiffServ PIB 6. Summary of the DiffServ PIB
The DiffServ PIB consists of one module containing the base PRCs for The DiffServ PIB consists of one module containing the base PRCs for
setting DiffServ policy, queues, classifiers, meters, etc., and also setting DiffServ policy, queues, classifiers, meters, etc., and
contains capability PRC's that allow a PEP to specify its device also contains capability PRC's that allow a PEP to specify its
characteristics to the PDP. This module contains two groups, which are device characteristics to the PDP. This module contains two groups,
summarized in this section. which are summarized in this section.
QoS Capabilities Group QoS Capabilities Group
This group consists of PRCs to indicate to the PDP the types of This group consists of PRCs to indicate to the PDP the types of
interface supported on the PEP in terms of their QoS capabilities interface supported on the PEP in terms of their QoS capabilities
and PRCs that the PDP can install in order to configure these and PRCs that the PDP can install in order to configure these
interfaces (queues, scheduling parameters, buffer sizes, etc.) to interfaces (queues, scheduling parameters, buffer sizes, etc.) to
affect the desired policy. This group describes capabilities in affect the desired policy. This group describes capabilities in
terms of the types of interfaces and takes configuration in terms terms of the types of interfaces and takes configuration in terms
of interface types and role combinations [FR-PIB]; it does not deal of interface types and role combinations [FR-PIB]; it does not
with individual interfaces on the device. deal with individual interfaces on the device.
QoS Policy Group QoS Policy Group
This group contains configuration of the functonal elements that This group contains configuration of the functional elements that
comprise the QoS policy that applies to an interface and the comprise the QoS policy that applies to an interface and the
specific parameters that describe those elements. This group specific parameters that describe those elements. This group
contains classifiers, meters, actions, droppers, queues and contains classifiers, meters, actions, droppers, queues and
schedulers. This group also contains the PRC that associates the schedulers. This group also contains the PRC that associates the
datapath elements with role combinations. datapath elements with role combinations.
7. PIB Operational Overview 7. PIB Operational Overview
This section provides an operation overview of configuring DiffServ QoS This section provides an operation overview of configuring DiffServ
policy. QoS policy.
After initial PEP to PDP communication setup, using [COPS-PR] for After initial PEP to PDP communication setup, using [COPS-PR] for
example, the PEP will provide to the PDP the PIB Provisioning Classes example, the PEP will provide to the PDP the PIB Provisioning
(PRCs), interface types, and interface type capabilities it supports. Classes (PRCs), interface types, and interface type capabilities it
supports.
The PRCs supported by the PEP are reported to the PDP in the PRC Support The PRCs supported by the PEP are reported to the PDP in the PRC
Table, frwkPrcSupportTable defined in the framework PIB [FR-PIB]. Each Support Table, frwkPrcSupportTable defined in the framework PIB [FR-
instance of the frwkPrcSupportTable indicates a PRC that the PEP PIB]. Each instance of the frwkPrcSupportTable indicates a PRC that
understands and for which the PDP can send class instances as part of the PEP understands and for which the PDP can send class instances
the policy information. as part of the policy information.
The interface types the PEP supports are described by rows in the The interface types the PEP supports are described by rows in the
interface type table, frwkIfCapsSetTable. Each row, or instance of this interface type table, frwkIfCapsSetTable. Each row, or instance of
class contains a pointer to a instance of a PRC that describes the this class contains a pointer to a instance of a PRC that describes
capabilities of the interface type. The capability objects may reside the capabilities of the interface type. The capability objects may
in the qosIfClassifierCapsTable, the qosIfMeterCapsTable, the reside in the qosIfClassifierCapsTable, the qosIfMeterCapsTable, the
qosIfSchedulerCapsTable, the qosIfElmDepthCapsTable, the qosIfSchedulerCapsTable, the qosIfElmDepthCapsTable, the
qosIfElmOutputCapsTable, or in a table defined in another PIB. qosIfElmOutputCapsTable, or in a table defined in another PIB.
The PDP, with knowledge of the PEP's capabilities, then provides the PEP The PDP, with knowledge of the PEP's capabilities, then provides the
with administration domain and interface-specific policy information. PEP with administration domain and interface-specific policy
information.
Instances of the qosDataPathTable are used to specify the first element Instances of the qosDataPathTable are used to specify the first
in the set of functional elements applied to an interface. Each element in the set of functional elements applied to an interface.
instance of the qosDataPathTable applies to an interface type defined by Each instance of the qosDataPathTable applies to an interface type
its roles and direction (ingress or egress). defined by its roles and direction (ingress or egress).
8. PIB Definitions 8. PIB Definitions
8.1. The DiffServ Base PIB 8.1. The DiffServ Base PIB
DIFFSERV-PIB PIB-DEFINITIONS ::= BEGIN DIFFSERV-PIB PIB-DEFINITIONS ::= BEGIN
IMPORTS IMPORTS
Unsigned32, Integer32, Unsigned32, Integer32,
MODULE-IDENTITY, OBJECT-TYPE MODULE-IDENTITY, OBJECT-TYPE
FROM COPS-PR-SPPI FROM COPS-PR-SPPI
zeroDotZero zeroDotZero
FROM SNMPv2-SMI FROM SNMPv2-SMI
TruthValue, TEXTUAL-CONVENTION TruthValue, TEXTUAL-CONVENTION
FROM SNMPv2-TC FROM SNMPv2-TC
InstanceId, ReferenceId, TagId, TagReferenceId, pib InstanceId, ReferenceId, TagId, TagReferenceId, pib
FROM COPS-PR-SPPI FROM COPS-PR-SPPI
RoleCombination, PrcIdentifier RoleCombination, PrcIdentifier, AttrIdentifier
FROM FRAMEWORK-ROLE-PIB FROM FRAMEWORK-ROLE-PIB
Dscp Dscp
FROM DIFFSERV-DSCP-TC FROM DIFFSERV-DSCP-TC
IfDirection IfDirection
FROM DIFF-SERV-MIB FROM DIFF-SERV-MIB
BurstSize BurstSize
FROM INTEGRATED-SERVICES-MIB; FROM INTEGRATED-SERVICES-MIB;
qosPolicyPib MODULE-IDENTITY qosPolicyPib MODULE-IDENTITY
SUBJECT-CATEGORIES { tbd } -- DiffServ QoS COPS Client Type SUBJECT-CATEGORIES { tbd } -- DiffServ QoS COPS Client Type
-- to be assigned by IANA -- to be assigned by IANA
LAST-UPDATED "200107201100Z" LAST-UPDATED "200111071800Z"
ORGANIZATION "IETF DIFFSERV WG" ORGANIZATION "IETF DIFFSERV WG"
CONTACT-INFO " CONTACT-INFO "
Michael Fine Michael Fine
Cisco Systems, Inc. Cisco Systems, Inc.
170 West Tasman Drive 170 West Tasman Drive
San Jose, CA 95134-1706 USA San Jose, CA 95134-1706 USA
Phone: +1 408 527 8218 Phone: +1 408 527 8218
Email: mfine@cisco.com Email: mfine@cisco.com
Keith McCloghrie Keith McCloghrie
skipping to change at page 27, line 28 skipping to change at page 27, line 15
that describe quality of service (QoS) policies for that describe quality of service (QoS) policies for
DiffServ. It includes general classes that may be extended DiffServ. It includes general classes that may be extended
by other PIB specifications as well as a set of PIB by other PIB specifications as well as a set of PIB
classes related to IP processing." classes related to IP processing."
::= { pib xxx } -- xxx to be assigned by IANA ::= { pib xxx } -- xxx to be assigned by IANA
qosCapabilityClasses OBJECT IDENTIFIER ::= { qosPolicyPib 1 } qosCapabilityClasses OBJECT IDENTIFIER ::= { qosPolicyPib 1 }
qosPolicyClasses OBJECT IDENTIFIER ::= { qosPolicyPib 2 } qosPolicyClasses OBJECT IDENTIFIER ::= { qosPolicyPib 2 }
qosPolicyParameters OBJECT IDENTIFIER ::= { qosPolicyPib 3 } qosPolicyParameters OBJECT IDENTIFIER ::= { qosPolicyPib 3 }
qosPolicyPibConformance OBJECT IDENTIFIER ::= { qosPolicyPib 4 }
-- --
-- Interface Capabilities Group -- Interface Capabilities Group
-- --
-- --
-- Interface Type Capability Tables -- Interface Type Capability Tables
-- --
-- The Interface type capability tables define capabilities that may -- The Interface type capability tables define capabilities that may
-- be associated with interfaces of a specific type. This PIB
-- defines three such tables: a classification capabilities table, a -- defines three such tables: a classification capabilities table, a
-- metering capabilities table and a scheduling capabilities table. -- metering capabilities table and a scheduling capabilities table.
-- Other PIBs may define other capability tables to augment the -- Other PIBs may define other capability tables to augment the
-- capability definitions of these tables or to introduce completely -- capability definitions of these tables or to introduce completely
-- new capabilities. -- new capabilities.
-- --
-- The Base Capability Table -- The Base Capability Table
-- --
qosBaseIfCapsTable OBJECT-TYPE qosBaseIfCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosBaseIfCapsEntry SYNTAX SEQUENCE OF QosBaseIfCapsEntry
PIB-ACCESS notify, 3 PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Base Interface Capability class. This class represents "The Base Interface Capability class. This class represents
a generic capability supported by a device in the ingress, a generic capability supported by a device in the ingress,
egress or both directions." egress or both directions."
::= { qosCapabilityClasses 1 } ::= { qosCapabilityClasses 1 }
qosBaseIfCapsEntry OBJECT-TYPE qosBaseIfCapsEntry OBJECT-TYPE
SYNTAX QosBaseIfCapsEntry SYNTAX QosBaseIfCapsEntry
STATUS current STATUS current
skipping to change at page 29, line 8 skipping to change at page 28, line 24
::= { qosBaseIfCapsEntry 1 } ::= { qosBaseIfCapsEntry 1 }
qosBaseIfCapsDirection OBJECT-TYPE qosBaseIfCapsDirection OBJECT-TYPE
SYNTAX Integer32 { SYNTAX Integer32 {
inbound(1), inbound(1),
outbound(2), outbound(2),
inAndOut(3) inAndOut(3)
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This object specifies the direction(s) for which the capability "This object specifies the direction(s) for which the
applies. A value of 'inbound(1)' means the capability applies capability applies. A value of 'inbound(1)' means the
only to the ingress direction. A value of 'outbound(2)' means capability applies only to the ingress direction. A value of
the capability applies only to the egress direction. A value of 'outbound(2)' means the capability applies only to the egress
'inAndOut(3)' means the capability applies to both directions." direction. A value of 'inAndOut(3)' means the capability
applies to both directions."
::= { qosBaseIfCapsEntry 2 } ::= { qosBaseIfCapsEntry 2 }
-- --
-- The Classification Capability Table -- The Classification Capability Table
-- --
qosIfClassificationCapsTable OBJECT-TYPE qosIfClassificationCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfClassificationCapsEntry SYNTAX SEQUENCE OF QosIfClassificationCapsEntry
PIB-ACCESS notify, 2 PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the classification capabilities of an "This table specifies the classification capabilities of an
interface type" interface type"
::= { qosCapabilityClasses 2 } ::= { qosCapabilityClasses 2 }
qosIfClassificationCapsEntry OBJECT-TYPE qosIfClassificationCapsEntry OBJECT-TYPE
SYNTAX QosIfClassificationCapsEntry SYNTAX QosIfClassificationCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
skipping to change at page 30, line 19 skipping to change at page 29, line 26
-- IP source addresses -- IP source addresses
ipDstAddrClassification(2), ipDstAddrClassification(2),
-- indicates the ability to classify based on -- indicates the ability to classify based on
-- IP destination addresses -- IP destination addresses
ipProtoClassification(3), ipProtoClassification(3),
-- indicates the ability to classify based on -- indicates the ability to classify based on
-- IP protocol numbers -- IP protocol numbers
ipDscpClassification(4), ipDscpClassification(4),
-- indicates the ability to classify based on -- indicates the ability to classify based on
-- IP DSCP -- IP DSCP
ipL4Classification(5) ipL4Classification(5),
-- indicates the ability to classify based on -- indicates the ability to classify based on
-- IP layer 4 port numbers for UDP and TCP -- IP layer 4 port numbers for UDP and TCP
ipV6FlowID(6)
-- indicates the ability to classify based on
-- IPv6 FlowIDs.
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Bit set of supported classification capabilities. In "Bit set of supported classification capabilities. In
addition to these capabilities, other PIBs may define other addition to these capabilities, other PIBs may define other
capabilities that can then be specified in addition to the capabilities that can then be specified in addition to the
ones specified here (or instead of the ones specified here if ones specified here (or instead of the ones specified here if
none of these are specified)." none of these are specified)."
::= { qosIfClassificationCapsEntry 1 } ::= { qosIfClassificationCapsEntry 1 }
-- --
-- Metering Capabilities -- Metering Capabilities
-- --
qosIfMeteringCapsTable OBJECT-TYPE qosIfMeteringCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfMeteringCapsEntry SYNTAX SEQUENCE OF QosIfMeteringCapsEntry
PIB-ACCESS notify, 2 PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the metering capabilities of an "This table specifies the metering capabilities of an
interface type" interface type"
::= { qosCapabilityClasses 3 } ::= { qosCapabilityClasses 3 }
qosIfMeteringCapsEntry OBJECT-TYPE qosIfMeteringCapsEntry OBJECT-TYPE
SYNTAX QosIfMeteringCapsEntry SYNTAX QosIfMeteringCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the classification "An instance of this class describes the classification
capabilities of an interface." capabilities of an interface."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { qosBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { qosBaseIfCapsDirection,
qosIfMeteringCapsSpec } qosIfMeteringCapsSpec }
skipping to change at page 31, line 20 skipping to change at page 30, line 22
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { qosBaseIfCapsDirection,
qosIfMeteringCapsSpec } qosIfMeteringCapsSpec }
::= { qosIfMeteringCapsTable 1 } ::= { qosIfMeteringCapsTable 1 }
QosIfMeteringCapsEntry ::= SEQUENCE { QosIfMeteringCapsEntry ::= SEQUENCE {
qosIfMeteringCapsSpec BITS qosIfMeteringCapsSpec BITS
} }
qosIfMeteringCapsSpec OBJECT-TYPE qosIfMeteringCapsSpec OBJECT-TYPE
SYNTAX BITS { SYNTAX BITS {
meterByRemarking (1), SimpleTokenBucket(1),
meterByDropping (2) AvgRate(2),
-- These capabilities indicate if the interface SrTCMBlind(3),
-- can remark out of profile packets or drop them, SrTCMAware(4),
-- respectively TrTCMBlind(5),
TrTCMAware(6),
TswTCM(7)
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Bit set of supported metering capabilities. As with "Bit set of supported metering capabilities. As with
classification capabilities, these metering capabilities may classification capabilities, these metering capabilities may
be augmented by capabilities specified in other PRCs (in other be augmented by capabilities specified in other PRCs (in other
PIBs)." PIBs)."
::= { qosIfMeteringCapsEntry 1 } ::= { qosIfMeteringCapsEntry 1 }
-- --
skipping to change at page 32, line 7 skipping to change at page 31, line 5
-- drop supported by an interface type for a specific flow -- drop supported by an interface type for a specific flow
-- direction. -- direction.
-- Additional capabilities affecting the drop functionalities -- Additional capabilities affecting the drop functionalities
-- are determined based on queue capabilities associated with -- are determined based on queue capabilities associated with
-- specific instance of a dropper, hence not specified by -- specific instance of a dropper, hence not specified by
-- this table. -- this table.
-- --
qosIfAlgDropCapsTable OBJECT-TYPE qosIfAlgDropCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfAlgDropCapsEntry SYNTAX SEQUENCE OF QosIfAlgDropCapsEntry
PIB-ACCESS notify, 2 PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the algorithmic dropper "This table specifies the algorithmic dropper
capabilities of an interface type" capabilities of an interface type"
::= { qosCapabilityClasses 4 } ::= { qosCapabilityClasses 4 }
qosIfAlgDropCapsEntry OBJECT-TYPE qosIfAlgDropCapsEntry OBJECT-TYPE
SYNTAX QosIfAlgDropCapsEntry SYNTAX QosIfAlgDropCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the algorithm dropper "An instance of this class describes the algorithm dropper
capabilities of an interface." capabilities of an interface."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { qosBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { qosBaseIfCapsDirection,
qosIfAlgDropCapsType } qosIfAlgDropCapsType,
qosIfAlgDropCapsMQCount }
::= { qosIfAlgDropCapsTable 1 } ::= { qosIfAlgDropCapsTable 1 }
QosIfAlgDropCapsEntry ::= SEQUENCE { QosIfAlgDropCapsEntry ::= SEQUENCE {
qosIfAlgDropCapsType BITS qosIfAlgDropCapsType BITS,
qosIfAlgDropCapsMQCount Unsigned32
} }
qosIfAlgDropCapsType OBJECT-TYPE qosIfAlgDropCapsType OBJECT-TYPE
SYNTAX BITS { SYNTAX BITS {
tailDrop(2), tailDrop(2),
headDrop(3), headDrop(3),
randomDrop(4) } randomDrop(4),
alwaysDrop(5),
mQDrop(6) }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The type of algorithm that droppers associated with queues "The type of algorithm that droppers associated with queues
may use. may use.
The tailDrop(2) algorithm means that packets are dropped from The tailDrop(2) algorithm means that packets are dropped from
the tail of the queue when the associated queue's MaxQueueSize is the tail of the queue when the associated queue's MaxQueueSize
exceeded. The headDrop(3) algorithm means that packets are is exceeded. The headDrop(3) algorithm means that packets are
dropped from the head of the queue when the associated queue's dropped from the head of the queue when the associated queue's
MaxQueueSize is exceeded. The randomDrop(4) algorithm means that MaxQueueSize is exceeded. The randomDrop(4) algorithm means
an algorithm is executed which may randomly that an algorithm is executed which may randomly
drop the packet, or drop other packet(s) from the queue drop the packet, or drop other packet(s) from the queue
in its place. The specifics of the algorithm may be in its place. The specifics of the algorithm may be
proprietary. However, parameters would be specified in the proprietary. However, parameters would be specified in the
qosRandomDropTable." qosRandomDropTable. The alwaysDrop(5) will drop every packet
presented to it. The mQDrop(6) algorithm will drop packets
based on measurement from multiple queues."
::= { qosIfAlgDropCapsEntry 1 } ::= { qosIfAlgDropCapsEntry 1 }
qosIfAlgDropCapsMQCount OBJECT-TYPE
SYNTAX Unsigned32
STATUS current
DESCRIPTION
"Indicates the number of queues measured for the drop
algorithm.
This attribute is ignored when alwaysDrop(5) algorithm is
used. This attribute contains the value of 1 for all drop
algorithm types except for mQDrop(6), where this attribute
is used to indicate the maximum number of qosMQAlgDropEntry
that can be chained together."
DEFVAL { 1 }
::= { qosIfAlgDropCapsEntry 2 }
-- --
-- Queue Capabilities -- Queue Capabilities
-- --
qosIfQueueCapsTable OBJECT-TYPE qosIfQueueCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfQueueCapsEntry SYNTAX SEQUENCE OF QosIfQueueCapsEntry
PIB-ACCESS notify, 4 PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the scheduling capabilities of an "This table specifies the scheduling capabilities of an
interface type" interface type"
::= { qosCapabilityClasses 5 } ::= { qosCapabilityClasses 5 }
qosIfQueueCapsEntry OBJECT-TYPE qosIfQueueCapsEntry OBJECT-TYPE
SYNTAX QosIfQueueCapsEntry SYNTAX QosIfQueueCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
skipping to change at page 34, line 13 skipping to change at page 33, line 16
DESCRIPTION DESCRIPTION
"Some interfaces may allow the size of a queue to be "Some interfaces may allow the size of a queue to be
configured. This attribute specifies the maximum size that configured. This attribute specifies the maximum size that
can be configured for a queue, specified in bytes." can be configured for a queue, specified in bytes."
::= { qosIfQueueCapsEntry 2 } ::= { qosIfQueueCapsEntry 2 }
qosIfQueueCapsTotalQueueSize OBJECT-TYPE qosIfQueueCapsTotalQueueSize OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Some interfaces may have a limited buffer space to be share "Some interfaces may have a limited buffer space to be shared
amoungst all queues of that interface while also allowing the amongst all queues of that interface while also allowing the
size of each queue to be configurable. To prevent the size of each queue to be configurable. To prevent the
situation where the PDP configures the sizes of the queues in situation where the PDP configures the sizes of the queues in
excess of the total buffer available to the interface, the PEP excess of the total buffer available to the interface, the PEP
can report the total buffer space in bytes available with this can report the total buffer space in bytes available with this
capability." capability."
::= { qosIfQueueCapsEntry 3 } ::= { qosIfQueueCapsEntry 3 }
-- --
-- Scheduler Capabilities -- Scheduler Capabilities
-- --
qosIfSchedulerCapsTable OBJECT-TYPE qosIfSchedulerCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfSchedulerCapsEntry SYNTAX SEQUENCE OF QosIfSchedulerCapsEntry
PIB-ACCESS notify, 3 PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the scheduler capabilities of an "This table specifies the scheduler capabilities of an
interface type" interface type"
::= { qosCapabilityClasses 6 } ::= { qosCapabilityClasses 6 }
qosIfSchedulerCapsEntry OBJECT-TYPE qosIfSchedulerCapsEntry OBJECT-TYPE
SYNTAX QosIfSchedulerCapsEntry SYNTAX QosIfSchedulerCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the scheduler "An instance of this class describes the scheduler
capabilities of an interface type." capabilities of an interface type."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { qosBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { qosBaseIfCapsDirection,
qosIfSchedulerCapsServiceDisc, qosIfSchedulerCapsServiceDisc,
qosIfSchedulerCapsMaxInputs } qosIfSchedulerCapsMaxInputs }
::= { qosIfSchedulerCapsTable 1 } ::= { qosIfSchedulerCapsTable 1 }
QosIfSchedulerCapsEntry ::= SEQUENCE { QosIfSchedulerCapsEntry ::= SEQUENCE {
qosIfSchedulerCapsServiceDisc OBJECT IDENTIFIER, qosIfSchedulerCapsServiceDisc OBJECT IDENTIFIER,
qosIfSchedulerCapsMaxInputs Unsigned32 qosIfSchedulerCapsMaxInputs Unsigned32,
qosIfSchedulerCapsMinMaxRate BITS
} }
qosIfSchedulerCapsServiceDisc OBJECT-TYPE qosIfSchedulerCapsServiceDisc OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER SYNTAX OBJECT IDENTIFIER
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The scheduling discipline for which the set of capabilities "The scheduling discipline for which the set of capabilities
specified in this object apply. Object identifiers for several specified in this object apply. Object identifiers for several
general purpose and well-known queuing disciplines are defined general purpose and well-known scheduling disciplines are
in this PIB. Queueing disciplines defined in another PIB may defined
also be specified." in the Scheduler Method Parameters section of this PIB.
These include Priority, WRR, WFQ."
::= { qosIfSchedulerCapsEntry 1 } ::= { qosIfSchedulerCapsEntry 1 }
qosIfSchedulerCapsMaxInputs OBJECT-TYPE qosIfSchedulerCapsMaxInputs OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum number of queues that this interface type can "The maximum number of queues and/or schedulers that can
support for the scheduler type indicated by feed into a scheduler indicated by this capability entry
qosIfSchedulerCapsServiceDisc. A value of zero means that there for this interface type. A value of zero means there
is no maximum." is no maximum."
::= { qosIfSchedulerCapsEntry 2 } ::= { qosIfSchedulerCapsEntry 2 }
qosIfSchedulerCapsMinMaxRate OBJECT-TYPE
SYNTAX BITS {
MinRate(1),
MaxRate(2),
MinAndMaxRates(3)
}
STATUS current
DESCRIPTION
"Scheduler capability indicating ability to handle inputs
with minimum rate, maximum rate, or both."
::= { qosIfSchedulerCapsEntry 3 }
-- --
-- Maximum Rate Capabilities
-- --
qosIfShaperCapsTable OBJECT-TYPE qosIfMaxRateCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfShaperCapsEntry SYNTAX SEQUENCE OF QosIfMaxRateCapsEntry
PIB-ACCESS notify, 3 PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the shaping capabilities of an "This table specifies the maximum rate capabilities of an
interface type" interface type"
::= { qosCapabilityClasses 7 } ::= { qosCapabilityClasses 7 }
qosIfShaperCapsEntry OBJECT-TYPE qosIfMaxRateCapsEntry OBJECT-TYPE
SYNTAX QosIfShaperCapsEntry SYNTAX QosIfMaxRateCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the shaping "An instance of this class describes the maximum rate
capabilities of an interface type." capabilities of an interface type."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { qosBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { qosBaseIfCapsDirection,
qosIfShaperCapsAlgorithm, QosIfMaxRateCapsMaxLevels }
qosIfShaperCapsMaxNumberOfRates } ::= { qosIfMaxRateCapsTable 1 }
::= { qosIfShaperCapsTable 1 }
QosIfShaperCapsEntry ::= SEQUENCE { QosIfMaxRateCapsEntry ::= SEQUENCE {
qosIfShaperCapsAlgorithm OBJECT IDENTIFIER, qosIfMaxRateCapsMaxLevels Unsigned32
qosIfShaperCapsMaxNumberOfRates Unsigned32
} }
qosIfShaperCapsAlgorithm OBJECT-TYPE qosIfMaxRateCapsMaxLevels OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER
STATUS current
DESCRIPTION
"The shaping method for which the set of capabilities
specified in this object apply. Values that may be
used for this attribute are: qosSingleRateShaper,
qosFrameRelayDualRateShaper, qosATMDualRateShaper,
qosRateAdaptiveShaper (RFC2963)."
::= { qosIfShaperCapsEntry 1 }
qosIfShaperCapsMaxNumberOfRates OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum number of rates shapers of the type indicated "The maximum number of levels a maximum rate specification
by qosIfShaperCapsAlgorithm may have for this interface type may have for this interface type and flow direction."
and flow direction." ::= { qosIfMaxRateCapsEntry 1 }
::= { qosIfShaperCapsEntry 2 }
-- --
-- Datapath Element Linkage Capabilities -- Datapath Element Linkage Capabilities
-- --
-- --
-- Datapath Element Cascade Depth -- Datapath Element Cascade Depth
-- --
qosIfElmDepthCapsTable OBJECT-TYPE qosIfElmDepthCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfElmDepthCapsEntry SYNTAX SEQUENCE OF QosIfElmDepthCapsEntry
PIB-ACCESS notify, 3 PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the number of elements of the same "This table specifies the number of elements of the same
type that can be cascaded together in a data path." type that can be cascaded together in a data path."
::= { qosCapabilityClasses 8 } ::= { qosCapabilityClasses 8 }
qosIfElmDepthCapsEntry OBJECT-TYPE qosIfElmDepthCapsEntry OBJECT-TYPE
SYNTAX QosIfElmDepthCapsEntry SYNTAX QosIfElmDepthCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the cascade depth "An instance of this class describes the cascade depth
for a particular datapath functional element PRC. A for a particular functional datapath element PRC. A
functional datapath element not represented in this functional datapath element not represented in this
table can be assumed to have no specific maximum table can be assumed to have no specific maximum
depth." depth."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { qosBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { qosBaseIfCapsDirection,
qosIfElmDepthCapsPrc } qosIfElmDepthCapsPrc }
::= { qosIfElmDepthCapsTable 1 } ::= { qosIfElmDepthCapsTable 1 }
QosIfElmDepthCapsEntry ::= SEQUENCE { QosIfElmDepthCapsEntry ::= SEQUENCE {
qosIfElmDepthCapsPrc PrcIdentifier, qosIfElmDepthCapsPrc PrcIdentifier,
qosIfElmDepthCapsCascadeMax Unsigned32 qosIfElmDepthCapsCascadeMax Unsigned32
} }
skipping to change at page 37, line 33 skipping to change at page 36, line 10
QosIfElmDepthCapsEntry ::= SEQUENCE { QosIfElmDepthCapsEntry ::= SEQUENCE {
qosIfElmDepthCapsPrc PrcIdentifier, qosIfElmDepthCapsPrc PrcIdentifier,
qosIfElmDepthCapsCascadeMax Unsigned32 qosIfElmDepthCapsCascadeMax Unsigned32
} }
qosIfElmDepthCapsPrc OBJECT-TYPE qosIfElmDepthCapsPrc OBJECT-TYPE
SYNTAX PrcIdentifier SYNTAX PrcIdentifier
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The object identifier of a PRC that represents a datapath "The object identifier of a PRC that represents a functional
functional element. This may be one of: qosClfrElementEntry, datapath element. This may be one of: qosClfrElementEntry,
qosMeterEntry, qosActionEntry, qosAlgDropEntry, qosQEntry, or qosMeterEntry, qosActionEntry, qosAlgDropEntry, qosQEntry, or
qosSchedulerEntry. The value is the OID of the table entry. qosSchedulerEntry. The value is the OID of the table entry.
There may not be more than one instance of this class with There may not be more than one instance of this class with
the same value of qosIfElmDepthCapsPrc." the same value of qosIfElmDepthCapsPrc."
::= { qosIfElmDepthCapsEntry 1 } ::= { qosIfElmDepthCapsEntry 1 }
qosIfElmDepthCapsCascadeMax OBJECT-TYPE qosIfElmDepthCapsCascadeMax OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum number of elements of type qosIfElmDepthCapsPrc "The maximum number of elements of type qosIfElmDepthCapsPrc
that can be linked consecutively in a data path." A value of that can be linked consecutively in a data path. A value of
zero indicates there is no specific maximum." zero indicates there is no specific maximum."
::= { qosIfElmDepthCapsEntry 2 } ::= { qosIfElmDepthCapsEntry 2 }
-- --
-- Datapath Element Linkage Types -- Datapath Element Linkage Types
-- --
qosIfElmLinkCapsTable OBJECT-TYPE qosIfElmLinkCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfElmLinkCapsEntry SYNTAX SEQUENCE OF QosIfElmLinkCapsEntry
PIB-ACCESS notify, 4 PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies what types of datapath functional "This table specifies what types of datapath functional
elements may be used as the next downstream element for elements may be used as the next downstream element for
a specific type of functional element." a specific type of functional element."
::= { qosCapabilityClasses 9 } ::= { qosCapabilityClasses 9 }
qosIfElmLinkCapsEntry OBJECT-TYPE qosIfElmLinkCapsEntry OBJECT-TYPE
SYNTAX QosIfElmLinkCapsEntry SYNTAX QosIfElmLinkCapsEntry
STATUS current STATUS current
skipping to change at page 38, line 31 skipping to change at page 36, line 48
a specific type of functional element." a specific type of functional element."
::= { qosCapabilityClasses 9 } ::= { qosCapabilityClasses 9 }
qosIfElmLinkCapsEntry OBJECT-TYPE qosIfElmLinkCapsEntry OBJECT-TYPE
SYNTAX QosIfElmLinkCapsEntry SYNTAX QosIfElmLinkCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class specifies a PRC that may "An instance of this class specifies a PRC that may
be used as the next functional element after a specific be used as the next functional element after a specific
type of element in a data path." type of element in a data path."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { qosBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { qosBaseIfCapsDirection,
qosIfElmLinkCapsPrc, qosIfElmLinkCapsPrc,
qosIfElmLinkCapsAttr, qosIfElmLinkCapsAttr,
qosIfElmLinkCapsNextPrc } qosIfElmLinkCapsNextPrc }
::= { qosIfElmLinkCapsTable 1 } ::= { qosIfElmLinkCapsTable 1 }
QosIfElmLinkCapsEntry ::= SEQUENCE { QosIfElmLinkCapsEntry ::= SEQUENCE {
qosIfElmLinkCapsPrc PrcIdentifier, qosIfElmLinkCapsPrc PrcIdentifier,
qosIfElmLinkCapsAttr Unsigned32, qosIfElmLinkCapsAttr AttrIdentifier,
qosIfElmLinkCapsNextPrc PrcIdentifier qosIfElmLinkCapsNextPrc PrcIdentifier
} }
qosIfElmLinkCapsPrc OBJECT-TYPE qosIfElmLinkCapsPrc OBJECT-TYPE
SYNTAX PrcIdentifier SYNTAX PrcIdentifier
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The value is the OID of a PRC that represents a "The value is the OID of a PRC that represents a
functional datapath element. This OID must not have functional datapath element. This OID must not have
the value zeroDotZero." the value zeroDotZero."
::= { qosIfElmLinkCapsEntry 1 } ::= { qosIfElmLinkCapsEntry 1 }
qosIfElmLinkCapsAttr OBJECT-TYPE qosIfElmLinkCapsAttr OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX AttrIdentifier
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The value represents the attribute in the the PRC "The value represents the attribute in the PRC
indicated by qosIfElmLinkCapsPrc that is used to indicated by qosIfElmLinkCapsPrc that is used to
specify the next functional element in the datapath. specify the next functional element in the datapath.
The attribute value corresponds to the order in which The attribute value corresponds to the order in which
the attribute appears in the definition of the PRC. the attribute appears in the definition of the PRC.
A value of 1 indicates the first attribute of the PRC, A value of 1 indicates the first attribute of the PRC,
a value of 2 indicates the second attribute of the a value of 2 indicates the second attribute of the
PRC, and so forth." PRC, and so forth."
::= { qosIfElmLinkCapsEntry 2 } ::= { qosIfElmLinkCapsEntry 2 }
qosIfElmLinkCapsNextPrc OBJECT-TYPE qosIfElmLinkCapsNextPrc OBJECT-TYPE
SYNTAX PrcIdentifier SYNTAX PrcIdentifier
STATUS current STATUS current
skipping to change at page 40, line 6 skipping to change at page 39, line 4
Prid Prc Attr NextPrc Prid Prc Attr NextPrc
1 qosMeterEntry qosMeterSucceedNext qosActionEntry 1 qosMeterEntry qosMeterSucceedNext qosActionEntry
2 qosMeterEntry qosMeterSucceedNext qosMeterEntry 2 qosMeterEntry qosMeterSucceedNext qosMeterEntry
3 qosMeterEntry qosMeterFailNext qosActionEntry. 3 qosMeterEntry qosMeterFailNext qosActionEntry.
zeroDotZero is a valid value for this attribute to zeroDotZero is a valid value for this attribute to
specify that the PRC specified in qosIfElmLinkCapsPrc specify that the PRC specified in qosIfElmLinkCapsPrc
is the last functional data path element." is the last functional data path element."
::= { qosIfElmLinkCapsEntry 3 } ::= { qosIfElmLinkCapsEntry 3 }
-- --
-- Policy Classes -- Policy Classes
-- --
-- --
-- Data Path Table -- Data Path Table
-- --
-- The Data Path Table enumerates the Differentiated Services -- The Data Path Table enumerates the Differentiated Services
-- Functional Data Paths within this device. Each entry specifies
-- the first functional datapath element to process data flow -- the first functional datapath element to process data flow
-- for each specific datapath. Each datapath is defined by the -- for each specific datapath. Each datapath is defined by the
-- interface role combination and direction. This table can -- interface role combination and direction. This table can
-- therefore have up to two entries for each role combination, -- therefore have up to two entries for each role combination,
-- ingress and egress. -- ingress and egress.
qosDataPathTable OBJECT-TYPE qosDataPathTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosDataPathEntry SYNTAX SEQUENCE OF QosDataPathEntry
PIB-ACCESS install, 6 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The data path table defines the data paths in this "The data path table indicates the start of
device. Each data path is defined by the interface, functional data paths in this device."
role combination and traffic direction. The first
functional datapath element to handle traffic for
this data path is defined by a Prid in the entries
of this table."
::= { qosPolicyClasses 1 } ::= { qosPolicyClasses 1 }
qosDataPathEntry OBJECT-TYPE qosDataPathEntry OBJECT-TYPE
SYNTAX QosDataPathEntry SYNTAX QosDataPathEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the data path table describes a single "Each entry in this table indicates the start of a single
data path in this device." functional data path, defined by its interface name,
role combination and traffic direction. The first
functional datapath element to handle traffic for each
data path is defined by the qosDataPathStart attribute
of each table entry.
Notice for each entry:
1. qosDataPathIfName must reference an existing interface
capability name in frwkIfCapSetTable [FR-PIB].
2. qosDataPathRoles must reference existing Role Combination
in frwkIfRoleComboTable [FR-PIB].
3. qosDataPathStart must reference an existing entry in a
functional data path element table.
If any one or more of these three requirements is not
satisfied, the qosDataPathEntry will not be installed."
PIB-INDEX { qosDataPathPrid } PIB-INDEX { qosDataPathPrid }
UNIQUENESS { qosDataPathRoles, UNIQUENESS { qosDataPathIfName,
qosDataPathRoles,
qosDataPathIfDirection } qosDataPathIfDirection }
::= { qosDataPathTable 1 } ::= { qosDataPathTable 1 }
QosDataPathEntry ::= SEQUENCE { QosDataPathEntry ::= SEQUENCE {
qosDataPathPrid InstanceId, qosDataPathPrid InstanceId,
qosDataPathIfName SnmpAdminString, qosDataPathIfName SnmpAdminString,
qosDataPathRoles RoleCombination, qosDataPathRoles RoleCombination,
qosDataPathIfDirection IfDirection, qosDataPathIfDirection IfDirection,
qosDataPathStart Prid qosDataPathStart Prid
} }
qosDataPathPrid OBJECT-TYPE qosDataPathPrid OBJECT-TYPE
SYNTAX InstanceId SYNTAX InstanceId
skipping to change at page 41, line 37 skipping to change at page 40, line 36
attribute must exist in the frwkIfCapSetTable [FR-PIB] prior attribute must exist in the frwkIfCapSetTable [FR-PIB] prior
to association with an instance of this class." to association with an instance of this class."
::= { qosDataPathEntry 2 } ::= { qosDataPathEntry 2 }
qosDataPathRoles OBJECT-TYPE qosDataPathRoles OBJECT-TYPE
SYNTAX RoleCombination SYNTAX RoleCombination
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The interfaces to which this data path entry applies, "The interfaces to which this data path entry applies,
specified in terms of roles. There must exist an entry specified in terms of roles. There must exist an entry
in the frwkIfCapSetRoleComboTable [FR-PIB] specifying in the frwkIfRoleComboTable [FR-PIB] specifying
this role combination, together with the interface this role combination, together with the interface
capability set specified by qosDataPathIfName, prior to capability set specified by qosDataPathIfName, prior to
association with an instance of this class." association with an instance of this class."
::= { qosDataPathEntry 3 } ::= { qosDataPathEntry 3 }
qosDataPathIfDirection OBJECT-TYPE qosDataPathIfDirection OBJECT-TYPE
SYNTAX IfDirection SYNTAX IfDirection
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Specifies the direction for which this data path "Specifies the direction for which this data path
skipping to change at page 42, line 22 skipping to change at page 41, line 15
DESCRIPTION DESCRIPTION
"This selects the first functional datapath element "This selects the first functional datapath element
to handle traffic for this data path. This to handle traffic for this data path. This
Prid should point to an instance of one of: Prid should point to an instance of one of:
qosClfrEntry qosClfrEntry
qosMeterEntry qosMeterEntry
qosActionEntry qosActionEntry
qosAlgDropEntry qosAlgDropEntry
qosQEntry qosQEntry
The PRI to must exist prior to the installation of The PRI pointed to must exist prior to the installation of
this datapath start element." this datapath start element."
::= { qosDataPathEntry 5 } ::= { qosDataPathEntry 5 }
-- --
-- Classifiers -- Classifiers
-- --
-- Classifier allows multiple classifier elements, of same or
-- different types, to be used together.
-- A classifier must completely classify all packets presented to
-- it. This means all traffic handled by a classifier must match
-- at least one classifier element within the classifier,
-- with the classifier element parameters specified by a filter.
-- It is the PDP's responsibility to create a _catch all_ classifier
-- element and filter that matches all packet. This _catch all_
-- classifier element should have the lowest Precedence value.
-- If there is ambiguity between classifier elements of different
-- classifier, classifier linkage order indicates their precedence;
-- the first classifier in the link is applied to the traffic first.
-- Each entry in the classifier table represents a classifier, with
-- classifier element table handling the fan-out functionality of a
-- classifier, and filter table defining the classification
-- patterns.
--
-- --
-- Classifier Table -- Classifier Table
-- --
-- The Classifier Table enumerates the Diffserv classifiers in this
-- device. Each classifier is referenced by its classifier elements
-- using its classifier ID.
--
qosClfrTable OBJECT-TYPE qosClfrTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosClfrEntry SYNTAX SEQUENCE OF QosClfrEntry
PIB-ACCESS install, 3 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"" "This table enumerates all the Diffserv classifier functional
data path elements of this device. The actual classification
definitions are detailed in qosClfrElementTable entries
belonging to each classifer.
An entry in this table, referenced by an upstream functional
data path element or a datapath table entry, is the entry
point to the classifier functional data path element.
The qosClfrId of each entry is used to organize all
classifier elements belonging to the same classifier."
REFERENCE REFERENCE
"[MODEL] section 4.1" "[MODEL] section 4.1"
::= { qosPolicyClasses 2 } ::= { qosPolicyClasses 2 }
qosClfrEntry OBJECT-TYPE qosClfrEntry OBJECT-TYPE
SYNTAX QosClfrEntry SYNTAX QosClfrEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the classifier table describes a "An entry in the classifier table describes a single
single classifier. Each classifier element belong- classifier. Each classifier element belonging to this
ing to the this classifier must have its classifier must have its qosClfrElementClfrId attribute equal
qosClfrElementClfrId attribute equal to qosClfrId." to qosClfrId."
PIB-INDEX { qosClfrPrid } PIB-INDEX { qosClfrPrid }
UNIQUENESS { qosClfrId } UNIQUENESS { qosClfrId }
::= { qosClfrTable 1 } ::= { qosClfrTable 1 }
QosClfrEntry ::= SEQUENCE { QosClfrEntry ::= SEQUENCE {
qosClfrPrid InstanceId, qosClfrPrid InstanceId,
qosClfrId TagReferenceId qosClfrId TagReferenceId
} }
qosClfrPrid OBJECT-TYPE qosClfrPrid OBJECT-TYPE
skipping to change at page 44, line 17 skipping to change at page 44, line 4
-- Entries in the classifier element table serves as -- Entries in the classifier element table serves as
-- the anchor for each classification pattern, defined -- the anchor for each classification pattern, defined
-- in filter table entries. Each classifier element -- in filter table entries. Each classifier element
-- table entry also specifies the subsequent downstream -- table entry also specifies the subsequent downstream
-- diffserv functional datapath element when the -- diffserv functional datapath element when the
-- classification pattern is satisfied. -- classification pattern is satisfied.
-- Each entry in the classifier element table describes -- Each entry in the classifier element table describes
-- one branch of the fan-out characteristic of a classifier -- one branch of the fan-out characteristic of a classifier
-- indicated in [MODEL] section 4.1. A classifier is made up -- indicated in [MODEL] section 4.1. A classifier is made up
-- of one or more classifier elements. -- of one or more classifier elements.
--
-- If there is ambiguity between classifier elements of the same
-- classifier, then qosClfrElementPrecedence needs to be used.
-- --
qosClfrElementTable OBJECT-TYPE qosClfrElementTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosClfrElementEntry SYNTAX SEQUENCE OF QosClfrElementEntry
PIB-ACCESS install, 6 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The classifier element table enumerates the rela- "The classifier element table enumerates the relationship
tionship between classification patterns and subse- between classification patterns and subsequent downstream
quent downstream diffserv functional data path ele- diffserv functional data path elements. Classification
ments. Classification parameters are defined by parameters are defined by entries of filter tables pointed
entries of filter tables pointed to by to by qosClfrElementSpecific. There can be filter tables of
qosClfrElementSpecific. There can be filter different types, and they can be inter-mixed and used within
tables of different types, and they can be inter- a classifier. An example of a filter table is the
mixed and used within a classifier. An example of a frwkIpFilterTable, defined in [FR-PIB], for IP Multi-Field
filter table is the frwkIpFilterTable, defined in Classifiers (MFCs)."
[FR-PIB], for IP Multi-Field Classifiers (MFCs).
Filter tables for other filter types may be defined
elsewhere."
REFERENCE REFERENCE
"[MODEL] section 4.1" "[MODEL] section 4.1"
::= { qosPolicyClasses 3 } ::= { qosPolicyClasses 3 }
qosClfrElementEntry OBJECT-TYPE qosClfrElementEntry OBJECT-TYPE
SYNTAX QosClfrElementEntry SYNTAX QosClfrElementEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the classifier element table describes a "An entry in the classifier element table describes a
single element of the classifier." single element of the classifier."
PIB-INDEX { qosClfrElementPrid } PIB-INDEX { qosClfrElementPrid }
UNIQUENESS { qosClfrElementClfrId, UNIQUENESS { qosClfrElementClfrId,
qosClfrElementOrder, qosClfrElementPrecedence,
qosClfrElementSpecific } qosClfrElementSpecific }
::= { qosClfrElementTable 1 } ::= { qosClfrElementTable 1 }
QosClfrElementEntry ::= SEQUENCE { QosClfrElementEntry ::= SEQUENCE {
qosClfrElementPrid InstanceId, qosClfrElementPrid InstanceId,
qosClfrElementClfrId TagId, qosClfrElementClfrId TagId,
qosClfrElementPrecedence Unsigned32, qosClfrElementPrecedence Unsigned32,
qosClfrElementNext Prid, qosClfrElementNext Prid,
qosClfrElementSpecific Prid qosClfrElementSpecific Prid
} }
skipping to change at page 46, line 4 skipping to change at page 45, line 25
instance of qosClfrEntry." instance of qosClfrEntry."
::= { qosClfrElementEntry 2 } ::= { qosClfrElementEntry 2 }
qosClfrElementPrecedence OBJECT-TYPE qosClfrElementPrecedence OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The relative order in which classifier elements are "The relative order in which classifier elements are
applied: higher numbers represent classifier elements applied: higher numbers represent classifier elements
with higher precedence. Classifier elements with the same with higher precedence. Classifier elements with the same
order must be unambiguous i.e. they must define
precedence must be unambiguous i.e. they must define
non-overlapping patterns, and are considered to be non-overlapping patterns, and are considered to be
applied simultaneously to the traffic stream. Clas- applied simultaneously to the traffic stream. Clas-
sifier elements with different order may overlap in sifier elements with different precedence may overlap
their filters: the classifier element with the highest in their filters: the classifier element with the highest
order that matches is taken. precedence that matches is taken.
On a given interface, there must be a complete clas- On a given interface, there must be a complete clas-
sifier in place at all times in the sifier in place at all times in the
ingress direction. This means that there will always ingress direction. This means that there will always
be one or more filters that match every possible pat- be one or more filters that match every possible pat-
tern that could be presented in an incoming packet. tern that could be presented in an incoming packet.
There is no such requirement in the egress direction." There is no such requirement in the egress direction."
DEFVAL { 0 } DEFVAL { 0 }
::= { qosClfrElementEntry 3 } ::= { qosClfrElementEntry 3 }
skipping to change at page 47, line 15 skipping to change at page 47, line 4
an entry in frwkIpFilterTable [FR-PIB]. an entry in frwkIpFilterTable [FR-PIB].
The PRI pointed to must exist prior to the installation of The PRI pointed to must exist prior to the installation of
this classifier element. this classifier element.
The value zeroDotZero is interpreted to match any- The value zeroDotZero is interpreted to match any-
thing not matched by another classifier element - only one thing not matched by another classifier element - only one
such entry may exist for each classifier." such entry may exist for each classifier."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosClfrElementEntry 5 } ::= { qosClfrElementEntry 5 }
-- --
-- Meters -- Meters
-- --
-- This PIB supports a variety of Meters. It includes a -- This PIB supports a variety of Meters. It includes a
-- specific definition for Meters whose parameter set can -- specific definition for Meters whose parameter set can
-- be modelled using Token Bucket parameters. -- be modelled using Token Bucket parameters.
-- Other metering parameter sets can be defined by other PIBs.
-- --
-- Multiple meter elements may be logically cascaded -- Multiple meter elements may be logically cascaded
-- using their qosMeterSucceedNext and qosMeterFailNext pointers if
-- required.
-- One example of this might be for an AF PHB implementation -- One example of this might be for an AF PHB implementation
-- that uses multiple level conformance meters.
-- --
-- Cascading of individual meter elements in the PIB is intended -- Cascading of individual meter elements in the PIB is intended
-- to be functionally equivalent to multiple level conformance--
determination of a packet. The sequential
-- nature of the representation is merely a notational -- nature of the representation is merely a notational
-- convenience for this PIB. -- convenience for this PIB.
-- --
-- srTCM meters (RFC 2697) can be specified using two sets of -- srTCM meters (RFC 2697) can be specified using two sets of
-- qosMeterEntry and qosTBParamEntry. First set specifies the -- qosMeterEntry and qosTBParamEntry. First set specifies the
-- Committed Information Rate and Committed Burst Size -- Committed Information Rate and Committed Burst Size
-- token-bucket. Second set specifies the Excess Burst -- token-bucket. Second set specifies the Excess Burst
-- Size token-bucket. -- Size token-bucket.
-- --
-- trTCM meters (RFC 2698) can be specified using two sets of -- trTCM meters (RFC 2698) can be specified using two sets of
skipping to change at page 48, line 15 skipping to change at page 47, line 45
-- --
-- tswTCM meters (RFC 2859) can be specified using two sets of -- tswTCM meters (RFC 2859) can be specified using two sets of
-- qosMeterEntry and qosTBParamEntry. First set specifies the -- qosMeterEntry and qosTBParamEntry. First set specifies the
-- Committed Target Rate token-bucket. Second set specifies the -- Committed Target Rate token-bucket. Second set specifies the
-- Peak Target Rate token-bucket. qosTBParamInterval in each -- Peak Target Rate token-bucket. qosTBParamInterval in each
-- token bucket reflects the Average Interval. -- token bucket reflects the Average Interval.
-- --
qosMeterTable OBJECT-TYPE qosMeterTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosMeterEntry SYNTAX SEQUENCE OF QosMeterEntry
PIB-ACCESS install, 5 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates specific meters that a system "This table enumerates specific meters that a system
may use to police a stream of traffic. The traffic may use to police a stream of traffic. The traffic
stream to be metered is determined by the element(s) stream to be metered is determined by the element(s)
upstream of the meter i.e. by the object(s) that upstream of the meter i.e. by the object(s) that
point to each entry in this table. This may include point to each entry in this table. This may include
all traffic on an interface. all traffic on an interface.
Specific meter details are to be found in Specific meter details are to be found in table entry
qosMeterSpecific." referenced by qosMeterSpecific."
REFERENCE REFERENCE "[MODEL] section 5.1"
"[MODEL] section 5.1"
::= { qosPolicyClasses 4 } ::= { qosPolicyClasses 4 }
qosMeterEntry OBJECT-TYPE qosMeterEntry OBJECT-TYPE
SYNTAX QosMeterEntry SYNTAX QosMeterEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the meter table describing a single "An entry in the meter table describes a single
meter." conformance level of a meter."
PIB-INDEX { qosMeterPrid } PIB-INDEX { qosMeterPrid }
UNIQUENESS { } UNIQUENESS { qosMeterSucceedNext,
qosMeterFailNext,
qosMeterSpecific }
::= { qosMeterTable 1 } ::= { qosMeterTable 1 }
QosMeterEntry ::= SEQUENCE { QosMeterEntry ::= SEQUENCE {
qosMeterPrid InstanceId, qosMeterPrid InstanceId,
qosMeterSucceedNext Prid, qosMeterSucceedNext Prid,
qosMeterFailNext Prid, qosMeterFailNext Prid,
qosMeterSpecific Prid qosMeterSpecific Prid
} }
qosMeterPrid OBJECT-TYPE qosMeterPrid OBJECT-TYPE
skipping to change at page 50, line 37 skipping to change at page 50, line 4
-- Token-Bucket Parameter Table -- Token-Bucket Parameter Table
-- --
-- Each entry in the Token Bucket Parameter Table parameterizes -- Each entry in the Token Bucket Parameter Table parameterizes
-- a single token bucket. Multiple token buckets can be -- a single token bucket. Multiple token buckets can be
-- used together to parameterize multiple levels of -- used together to parameterize multiple levels of
-- conformance. -- conformance.
-- --
-- Note that an entry in the Token Bucket Parameter Table can -- Note that an entry in the Token Bucket Parameter Table can
-- be shared, pointed to, by multiple qosMeterTable entries. -- be shared, pointed to, by multiple qosMeterTable entries.
-- --
qosTBParamTable OBJECT-TYPE qosTBParamTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosTBParamEntry SYNTAX SEQUENCE OF QosTBParamEntry
PIB-ACCESS install, 6 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates specific token-bucket meters "This table enumerates token-bucket meter parameter sets
that a system may use to police a stream of traffic. that a system may use to police a stream of traffic.
Such meters are modelled here as having a single rate Such parameter sets are modelled here as each having a single
rate
and a single burst size. Multiple entries are used and a single burst size. Multiple entries are used
when multiple rates/burst sizes are needed." when multiple rates/burst sizes are needed."
REFERENCE REFERENCE
"[MODEL] section 5.1" "[MODEL] section 5.1"
::= { qosPolicyClasses 5 } ::= { qosPolicyClasses 5 }
qosTBParamEntry OBJECT-TYPE qosTBParamEntry OBJECT-TYPE
SYNTAX QosTBParamEntry SYNTAX QosTBParamEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry that describes a single token-bucket meter." "An entry that describes a single token-bucket
parameter set."
PIB-INDEX { qosTBParamPrid } PIB-INDEX { qosTBParamPrid }
UNIQUENESS { qosTBParamType, UNIQUENESS { qosTBParamType,
qosTBParamRate, qosTBParamRate,
qosTBParamBurstSize, qosTBParamBurstSize,
qosTBParamInterval } qosTBParamInterval }
::= { qosTBParamTable 1 } ::= { qosTBParamTable 1 }
QosTBParamEntry ::= SEQUENCE { QosTBParamEntry ::= SEQUENCE {
qosTBParamPrid InstanceId, qosTBParamPrid InstanceId,
qosTBParamType OBJECT IDENTIFIER, qosTBParamType OBJECT IDENTIFIER,
skipping to change at page 51, line 42 skipping to change at page 50, line 52
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An arbitrary integer index that uniquely identifies an "An arbitrary integer index that uniquely identifies an
instance of the class." instance of the class."
::= { qosTBParamEntry 1 } ::= { qosTBParamEntry 1 }
qosTBParamType OBJECT-TYPE qosTBParamType OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER SYNTAX OBJECT IDENTIFIER
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Metering/Shaping algorithm associated with the "The Metering algorithm associated with the
Token/Leaky Bucket parameters. Token-Bucket parameters. zeroDotZero indicates this
is unknown.
Standard values for generic algorithms are as follows: Standard values for generic algorithms are as follows:
qosTBParamSimpleTokenBucket, qosTBParamAvgRate, qosTBParamSimpleTokenBucket, qosTBParamAvgRate,
qosTBParamSrTCMBlind, qosTBParamSrTCMAware, qosTBParamSrTCMBlind, qosTBParamSrTCMAware,
qosTBParamTrTCMBlind, qosTBParamTrTCMAware, qosTBParamTrTCMBlind, qosTBParamTrTCMAware,
qosTBParamTswTCM qosTBParamTswTCM
are specified in this PIB as OBJECT-IDENTITYs; additional values These are specified in this PIB as OBJECT-IDENTITYs
may be further specified in other PIBs." under qosPolicyParameters; additional values may be
further specified in other PIBs."
REFERENCE REFERENCE
"[MODEL] section 5" "[MODEL] section 5"
::= { qosTBParamEntry 2 } ::= { qosTBParamEntry 2 }
qosTBParamRate OBJECT-TYPE qosTBParamRate OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "kilobits per second" UNITS "kilobits per second"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The token-bucket rate, in kilobits per second "The token-bucket rate, in kilobits per second
(kbps). This attribute is used for: 1. CIR in RFC (kbps). This attribute is used for:
2697 for srTCM 2. CIR and PIR in RFC 2698 for trTCM 1. CIR in RFC 2697 for srTCM
3. CTR and PTR in RFC 2859 for TSWTCM 4. AverageRate 2. CIR and PIR in RFC 2698 for trTCM
used in [MODEL] section 5." 3. CTR and PTR in RFC 2859 for TSWTCM
4. AverageRate in [MODEL] section 5."
::= { qosTBParamEntry 3 } ::= { qosTBParamEntry 3 }
qosTBParamBurstSize OBJECT-TYPE qosTBParamBurstSize OBJECT-TYPE
SYNTAX BurstSize SYNTAX BurstSize
UNITS "Bytes" UNITS "Bytes"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum number of bytes in a single transmission "The maximum number of bytes in a single transmission
burst. This attribute is used for: 1. CBS and EBS in burst. This attribute is used for:
RFC 2697 for srTCM 2. CBS and PBS in FRC 2698 for 1. CBS and EBS in RFC 2697 for srTCM
trTCM 3. Burst Size used in [MODEL] section 5." 2. CBS and PBS in FRC 2698 for trTCM
3. Burst Size in [MODEL] section 5."
::= { qosTBParamEntry 4 } ::= { qosTBParamEntry 4 }
qosTBParamInterval OBJECT-TYPE qosTBParamInterval OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "microseconds" UNITS "microseconds"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The time interval used with the token bucket. For: "The time interval used with the token bucket. For:
1. Average Rate Meter, [MODEL] section 5.2.1,
-Delta.
2. Simple Token Bucket Meter, [MODEL] section
5.1, - time interval t.
3. RFC 2859 TSWTCM, - AVG_INTERVAL.
1. Average Rate Meter, [MODEL] section 5.2.1, - 4. RFC 2697 srTCM, RFC 2698 trTCM, -
Delta. 2. Simple Token Bucket Meter, [MODEL] section
5.1, - time interval t. 3. RFC 2859 TSWTCM, -
AVG_INTERVAL. 4. RFC 2697 srTCM, RFC 2698 trTCM, -
token bucket update time interval." token bucket update time interval."
::= { qosTBParamEntry 5 } ::= { qosTBParamEntry 5 }
-- --
-- Actions -- Actions
-- --
-- --
-- The Action Table allows enumeration of the different -- The Action Table allows enumeration of the different
-- types of actions to be applied to a traffic flow. -- types of actions to be applied to a traffic flow.
-- --
qosActionTable OBJECT-TYPE qosActionTable OBJECT-TYPE
skipping to change at page 53, line 23 skipping to change at page 53, line 15
-- Actions -- Actions
-- --
-- --
-- The Action Table allows enumeration of the different -- The Action Table allows enumeration of the different
-- types of actions to be applied to a traffic flow. -- types of actions to be applied to a traffic flow.
-- --
qosActionTable OBJECT-TYPE qosActionTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosActionEntry SYNTAX SEQUENCE OF QosActionEntry
PIB-ACCESS install, 5 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Action Table enumerates actions that can be per- "The Action Table enumerates actions that can be per-
formed to a stream of traffic. Multiple actions can formed to a stream of traffic. Multiple actions can
be concatenated. For example, after marking a stream be concatenated. For example, after marking a stream
of traffic exiting from a meter, a device can then of traffic exiting from a meter, a device can then
perform a mark action of the conforming or non- perform a mark action of the conforming or non-
conforming traffic. conforming traffic.
Specific actions are indicated by qosAction- Specific actions are indicated by qosAction-
skipping to change at page 54, line 7 skipping to change at page 53, line 39
"[MODEL] section 6." "[MODEL] section 6."
::= { qosPolicyClasses 6 } ::= { qosPolicyClasses 6 }
qosActionEntry OBJECT-TYPE qosActionEntry OBJECT-TYPE
SYNTAX QosActionEntry SYNTAX QosActionEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Each entry in the action table allows description of "Each entry in the action table allows description of
one specific action to be applied to traffic." one specific action to be applied to traffic."
PIB-INDEX { qosActionPrid } PIB-INDEX { qosActionPrid }
UNIQUENESS { } UNIQUENESS { qosActionNext,
QosActionSpecific }
::= { qosActionTable 1 } ::= { qosActionTable 1 }
QosActionEntry ::= SEQUENCE { QosActionEntry ::= SEQUENCE {
qosActionPrid InstanceId, qosActionPrid InstanceId,
qosActionNext Prid, qosActionNext Prid,
qosActionSpecific Prid qosActionSpecific Prid
} }
qosActionPrid OBJECT-TYPE qosActionPrid OBJECT-TYPE
SYNTAX InstanceId SYNTAX InstanceId
skipping to change at page 55, line 24 skipping to change at page 54, line 50
The PRI pointed to must exist prior to installing this The PRI pointed to must exist prior to installing this
action datapath entry." action datapath entry."
::= { qosActionEntry 3 } ::= { qosActionEntry 3 }
-- DSCP Mark Action Table -- DSCP Mark Action Table
-- --
-- Rows of this table are pointed to by qosActionSpecific -- Rows of this table are pointed to by qosActionSpecific
-- to provide detailed parameters specific to the DSCP -- to provide detailed parameters specific to the DSCP
-- Mark action. -- Mark action.
-- This table should at most contain one entry for each supported
-- DSCP value. These entries should be reused by different
-- qosActionEntry in same or different data paths.
-- --
qosDscpMarkActTable OBJECT-TYPE qosDscpMarkActTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosDscpMarkActEntry SYNTAX SEQUENCE OF QosDscpMarkActEntry
PIB-ACCESS install, 3 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates specific DSCPs used for mark- "This table enumerates specific DSCPs used for marking or
ing or remarking the DSCP field of IP packets. The remarking the DSCP field of IP packets. The entries of this
entries of this table may be referenced by a table may be referenced by a qosActionSpecific attribute."
qosActionSpecific attribute."
REFERENCE REFERENCE
"[MODEL] section 6.1" "[MODEL] section 6.1"
::= { qosPolicyClasses 7 } ::= { qosPolicyClasses 7 }
qosDscpMarkActEntry OBJECT-TYPE qosDscpMarkActEntry OBJECT-TYPE
SYNTAX QosDscpMarkActEntry SYNTAX QosDscpMarkActEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the DSCP mark action table that "An entry in the DSCP mark action table that describes a
describes a single DSCP used for marking." single DSCP used for marking."
PIB-INDEX { qosDscpMarkActPrid } PIB-INDEX { qosDscpMarkActPrid }
INDEX { qosDscpMarkActDscp }
UNIQUENESS { qosDscpMarkActDscp } UNIQUENESS { qosDscpMarkActDscp }
::= { qosDscpMarkActTable 1 } ::= { qosDscpMarkActTable 1 }
QosDscpMarkActEntry ::= SEQUENCE { QosDscpMarkActEntry ::= SEQUENCE {
qosDscpMarkActPrid InstanceId, qosDscpMarkActPrid InstanceId,
qosDscpMarkActDscp Dscp qosDscpMarkActDscp Dscp
} }
qosDscpMarkActPrid OBJECT-TYPE qosDscpMarkActPrid OBJECT-TYPE
SYNTAX InstanceId SYNTAX InstanceId
skipping to change at page 56, line 35 skipping to change at page 56, line 4
"The DSCP that this Action uses for marking/remarking "The DSCP that this Action uses for marking/remarking
traffic. Note that a DSCP value of -1 is not permit- traffic. Note that a DSCP value of -1 is not permit-
ted in this table. It is quite possible that the ted in this table. It is quite possible that the
only packets subject to this Action are already only packets subject to this Action are already
marked with this DSCP. Note also that Diffserv may marked with this DSCP. Note also that Diffserv may
result in packet remarking both on ingress to a net- result in packet remarking both on ingress to a net-
work and on egress from it and it is quite possible work and on egress from it and it is quite possible
that ingress and egress would occur in the same that ingress and egress would occur in the same
router." router."
::= { qosDscpMarkActEntry 2 } ::= { qosDscpMarkActEntry 2 }
-- --
-- Algorithmic Drop Table -- Algorithmic Drop Table
-- --
-- Algorithmic Drop Table is the entry point for the Algorithmic
-- Dropper functional data path element.
-- For a simple algorithmic dropper, a single algorithmic drop entry
-- will be sufficient to parameterize the dropper.
-- For more complex algorithmic dropper, the qosAlgDropSpecific
-- attribute can be used to reference an entry in a parameter table,
-- e.g. qosRandomDropTable for random dropper.
-- For yet more complex dropper, for example, dropper that measures
-- multiple queues, each queue with its own algorithm, can use a
-- qosAlgDropTable entry as the entry point for Algorithm Dropper
-- functional data path element, leaving the dropper parameters
-- for each queue be specified by entries of qosMQAlgDropTable.
-- In such usage, the anchoring qosAlgDropEntry's qosAlgDropType
-- should be mQDrop, and its qosAlgDropQMeasure should reference
-- the subsequent qosMQAlgDropEntry's, its qosAlgDropSpecific
-- should be used to reference parameters applicable to all the
-- queues being measured.
-- The subsequent qosMQAlgDropEntry's will provide the parameters,
-- one for each queue being measured. The qosMQAlgDropEntry's are
-- chained using their qosMQAlgDropNext attributes.
--
qosAlgDropTable OBJECT-TYPE qosAlgDropTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosAlgDropEntry SYNTAX SEQUENCE OF QosAlgDropEntry
PIB-ACCESS install, 7 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The algorithmic drop table contains entries describ- "The algorithmic drop table contains entries describ-
ing an element that drops packets according to some ing a functional data path element that drops
algorithm." packets according to some algorithm."
REFERENCE REFERENCE
"[MODEL] section 7.1.3" "[MODEL] section 7.1.3"
::= { qosPolicyClasses 9 } ::= { qosPolicyClasses 9 }
qosAlgDropEntry OBJECT-TYPE qosAlgDropEntry OBJECT-TYPE
SYNTAX QosAlgDropEntry SYNTAX QosAlgDropEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry describes a process that drops packets "An entry describes a process that drops packets
according to some algorithm. Further details of the according to some algorithm. Further details of the
algorithm type are to be found in qosAlgDropType algorithm type are to be found in qosAlgDropType
and with more detail parameter entry pointed to by and with more detail parameter entry pointed to by
qosAlgDropSpecific when necessary." qosAlgDropSpecific when necessary."
PIB-INDEX { qosAlgDropPrid } PIB-INDEX { qosAlgDropPrid }
UNIQUENESS { } UNIQUENESS { qosAlgDropType,
qosAlgDropNext,
qosAlgDropQMeasure,
qosAlgDropQThreshold,
qosAlgDropSpecific }
::= { qosAlgDropTable 1 } ::= { qosAlgDropTable 1 }
QosAlgDropEntry ::= SEQUENCE { QosAlgDropEntry ::= SEQUENCE {
qosAlgDropPrid InstanceId, qosAlgDropPrid InstanceId,
qosAlgDropType INTEGER, qosAlgDropType INTEGER,
qosAlgDropNext Prid, qosAlgDropNext Prid,
qosAlgDropQMeasure Prid, qosAlgDropQMeasure Prid,
qosAlgDropQThreshold Unsigned32, qosAlgDropQThreshold Unsigned32,
qosAlgDropSpecific Prid qosAlgDropSpecific Prid
} }
skipping to change at page 58, line 8 skipping to change at page 57, line 35
"An arbitrary integer index that uniquely identifies an "An arbitrary integer index that uniquely identifies an
instance of the class." instance of the class."
::= { qosAlgDropEntry 1 } ::= { qosAlgDropEntry 1 }
qosAlgDropType OBJECT-TYPE qosAlgDropType OBJECT-TYPE
SYNTAX INTEGER { SYNTAX INTEGER {
other(1), other(1),
tailDrop(2), tailDrop(2),
headDrop(3), headDrop(3),
randomDrop(4), randomDrop(4),
alwaysDrop(5) alwaysDrop(5),
mQDrop(6)
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The type of algorithm used by this dropper. A value "The type of algorithm used by this dropper. A value
of tailDrop(2) or headDrop(3) represents an algorithm of tailDrop(2), headDrop(3), or alwaysDrop(5) represents
that is completely specified by this PIB. an algorithm that is completely specified by this PIB.
A value of other(1) indicates that the specifics of A value of other(1) indicates that the specifics of
the drop algorithm are specified in some other PIB the drop algorithm are specified in some other PIB
module, and that the qosAlgDropSpecific attribute module, and that the qosAlgDropSpecific attribute
points to an instance of a PRC in that PIB that points to an instance of a PRC in that PIB that
specifies the information necessary to implement the specifies the information necessary to implement the
algorithm. algorithm.
The tailDrop(2) algorithm is described as follows: The tailDrop(2) algorithm is described as follows:
qosAlgDropQThreshold represents the depth of the qosAlgDropQThreshold represents the depth of the
skipping to change at page 59, line 5 skipping to change at page 58, line 27
qosAlgDropSpecific points to a qosRandomDropEntry qosAlgDropSpecific points to a qosRandomDropEntry
that describes the algorithm. For this that describes the algorithm. For this
algorithm, qosAlgQThreshold is understood to be algorithm, qosAlgQThreshold is understood to be
the absolute maximum size of the queue and additional the absolute maximum size of the queue and additional
parameters are described in qosRandomDropTable. parameters are described in qosRandomDropTable.
The alwaysDrop(5) algorithm always drops packets. In The alwaysDrop(5) algorithm always drops packets. In
this case, the other configuration values in this Entry this case, the other configuration values in this Entry
are not meaningful; The queue is not used, therefore, are not meaningful; The queue is not used, therefore,
qosAlgDropNext, qosAlgDropQMeasure, and qosAlgDropNext, qosAlgDropQMeasure, and
qosAlgDropSpecific should be all set to zeroDotZero." qosAlgDropSpecific should be all set to zeroDotZero.
The mQDrop(6) algorithm measures multiple queues for
the drop algorithm. The queues measured are represented
by having qosAlgDropQMeasure referencing a qosMQAlgDropEntry.
Each of the chained qosMQAlgDropEntry is used to describe
the drop algorithm for one of the measured queues."
::= { qosAlgDropEntry 2 } ::= { qosAlgDropEntry 2 }
qosAlgDropNext OBJECT-TYPE qosAlgDropNext OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This selects the next diffserv functional datapath "This selects the next diffserv functional datapath
element to handle traffic for this data path. element to handle traffic for this data path.
The value zeroDotZero in this variable indicates no The value zeroDotZero in this attribute indicates no
further Diffserv treatment is performed on traffic of further Diffserv treatment is performed on traffic of
this datapath. Any other value must point to a valid this datapath. Any other value must point to a valid
(pre-existing) instance of one of: (pre-existing) instance of one of:
qosClfrEntry qosClfrEntry
qosMeterEntry qosMeterEntry
qosActionEntry qosActionEntry
qosAlgDropEntry qosAlgDropEntry
qosQEntry." qosQEntry.
When qosAlgDropType is alwaysDrop(5), this attribute is
Ignored."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosAlgDropEntry 3 } ::= { qosAlgDropEntry 3 }
qosAlgDropQMeasure OBJECT-TYPE qosAlgDropQMeasure OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Points to an entry in the qosQTable to indicate "Points to a PRI to indicate the queues that a drop algorithm
the queue that a drop algorithm is to monitor when is to monitor when deciding whether to drop a packet.
deciding whether to drop a packet.
For alwaysDrop(5), this attribute should be zeroDotZero.
For tailDrop(2), headDrop(3), randomDrop(4), this should
point to an entry in the qosQTable.
For mQDrop(6), this should point to a qosMQAlgDropEntry that
Describe one of the queues being measured for multiple
queue dropper.
The PRI pointed to must exist prior to installing The PRI pointed to must exist prior to installing
this dropper element." this dropper element."
::= { qosAlgDropEntry 4 } ::= { qosAlgDropEntry 4 }
qosAlgDropQThreshold OBJECT-TYPE qosAlgDropQThreshold OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "Bytes" UNITS "Bytes"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A threshold on the depth in bytes of the queue being "A threshold on the depth in bytes of the queue being
measured at which a trigger is generated to the drop- measured at which a trigger is generated to the drop-
ping algorithm. ping algorithm, unless qosAlgDropType is alwaysDrop(5)
where this attribute is ignored.
For the tailDrop(2) or headDrop(3) algorithms, this For the tailDrop(2) or headDrop(3) algorithms, this
represents the depth of the queue, pointed to by represents the depth of the queue, pointed to by
qosAlgDropQMeasure, at which the drop action qosAlgDropQMeasure, at which the drop action
will take place. Other algorithms will need to define will take place. Other algorithms will need to define
their own semantics for this threshold." their own semantics for this threshold."
::= { qosAlgDropEntry 5 } ::= { qosAlgDropEntry 5 }
qosAlgDropSpecific OBJECT-TYPE qosAlgDropSpecific OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
skipping to change at page 60, line 30 skipping to change at page 60, line 7
must exist prior to installing this dropper element. must exist prior to installing this dropper element.
Entries with qosAlgDropType equal to other(1) Entries with qosAlgDropType equal to other(1)
must have this point to an instance of a PRC must have this point to an instance of a PRC
defined in another PIB module. defined in another PIB module.
Entries with qosAlgDropType equal to random- Entries with qosAlgDropType equal to random-
Drop(4) must have this point to an entry in Drop(4) must have this point to an entry in
qosRandomDropTable. qosRandomDropTable.
Entries with qosAlgDropType equal to mQDrop(6) can use this
attribute to reference parameters that is used by all the
queues of the multiple queues being measured.
For all other algorithms, this should take the value For all other algorithms, this should take the value
zeroDotZero." zeroDotZero."
::= { qosAlgDropEntry 6 } ::= { qosAlgDropEntry 6 }
-- --
-- Multiple Queue Algorithmic Drop Table
--
-- Entries of this table should be referenced by qosAlgDropQMeasure
-- when qosAlgDropType is mQDrop(6) for droppers measuring multiple
-- queues for its drop algorithm.
-- Each entry of the table is used to describe the drop algorithm
-- for a single queue within the multiple queues being measured.
--
-- Entries of this table, qosMQAlgDropEntry, is extended from
-- qosAlgDropEntry, with usage of corresponding parameters the same
-- except:
-- qosMQAlgDropNext is used to point to the next diffserv
-- functional data path element when the packet is not dropped.
-- qosMQAlgDropExceedNext is used to point to the next
-- qosMQAlgDropEntry for chaining together the multiple
-- qosMQAlgDropEntry's for the multiple queues being measured.
--
qosMQAlgDropTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosMQAlgDropEntry
PIB-ACCESS install
STATUS current
DESCRIPTION
"The multiple queue algorithmic drop table contains entries
describing each queue being measured for the multiple queue
algorithmic dropper."
::= { qosPolicyClasses 10 }
qosMQAlgDropEntry OBJECT-TYPE
SYNTAX QosMQAlgDropEntry
STATUS current
DESCRIPTION
"An entry describes a process that drops packets
according to some algorithm. Each entry is used for
each of the multiple queues being measured. Each entry
extends the basic qosAlgDropEntry with adding of a
qosMQAlgDropExceedNext attribute.
Further details of the algorithm type are to be found in
qosAlgDropType and with more detail parameter entry pointed
to by qosMQAlgDropSpecific when necessary."
EXTENDS { qosAlgDropEntry }
UNIQUENESS { qosMQAlgDropExceedNext }
::= { qosMQAlgDropTable 1 }
QosMQAlgDropEntry ::= SEQUENCE {
qosMQAlgDropExceedNext Prid
}
qosMQAlgDropExceedNext OBJECT-TYPE
SYNTAX Prid
STATUS current
DESCRIPTION
"Used for linking of multiple qosMQAlgDropEntry for mQDrop.
A value of zeroDotZero indicates this is the last of a
chain of qosMQAlgDropEntry."
DEFVAL { zeroDotZero }
::= { qosMQAlgDropEntry 1 }
--
-- Random Drop Table -- Random Drop Table
-- --
qosRandomDropTable OBJECT-TYPE qosRandomDropTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosRandomDropEntry SYNTAX SEQUENCE OF QosRandomDropEntry
PIB-ACCESS install, 9 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The random drop table contains entries describing a "The random drop table contains entries describing a
process that drops packets randomly. Entries in this process that drops packets randomly. Entries in this
table is intended to be pointed to by table is intended to be pointed to by
qosAlgDropSpecific." qosAlgDropSpecific."
REFERENCE REFERENCE
"[MODEL] section 7.1.3" "[MODEL] section 7.1.3"
::= { qosPolicyClasses 10 } ::= { qosPolicyClasses 11 }
qosRandomDropEntry OBJECT-TYPE qosRandomDropEntry OBJECT-TYPE
SYNTAX QosRandomDropEntry SYNTAX QosRandomDropEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry describes a process that drops packets "An entry describes a process that drops packets
according to a random algorithm." according to a random algorithm."
PIB-INDEX { qosRandomDropPrid } PIB-INDEX { qosRandomDropPrid }
UNIQUENESS { qosRandomDropMinThreshBytes, UNIQUENESS { qosRandomDropMinThreshBytes,
qosRandomDropMinThreshPkts, qosRandomDropMinThreshPkts,
skipping to change at page 62, line 17 skipping to change at page 62, line 42
DESCRIPTION DESCRIPTION
"The average queue depth in bytes, beyond which traffic has a "The average queue depth in bytes, beyond which traffic has a
non-zero probability of being dropped." non-zero probability of being dropped."
::= { qosRandomDropEntry 2 } ::= { qosRandomDropEntry 2 }
qosRandomDropMinThreshPkts OBJECT-TYPE qosRandomDropMinThreshPkts OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "packets" UNITS "packets"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The average queue depth in packets, beyond which traffic has a "The average queue depth in packets, beyond which traffic has
non-zero probability of being dropped." a non-zero probability of being dropped."
::= { qosRandomDropEntry 3 } ::= { qosRandomDropEntry 3 }
qosRandomDropMaxThreshBytes OBJECT-TYPE qosRandomDropMaxThreshBytes OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "bytes" UNITS "bytes"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The average queue depth beyond which traffic has a probability "The average queue depth beyond which traffic has a
indicated by qosRandomDropProbMax of being dropped or probability indicated by qosRandomDropProbMax of being dropped
marked. Note that this differs from the physical queue limit, or marked. Note that this differs from the physical queue
which is stored in qosAlgDropQThreshold." limit, which is stored in qosAlgDropQThreshold."
::= { qosRandomDropEntry 4 } ::= { qosRandomDropEntry 4 }
qosRandomDropMaxThreshPkts OBJECT-TYPE qosRandomDropMaxThreshPkts OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "packets" UNITS "packets"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The average queue depth beyond which traffic has a probability "The average queue depth beyond which traffic has a
indicated by qosRandomDropProbMax of being dropped or probability indicated by qosRandomDropProbMax of being dropped
marked. Note that this differs from the physical queue limit, or marked. Note that this differs from the physical queue
which is stored in qosAlgDropQThreshold." limit, which is stored in qosAlgDropQThreshold."
::= { qosRandomDropEntry 5 } ::= { qosRandomDropEntry 5 }
qosRandomDropProbMax OBJECT-TYPE qosRandomDropProbMax OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The worst case random drop probability, expressed in drops per "The worst case random drop probability, expressed in drops
thousand packets. per thousand packets.
For example, if every packet may be dropped in the worst case For example, if every packet may be dropped in the worst case
(100%), this has the value 1000. Alternatively, if in the worst (100%), this has the value 1000. Alternatively, if in the
case one percent (1%) of traffic may be dropped, it has the value worst case one percent (1%) of traffic may be dropped, it has
10." the value 10."
::= { qosRandomDropEntry 6 } ::= { qosRandomDropEntry 6 }
qosRandomDropWeight OBJECT-TYPE qosRandomDropWeight OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The weighting of past history in affecting the Exponentially "The weighting of past history in affecting the Exponentially
Weighted Moving Average function which calculates the current Weighted Moving Average function which calculates the current
average queue depth. The equation uses average queue depth. The equation uses
qosRandomDropWeight/MaxValue as the coefficient for the new qosRandomDropWeight/MaxValue as the coefficient for the new
sample in the equation, and sample in the equation, and
(MaxValue - qosRandomDropWeight)/MaxValue as the coefficient of (MaxValue - qosRandomDropWeight)/MaxValue as the coefficient
the old value, where, MaxValue is determined via capability of the old value, where, MaxValue is determined via capability
reported by the PEP. reported by the PEP.
Implementations may further limit the values of Implementations may further limit the values of
qosRandomDropWeight via the capability tables." qosRandomDropWeight via the capability tables."
::= { qosRandomDropEntry 7 } ::= { qosRandomDropEntry 7 }
qosRandomDropSamplingRate OBJECT-TYPE qosRandomDropSamplingRate OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of times per second the queue is sampled for queue "The number of times per second the queue is sampled for queue
average calculation. A value of zero means the queue is sampled average calculation. A value of zero means the queue is
approximately each time a packet is enqueued (or dequeued)." sampled approximately each time a packet is enqueued (or
dequeued)."
::= { qosRandomDropEntry 8 } ::= { qosRandomDropEntry 8 }
-- --
-- Queue Table -- Queue Table
-- --
-- --
-- An entry of qosQTable represents a FIFO queue diffserv -- An entry of qosQTable represents a FIFO queue diffserv
-- functional data path element as described in [MODEL] section -- functional data path element as described in [MODEL] section
-- 7.1.1. -- 7.1.1.
-- Notice the specification of scheduling parameters for a queue -- Notice the specification of scheduling parameters for a queue
-- as part of the input to a scheduler functional data path -- as part of the input to a scheduler functional data path
-- element as described in [MODEL] section 7.1.2. This allows -- element as described in [MODEL] section 7.1.2. This allows
-- building of hierarchical queuing/scheduling. -- building of hierarchical queuing/scheduling.
-- A queue therefore is parameterized by: -- A queue therefore is parameterized by:
-- 1. Which scheduler will service this queue, qosQNext. -- 1. Which scheduler will service this queue, qosQNext.
-- 2. How the scheduler will service this queue, with respect -- 2. How the scheduler will service this queue, with respect
skipping to change at page 64, line 16 skipping to change at page 65, line 20
-- functional data path element as described in [MODEL] section -- functional data path element as described in [MODEL] section
-- 7.1.1. -- 7.1.1.
-- Notice the specification of scheduling parameters for a queue -- Notice the specification of scheduling parameters for a queue
-- as part of the input to a scheduler functional data path -- as part of the input to a scheduler functional data path
-- element as described in [MODEL] section 7.1.2. This allows -- element as described in [MODEL] section 7.1.2. This allows
-- building of hierarchical queuing/scheduling. -- building of hierarchical queuing/scheduling.
-- A queue therefore is parameterized by: -- A queue therefore is parameterized by:
-- 1. Which scheduler will service this queue, qosQNext. -- 1. Which scheduler will service this queue, qosQNext.
-- 2. How the scheduler will service this queue, with respect -- 2. How the scheduler will service this queue, with respect
-- to all the other queues the same scheduler needs to service, -- to all the other queues the same scheduler needs to service,
-- qosQMinRate and qosQMaxRate.
-- --
-- Notice one or more upstream diffserv functional data path element
-- may share, point to, a qosQTable entry as described in [MODEL] --
section 7.1.1.
-- --
qosQTable OBJECT-TYPE qosQTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosQEntry SYNTAX SEQUENCE OF QosQEntry
PIB-ACCESS install, 5 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Queue Table enumerates the individual queues on "The Queue Table enumerates the queues."
an interface." ::= { qosPolicyClasses 12 }
::= { qosPolicyClasses 11 }
qosQEntry OBJECT-TYPE qosQEntry OBJECT-TYPE
SYNTAX QosQEntry SYNTAX QosQEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the Queue Table describes a single queue "An entry in the Queue Table describes a single queue
in one direction on an interface." as a functional data path element."
PIB-INDEX { qosQPrid } PIB-INDEX { qosQPrid }
UNIQUENESS { } UNIQUENESS { qosQNext,
qosQMinRate,
qosQMaxRate }
::= { qosQTable 1 } ::= { qosQTable 1 }
QosQEntry ::= SEQUENCE { QosQEntry ::= SEQUENCE {
qosQPrid InstanceId, qosQPrid InstanceId,
qosQNext Prid, qosQNext Prid,
qosQRate Prid, qosQMinRate Prid,
qosQShaper Prid qosQMaxRate Prid
} }
qosQPrid OBJECT-TYPE qosQPrid OBJECT-TYPE
SYNTAX InstanceId SYNTAX InstanceId
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An arbitrary integer index that uniquely identifies an "An arbitrary integer index that uniquely identifies an
instance of the class." instance of the class."
::= { qosQEntry 1 } ::= { qosQEntry 1 }
qosQNext OBJECT-TYPE qosQNext OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
skipping to change at page 65, line 19 skipping to change at page 66, line 16
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An arbitrary integer index that uniquely identifies an "An arbitrary integer index that uniquely identifies an
instance of the class." instance of the class."
::= { qosQEntry 1 } ::= { qosQEntry 1 }
qosQNext OBJECT-TYPE qosQNext OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This selects the next diffserv functional datapath "This selects the next diffserv scheduler. This must point
element to handle traffic for this data path. This to a qosSchedulerEntry.
value must point to a valid (pre-existing) instance
of one of: A value of zeroDotZero in this attribute indicates an
qosSchedulerEntry" incomplete qosQEntry instance. In such a case, the entry
has no operational effect, since it has no parameters to
give it meaning."
::= { qosQEntry 2 } ::= { qosQEntry 2 }
qosQRate OBJECT-TYPE qosQMinRate OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This Prid indicates the entry in qosAssuredRateTable "This Prid indicates the entry in qosMinRateTable
the scheduler, pointed to by qosQNext, should use to service the scheduler, pointed to by qosQNext, should use to service
this queue. If this value is zeroDotZero, then qosQShaper this queue.
must not be zeroDotZero. If this value is not zeroDotZero If this value is zeroDotZero, then minimum rate and priority
then the instance pointed to must exist prior to installing is unspecified.
If this value is not zeroDotZero then the instance pointed to
must exist prior to installing
this entry." this entry."
::= { qosQEntry 3 } ::= { qosQEntry 3 }
qosQShaper OBJECT-TYPE qosQMaxRate OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This Prid indicates the entry in qosShapingRateTable "This Prid indicates the entry in qosMaxRateTable
the scheduler, pointed to by qosQNext, should use to service the scheduler, pointed to by qosQNext, should use to service
this queue. If this value is zeroDotZero, then qosQRate this queue.
must not be zeroDotZero. If this value is not zeroDotZero If this value is zeroDotZero, then the maximum rate is the
line speed of the interface.
If this value is not zeroDotZero
then the instance pointed to must exist prior to installing then the instance pointed to must exist prior to installing
this entry." this entry."
::= { qosQEntry 4 } ::= { qosQEntry 4 }
-- --
-- Scheduler Table -- Scheduler Table
-- --
-- --
-- The Scheduler Table is used for representing packet schedulers: -- The Scheduler Table is used for representing packet schedulers:
-- it provides flexibility for multiple scheduling algorithms, each -- it provides flexibility for multiple scheduling algorithms, each
-- servicing multiple queues, to be used on the same
-- logical/physical interface of a data path.
--
-- Notice the servicing parameters the scheduler uses is -- Notice the servicing parameters the scheduler uses is
-- specified by each of its upstream functional data path elements, -- specified by each of its upstream functional data path elements,
-- queues or schedulers of this PIB.
-- The coordination and coherency between the servicing parameters -- The coordination and coherency between the servicing parameters
-- of the scheduler's upstream functional data path elements must -- of the scheduler's upstream functional data path elements must
-- be maintained for the scheduler to function correctly. -- be maintained for the scheduler to function correctly.
-- --
-- The qosSchedulerMinRate and qosSchedulerMaxRate attributes are
used for specifying
-- the servicing parameters for output of a scheduler when its -- the servicing parameters for output of a scheduler when its
-- downstream functional data path element is another scheduler. -- downstream functional data path element is another scheduler.
-- This is used for building hierarchical queue/scheduler. -- This is used for building hierarchical queue/scheduler.
--
-- More discussion of the scheduler functional data path element -- More discussion of the scheduler functional data path element
-- is in [MODEL] section 7.1.2. -- is in [MODEL] section 7.1.2.
-- --
qosSchedulerTable OBJECT-TYPE qosSchedulerTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosSchedulerEntry SYNTAX SEQUENCE OF QosSchedulerEntry
PIB-ACCESS install, 6 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Scheduler Table enumerates packet schedulers. "The Scheduler Table enumerates packet schedulers.
Multiple scheduling algorithms can be used on a given Multiple scheduling algorithms can be used on a given
interface, with each algorithm described by one datapath, with each algorithm described by one
qosSchedulerEntry." qosSchedulerEntry."
REFERENCE REFERENCE
"[MODEL] section 7.1.2" "[MODEL] section 7.1.2"
::= { qosPolicyClasses 12 } ::= { qosPolicyClasses 13 }
qosSchedulerEntry OBJECT-TYPE qosSchedulerEntry OBJECT-TYPE
SYNTAX QosSchedulerEntry SYNTAX QosSchedulerEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the Scheduler Table describing a single "An entry in the Scheduler Table describing a single
instance of a scheduling algorithm." instance of a scheduling algorithm."
PIB-INDEX { qosSchedulerPrid } PIB-INDEX { qosSchedulerPrid }
UNIQUENESS { } UNIQUENESS { qosSchedulerNext,
qosSchedulerMethod,
qosSchedulerMinRate,
qosSchedulerMaxRate }
::= { qosSchedulerTable 1 } ::= { qosSchedulerTable 1 }
QosSchedulerEntry ::= SEQUENCE { QosSchedulerEntry ::= SEQUENCE {
qosSchedulerPrid InstanceId, qosSchedulerPrid InstanceId,
qosSchedulerNext Prid, qosSchedulerNext Prid,
qosSchedulerMethod OBJECT IDENTIFIER, qosSchedulerMethod OBJECT IDENTIFIER,
qosSchedulerRate Prid, qosSchedulerMinRate Prid,
qosSchedulerShaper Prid qosSchedulerMaxRate Prid
} }
qosSchedulerPrid OBJECT-TYPE qosSchedulerPrid OBJECT-TYPE
SYNTAX InstanceId SYNTAX InstanceId
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An arbitrary integer index that uniquely identifies an "An arbitrary integer index that uniquely identifies an
instance of the class." instance of the class."
::= { qosSchedulerEntry 1 } ::= { qosSchedulerEntry 1 }
qosSchedulerNext OBJECT-TYPE qosSchedulerNext OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This selects the next diffserv functional datapath "This selects the next diffserv functional datapath
element to handle traffic for this data path. element to handle traffic for this data path.
A value of zeroDotZero in this attribute indicates no This attribute normally have a value of zeroDotZero to
further Diffserv treatment is performed on traffic of indicate no further Diffserv treatment is performed on traffic of
this datapath. The use of zeroDotZero is the normal this datapath. The use of zeroDotZero is the normal
usage for the last functional datapath element. Any usage for the last functional datapath element. Any
value other than zeroDotZero must point to a valid value other than zeroDotZero must point to a valid
(pre-existing) instance of one of: (pre-existing) instance of one of:
qosSchedulerEntry qosSchedulerEntry
qosQEntry (as indicated by [MODEL] section qosQEntry,
7.1.4),
or or: qosClfrEntry
qosClfrEntry
qosMeterEntry qosMeterEntry
qosActionEntry qosActionEntry
qosAlgDropEntry (for building multiple TCB's for the same qosAlgDropEntry
data path).
This can point to another qosSchedulerEntry This points to another qosSchedulerEntry
for implementation of multiple scheduler methods for for implementation of multiple scheduler methods for
the same datapath, and for implementation of the same datapath, and for implementation of
hierarchical schedulers." hierarchical schedulers."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosSchedulerEntry 2 } ::= { qosSchedulerEntry 2 }
qosSchedulerMethod OBJECT-TYPE qosSchedulerMethod OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER SYNTAX OBJECT IDENTIFIER
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The scheduling algorithm used by this Scheduler. Standard values "The scheduling algorithm used by this Scheduler.
for generic algorithms: qosSchedulerPriority, qosSchedulerWRR,
and qosSchedulerWFQ are specified in this PIB; Standard values for generic algorithms:
additional values may be further specified in other PIBs." qosSchedulerPriority,
qosSchedulerWRR,
qosSchedulerWFQ
are specified in this PIB.
Additional values may be further specified in other PIBs.
A value of zeroDotZero indicates this is unknown."
REFERENCE REFERENCE
"[MODEL] section 7.1.2" "[MODEL] section 7.1.2"
::= { qosSchedulerEntry 3 } ::= { qosSchedulerEntry 3 }
qosSchedulerRate OBJECT-TYPE qosSchedulerMinRate OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This Prid indicates the entry in qosAssuredRateTable "This Prid indicates the entry in qosMinRateTable
which indicates the priority or minimum output rate from this which indicates the priority or minimum output rate from this
scheduler. This attribute is only used when there is more than scheduler. This attribute is used only when there is more
one level of scheduler. It should have the value of zeroDotZero than one level of scheduler.
when not used."
When it has the value zeroDotZero, it indicates that no
Minimum rate or priority is imposed."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosSchedulerEntry 4 } ::= { qosSchedulerEntry 4 }
qosSchedulerShaper OBJECT-TYPE qosSchedulerMaxRate OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This Prid indicates the entry in qosShapingRateTable "This Prid indicates the entry in qosMaxRateTable
which indicates the maximum output rate from this scheduler. which indicates the maximum output rate from this scheduler.
This attribute is only used when there is more than one level of When more than one maximum rate applies (e.g. a multi-rate
scheduler. It should have the value of zeroDotZero when not shaper is used), it points to the first of the rate entries.
used." This attribute is only used when there is more than one level
of scheduler.
When it has the value zeroDotZero, it indicates that no
Maximum rate is imposed."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosSchedulerEntry 5 } ::= { qosSchedulerEntry 5 }
-- --
-- Minimum Rate Parameters Table
-- --
-- The parameters used by a scheduler for its inputs or outputs are
-- maintained separately from the Queue or Scheduler table entries
-- for reusability reasons and so that they may be used by both
-- queues and schedulers. This follows the approach for separation
-- of data path elements from parameterization that is used
-- throughout this MIB.
-- Use of these Minimum Rate Parameter Table entries by Queues and
-- Schedulers allows the modeling of hierarchical scheduling
-- systems.
-- --
-- Specifically, a Scheduler has one or more inputs and one output.
-- Any queue feeding a scheduler, or any scheduler which feeds a
-- second scheduler, might specify a minimum transfer rate by
-- pointing to a Minimum Rate Parameter Table entry.
--
-- The qosMinRatePriority/Abs/Rel attributes are used as
-- parameters to the work-conserving portion of a scheduler:
-- "work-conserving" implies that the scheduler can continue to emit
-- data as long as there is data available at its input(s). This
-- has the effect of guaranteeing a certain priority relative to
-- other scheduler inputs and/or a certain minimum proportion of the
-- available output bandwidth. Properly configured, this means a
-- certain minimum rate, which may be exceeded should traffic be
-- available should there be spare bandwidth after all other classes
-- have had opportunities to consume their own minimum rates.
-- --
qosAssuredRateTable OBJECT-TYPE qosMinRateTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosAssuredRateEntry SYNTAX SEQUENCE OF QosMinRateEntry
PIB-ACCESS install, 5 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Assured Rate Table enumerates individual "The Minimum Rate Table enumerates individual
sets of scheduling parameter that can be used/reused sets of scheduling parameter that can be used/reused
by Queues and Schedulers." by Queues and Schedulers."
::= { qosPolicyClasses 13 } ::= { qosPolicyClasses 14 }
qosAssuredRateEntry OBJECT-TYPE qosMinRateEntry OBJECT-TYPE
SYNTAX QosAssuredRateEntry SYNTAX QosMinRateEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the Assured Rate Table describes "An entry in the Minimum Rate Table describes
a single set of scheduling parameter for use by a single set of scheduling parameter for use by
queues and schedulers." queues and schedulers."
PIB-INDEX { qosAssuredRatePrid } PIB-INDEX { qosMinRatePrid }
UNIQUENESS { qosAssuredRatePriority, UNIQUENESS { qosMinRatePriority,
qosAssuredRateAbs, qosMinRateAbsolute,
qosAssuredRateRel } qosMinRateRelative }
::= { qosAssuredRateTable 1 } ::= { qosMinRateTable 1 }
QosMinRateEntry ::= SEQUENCE {
QosAssuredRateEntry ::= SEQUENCE { qosMinRatePrid InstanceId,
qosAssuredRatePrid InstanceId, qosMinRatePriority Unsigned32,
qosAssuredRatePriority Unsigned32, qosMinRateAbsolute Unsigned32,
qosAssuredRateAbs Unsigned32, qosMinRateRelative Unsigned32
qosAssuredRateRel Unsigned32
} }
qosAssuredRatePrid OBJECT-TYPE qosMinRatePrid OBJECT-TYPE
SYNTAX InstanceId SYNTAX InstanceId
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An arbitrary integer index that uniquely identifies an "An arbitrary integer index that uniquely identifies an
instance of the class." instance of the class."
::= { qosAssuredRateEntry 1 } ::= { qosMinRateEntry 1 }
qosAssuredRatePriority OBJECT-TYPE qosMinRatePriority OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The priority of this input to the associated scheduler, relative "The priority of this input to the associated scheduler,
to the scheduler's other inputs. Higher Priority value indicates relative to the scheduler's other inputs. Higher Priority
the associated queue/scheduler will get service first before value indicates the associated queue/scheduler will get
others with lower Priority values." service first before others with lower Priority values."
::= { qosAssuredRateEntry 2 } ::= { qosMinRateEntry 2 }
qosAssuredRateAbs OBJECT-TYPE qosMinRateAbsolute OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "kilobits per second" UNITS "kilobits per second"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The minimum absolute rate, in kilobits/sec, that a "The minimum absolute rate, in kilobits/sec, that a downstream
downstream scheduler element should allocate to this scheduler element should allocate to this queue. If the value
queue. If the value is zero, then there is effec- is zero, then there is effectively no minimum rate guarantee.
tively no minimum rate guarantee. If the value is If the value is non-zero, the scheduler will assure the
non-zero, the scheduler will assure the servicing of servicing of this queue to at least this rate.
this queue to at least this rate.
Note that this attribute's value is coupled to that Note that this attribute's value is coupled to that
of qosAssuredRateRel: changes to one will of qosMinRateRelative: changes to one will affect the value
affect the value of the other. of the other.
[IFMIB] defines ifSpeed as Gauge32 in units of bits per second, [IFMIB] defines ifSpeed as Gauge32 in units of bits per
and ifHighSpeed as Gauge32 in units of 1,000,000 bits per second. second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits
per second.
This yields the following equations: This yields the following equations:
RateRel = [ (RateAbs * 1000) / ifSpeed ] * 10,000 RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000
Where, 1000 is for converting kbps used by RateAbs to bps used by Where, 1000 is for converting kbps used by RateAbsolute to bps
ifSpeed, 10,000 is for 'in units of 1/10,000 of 1' for RateRel. used
by ifSpeed, 1,000 is for 'in units of 1/1,000 of 1' for
RateRelative.
or, if appropriate: or, if appropriate:
RateRel = { [ (RateAbs * 1000) / 1,000,000 ] / ifHIghSpeed } * 10,000 RateRelative =
{ [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } *
1,000
Where, 1000 and 1,000,000 is for converting kbps used by RateAbs to Where, 1000 and 1,000,000 is for converting kbps used by
1 million bps used by ifHighSpeed, 10,000 is for 'in units of RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is
1/10,000 of 1' for RateRel." for
'in units of 1/1,000 of 1' for RateRelative."
REFERENCE REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]" "ifSpeed, ifHighSpeed from [IFMIB]"
::= { qosAssuredRateEntry 3 } ::= { qosMinRateEntry 3 }
qosAssuredRateRel OBJECT-TYPE qosMinRateRelative OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The minimum rate that a downstream scheduler element "The minimum rate that a downstream scheduler element
should allocate to this queue, relative to the max- should allocate to this queue, relative to the max-
imum rate of the interface as reported by ifSpeed or imum rate of the interface as reported by ifSpeed or
ifHighSpeed, in units of 1/10,000 of 1. If the value ifHighSpeed, in units of 1/1,000 of 1. If the value
is zero, then there is effectively no minimum rate is zero, then there is effectively no minimum rate
guarantee. If the value is non-zero, the scheduler guarantee. If the value is non-zero, the scheduler
will assure the servicing of this queue to at least will assure the servicing of this queue to at least
this rate. this rate.
Note that this attribute's value is coupled to that Note that this attribute's value is coupled to that
of qosAssuredRateAbs: changes to one will of qosMinRateAbsolute: changes to one will
affect the value of the other. affect the value of the other.
[IFMIB] defines ifSpeed as Gauge32 in units of bits per second, [IFMIB] defines ifSpeed as Gauge32 in units of bits per
and ifHighSpeed as Gauge32 in units of 1,000,000 bits per second. second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits
per second.
This yields the following equations: This yields the following equations:
RateRel = [ (RateAbs * 1000) / ifSpeed ] * 10,000 RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000
Where, 1000 is for converting kbps used by RateAbs to bps used by
ifSpeed, 10,000 is for 'in units of 1/10,000 of 1' for RateRel. Where, 1000 is for converting kbps used by RateAbsolute to bps
used by ifSpeed, 1,000 is for 'in units of 1/1,000 of 1' for
RateRelative.
or, if appropriate: or, if appropriate:
RateRel = { [ (RateAbs * 1000) / 1,000,000 ] / ifHIghSpeed } * 10,000 RateRelative =
{ [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } *
1,000
Where, 1000 and 1,000,000 is for converting kbps used by RateAbs to Where, 1000 and 1,000,000 is for converting kbps used by
1 million bps used by ifHighSpeed, 10,000 is for 'in units of RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is
1/10,000 of 1' for RateRel." for
'in units of 1/1,000 of 1' for RateRelative."
REFERENCE REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]" "ifSpeed, ifHighSpeed from [IFMIB]"
::= { qosAssuredRateEntry 4 } ::= { qosMinRateEntry 4 }
-- --
-- Maximum Rate Parameters Table
-- --
-- The parameters used by a scheduler for its inputs or outputs are
-- maintained separately from the Queue or Scheduler table entries
-- for reusability reasons and so that they may be used by both
-- queues and schedulers. This follows the approach for separation
-- of data path elements from parameterization that is used
-- throughout this MIB.
-- Use of these Maximum Rate Parameter Table entries by Queues and
-- Schedulers allows the modeling of hierarchical scheduling
-- systems.
-- --
-- Specifically, a Scheduler has one or more inputs and one output.
-- Any queue feeding a scheduler, or any scheduler which feeds a
-- second scheduler, might specify a maximum transfer rate by
-- pointing to a Maximum Rate Parameter Table entry. Multi-rate
-- shapers, such as a Dual Leaky Bucket algorithm, specify their
-- rates using multiple Maximum Rate Parameter Entries with the same
-- qosMaxRateId but different qosMaxRateLevels.
--
-- The qosMaxRateLevel/Abs/Rel attributes are used as
-- parameters to the non-work-conserving portion of a scheduler:
-- non-work-conserving implies that the scheduler may sometimes not
-- emit a packet, even if there is data available at its input(s).
-- This has the effect of limiting the servicing of the
-- queue/scheduler input or output, in effect performing shaping of
-- the packet stream passing through the queue/scheduler, as
-- described in the Informal Differentiated Services Model
-- section 7.2.
-- --
qosShapingRateTable OBJECT-TYPE qosMaxRateTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosShapingRateEntry SYNTAX SEQUENCE OF QosMaxRateEntry
PIB-ACCESS install, 6 PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Shaping Rate Table enumerates individual "The Maximum Rate Table enumerates individual
sets of scheduling parameter that can be used/reused sets of scheduling parameter that can be used/reused
by Queues and Schedulers." by Queues and Schedulers."
::= { qosPolicyClasses 14 } ::= { qosPolicyClasses 15 }
qosMaxRateEntry OBJECT-TYPE
qosShapingRateEntry OBJECT-TYPE SYNTAX QosMaxRateEntry
SYNTAX QosShapingRateEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the Assured Rate Table describes "An entry in the Maximum Rate Table describes
a single set of scheduling parameter for use by a single set of scheduling parameter for use by
queues and schedulers." queues and schedulers."
PIB-INDEX { qosShapingRatePrid } PIB-INDEX { qosMaxRatePrid }
UNIQUENESS { qosShapingRateLevel, UNIQUENESS { qosMaxRateId,
qosShapingRateAbs, qosMaxRateLevel,
qosShapingRateRel, qosMaxRateAbsolute,
qosShapingRateThreshold } qosMaxRateRelative,
::= { qosShapingRateTable 1 } qosMaxRateThreshold }
::= { qosMaxRateTable 1 }
QosShapingRateEntry ::= SEQUENCE { QosMaxRateEntry ::= SEQUENCE {
qosShapingRatePrid InstanceId, qosMaxRatePrid InstanceId,
qosShapingRateLevel Unsigned32, qosMaxRateId Unsigned32,
qosShapingRateAbs Unsigned32, qosMaxRateLevel Unsigned32,
qosShapingRateRel Unsigned32, qosMaxRateAbsolute Unsigned32,
qosShapingRateThreshold BurstSize qosMaxRateRelative Unsigned32,
qosMaxRateThreshold BurstSize
} }
qosShapingRatePrid OBJECT-TYPE qosMaxRatePrid OBJECT-TYPE
SYNTAX InstanceId SYNTAX InstanceId
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An arbitrary integer index that uniquely identifies an "An arbitrary integer index that uniquely identifies an
instance of the class." instance of the class."
::= { qosShapingRateEntry 1 } ::= { qosMaxRateEntry 1 }
qosShapingRateLevel OBJECT-TYPE qosMaxRateId OBJECT-TYPE
SYNTAX Unsigned32
STATUS current
DESCRIPTION
"An index used together with qosMaxRateId for representing
a multi-rate shaper. This attribute is used for associating
all the rate attributes of a multi-rate shaper. Each
qosMaxRateEntry of a multi-rate shaper must have the same
value in this attribute. The different rates of a multi-rate
shaper is identified using qosMaxRateLevel.
This attribute uses the value of zero to indicate this
attribute is not used, for single rate shaper."
DEFVAL { 0 }
::= { qosMaxRateEntry 2 }
qosMaxRateLevel OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An index that indicates which level of a multi-rate shaper is "An index that indicates which level of a multi-rate shaper is
being given its parameters. A multi-rate shaper has some number being given its parameters. A multi-rate shaper has some
of rate levels. Frame Relay's dual rate specification refers to a number of rate levels. Frame Relay's dual rate specification
'committed' and an 'excess' rate; ATM's dual rate specification refers to a 'committed' and an 'excess' rate; ATM's dual rate
refers to a 'mean' and a 'peak' rate. This table is generalized specification refers to a 'mean' and a 'peak' rate. This table
to support an arbitrary number of rates. The committed or mean is generalized to support an arbitrary number of rates. The
rate is level 1, the peak rate (if any) is the highest level rate committed or mean rate is level 1, the peak rate (if any) is
configured, and if there are other rates they are distributed in the highest level rate configured, and if there are other
monotonically increasing order between them." rates they are distributed in monotonically increasing order
::= { qosShapingRateEntry 2 } between them.
When the entry is used for a single rate shaper, this
attribute contains a value of zero."
DEFVAL { 0 }
::= { qosMaxRateEntry 3 }
qosShapingRateAbs OBJECT-TYPE qosMaxRateAbsolute OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "kilobits per second" UNITS "kilobits per second"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum rate in kilobits/sec that a downstream "The maximum rate in kilobits/sec that a downstream
scheduler element should allocate to this queue. If scheduler element should allocate to this queue. If
the value is zero, then there is effectively no max- the value is zero, then there is effectively no max-
imum rate limit and that the scheduler should attempt imum rate limit and that the scheduler should attempt
to be work-conserving for this queue. If the value to be work-conserving for this queue. If the value
is non-zero, the scheduler will limit the servicing is non-zero, the scheduler will limit the servicing
of this queue to, at most, this rate in a non-work- of this queue to, at most, this rate in a non-work-
conserving manner. conserving manner.
Note that this attribute's value is coupled to that Note that this attribute's value is coupled to that
of qosShapingRateRel: changes to one will of qosMaxRateRelative: changes to one will
affect the value of the other. affect the value of the other.
[IFMIB] defines ifSpeed as Gauge32 in units of bits per second, [IFMIB] defines ifSpeed as Gauge32 in units of bits per
and ifHighSpeed as Gauge32 in units of 1,000,000 bits per second. second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits
per second.
This yields the following equations: This yields the following equations:
RateRel = [ (RateAbs * 1000) / ifSpeed ] * 10,000 RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000
Where, 1000 is for converting kbps used by RateAbs to bps used by Where, 1000 is for converting kbps used by RateAbsolute to bps
ifSpeed, 10,000 is for 'in units of 1/10,000 of 1' for RateRel. used by ifSpeed, 1,000 is for 'in units of 1/1,000 of 1'
for RateRelative.
or, if appropriate: or, if appropriate:
RateRel = { [ (RateAbs * 1000) / 1,000,000 ] / ifHIghSpeed } * 10,000 RateRelative =
{ [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } *
Where, 1000 and 1,000,000 is for converting kbps used by RateAbs to 1,000
1 million bps used by ifHighSpeed, 10,000 is for 'in units of Where, 1000 and 1,000,000 is for converting kbps used by
1/10,000 of 1' for RateRel." RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is
::= { qosShapingRateEntry 3 } for
'in units of 1/1,000 of 1' for RateRelative."
::= { qosMaxRateEntry 4 }
qosShapingRateRel OBJECT-TYPE qosMaxRateRelative OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum rate that a downstream scheduler element "The maximum rate that a downstream scheduler element
should allocate to this queue, relative to the max- should allocate to this queue, relative to the max-
imum rate of the interface as reported by ifSpeed or imum rate of the interface as reported by ifSpeed or
ifHighSpeed, in units of 1/10,000 of 1. If the value ifHighSpeed, in units of 1/1,000 of 1. If the value
is zero, then there is effectively no maximum rate is zero, then there is effectively no maximum rate
limit and the scheduler should attempt to be work- limit and the scheduler should attempt to be work-
conserving for this queue. If the value is non-zero, conserving for this queue. If the value is non-zero,
the scheduler will limit the servicing of this queue the scheduler will limit the servicing of this queue
to, at most, this rate in a non-work-conserving to, at most, this rate in a non-work-conserving
manner. manner.
Note that this attribute's value is coupled to that Note that this attribute's value is coupled to that
of qosShapingRateAbs: changes to one will of qosMaxRateAbsolute: changes to one will
affect the value of the other. affect the value of the other.
[IFMIB] defines ifSpeed as Gauge32 in units of bits per second, [IFMIB] defines ifSpeed as Gauge32 in units of bits per
and ifHighSpeed as Gauge32 in units of 1,000,000 bits per second. second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits
per second.
This yields the following equations: This yields the following equations:
RateRel = [ (RateAbs * 1000) / ifSpeed ] * 10,000 RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000
Where, 1000 is for converting kbps used by RateAbs to bps used by Where, 1000 is for converting kbps used by RateAbsolute to bps
ifSpeed, 10,000 is for 'in units of 1/10,000 of 1' for RateRel. used
by ifSpeed, 1,000 is for 'in units of 1/1,000 of 1' for
RateRelative.
or, if appropriate: or, if appropriate:
RateRel = { [ (RateAbs * 1000) / 1,000,000 ] / ifHIghSpeed } * 10,000 RateRelative =
{ [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } *
1,000
Where, 1000 and 1,000,000 is for converting kbps used by RateAbs to Where, 1000 and 1,000,000 is for converting kbps used by
1 million bps used by ifHighSpeed, 10,000 is for 'in units of RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is
1/10,000 of 1' for RateRel." for
'in units of 1/1,000 of 1' for RateRelative."
REFERENCE REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]" "ifSpeed, ifHighSpeed from [IFMIB]"
::= { qosShapingRateEntry 4 } ::= { qosMaxRateEntry 5 }
qosShapingRateThreshold OBJECT-TYPE qosMaxRateThreshold OBJECT-TYPE
SYNTAX BurstSize SYNTAX BurstSize
UNITS "Bytes" UNITS "Bytes"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of bytes of queue depth at which the rate of a "The number of bytes of queue depth at which the rate of a
multi-rate scheduler will increase to the next output rate. In multi-rate scheduler will increase to the next output rate. In
the last PRI for such a shaper, this threshold is the last PRI for such a shaper, this threshold is
ignored and by convention is zero." ignored and by convention is zero."
REFERENCE REFERENCE
"RFC 2963" "Adaptive Rate Shaper, RFC 2963"
::= { qosShapingRateEntry 5 } ::= { qosMaxRateEntry 6 }
-- --
-- Parameters Section -- Parameters Section
-- --
-- The Parameters Section defines parameter objects that can be used
-- for specific attributes defined in the PIB PRCs.
qosTBParameters OBJECT IDENTIFIER ::= { qosPolicyParameters 1 } qosTBParameters OBJECT IDENTIFIER ::= { qosPolicyParameters 1 }
qosSchedulerParameters OBJECT IDENTIFIER ::= { qosPolicyParameters 2 } qosSchedulerParameters OBJECT IDENTIFIER
qosShaperParameters OBJECT IDENTIFIER ::= { qosPolicyParameters 2 } ::= { qosPolicyParameters 2 }
-- --
-- Token Bucket Type Parameters -- Token Bucket Type Parameters
-- --
qosTBParamSimpleTokenBucket OBJECT-IDENTITY qosTBParamSimpleTokenBucket OBJECT-IDENTITY
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This value indicates the use of a Two Parameter Token Bucket "This value indicates the use of a Two Parameter Token Bucket
as described in [MODEL] section 5.2.3." as described in [MODEL] section 5.2.3."
skipping to change at page 76, line 41 skipping to change at page 78, line 40
DESCRIPTION DESCRIPTION
"This value indicates the use of an Average Rate Meter as "This value indicates the use of an Average Rate Meter as
described in [MODEL] section 5.2.1." described in [MODEL] section 5.2.1."
REFERENCE REFERENCE
"[MODEL] sections 5 and 7.1.2" "[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 2 } ::= { qosTBParameters 2 }
qosTBParamSrTCMBlind OBJECT-IDENTITY qosTBParamSrTCMBlind OBJECT-IDENTITY
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This value indicates the use of Single Rate Three Color Marker "This value indicates the use of Single Rate Three Color
Metering as defined by RFC 2697, with `Color Blind' mode as Marker Metering as defined by RFC 2697, with `Color Blind'
described by the RFC." mode as described by the RFC."
REFERENCE REFERENCE
"[MODEL] sections 5 and 7.1.2" "[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 3 } ::= { qosTBParameters 3 }
qosTBParamSrTCMAware OBJECT-IDENTITY qosTBParamSrTCMAware OBJECT-IDENTITY
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This value indicates the use of Single Rate Three Color Marker "This value indicates the use of Single Rate Three Color
Metering as defined by RFC 2697, with `Color Aware' mode as Marker Metering as defined by RFC 2697, with `Color Aware'
described by the RFC." mode as described by the RFC."
REFERENCE REFERENCE
"[MODEL] sections 5 and 7.1.2" "[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 4 } ::= { qosTBParameters 4 }
qosTBParamTrTCMBlind OBJECT-IDENTITY qosTBParamTrTCMBlind OBJECT-IDENTITY
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This value indicates the use of Two Rate Three Color Marker "This value indicates the use of Two Rate Three Color Marker
Metering as defined by RFC 2698, with `Color Blind' mode as Metering as defined by RFC 2698, with `Color Blind' mode as
described by the RFC." described by the RFC."
skipping to change at page 78, line 4 skipping to change at page 79, line 38
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This value indicates the use of Time Sliding Window "This value indicates the use of Time Sliding Window
Three Color Marker Metering as defined by RFC 2859." Three Color Marker Metering as defined by RFC 2859."
REFERENCE REFERENCE
"[MODEL] sections 5 and 7.1.2" "[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 7 } ::= { qosTBParameters 7 }
-- --
-- Scheduler Method Parameters -- Scheduler Method Parameters
-- --
qosSchedulerPriority OBJECT-IDENTITY qosSchedulerPriority OBJECT-IDENTITY
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"For use with qosSchedulerMethod and qosIfSchedulingCapsServiceDisc "For use with qosSchedulerMethod and
to indicate Priority scheduling method, defined as an algorithm in qosIfSchedulingCapsServiceDisc to indicate Priority
which the presence of data in a queue or set of queues absolutely scheduling method, defined as an algorithm in which the
precludes dequeue from another queue or set of queues. Notice presence of data in a queue or set of queues absolutely
attributes from qosAssuredRateEntry of the queues/schedulers feeding precludes dequeue from another queue or set of queues.
this scheduler are used when determining the next packet to schedule." Notice attributes from qosMinRateEntry of the
queues/schedulers feeding this scheduler are used when
determining the next packet to schedule."
REFERENCE REFERENCE
"[MODEL] section 7.1.2" "[MODEL] section 7.1.2"
::= { qosSchedulerParameters 1 } ::= { qosSchedulerParameters 1 }
qosSchedulerWRR OBJECT-IDENTITY qosSchedulerWRR OBJECT-IDENTITY
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"For use with qosSchedulerMethod and qosIfSchedulingCapsServiceDisc "For use with qosSchedulerMethod and
to indicate Weighted Round scheduling method, defined as any algorithm qosIfSchedulingCapsServiceDisc to indicate Weighted Round
in which a set of queues are visited in a fixed order, and varying Robin scheduling method, defined as any algorithm in which
amounts of traffic are removed from each queue in turn to implement an a set of
queues are visited in a fixed order, and varying amounts of
traffic are removed from each queue in turn to implement an
average output rate by class. Notice attributes from average output rate by class. Notice attributes from
qosAssuredRateEntry of the queues/schedulers feeding this scheduler are qosMinRateEntry of the queues/schedulers feeding this
used when determining the next packet to schedule." scheduler are used when determining the next packet to
schedule."
REFERENCE REFERENCE
"[MODEL] section 7.1.2" "[MODEL] section 7.1.2"
::= { qosSchedulerParameters 2 } ::= { qosSchedulerParameters 2 }
qosSchedulerWFQ OBJECT-IDENTITY qosSchedulerWFQ OBJECT-IDENTITY
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"For use with qosSchedulerMethod and qosIfSchedulingCapsServiceDisc "For use with qosSchedulerMethod and
to indicate Weighted Fair Queueing scheduling method, defined as any qosIfSchedulingCapsServiceDisc
algorithm in which a set of queues are conceptually visited in some to indicate Weighted Fair Queueing scheduling method, defined
as any
algorithm in which a set of queues are conceptually visited
in some
order, to implement an average output rate by class. Notice order, to implement an average output rate by class. Notice
attributes from qosAssuredRateEntry of the queues/schedulers feeding attributes from qosMinRateEntry of the queues/schedulers
this scheduler are used when determining the next packet to schedule." feeding
this scheduler are used when determining the next packet to
schedule."
REFERENCE REFERENCE
"[MODEL] section 7.1.2" "[MODEL] section 7.1.2"
::= { qosSchedulerParameters 3 } ::= { qosSchedulerParameters 3 }
-- --
qosSingleRateShaper OBJECT-IDENTITY
STATUS current
DESCRIPTION
"For use with qosIfShaperCapsAlgorithm to indicate single rate
shaping method."
REFERENCE
"[MODEL] section 7.2"
::= { qosShaperParameters 1 }
qosFrameRelayDualRateShaper OBJECT-IDENTITY
STATUS current
DESCRIPTION
"For use with qosIfShaperCapsAlgorithm to indicate Frame relay
dual rate shaping method."
REFERENCE
"[MODEL] section 7.2"
::= { qosShaperParameters 2 }
qosATMDualRateShaper OBJECT-IDENTITY
STATUS current
DESCRIPTION
"For use with qosIfShaperCapsAlgorithm to indicate ATM dual
rate shaping method."
REFERENCE
"[MODEL] section 7.2"
::= { qosShaperParameters 3 }
qosRateAdaptiveShaper OBJECT-IDENTITY
STATUS current
DESCRIPTION
"For use with qosIfShaperCapsAlgorithm to indicate rate
adaptive shaping method (RFC2963)."
REFERENCE
"[MODEL] section 7.2"
::= { qosShaperParameters 4 }
-- Conformance Section -- Conformance Section
-- --
qosPolicyPibConformance
OBJECT IDENTIFIER ::= { qosPolicyPib 3 }
qosPolicyPibCompliances qosPolicyPibCompliances
OBJECT IDENTIFIER ::= { qosPolicyPibConformance 1 } OBJECT IDENTIFIER ::= { qosPolicyPibConformance 1 }
qosPolicyPibGroups qosPolicyPibGroups
OBJECT IDENTIFIER ::= { qosPolicyPibConformance 2 } OBJECT IDENTIFIER ::= { qosPolicyPibConformance 2 }
qosPolicyPibCompliance MODULE-COMPLIANCE qosPolicyPibCompliance MODULE-COMPLIANCE
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Describes the requirements for conformance to the "Describes the requirements for conformance to the
QoS Policy PIB." QoS Policy PIB."
MODULE -- this module MODULE -- this module
MANDATORY-GROUPS { MANDATORY-GROUPS {
qosPibDataPathGroup, qosPibDataPathGroup,
qosPibClfrGroup, qosPibClfrGroup,
qosPibClfrElementGroup, qosPibClfrElementGroup,
qosPibActionGroup, qosPibActionGroup,
qosPibAlgDropGroup, qosPibAlgDropGroup,
qosPibQGroup, qosPibQGroup,
qosPibSchedulerGroup, qosPibSchedulerGroup,
qosPibAssuredRateGroup, qosPibMinRateGroup,
qosPibShapingRateGroup } qosPibMaxRateGroup }
GROUP qosPibMeterGroup GROUP qosPibMeterGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that implement "This group is mandatory for devices that implement
metering functions." metering functions."
GROUP qosPibTBParamGroup GROUP qosPibTBParamGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that implement "This group is mandatory for devices that implement
token-bucket metering functions." token-bucket metering functions."
GROUP qosPibDscpMarkActGroup GROUP qosPibDscpMarkActGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that implement "This group is mandatory for devices that implement
DSCP-Marking functions." DSCP-Marking functions."
GROUP qosPibMQAlgDropGroup
DESCRIPTION
"This group is mandatory for devices that implement
Multiple Queue Measured Algorithmic Drop functions."
GROUP qosPibRandomDropGroup GROUP qosPibRandomDropGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that implement "This group is mandatory for devices that implement
Random Drop functions." Random Drop functions."
OBJECT qosClfrId OBJECT qosClfrId
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
skipping to change at page 84, line 11 skipping to change at page 84, line 21
OBJECT qosRandomDropMaxThreshBytes OBJECT qosRandomDropMaxThreshBytes
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropMaxThreshPkts OBJECT qosRandomDropMaxThreshPkts
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropProbMax
MIN-ACCESS notify
DESCRIPTION
"Install support is not required."
OBJECT qosRandomDropWeight OBJECT qosRandomDropWeight
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropSamplingRate OBJECT qosRandomDropSamplingRate
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropProbMax OBJECT qosQNext
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosQNext OBJECT qosQMinRate
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosQRate OBJECT qosQMaxRate
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosQShaper OBJECT qosSchedulerNext
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosSchedulerMethod OBJECT qosSchedulerMethod
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosSchedulerRate OBJECT qosSchedulerMinRate
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosSchedulerShaper OBJECT qosSchedulerMaxRate
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosSchedulerNext OBJECT qosMinRatePriority
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosAssuredRatePriority OBJECT qosMinRateAbsolute
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosAssuredRateAbs OBJECT qosMinRateRelative
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosAssuredRateRel OBJECT qosMaxRateLevel
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosShapingRateAbs OBJECT qosMaxRateAbsolute
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosShapingRateRel OBJECT qosMaxRateRelative
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosShapingRateThreshold OBJECT qosMaxRateThreshold
MIN-ACCESS notify MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
::= { qosPibCompliances 1 } ::= { qosPibCompliances 1 }
qosPibDataPathGroup OBJECT-GROUP qosPibDataPathGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosDataPathStart qosDataPathIfName, qosDataPathRoles,
qosDataPathDirection, qosDataPathStart
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Data Path Group defines the PIB Objects that "The Data Path Group defines the PIB Objects that
describe a data path." describe a data path."
::= { qosPibGroups 1 } ::= { qosPolicyPibGroups 1 }
qosPibClfrGroup OBJECT-GROUP qosPibClfrGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosClfrId qosClfrId
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Classifier Group defines the PIB Objects that "The Classifier Group defines the PIB Objects that
describe a generic classifier." describe a generic classifier."
::= { qosPibGroups 2 } ::= { qosPolicyPibGroups 2 }
qosPibClfrElementGroup OBJECT-GROUP qosPibClfrElementGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosClfrElementClfrId, qosClfrElementOrder, qosClfrElementClfrId, qosClfrElementPrecedence,
qosClfrElementNext, qosClfrElementSpecific qosClfrElementNext, qosClfrElementSpecific
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Classifier Group defines the PIB Objects that "The Classifier Group defines the PIB Objects that
describe a generic classifier." describe a generic classifier."
::= { qosPibGroups 3 } ::= { qosPolicyPibGroups 3 }
qosPibMeterGroup OBJECT-GROUP qosPibMeterGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosMeterSucceedNext, qosMeterFailNext, qosMeterSucceedNext, qosMeterFailNext,
qosMeterSpecific qosMeterSpecific
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Meter Group defines the objects used in describ- "The Meter Group defines the objects used in describ-
ing a generic meter element." ing a generic meter element."
::= { qosPibGroups 5 } ::= { qosPolicyPibGroups 4 }
qosPibTBParamGroup OBJECT-GROUP qosPibTBParamGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosTBParamType, qosTBParamRate, qosTBParamType, qosTBParamRate,
qosTBParamBurstSize, qosTBParamInterval qosTBParamBurstSize, qosTBParamInterval
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Token-Bucket Parameter Group defines the objects "The Token-Bucket Parameter Group defines the objects
used in describing a single-rate token bucket meter used in describing a single-rate token bucket meter
element." element."
::= { qosPibGroups 6 } ::= { qosPolicyPibGroups 5 }
qosPibActionGroup OBJECT-GROUP qosPibActionGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosActionNext, qosActionSpecific qosActionNext, qosActionSpecific
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Action Group defines the objects used in "The Action Group defines the objects used in
describing a generic action element." describing a generic action element."
::= { qosPibGroups 7 } ::= { qosPolicyPibGroups 6 }
qosPibDscpMarkActGroup OBJECT-GROUP qosPibDscpMarkActGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosDscpMarkActDscp qosDscpMarkActDscp
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The DSCP Mark Action Group defines the objects used "The DSCP Mark Action Group defines the objects used
in describing a DSCP Marking Action element." in describing a DSCP Marking Action element."
::= { qosPibGroups 8 } ::= { qosPolicyPibGroups 7 }
qosPibAlgDropGroup OBJECT-GROUP qosPibAlgDropGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosAlgDropType, qosAlgDropNext, qosAlgDropType, qosAlgDropNext,
qosAlgDropQMeasure, qosAlgDropQThreshold, qosAlgDropQMeasure, qosAlgDropQThreshold,
qosAlgDropSpecific qosAlgDropSpecific
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Algorithmic Drop Group contains the objects that "The Algorithmic Drop Group contains the objects that
describe algorithmic dropper operation and configura- describe algorithmic dropper operation and configura-
tion." tion."
::= { qosPibGroups 12 } ::= { qosPolicyPibGroups 8 }
qosPibMQAlgDropGroup OBJECT-GROUP
OBJECTS {
qosMQAlgDropExceedNext
}
STATUS current
DESCRIPTION
"The Multiple Queue Measured Algorithmic Drop Group
contains the objects that describe multiple queue
measured algorithmic dropper operation and configuration."
::= { qosPolicyPibGroups 9 }
qosPibRandomDropGroup OBJECT-GROUP qosPibRandomDropGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosRandomDropMinThreshBytes, qosRandomDropMinThreshBytes,
qosRandomDropMinThreshPkts, qosRandomDropMinThreshPkts,
qosRandomDropMaxThreshBytes, qosRandomDropMaxThreshBytes,
qosRandomDropMaxThreshPkts, qosRandomDropMaxThreshPkts,
qosRandomDropProbMax, qosRandomDropProbMax,
qosRandomDropWeight, qosRandomDropWeight,
qosRandomDropSamplingRate qosRandomDropSamplingRate
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Random Drop Group augments the Algorithmic Drop Group for "The Random Drop Group augments the Algorithmic Drop Group
for
random dropper operation and configuration." random dropper operation and configuration."
::= { qosPibGroups 13 } ::= { qosPolicyPibGroups 10 }
qosPibQGroup OBJECT-GROUP qosPibQGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosQNext, qosQRate, qosQShaper qosQNext, qosQMinRate, qosQMaxRate
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Queue Group contains the objects that describe "The Queue Group contains the objects that describe
an interface's queues." an interface type's queues."
::= { qosPibGroups 14 } ::= { qosPolicyPibGroups 11 }
qosPibSchedulerGroup OBJECT-GROUP qosPibSchedulerGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosSchedulerMethod, qosSchedulerRate, qosSchedulerNext, qosSchedulerMethod,
qosSchedulerShaper, qosSchedulerNext qosSchedulerMinRate, qosSchedulerMaxRate
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Scheduler Group contains the objects that "The Scheduler Group contains the objects that
describe packet schedulers on interfaces." describe packet schedulers on interface types."
::= { qosPibGroups 15 } ::= { qosPolicyPibGroups 12 }
qosPibAssuredRateGroup OBJECT-GROUP qosPibMinRateGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosAssuredRatePriority, qosMinRatePriority,
qosAssuredRateAbs, qosAssuredRateRel qosMinRateAbsolute, qosMinRateRelative
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Assured Rate Group contains the objects "The Minimum Rate Group contains the objects
that describe packet schedulers' parameters on inter- that describe packet schedulers' parameters on interface
faces." types."
::= { qosPibGroups 16 } ::= { qosPolicyPibGroups 13 }
qosPibShapingRateGroup OBJECT-GROUP qosPibMaxRateGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosShapingRateAbs, qosShapingRateRel, qosMaxRateLevel, qosMaxRateAbsolute, qosMaxRateRelative,
qosShapingRateThreshold qosMaxRateThreshold
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Shaping Rate Group contains the objects "The Maximum Rate Group contains the objects
that describe packet schedulers' parameters on inter- that describe packet schedulers' parameters on interface
faces." types."
::= { qosPibGroups 17 } ::= { qosPolicyPibGroups 14 }
END END
9. Subect Category Considerations 9. Acknowledgments
This PIB builds on all the work that has gone into the Informal
Management Model for Diffserv Routers and Management Information
Base for the Differentiated Services Architecture.
It has been developed with the active involvement of many people,
but most notably Ravi Sahita and Walter Weiss.
10. Subject Category Considerations
The numbering space used for the DiffServ PIB, as indicated by the The numbering space used for the DiffServ PIB, as indicated by the
SUBJECT-CATEGORIES clause, will be assigned by the Internet Assigned SUBJECT-CATEGORIES clause, will be assigned by the Internet Assigned
Numbers Authority (IANA). Notice the numbering space used by SUBJECT- Numbers Authority (IANA). Notice the numbering space used by
CATEGORIES maps to the Client Type numbering space in [COPS-PR]. This SUBJECT-CATEGORIES maps to the Client Type numbering space in [COPS-
relationship is detailed in section 7.1 of [SPPI]. Due to the fact that PR]. This relationship is detailed in section 7.1 of [SPPI]. Due
Client Type value of 1 has already been used by [COPS-RSVP], the to the fact that Client Type value of 1 has already been used by
numbering space for SUBJECT-CATEGORIES will need to start with the value [COPS-RSVP], the numbering space for SUBJECT-CATEGORIES will need to
of 2. start with the value of 2.
Other PIB Modules may use the same SUBJECT-CATEGORIES as this DiffServ Other PIB Modules may use the same SUBJECT-CATEGORIES as this
PIB Module. In such situations, PRC numbering space under a specific DiffServ PIB Module. In such situations, PRC numbering space under
SUBJECT-CATEGORIES should be coordinated with existing PIB Modules using a specific SUBJECT-CATEGORIES should be coordinated with existing
the same SUBJECT-CATEGORIES. PIB Modules using the same SUBJECT-CATEGORIES.
10. Security Considerations 11. Security Considerations
The information contained in a PIB when transported by the COPS protocol The information contained in a PIB when transported by the COPS
[COPS-PR] may be sensitive, and its function of provisioning a PEP protocol [COPS-PR] may be sensitive, and its function of
requires that only authorized communication take place. The use of provisioning a PEP requires that only authorized communication take
IPSEC between PDP and PEP, as described in [COPS], provides the place. The use of IPSEC between PDP and PEP, as described in
necessary protection against these threats. [COPS], provides the necessary protection against these threats.
11. Intellectual Property Considerations 12. Intellectual Property Considerations
The IETF is being notified of intellectual property rights claimed in The IETF is being notified of intellectual property rights claimed
regard to some or all of the specification contained in this document. in regard to some or all of the specification contained in this
For more information consult the online list of claimed rights. document. For more information consult the online list of claimed
rights.
12. Authors' Addresses 13. RFC Editor Considerations
Some IETF documents this document references are in the IESG last
call stage. This document references them as internet drafts.
Please use their corresponding RFC numbers prior to publishing of
this document as a RFC. The referenced IETF documents are [FR-PIB],
[MODEL], and [DS-MIB].
14. IANA Considerations
This document standardizes a Policy Information Base (PIB) module,
requesting an IANA assigned PIB number.
15. Authors' Addresses
Michael Fine Michael Fine
Cisco Systems, Inc. Cisco Systems, Inc.
170 West Tasman Drive 170 West Tasman Drive
San Jose, CA 95134-1706 USA San Jose, CA 95134-1706 USA
Phone: +1 408 527 8218 Phone: +1 408 527 8218
Email: mfine@cisco.com Email: mfine@cisco.com
Keith McCloghrie Keith McCloghrie
Cisco Systems, Inc. Cisco Systems, Inc.
170 West Tasman Drive 170 West Tasman Drive
San Jose, CA 95134-1706 USA San Jose, CA 95134-1706 USA
Phone: +1 408 526 5260 Phone: +1 408 526 5260
Email: kzm@cisco.com Email: kzm@cisco.com
John Seligson John Seligson
Nortel Networks, Inc. Nortel Networks, Inc.
4401 Great America Parkway 4401 Great America Parkway
skipping to change at page 92, line 4 skipping to change at page 92, line 12
2111 NE 25th Avenue 2111 NE 25th Avenue
Hillsboro, OR 97124 USA Hillsboro, OR 97124 USA
Phone: +1 503 264 8491 Phone: +1 503 264 8491
Email: carol.a.bell@intel.com Email: carol.a.bell@intel.com
Andrew Smith Andrew Smith
Allegro Networks Allegro Networks
6399 San Ignacio Ave 6399 San Ignacio Ave
San Jose, CA 95119 San Jose, CA 95119
andrew@allegronetworks.com andrew@allegronetworks.com
Francis Reichmeyer Francis Reichmeyer
PFN, Inc. PFN, Inc.
University Park at MIT University Park at MIT
26 Landsdowne Street 26 Landsdowne Street
Cambridge, MA 02139 Cambridge, MA 02139
Phone: +1 617 494 9980 Phone: +1 617 494 9980
Email: franr@pfn.com Email: franr@pfn.com
13. References 16. References
[COPS] [COPS]
Boyle, J., Cohen, R., Durham, D., Herzog, S., Rajan, R., and Boyle, J., Cohen, R., Durham, D., Herzog, S., Rajan, R., and
A. Sastry, "The COPS (Common Open Policy Service) Protocol" A. Sastry, "The COPS (Common Open Policy Service) Protocol"
RFC 2748, January 2000. RFC 2748, January 2000.
[COPS-PR] [COPS-PR]
K. Chan, D. Durham, S. Gai, S. Herzog, K. McCloghrie, K. Chan, D. Durham, S. Gai, S. Herzog, K. McCloghrie,
F. Reichmeyer, J. Seligson, A. Smith, R. Yavatkar, F. Reichmeyer, J. Seligson, A. Smith, R. Yavatkar,
[SPPI] [SPPI]
K. McCloghrie, M. Fine, J. Seligson, K. Chan, S. Hahn, K. McCloghrie, M. Fine, J. Seligson, K. Chan, S. Hahn,
R. Sahita, A. Smith, F. Reichmeyer, "Structure of Policy R. Sahita, A. Smith, F. Reichmeyer, "Structure of Policy
Provisioning Information", Provisioning Information",
Internet Draft <draft-ietf-rap-sppi-07.txt>, May 2001. RFC 3159,August 2001.
[DSARCH] [DSARCH]
M. Carlson, W. Weiss, S. Blake, Z. Wang, D. Black, and M. Carlson, W. Weiss, S. Blake, Z. Wang, D. Black, and
E. Davies, "An Architecture for Differentiated Services", E. Davies, "An Architecture for Differentiated Services",
RFC 2475, December 1998 RFC 2475, December 1998
[DSFIELD] [DSFIELD]
K. Nichols, S. Blake, F. Baker, D. Black, "Definition of the K. Nichols, S. Blake, F. Baker, D. Black, "Definition of the
Differentiated Services Field (DS Field) in the IPv4 and Differentiated Services Field (DS Field) in the IPv4 and
IPv6 Headers", RFC 2474, December 1998. IPv6 Headers", RFC 2474, December 1998.
[FR-PIB] [FR-PIB]
M. Fine, K. McCloghrie, J. Seligson, K. Chan, S. Hahn, M. Fine, K. McCloghrie, J. Seligson, K. Chan, S. Hahn,
R. Sahita, A. Smith, F. Reichmeyer, "Framework Policy R. Sahita, A. Smith, F. Reichmeyer, "Framework Policy
Information Base", Information Base",
Internet Draft <draft-ietf-rap-frameworkpib-05.txt>, Internet Draft <draft-ietf-rap-frameworkpib-06.txt>,
November 2001.
[RAP-FRAMEWORK] [RAP-FRAMEWORK]
R. Yavatkar, D. Pendarakis, "A Framework for R. Yavatkar, D. Pendarakis, "A Framework for
Policy-based Admission Control", RFC 2753, January 2000. Policy-based Admission Control", RFC 2753, January 2000.
[SNMP-SMI] [SNMP-SMI]
K. McCloghrie, D. Perkins, J. Schoenwaelder, J. Case, K. McCloghrie, D. Perkins, J. Schoenwaelder, J. Case,
M. Rose and S. Waldbusser, "Structure of Management Information M. Rose and S. Waldbusser, "Structure of Management
Information
Version 2 (SMIv2)", STD 58, RFC 2578, April 1999. Version 2 (SMIv2)", STD 58, RFC 2578, April 1999.
[MODEL] [MODEL]
Y. Bernet, A. Smith, S. Blake, D. Grossman "A Conceptual Model Y. Bernet, S. Blake, D. Grossman, A. Smith "An Informal
for DiffServ Routers", draft-ietf-diffserv-model-04.txt, Management Model for Diffser Routers",
July 2000. Internet Draft <draft-ietf diffserv - -model-06.txt>,
February 2001.
[IFMIB] [IFMIB]
K. McCloghrie, F. Kastenholz, "The Interfaces Group MIB using K. McCloghrie, F. Kastenholz, "The Interfaces Group MIB using
SMIv2", RFC 2233, November 1997. SMIv2", RFC 2233, November 1997.
[DS-MIB] [DS-MIB]
F. Baker, K. Chan, A. Smith, "Management Information Base for F. Baker, K. Chan, A. Smith, "Management Information Base for
the Differentiated Services Architecture", the Differentiated Services Architecture",
draft-ietf-diffserv-mib-14.txt, October 2001
[ACTQMGMT] [ACTQMGMT]
V. Firoiu, M. Borden "A Study of Active Queue Management for V. Firoiu, M. Borden "A Study of Active Queue Management for
Congestion Control", March 2000, In IEEE Infocom 2000, Congestion Control", March 2000, In IEEE Infocom 2000,
http://www.ieee-infocom.org/2000/papers/405.pdf http://www.ieee-infocom.org/2000/papers/405.pdf
[AQMROUTER] [AQMROUTER]
V.Misra, W.Gong, D.Towsley "Fuid-based analysis of a network of V.Misra, W.Gong, D.Towsley "Fluid-based analysis of a network
AQM routers supporting TCP flows with an application to RED", of AQM routers supporting TCP flows with an application to
In SIGCOMM 2000, RED", In SIGCOMM 2000,
http://www.acm.org/sigcomm/sigcomm2000/conf/paper/ http://www.acm.org/sigcomm/sigcomm2000/conf/paper/
sigcomm2000-4-3.ps.gz sigcomm2000-4-3.ps.gz
[AF-PHB] [AF-PHB]
J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, "Assured J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, "Assured
Forwarding PHB Group.", RFC 2597, June 1999. Forwarding PHB Group.", RFC 2597, June 1999.
[EF-PHB] [EF-PHB]
V. Jacobson, K. Nichols, K. Poduri, "An Expedited Forwarding V. Jacobson, K. Nichols, K. Poduri, "An Expedited Forwarding
PHB." RFC 2598, June 1999. PHB." RFC 2598, June 1999.
skipping to change at page 95, line 5 skipping to change at page 94, line 31
RFC 2697, September 1999. RFC 2697, September 1999.
[TRTCM] [TRTCM]
J. Heinanen, R. Guerin, "A Two Rate Three Color Marker", J. Heinanen, R. Guerin, "A Two Rate Three Color Marker",
RFC 2698, September 1999. RFC 2698, September 1999.
[TSWTCM] [TSWTCM]
W. Fang, N. Seddigh, B. Nandy "A Time Sliding Window Three W. Fang, N. Seddigh, B. Nandy "A Time Sliding Window Three
Colour Marker", RFC 2859, June 2000. Colour Marker", RFC 2859, June 2000.
[RFC2026]
Bradner, S., "The Internet Standards Process -- Revision 3",
BCP 9, RFC 2026, October 1996.
[SHAPER]
"A Rate Adaptive Shaper for Differentiated Services",
RFC 2963, October 2000.
Table of Contents Table of Contents
1 Glossary ........................................................ 3 1. Glossary..........................................................2
2 Introduction .................................................... 3 2. Introduction......................................................2
3 Relationship to the Diffserv Informal Management Model .......... 3 3. Relationship to the Diffserv Informal Management Model............2
3.1 PIB Overview .................................................. 4 3.1. PIB Overview....................................................3
4 Structure of the PIB ............................................ 6
4.1 General Conventions ........................................... 6 4. Structure of the PIB..............................................4
4.2 DiffServ Data Paths ........................................... 6 4.1. General Conventions.............................................5
4.2.1 Data Path PRC ............................................... 7 4.2. DiffServ Data Paths.............................................5
4.3 Classifiers ................................................... 8 4.2.1. Data Path PRC.................................................5
4.3.1 Classifier PRC .............................................. 9 4.3. Classifiers.....................................................6
4.3.2 Classifier Element PRC ..................................... 9 4.3.1. Classifier PRC................................................7
4.4 Meters ........................................................ 9 4.3.2. Classifier Element PRC.......................................7
4.4.1 Meter PRC ................................................... 10 4.4. Meters..........................................................7
4.4.2 Token-Bucket Parameter PRC .................................. 10
4.5 Actions ....................................................... 10 4.4.1. Meter PRC.....................................................8
4.5.1 DSCP Mark Action PRC ........................................ 11 4.4.2. Token-Bucket Parameter PRC....................................8
4.6 Queueing Elements ............................................. 11
4.6.1 Algorithmic Dropper PRC ..................................... 11 4.5. Actions.........................................................8
4.6.2 Random Dropper PRC .......................................... 13 4.5.1. DSCP Mark Action PRC..........................................9
4.6.3 Queues and Schedulers ....................................... 14 4.6. Queueing Elements...............................................9
4.7 Specifying Device Capabilities ................................ 16 4.6.1. Algorithmic Dropper PRC.......................................9
5 PIB Usage Example ............................................... 17
5.1 Model's Example ............................................... 18 4.6.2. Random Dropper PRC...........................................10
5.2 Additional Data Path Example .................................. 20 4.6.3. Queues and Schedulers........................................12
5.2.1 Data ........................................................ 20 4.7. Specifying Device Capabilities.................................13
5.2.2 Meter ....................................................... 23 5. PIB Usage Example................................................14
5.2.3 Queue ....................................................... 24 5.1. Data Path Example..............................................15
6 Summary of the DiffServ PIB ..................................... 24 5.2. Classifier and Classifier Element Example......................15
7 PIB Operational Overview ........................................ 25 5.3. Meter Example..................................................17
8 PIB Definitions ................................................. 26 5.4. Action Example.................................................18
8.1 The DiffServ Base PIB ......................................... 26
9 Subect Category Considerations .................................. 90 5.5. Dropper Examples...............................................18
10 Security Considerations ........................................ 90 5.5.1. Tail Dropper Example.........................................19
11 Intellectual Property Considerations ........................... 90 5.5.2. Single Queue Random Dropper Example..........................19
12 Authors' Addresses ............................................. 90 5.5.3. Multiple Queue Random Dropper Example........................20
13 References ..................................................... 92 5.6. Queue and Scheduler Example....................................21
6. Summary of the DiffServ PIB......................................24
7. PIB Operational Overview.........................................25
8. PIB Definitions..................................................26
8.1. The DiffServ Base PIB..........................................26
9. Acknowledgments.................................................90
10. Subject Category Considerations.................................90
11. Security Considerations.........................................90
12. Intellectual Property Considerations............................90
13. RFC Editor Considerations.......................................90
14. IANA Considerations.............................................91
15. Authors' Addresses..............................................91
16. References......................................................92
 End of changes. 421 change blocks. 
1264 lines changed or deleted 1798 lines changed or added

This html diff was produced by rfcdiff 1.34. The latest version is available from http://tools.ietf.org/tools/rfcdiff/