draft-ietf-diffserv-pib-06.txt   draft-ietf-diffserv-pib-07.txt 
Internet Engineering Task Force M. Fine Internet Engineering Task Force M. Fine
Diffserv Working Group K. McCloghrie Diffserv Working Group Atheros Communications
Internet-Draft Cisco Systems Internet-Draft K. McCloghrie
draft-ietf-diffserv-pib-06.txt J. Seligson draft-ietf-diffserv-pib-07.txt Cisco Systems
Expires September 2002 K. Chan Expires November 2002 J. Seligson
K. Chan
Nortel Networks Nortel Networks
S. Hahn S. Hahn
C. Bell C. Bell
Intel Intel
A. Smith A. Smith
Allegro Networks Allegro Networks
F. Reichmeyer F. Reichmeyer
PFN PFN
Differentiated Services Quality of Service Policy Information Base Differentiated Services Quality of Service Policy Information Base
skipping to change at page 1, line 41 skipping to change at page 1, line 42
The list of current Internet-Drafts can be accessed at The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt http://www.ietf.org/ietf/1id-abstracts.txt
The list of Internet-Draft Shadow Directories can be accessed at The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html. http://www.ietf.org/shadow.html.
This document is a product of the IETF's Differentiated Services This document is a product of the IETF's Differentiated Services
Working Group. Comments should be addressed to WG's mailing list at Working Group. Comments should be addressed to WG's mailing list at
diffserv@ietf.org. The charter for Diffserv may be found at diffserv@ietf.org. The charter for Diffserv may be found at
http://www.ietf.org/html.charters/diffserv-charter.html. http://www.ietf.org/html.charters/diffserv-charter.html.
Copyright c The Internet Society (2001). All Rights Reserved. Copyright c The Internet Society (2002). All Rights Reserved.
Distribution of this memo is unlimited. Distribution of this memo is unlimited.
Abstract Abstract
This document describes a Policy Information Base (PIB) for a device This document describes a Policy Information Base (PIB) for a device
implementing the Differentiated Services Architecture. The Policy implementing the Differentiated Services Architecture. The
Rule Classes defined here provide policy control of resources provisioning classes defined here provide policy control of
implementing the Differentiated Services Architecture. These Policy resources implementing the Differentiated Services Architecture.
Rule Classes can be used with other none Differentiated Services These provisioning classes can be used with other none
Policy Rule Classes (defined in other PIBs) to provide for a Differentiated Services provisioning classes (defined in other PIBs)
comprehensive policy controlled mapping of service requirement to to provide for a comprehensive policy controlled mapping of service
device resource capability and usage. requirement to device resource capability and usage.
Conventions used in this document Conventions used in this document
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in
this document are to be interpreted as described in [RFC-2119]. this document are to be interpreted as described in [RFC-2119].
Table of Contents
1. Glossary..........................................................3
2. Introduction......................................................3
3. Relationship to the Diffserv Informal Management Model............3
3.1. PIB Overview....................................................4
4. Structure of the PIB..............................................6
4.1. General Conventions.............................................6
4.2. DiffServ Data Paths.............................................6
4.2.1. Data Path PRC.................................................6
4.3. Classifiers.....................................................7
4.3.1. Classifier PRC................................................8
4.3.2. Classifier Element PRC.......................................8
4.4. Meters..........................................................9
4.4.1. Meter PRC.....................................................9
4.4.2. Token-Bucket Parameter PRC....................................9
4.5. Actions........................................................10
4.5.1. DSCP Mark Action PRC.........................................10
4.6. Queueing Elements..............................................10
4.6.1. Algorithmic Dropper PRC......................................10
4.6.2. Random Dropper PRC...........................................12
4.6.3. Queues and Schedulers........................................13
4.7. Specifying Device Capabilities.................................15
5. PIB Usage Example................................................16
5.1. Data Path Example..............................................16
5.2. Classifier and Classifier Element Example......................16
5.3. Meter Example..................................................19
5.4. Action Example.................................................19
5.5. Dropper Examples...............................................20
5.5.1. Tail Dropper Example.........................................20
5.5.2. Single Queue Random Dropper Example..........................20
5.5.3. Multiple Queue Random Dropper Example........................21
5.6. Queue and Scheduler Example....................................23
6. Summary of the DiffServ PIB......................................25
7. PIB Operational Overview.........................................26
8. PIB Definition...................................................27
9. Acknowledgments.................................................87
10. Security Considerations.........................................87
11. Intellectual Property Considerations............................87
12. RFC Editor Considerations.......................................87
13. IANA Considerations.............................................87
14. Authors' Addresses..............................................88
15. Normative References............................................89
16. Full Copyright...................................................91
1. Glossary 1. Glossary
PRC Provisioning Class. A type of policy data. PRC Provisioning Class. A type of policy data. See [POLTERM].
PRI Provisioning Instance. An instance of a PRC. PRI Provisioning Instance. An instance of a PRC. See [POLTERM].
PIB Policy Information Base. The database of policy information. PIB Policy Information Base. The database of policy information.
See [POLTERM].
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 PRC. instance of a PRC.
2. Introduction 2. Introduction
[SPPI] describes a structure for specifying policy information that [SPPI] describes a structure for specifying policy information that
can then be transmitted to a network device for the purpose of can then be transmitted to a network device for the purpose of
configuring policy at that device. The model underlying this configuring policy at that device. The model underlying this
structure is one of well-defined policy rule classes and instances structure is one of well-defined provisioning classes and instances
of these classes residing in a virtual information store called the of these classes residing in a virtual information store called the
Policy Information Base (PIB). Policy Information Base (PIB).
This document specifies a set of policy rule classes specifically This document specifies a set of provisioning classes specifically
for 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] One way to provision policy is by means of the COPS protocol [COPS]
with the extensions for provisioning [COPS-PR]. This protocol with the extensions for provisioning [COPS-PR]. This protocol
supports multiple clients, each of which may provision policy for a supports multiple clients, each of which may provision policy for a
specific policy domain such as QoS. The PRCs defined in this specific policy domain such as QoS. The PRCs defined in this
DiffServ QoS PIB are intended for use by the COPS-PR QoS client DiffServ QoS PIB are intended for use by the COPS-PR QoS client
type. Furthermore, these PRCs are in addition to any other PIBs type. Furthermore, these PRCs are in addition to any other PIBs
that may be defined for the QoS client type in the future, as well that may be defined for the QoS client type in the future, as well
as the PRCs defined in the Framework 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 This PIB is designed according to the Differentiated Services
Informal Management Model documented in [MODEL]. The model describes Informal Management Model documented in [MODEL]. The model describes
the way that ingress and egress interfaces of an 'n'-port router are the way that ingress and egress interfaces of a 'n'-port router are
modeled. It describes the configuration and management of a Diffserv modeled. It describes the configuration and management of a Diffserv
interface in terms of a Traffic Conditioning Block (TCB) which interface in terms of a Traffic Conditioning Block (TCB) which
contains, by definition, zero or more classifiers, meters, actions, contains, by definition, zero or more classifiers, meters, actions,
algorithmic droppers, queues and schedulers. These elements are algorithmic droppers, queues and schedulers. These elements are
arranged according to the QoS policy being expressed, always in that arranged according to the QoS policy being expressed, always in that
order. Traffic may be classified; classified traffic may be metered; order. Traffic may be classified; classified traffic may be metered;
each stream of traffic identified by a combination of classifiers each stream of traffic identified by a combination of classifiers
and meters may have some set of actions performed on it; it may have and meters may have some set of actions performed on it; it may have
dropping algorithms applied and it may ultimately be stored into a dropping algorithms applied and it may ultimately be stored into a
queue before being scheduled out to its next destination, either queue before being scheduled out to its next destination, either
skipping to change at page 3, line 36 skipping to change at page 4, line 37
in the text for relating the PIB with the [MODEL]. The actual in the text for relating the PIB with the [MODEL]. The actual
distinguishing of which TCB a specific element is a part of is not distinguishing of which TCB a specific element is a part of is not
needed for the instrumentation of a device to support the needed for the instrumentation of a device to support the
functionalities of DiffServ, but it is useful for conceptual functionalities of DiffServ, but it is useful for conceptual
reasons. By not using the TCB concept, this PIB allows any grouping reasons. By not using the TCB concept, this PIB allows any grouping
of elements to construct TCBs, using rules indicated by the [MODEL]. of elements to construct TCBs, using rules indicated by the [MODEL].
This will minimize changes to this PIB if rules in [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 The notion of a Data Path is used in this PIB to indicate the
DiffServ processing a packet may experience. This Data Path is DiffServ processing a packet may experience. This Data Path is
distinguished based on the Role Combination and the Direction of the distinguished based on the Role Combination, Capability Set, and the
flow the packet is part of. A Data Path Table Entry indicates the Direction of the flow the packet is part of. A Data Path Table
first of possibly multiple elements that will apply DiffServ Entry indicates the first of possibly multiple elements that will
treatment to the packet. 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 DiffServ treatments being applied to a packet, and the
parameterization of these treatments. These two aspects of the parameterization of these treatments. These two aspects of the
configuration are kept separate throughout the design of the PIB, configuration are kept separate throughout the design of the PIB,
and are fulfilled using 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
skipping to change at page 4, line 33 skipping to change at page 5, line 36
drop functionality. drop functionality.
- Enqueue the traffic for output in the appropriate queue, whose - Enqueue the traffic for output in the appropriate queue, whose
scheduler may shape the traffic or simply forward it with some scheduler 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 describes interface role single DiffServ device. This class describes interface role
combination and interface direction specific data paths. combination 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 parameterization table - TBParam table, applicable for Simple
Token Bucket Meter, Average Rate Meter, Single Rate Three Color Token Bucket Meter, Average Rate Meter, Single Rate Three Color
Meter, Two Rate Three Color Meter, and Sliding Window Three Meter, Two Rate Three Color Meter, and Sliding Window Three
Color Meter. Color Meter.
Action Tables Action Tables
A general extensible framework and examples of parameterization A general extensible framework and example of parameterization
tables for Mark actions. The tables for Mark action. The "multiplexer" and "null" actions
"multiplexer" and "null" actions described in [MODEL] are described in [MODEL] are accomplished implicitly by means of the
accomplished implicitly by means of the Prid structures of the Prid structures of the other elements.
other elements.
Algorithmic Dropper Tables Algorithmic Dropper Tables
A general extensible framework for describing the dropper A general extensible framework for describing the dropper
functional datapath element. This includes the absolute dropper functional datapath element. This includes the absolute dropper
and other queue measurement dependent algorithmic droppers. and other queue measurement dependent algorithmic droppers.
Queue and Scheduler Tables Queue and Scheduler Tables
A general extensible framework for parameterizing queuing and A general extensible framework for parameterizing queuing and
scheduler systems. Notice Shaper is considered as a type of scheduler systems. Notice Shaper is considered as a type of
scheduler and is included 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 PIB consists of PRCs that represent functional elements in the
the data path (e.g. classifiers, meters, actions), and classes that data path (e.g. classifiers, meters, actions), and classes that
specify parameters that apply to a certain type of functional specify parameters that apply to a certain type of functional
element (e.g. a Token Bucket meter or a Mark action). Parameters element (e.g. a Token Bucket meter or a Mark action). Parameters
are typically specified in a separate PRC to enable the use of are typically specified in a separate PRC to enable the use of
parameter classes by multiple policies. parameter classes by multiple policies.
Functional element PRCs use the Prid TC (defined in [SPPI]) to Functional element PRCs use the Prid TC (defined in [SPPI]) to
indicate indirection. A Prid is an object identifier that is used indicate indirection. A Prid is an object identifier that is used
to specify an instance of a PRC in another table. A Prid is used to to specify an instance of a PRC in another table. A Prid is used to
point to parameter PRC that applies to a functional element, such as point to parameter PRC that applies to a functional element, such as
which filter should be used for a classifier element. A Prid is also which filter should be used for a classifier element. A Prid is also
skipping to change at page 5, line 55 skipping to change at page 7, line 4
Please refer to the [MODEL] for discussions on the valid sequencing Please refer to the [MODEL] for discussions on the valid sequencing
and grouping of DiffServ Functional Elements. Given some basic and grouping of DiffServ Functional Elements. Given some basic
information, e.g. the interface capability, role combination and information, e.g. the interface capability, role combination and
direction, the first DiffServ Functional Element is determined. direction, the first DiffServ Functional Element is determined.
Subsequent DiffServ Functional Elements are provided by the "Next" Subsequent DiffServ Functional Elements are provided by the "Next"
pointer attribute of each entry of data path tables. A description pointer attribute of each entry of data path tables. A description
of how this "Next" pointer is used in each table is provided in of how this "Next" pointer is used 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 The Data Path PRC provides the DiffServ treatment starting points
for all packets of this DiffServ device. Each instance of this PRC for all packets of this DiffServ device. Each instance of this PRC
specifies the interface capability, role combination and direction specifies the interface capability, role combination and direction
for the packet flow. There should be at most two entries for each for the packet flow. There should be at most two entries for each
(interface type, role combination) pair, one for ingress and one for (interface type, role combination, interface capability), one for
egress. Each instance provides the first DiffServ Functional ingress and one for egress. Each instance provides the first
Element each packet at a specific interface (identified by the roles DiffServ Functional Element each packet at a specific interface
assigned to the interface) traveling in a specific relative (identified by the roles assigned to the interface) traveling in a
direction should experience. Notice this table is interface specific relative direction should experience. Notice this class is
specific, with the use of interface type and RoleCombination. To interface specific, with the use of interface type capability set
indicate explicitly that there are no Diffserv treatments for a and RoleCombination. To indicate explicitly that there are no
particular interface type, role combination and direction, an Diffserv treatments for a particular interface type capability set,
instance of the Data Path PRC can be created with zeroDotZero in the role combination and direction, an instance of the Data Path PRC can
qosDataPathStart attribute. This situation can also be indicated be created with zeroDotZero in the dsDataPathStart attribute. This
implicitly by not supplying an instance of a Data Path PRC for that situation can also be indicated implicitly by not supplying an
particular interface type, role combination and direction. The instance of a Data Path PRC for that particular interface type
capability set, 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 that the PEP should perform normal IP device processing when
zeroDotZero is used in the qosDataPathStart attribute, or when the zeroDotZero is used in the dsDataPathStart attribute, or when the
entry does not exist. Normal IP device processing will depend on the entry does not exist. Normal IP device processing will depend on the
device; for 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 Based on implementation experience of network devices where data
path functional elements are implemented in separate physical path functional elements are implemented in separate physical
processors or application specific integrated circuits, separated by processors or application specific integrated circuits, separated by
switch fabric, it seems that more complex notions of data path are switch fabric, it seems that more complex notions of data path are
required within the network device to correlate the different required within the network device to correlate the different
physically separate data path functional elements. For example, physically separate data path functional elements. For example,
ingress processing may have determined a specific ingress flow that ingress processing may have determined a specific ingress flow that
skipping to change at page 8, line 43 skipping to change at page 9, line 46
of meter. The definition of parameters specific to the type of of meter. The definition of parameters specific to the type of
meter used is referenced via a pointer to an instance of a PRC meter used is referenced via a pointer to an instance of a PRC
containing those specifics. This enables the use of any sort of containing those specifics. This enables the use of any sort of
specific meter table that one might wish to design, standard or specific meter table that one might wish to design, standard or
proprietary. One specific meter table is 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. 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 This is included as an example of a common type of meter. Entries
in this table are referenced from the qosMeterSpecific attributes of in this class are referenced from the dsMeterSpecific attributes of
meter PRC instances. The parameters are represented by a rate meter PRC instances. The parameters are represented by a rate
qosTBParamRate, a burst size qosTBParamBurstSize, and an interval dsTBParamRate, a burst size dsTBParamBurstSize, and an interval
qosTBparamInterval. The type of meter being parameterized is dsTBparamInterval. The type of meter being parameterized is
indicated by the qosTBParamType attribute. This is used to indicated by the dsTBParamType attribute. This is used to determine
determine how the rate, burst and rate interval parameters are used. how the rate, burst and rate interval parameters are used.
Additional meter parameterization classes can be defined in other Additional meter parameterization classes can be defined in other
PIBs when necessary. PIBs when necessary.
4.5. Actions 4.5. Actions
Actions include "no action", "mark the traffic with a DSCP" or Actions include "no action", "mark the traffic with a DSCP" or
"specific action". Other tasks such as "shape the traffic" or "drop "specific action". Other tasks such as "shape the traffic" or "drop
based on some algorithm" are handled in other functional datapath based on some algorithm" are handled in other functional datapath
elements rather than in actions. The "multiplexer", "replicator" elements rather than in actions. The "multiplexer", "replicator"
and "null" actions described in [MODEL] are accomplished implicitly and "null" actions described in [MODEL] are accomplished implicitly
through 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 dsActionTable to organize one Action's
relationship with the element(s) before and after it. It allows relationship with the element(s) before and after it. It allows
Actions to be cascaded to enable multiple Actions be applied to a Actions to be cascaded to enable multiple Actions be applied to a
single traffic stream by using each entry's qosActionNext attribute. single traffic stream by using each entry's dsActionNext attribute.
The qosActionNext attribute of the last action entry in the chain The dsActionNext attribute of the last action entry in the chain
points to the next element in the TCB, if any, e.g. a Queueing points to the next element in the TCB, if any, e.g. a Queueing
element. It may also point 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 The parameters needed for the Action element will depend on the type
of Action to be taken. Hence the PIB allows for specific Action of Action to be taken. Hence the PIB allows for specific Action
Tables for the different Action types. This flexibility allows Tables for the different Action types. This flexibility allows
additional Actions be specified in other PIBs and also allows for additional Actions be specified in other PIBs and also allows for
the use of proprietary Actions without impact on those defined here. the use of proprietary Actions without impact on those defined here.
One may consider packet dropping as an Action element. Packet One may consider packet dropping as an Action element. Packet
dropping is handled by the Algorithm Dropper datapath functional dropping is handled by the Algorithmic Dropper datapath functional
element. 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 This Action is applied to traffic in order to mark it with a
Diffserv Codepoint (DSCP) value, specified in the Diffserv Codepoint (DSCP) value, specified in the
qosDscpMarkActTable. dsDscpMarkActTable.
4.6. Queueing Elements 4.6. Queueing Elements
These include Algorithmic Droppers, Queues and Schedulers, which are These include Algorithmic Droppers, Queues and Schedulers, which are
all 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 Algorithmic Dropper PRC. An Algorithmic Dropper is assumed to
operate indiscriminately on all packets that are presented at its operate indiscriminately on all packets that are presented at its
input, all traffic separation should be done by classifiers and input, all traffic separation should be done by classifiers and
meters preceding it. meters preceding it.
Algorithmic Dropper includes many types of droppers, from the simple Algorithmic Dropper includes many types of droppers, from the simple
always dropper to the more complex random dropper. This is always dropper to the more complex random dropper. This is
indicated by the qosAlgDropType attribute. indicated by the dsAlgDropType 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 Algorithmic Dropper Table entry contains a dsAlgDropQMeasure
attribute, indicating which queue's state affects the calculation of attribute, indicating which queue's state affects the calculation of
the Algorithmic Dropper. Each entry also contains a qosAlgDropNext the Algorithmic Dropper. Each entry also contains a dsAlgDropNext
attribute which indicates to which queue the Algorithmic Dropper attribute which indicates to which queue the Algorithmic Dropper
sinks its traffic. sinks its traffic.
Algorithmic Droppers may also contain a pointer to specific detail Algorithmic Droppers may also contain a pointer to specific detail
of the drop algorithm, qosAlgDropSpecific. This PIB defines the of the drop algorithm, dsAlgDropSpecific. This PIB defines the
detail for three drop algorithms: Tail Drop, Head Drop and Random detail for three drop algorithms: Tail Drop, Head Drop and Random
Drop; other algorithms are outside the scope of this PIB module but Drop; other algorithms are outside the scope of this PIB module but
the general framework is intended to allow for their inclusion via the general framework is intended to allow for their inclusion via
other PIB modules. other PIB modules.
One generally-applicable parameter of a dropper is the specification One generally-applicable parameter of a dropper is the specification
of a queue-depth threshold at which some drop action is to start. of a queue-depth threshold at which some drop action is to start.
This is represented in this PIB, as a base attribute, This is represented in this PIB, as a base attribute,
qosAlgDropQThreshold, of the Algorithmic Dropper entry. The dsAlgDropQThreshold, of the Algorithmic Dropper entry. The
attribute, qosAlgDropQMeasure, specifies which queue's depth attribute, dsAlgDropQMeasure, specifies which queue's depth
qosAlgDropQThreshold is to compare against. dsAlgDropQThreshold is to compare against.
o An Always Dropper drops every packet presented to it. This type o An Always Dropper drops every packet presented to it. This type
of dropper does not require any other parameter. of dropper does not require any other parameter.
o A Tail Dropper requires the specification of a maximum queue o A Tail Dropper requires the specification of a maximum queue
depth threshold: when the queue pointed at by qosAlgDropQMeasure depth threshold: when the queue pointed at by dsAlgDropQMeasure
reaches that depth threshold, qosAlgDropQThresh, any new reaches that depth threshold, dsAlgDropQThresh, 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 dsAlgDropEntry.
o A Head Dropper requires the specification of a maximum queue o A Head Dropper requires the specification of a maximum queue
depth threshold: when the queue pointed at by qosAlgDropQMeasure depth threshold: when the queue pointed at by dsAlgDropQMeasure
reaches that depth threshold, qosAlgDropQThresh, traffic reaches that depth threshold, dsAlgDropQThresh, 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 dsAlgDropEntry.
o Random Droppers are recommended as a way to control congestion, o Random Droppers are recommended as a way to control congestion,
in [QUEUEMGMT] and called for in the [AF-PHB]. Various in [QUEUEMGMT] and called for in the [AF-PHB]. Various
implementations exist, which agree on marking or dropping just implementations exist, which agree on marking or dropping just
enough traffic to communicate with TCP-like protocols about enough traffic to communicate with TCP-like protocols about
congestion avoidance, but differ markedly on their specific congestion avoidance, but differ markedly on their specific
parameters. This PIB attempts to offer a minimal set of controls parameters. This PIB attempts to offer a minimal set of controls
for any random dropper, but expects that vendors will augment the for any random dropper, but expects that vendors will augment the
PRC with additional controls and status in accordance with their PRC with additional controls and status in accordance with their
implementation. This algorithm requires additional parameters on implementation. This algorithm requires additional parameters on
top of those in qosAlgDropEntry; these are discussed below. top of those in dsAlgDropEntry; these are discussed below.
A Dropper Type of other is provided for implementation of dropper
types not defined here. When the Dropper Type is other, its full
specification will need to be provided by another PRC referenced by
dsAlgDropSpecific. A Dropper Type of Multiple Queue Random Dropper
is also provided, please reference section 5.5.3 of this document
for more details.
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 One example of a random dropper is a RED-like dropper. An example of
the representation chosen in this PIB for this element is shown in the representation chosen in this PIB for this element is shown in
Figure 1. Figure 1.
Random droppers often have their drop probability function described Random droppers often have their drop probability function described
as 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. (Qmin, Pmin) then defines the start of the characteristic plot.
Normally Pmin=0, meaning with average queue length below Qmin, there Normally Pmin=0, meaning with average queue length below Qmin, there
will be no drops. (Qmax, Pmax) defines a "knee" on the plot, after will be no drops. (Qmax, Pmax) defines a "knee" on the plot, after
which point the drop probability become more progressive (greater which point the drop probability become more progressive (greater
slope). (Qclip, 1) defines the queue length at which all packets slope). (Qclip, 1) defines the queue length at which all packets
will be dropped. Notice this is different from Tail Drop because will be dropped. Notice this is different from Tail Drop because
this uses an averaged queue length. Although it is possible for this uses an averaged queue length. Although it is possible for
Qclip = Qmax. Qclip = Qmax.
In the PIB module, qosRandomDropMinThreshBytes and In the PIB module, dsRandomDropMinThreshBytes and
qosRandomDropMinThreshPkts represent Qmin. dsRandomDropMinThreshPkts represent Qmin.
qosRandomDropMaxThreshBytes and qosRandomDropMaxThreshPkts represent dsRandomDropMaxThreshBytes and dsRandomDropMaxThreshPkts represent
Qmax. qosAlgDropQThreshold represents Qclip. qosRandomDropProbMax Qmax. dsAlgDropQThreshold represents Qclip. dsRandomDropProbMax
represents Pmax. This PIB does not represent Pmin (assumed to be represents Pmax. This PIB does not represent Pmin (assumed to be
zero unless otherwise represented). zero unless otherwise represented).
In addition, since message memory is finite, queues generally have In addition, since message memory is finite, queues generally have
some upper bound above which they are incapable of storing some upper bound above which they are incapable of storing
additional traffic. Normally this number is equal to Qclip, additional traffic. Normally this number is equal to Qclip,
specified by qosAlgDropQThreshold. specified by dsAlgDropQThreshold.
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
+-----------------+ +-------+ +-----------------+ +-------+
--->| Next --------- -- + +---------------->| Next -+--> |AlgDrop | |Queue |
| QMeasure -------+--+ | ... | --->| Next ---------+-+----------------->| Next -+-->
| QThreshold | RandomDrop +-------+ | QMeasure -------+-+ | ... |
| QThreshold | +-------+
| Type=randomDrop | +----------------+ | Type=randomDrop | +----------------+
| Specific -------+-->| MinThreshBytes | | Specific -------+-->|RandomDrop |
+-----------------+ | MaxThreshBytes | +-----------------+ | MinThreshBytes |
| 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 The calculation of a smoothed queue length may also have an
important bearing on the behavior of the dropper: parameters may important bearing on the behavior of the dropper: parameters may
include the sampling interval or rate, and the weight of each include the sampling interval or rate, and the weight of each
sample. The performance may be very sensitive to the values of these sample. The performance may be very sensitive to the values of these
parameters and a wide range of possible values may be required due parameters and a wide range of possible values may be required due
to a wide range of link speeds. Most algorithms include a sample to a wide range of link speeds. Most algorithms include a sample
weight, represented here by qosRandomDropWeight. The availability weight, represented here by dsRandomDropWeight. The availability of
of qosRandomDropSamplingRate as readable is important, the dsRandomDropSamplingRate as readable is important, the information
information provided by Sampling Rate is essential to the provided by Sampling Rate is essential to the configuration of
configuration of qosRandomDropWeight. Having Sampling Rate be dsRandomDropWeight. Having Sampling Rate be configurable is also
configurable is also helpful, as line speed increases, the ability helpful, as line speed increases, the ability to have queue sampling
to have queue sampling be less frequent than packet arrival is be less frequent than packet arrival is needed. Note however that
needed. Note however that there is ongoing research on this topic, there is ongoing research on this topic, see e.g. [ACTQMGMT] and
see e.g. [ACTQMGMT] and [AQMROUTER]. [AQMROUTER].
Additional parameters may be added in an enterprise PIB module, e.g. Additional parameters may be added in an enterprise PIB module, e.g.
by using AUGMENTS on this table, to handle aspects of random drop by using AUGMENTS on this class, 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 NOTE: Deterministic Droppers can be viewed as a special case of
Random Droppers with the drop probability restricted to 0 and 1. Random Droppers with the drop probability restricted to 0 and 1.
Hence Deterministic Droppers might be described by a Random Dropper Hence Deterministic Droppers might be described by a Random Dropper
with Pmin = 0, Pmax = 1, Qmin = Qmax = Qclip, the averaged queue with Pmin = 0, Pmax = 1, Qmin = Qmax = Qclip, the averaged queue
length at which 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] The Queue PRC models simple FIFO queues, as described in [MODEL]
section 7.1.1. The Scheduler PRC allows flexibility in constructing section 7.1.1. The Scheduler PRC allows flexibility in constructing
both simple and somewhat more complex queueing hierarchies from both simple and somewhat more complex queueing hierarchies from
those queues. Of course, since TCBs can be cascaded multiple times those queues. Of course, since TCBs can be cascaded multiple times
on an interface, even more complex hierarchies can be constructed on an interface, even more complex hierarchies can be constructed
that way also. 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 elements e.g. dsMeterSucceedNext. Note that multiple
upstream elements may direct their traffic to the same Queue PRI. upstream elements may direct their traffic to the same Queue PRI.
For example, the Assured Forwarding PHB suggests that all traffic For example, the Assured Forwarding PHB suggests that all traffic
marked AF11, AF12 or AF13 be placed in the same queue, after marked AF11, AF12 or AF13 be placed in the same queue, after
metering, without reordering. This would be represented by having metering, without reordering. This would be represented by having
the qosMeterSucceedNext of each upstream meter point at the same the dsMeterSucceedNext of each upstream meter point at the same
Queue PRI. Queue PRI.
NOTE: Queue and Scheduler PRIs are for data path description, they NOTE: Queue and Scheduler PRIs are for data path description, they
both use Scheduler Parameterization Table entries for diffserv both use Scheduler Parameterization Table entries for diffserv
treatment parameterization. treatment parameterization.
A Queue Table entry specifies the scheduler it wants service from by A Queue Table entry specifies the scheduler it wants service from by
use of its Next pointer. use of its Next pointer.
Each Scheduler Table entry represents the algorithm in use for Each Scheduler Table entry represents the algorithm in use for
servicing the one or more queues that feed it. The [MODEL] section servicing the one or more queues that feed it. The [MODEL] section
7.1.2 describes a scheduler with multiple inputs: this is 7.1.2 describes a scheduler with multiple inputs: this is
represented in the PIB by having the scheduling parameters be represented in the PIB by having the scheduling parameters be
associated with each input. In this way, sets of Queues can be associated with each input. In this way, sets of Queues can be
grouped together as inputs to the same Scheduler. This table serves grouped together as inputs to the same Scheduler. This class serves
to represent the example scheduler described in the [MODEL]: other to represent the example scheduler described in the [MODEL]: other
more complex representations might be created outside of this PIB. more complex representations might be created outside of this PIB.
Both the Queue PRC and the Scheduler PRC use instances of the Both the Queue PRC and the Scheduler PRC use instances of the
Scheduler Parameterization PRC to specify diffserv treatment Scheduler Parameterization PRC to specify diffserv treatment
parameterization. Scheduler Parameter PRC instances are used to parameterization. Scheduler Parameter PRC instances are used to
parameterize each input that feeds into a scheduler. The inputs can parameterize each input that feeds into a scheduler. The inputs can
be a mixture of Queue PRI's and Scheduler PRI's. Scheduler 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 Parameter PRI's can be used/reused by one or more Queue and/or
Scheduler Table entries. Scheduler Table entries.
skipping to change at page 13, line 23 skipping to change at page 14, line 28
For representing a Strict Priority scheduler, each scheduler input For representing a Strict Priority scheduler, each scheduler input
is assigned a priority with respect to all the other inputs feeding is assigned a priority with respect to all the other inputs feeding
the same scheduler, with default values for the other parameters. A the same scheduler, with default values for the other parameters. A
higher-priority input which contains traffic that is not being higher-priority input which contains traffic that is not being
delayed for shaping will be serviced before a lower-priority input. delayed for shaping will be serviced before a lower-priority input.
For Weighted Scheduling methods e.g. WFQ, WRR, the "weight" of a For Weighted Scheduling methods e.g. WFQ, WRR, the "weight" of a
given scheduler input is represented with a Minimum Service Rate given scheduler input is represented with a Minimum Service Rate
leaky-bucket profile which provides guaranteed minimum bandwidth to leaky-bucket profile which provides guaranteed minimum bandwidth to
that input, if required. This is represented by a rate that input, if required. This is represented by a rate
qosMinRateAbsolute; the classical weight is the ratio between that dsMinRateAbsolute; the classical weight is the ratio between that
rate and the interface speed, or perhaps the ratio between that rate rate and the interface speed, or perhaps the ratio between that rate
and the sum of the configured rates for classes. The rate may, and the sum of the configured rates for classes. The rate may,
alternatively, be represented by a relative value, as a fraction of alternatively, be represented by a relative value, as a fraction of
the interface's current line rate, qosMinRateRelative to assist in the interface's current line rate, dsMinRateRelative to assist in
cases where line rates are variable or where a higher-level policy cases where line rates are variable or where a higher-level policy
might be expressed in terms of fractions of network resources. The might be expressed in terms of fractions of network resources. The
two rate parameters are inter-related and changes in one may be two rate parameters are inter-related and changes in one may be
reflected in the other. reflected in the other.
For weighted scheduling methods, one can say loosely, that WRR For weighted scheduling methods, one can say loosely, that WRR
focuses on meeting bandwidth sharing, without concern for relative focuses on meeting bandwidth sharing, without concern for relative
delay amongst the queues; where WFQ control both queue service order delay amongst the queues; where WFQ control both queue service order
and amount of traffic serviced, providing meeting bandwidth sharing and amount of traffic serviced, providing meeting bandwidth sharing
and relative delay ordering amongst the queues. and relative delay ordering amongst the queues.
A queue or scheduled set of queues (which is an input to a A queue or scheduled set of queues (which is an input to a
scheduler) may also be capable of acting as a non-work-conserving scheduler) may also be capable of acting as a non-work-conserving
[MODEL] traffic shaper: this is done by defining a Maximum Service [MODEL] traffic shaper: this is done by defining a Maximum Service
Rate leaky-bucket profile in order to limit the scheduler bandwidth Rate leaky-bucket profile in order to limit the scheduler bandwidth
available to that input. This is represented by a rate available to that input. This is represented by a rate
qosMaxRateAbsolute; the classical weight is the ratio between that dsMaxRateAbsolute; the classical weight is the ratio between that
rate and the interface speed, or perhaps the ratio between that rate rate and the interface speed, or perhaps the ratio between that rate
and the sum of the configured rates for classes. The rate may, and the sum of the configured rates for classes. The rate may,
alternatively, be represented by a relative value, as a fraction of alternatively, be represented by a relative value, as a fraction of
the interface's current line rate, qosMaxRateRelative. There was the interface's current line rate, dsMaxRateRelative. There was
discussion in the working group about alternative modeling discussion in the working group about alternative modeling
approaches, such as defining a shaping action or a shaping element. approaches, such as defining a shaping action or a shaping element.
We did not take this approach because shaping is in fact something a We did not take this approach because shaping is in fact something a
scheduler does to its inputs, (which we model as a queue with a scheduler does to its inputs, (which we model as a queue with a
maximum rate or a scheduler whose output has a maximum rate) and we maximum rate or a scheduler whose output has a maximum rate) and we
felt it was simpler and more elegant to simply describe it in that felt it was simpler and more elegant to simply describe it in that
context. context. Additionally, multi-rate shaper [SHAPER] can be
represented by the use of multiple dsMaxRateTable entries.
Other types of priority and weighted scheduling methods can be Other types of priority and weighted scheduling methods can be
defined using existing parameters in qosMinRateEntry. NOTE: defined using existing parameters in dsMinRateEntry. NOTE:
dsSchedulerMethod uses AutonomousType 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 OBJECT-IDENTITY definition, a description of how the existing
objects 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. supported by a PEP and to specify any limitations on that support.
The PIB also uses the capability PRC's frwkIfCapSetTable and The PIB also uses the capability PRC's frwkCapabilitySetTable and
frwkIfRoleComboTable 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 sets, interface types and role combinations. Each
capability PRC frwkIfCapSetTable contains an OID that points to an instance of the capability PRC frwkCapabilitySetTable contains an
instance of a PRC that describes some capability of that interface OID that points to an instance of a PRC that describes some
type. The Diffserv PIB defines several of these capability PRCs, capability of that interface type. The Diffserv PIB defines several
which assist the PDP with the configuration of Diffserv functional of these capability PRCs, which assist the PDP with the
elements that can be implemented by the device. Each of these configuration of Diffserv functional elements that can be
capability PRCs contains a direction attribute that specifies the implemented by the device. Each of these capability PRCs contains a
direction for which the capability applies. This attribute is direction attribute that specifies the direction for which the
defined in a base capability PRC, which is extended by each specific capability applies. This attribute is defined in a base capability
capability PRC. PRC, which is extended by each specific capability PRC.
Classification capabilities, which specify the information elements Classification capabilities, which specify the information elements
the 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 dsIfClassificationCaps PRC. Metering capabilities, which indicate
what the device can do with out-of-profile packets, are specified what the device can do with out-of-profile packets, are specified
using the qosIfMeteringCaps PRC. Scheduling capabilities, such as using the dsIfMeteringCaps PRC. Scheduling capabilities, such as
the number of inputs supported, are reported using the the number of inputs supported, are reported using the
qosIfSchedulingCaps PRC. Algorithmic drop capabilities, such as the dsIfSchedulingCaps PRC. Algorithmic drop capabilities, such as the
types of algorithms supported, are reported using the types of algorithms supported, are reported using the
qosIfAlgDropCaps PRC. Queue capabilities, such as the maximum dsIfAlgDropCaps PRC. Queue capabilities, such as the maximum number
number of queues, are reported using the qosIfQueueCaps PRC. of queues, are reported using the dsIfQueueCaps PRC.
Maximum Rate capabilities, such as the maximum number of max rate Maximum Rate capabilities, such as the maximum number of max rate
Levels, are reported using the qosIfMaxRateCaps PRC. Levels, are reported using the dsIfMaxRateCaps 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 dsIfElmDepthCaps 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 consecutively in a datapath. The dsIfElmLinkCaps PRC indicates what
what functional datapath elements may follow a specific type of functional datapath elements may follow a specific type of element
element in a datapath. in a datapath.
The capability reporting classes in the DiffServ and Framework PIB The capability reporting classes in the DiffServ and Framework PIB
are meant to allow the PEP to indicate some general guidelines about are meant to allow the PEP to indicate some general guidelines about
what the device can do. They are intended to be an aid to the PDP what the device can do. They are intended to be an aid to the PDP
when it constructs policy for the PEP. These classes do not when it constructs policy for the PEP. These classes do not
necessarily allow the PEP to indicate every possible configuration necessarily allow the PEP to indicate every possible configuration
that it can or cannot support. If a PEP receives a policy that it that it can or cannot support. If a PEP receives a policy that it
cannot implement, it must notify the PDP with a failure report. cannot implement, it must notify the PDP with a failure report.
Currently [COPS-PR] error handling mechanism as specified in
[COPS-PR] sections 4.4, 4.5, and 4.6 completely handles all known
error cases of this PIB, hence no additional methods and PRCs need
to be specified here.
5. PIB Usage Example 5. PIB Usage Example
This section provides some examples on how the different table This section provides some examples on how the different table
entries of this PIB may be used together for a Diffserv Device. The entries of this PIB may be used together for a Diffserv Device. The
usage of each individual attribute is defined within the PIB module usage of each individual attribute is defined within the PIB module
itself. For the figures, all the PIB table entry and attribute names itself. For the figures, all the PIB table entry and attribute names
are assumed to have "qos" as their first common initial part of the are assumed to have "ds" as their first common initial part of the
name, with the table entry name assumed to be their second common name, with the table entry name assumed to be their second common
initial part of the name. "0.0" is being used to mean zeroDotZero. initial part of the name. "0.0" is being used to mean zeroDotZero.
And for Scheduler Method "= X" means "using the OID of And for Scheduler Method "= X" means "using the OID of
qoxSchedulerX". diffServSchedulerX".
5.1. Data Path Example 5.1. Data Path Example
Notice Each entry of the DataPath table is used for a specific Notice Each entry of the DataPath table is used for a specific
interface type handling a flow in a specific direction for a interface type handling a flow in a specific direction for a
specific functional role-combination. For our example, we just specific functional role-combination. For our example, we just
define one of such entry. define one of such entry.
+---------------------+ +---------------------+
|DataPath | |DataPath |
| IfName ="IfCap1" | | CapSetName ="IfCap1"|
| Roles = "A+B" | | Roles = "A+B" |
| IfDirection=Ingress | +---------+ | IfDirection=Ingress | +---------+
| Start --------------+--->|Clfr | | Start --------------+--->|Clfr |
+---------------------+ | Id=Dept | +---------------------+ | Id=Dept |
+---------+ +---------+
Figure 2: DataPath Usage Example Figure 2: DataPath Usage Example
In Figure 2, we are using IfCap1 to indicate interface type with In Figure 2, we are using IfCap1 to indicate interface type with
capability set 1 handling ingress flow for functional roles of capability set 1 handling ingress flow for functional roles of
_A+B_. We are using classifier for departments to lead us into "A+B". We are using classifier for departments to lead us into
the Classifier Example below. the Classifier Example below.
5.2. Classifier and Classifier Element Example 5.2. Classifier and Classifier Element Example
We want to show how a multilevel classifier can be built using the 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 classifier tables provided by this PIB. Notice we didn't go into
details of the filters because they are not defined by this PIB. details of the filters because they are not defined by this PIB.
Continuing from the Data Path example from the previous section, let Continuing from the Data Path example from the previous section, let
say we want to perform the following classification functionality to say we want to perform the following classification functionality to
do flow separation based on department and application type: do flow separation based on department and application type:
if (Dept1) then take Dept1-action if (Dept1) then take Dept1-action
{ {
if (Appl1) then take Dept1-Appl1-action. if (Appl1) then take Dept1-Appl1-action.
skipping to change at page 18, line 8 skipping to change at page 19, line 18
5.3. Meter Example 5.3. Meter Example
A single rate simple Meter may be easy to envision, hence we will do A single rate simple Meter may be easy to envision, hence we will do
a Two Rate Three Color [TRTCM] example, using two Meter table a Two Rate Three Color [TRTCM] example, using two Meter table
entries and two TBParam table entries. entries and two TBParam table entries.
+--------------+ +---------+ +--------------+ +----------+ +--------------+ +---------+ +--------------+ +----------+
|Meter | +->|Action | +->| Meter | +->|Action | |Meter | +->|Action | +->| Meter | +->|Action |
| Id=D1A1Rate1 | | | Id=Green| | | Id=D1A1Rate2 | | | Id=Yellow| | Id=D1A1Rate1 | | | Id=Green| | | Id=D1A1Rate2 | | | Id=Yellow|
| SucceedNext -+ + + - ---------+ | | SucceedNext -+-+ +----------+ | SucceedNext -+-+ +---------+ | | SucceedNext -+-+ +----------+
| FailNext ----+-----------------+ | FailNext ----+--+ +-------+ | FailNext ----+-----------------+ | FailNext ----+--+ +-------+
| Specific -+ | | Specific -+ | +->|Action | | Specific -+ | | Specific -+ | +->|Action |
+-----------+--+ +-----------+--+ | Id=Red| +-----------+--+ +-----------+--+ | Id=Red|
| | +-------+ | | +-------+
| +------------+ | +------------+ | +------------+ | +------------+
+->|TBMeter | +->|TBMeter | +->|TBMeter | +->|TBMeter |
| Type=TRTCM | | Type=TRTCM | | Type=TRTCM | | Type=TRTCM |
| Rate | | Rate | | Rate | | Rate |
| BurstSize | | BurstSize | | BurstSize | | BurstSize |
| Interval | | Interval | | Interval | | Interval |
skipping to change at page 19, line 39 skipping to change at page 20, line 49
| Next --------------+-+--+ | Next --------------+-+--+
| QMeasure ----------+-+ | QMeasure ----------+-+
| QThreshold=2Mbytes | | QThreshold=2Mbytes |
| Specific=0.0 | | Specific=0.0 |
+--------------------+ +--------------------+
Figure 6: Tail Dropper Usage Example Figure 6: Tail Dropper Usage Example
5.5.2. Single Queue Random Dropper Example 5.5.2. Single Queue Random Dropper Example
Use of Random Dropper will introduce the usage of qosRandomDropEntry Use of Random Dropper will introduce the usage of dsRandomDropEntry
as in the example below. as in the example below.
+-----------------+ +------+ +-----------------+ +------+
|AlgDrop | +->|Q AF1 | |AlgDrop | +->|Q AF1 |
| Id=AF11 | | +------+ | Id=AF11 | | +------+
| Type=randomDrop | | | Type=randomDrop | |
| Next -----------+-+--+ | Next -----------+-+--+
| QMeasure -------+-+ | QMeasure -------+-+
| QThreshold | +----------------+ | QThreshold | +----------------+
| Specific -------+-->|RandomDrop | | Specific -------+-->|RandomDrop |
skipping to change at page 20, line 10 skipping to change at page 21, line 22
| MinThreshPkts | | MinThreshPkts |
| MaxThreshBytes | | MaxThreshBytes |
| MaxThreshPkts | | MaxThreshPkts |
| ProbMax | | ProbMax |
| Weight | | Weight |
| SamplingRate | | SamplingRate |
+----------------+ +----------------+
Figure 7: Single Queue Random Dropper Usage Example Figure 7: Single Queue Random Dropper Usage Example
Notice for Random Dropper, qosAlgDropQThreshold contains the maximum Notice for Random Dropper, dsAlgDropQThreshold contains the maximum
average queue length, Qclip, for the queue being measured as average queue length, Qclip, for the queue being measured as
indicated by qosQMeasure, the rest of the Random Dropper parameters indicated by dsAlgDropQMeasure, the rest of the Random Dropper
are specified by qosRandomDropEntry as referenced by qosSpecific. parameters are specified by dsRandomDropEntry as referenced by
In this example, both qosNext and qosQMeasure references the same dsAlgDropSpecific. In this example, both dsAlgDropNext and
queue. This is the simple case but qosQMeasure may reference dsAlgDropQMeasure references the same queue. This is the simple
another queue for PEP implementation supporting this feature. case but dsAlgDropQMeasure may reference another queue for PEP
implementation supporting this feature.
5.5.3. Multiple Queue Random Dropper Example 5.5.3. Multiple Queue Random Dropper Example
When network device implementation requires measuring multiple When network device implementation requires measuring multiple
queues for determining the behavior of a drop algorithm, the queues for determining the behavior of a drop algorithm, the
existing PRCs defined in this PIB will be sufficient for the simple existing PRCs defined in this PIB will be sufficient for the simple
case, as indicated by this example. case, as indicated by this example.
+-------------+ +------+ +-------------+ +------+
|AlgDrop | +----------------+-------------------+->|Q_AF1 | |AlgDrop | +----------------+-------------------+->|Q_AF1 |
skipping to change at page 21, line 4 skipping to change at page 22, line 17
| MinThreshBytes | | MinThreshBytes | | MinThreshBytes | | MinThreshBytes |
| MinThreshPkts | | MinThreshPkts | | MinThreshPkts | | MinThreshPkts |
| MaxThreshBytes | | MaxThreshBytes | | MaxThreshBytes | | MaxThreshBytes |
| MaxThreshPkts | | MaxThreshPkts | | MaxThreshPkts | | MaxThreshPkts |
| ProbMax | | ProbMax | | ProbMax | | ProbMax |
| Weight | | Weight | | Weight | | Weight |
| SamplingRate | | SamplingRate | | SamplingRate | | SamplingRate |
+----------------+ +----------------+ +----------------+ +----------------+
Figure 8: Multiple Queue Random Dropper Usage Example Figure 8: Multiple Queue Random Dropper Usage Example
For this example, we have two queues, Q_AF1 and Q_AF2, sharing the 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 same buffer resources. We want to make sure the common buffer
resource is sufficient to service the AF11 traffic, and we want to resource is sufficient to service the AF11 traffic, and we want to
measure the two queues for determining the drop algorithm for AF11 measure the two queues for determining the drop algorithm for AF11
traffic feeding into _Q_AF1_. Notice mQDrop is used for traffic feeding into _Q_AF1_. Notice mQDrop is used for
qosAlgDropType of qosAlgDropEntry to indicate Multiple Queue dsAlgDropType of dsAlgDropEntry to indicate Multiple Queue Dropping
Dropping Algorithm. Algorithm.
The common shared buffer resource is indicated by the use of The common shared buffer resource is indicated by the use of
qosAlgDropEntry, with their attributes used as follows: dsAlgDropEntry, with their attributes used as follows:
- qosAlgDropType indicates the algorithm used, mQDrop. - dsAlgDropType indicates the algorithm used, mQDrop.
- qosAlgDropNext is used to indicate the next functional data path - dsAlgDropNext is used to indicate the next functional data path
element to handle the flow when no drop occurs. element to handle the flow when no drop occurs.
- qosAlgDropQMeasure is used as the anchor for the list of - dsAlgDropQMeasure is used as the anchor for the list of
qosMQAlgDropEntry, one for each queue being measured. dsMQAlgDropEntry, one for each queue being measured.
- qosAlgDropQThreshold is used to indicate the size of the shared - dsAlgDropQThreshold is used to indicate the size of the shared
buffer pool. buffer pool.
- qosAlgDropSpecific can be used to reference instance of additional - dsAlgDropSpecific can be used to reference instance of additional
PRC (not defined in this PIB) if more parameters are required to PRC (not defined in this PIB) if more parameters are required to
describe the common shared buffer resource. describe the common shared buffer resource.
For this example, there are two subsequent qosMQAlgDropEntry, one For this example, there are two subsequent dsMQAlgDropEntry, one for
for each queue being measured, with its attributes used as follows: each queue being measured, with its attributes used as follows:
- qosMQAlgDropType indicates the algorithm used, for this example, - dsMQAlgDropType indicates the algorithm used, for this example,
both qosMQAlgDropType uses randomDrop. both dsMQAlgDropType uses randomDrop.
- qosMQAlgDropQMeasure indicates the queue being measured. - dsMQAlgDropQMeasure indicates the queue being measured.
- qosMQAlgDropNext indicates the next functional data path element - dsMQAlgDropNext indicates the next functional data path element
to handle the flow when no drop occurs. to handle the flow when no drop occurs.
- qosMQAlgDropExceedNext is used to indicate the next queue's - dsMQAlgDropExceedNext is used to indicate the next queue's
qosMQAlgDropEntry. With the use of zeroDotZero to indicate the dsMQAlgDropEntry. With the use of zeroDotZero to indicate the
last queue. last queue.
- qosMQAlgDropQMeasure is used to indicate the queue being measured. - dsMQAlgDropQMeasure is used to indicate the queue being measured.
For this example, _Q AF1_ and _Q_AF2_ are the two queues used. For this example, _Q AF1_ and _Q_AF2_ are the two queues used.
- qosAlgDropQThreshold is used as in single queue Random Dropper. - dsAlgDropQThreshold is used as in single queue Random Dropper.
- qosAlgDropSpecific is used to reference the PRID that describes - dsAlgDropSpecific is used to reference the PRID that describes
the dropper parameters as in its normal usage. For this example the dropper parameters as in its normal usage. For this example
both qosAlgDropSpecific reference qosRandomDropEntrys. both dsAlgDropSpecific reference dsRandomDropEntrys.
Notice the anchoring qosAlgDropEntry and the two qosMQAlgDropEntrys Notice the anchoring dsAlgDropEntry and the two dsMQAlgDropEntrys
all have their Next attribute pointing to Q_AF1. This indicates: all have their Next attribute pointing to Q_AF1. This indicates:
- If the packet does not need to be checked with the individual - If the packet does not need to be checked with the individual
queue's drop processing because of abundance of common shared queue's drop processing because of abundance of common shared
buffer resources, then the packet is sent to Q_AF1. buffer resources, then the packet is sent to Q_AF1.
- If the packet is not dropped due to current Q_AF1 conditions, then - If the packet is not dropped due to current Q_AF1 conditions, then
it is sent to Q_AF1. it is sent to Q_AF1.
- If the packet is not dropped due to current Q_AF2 conditions, then - If the packet is not dropped due to current Q_AF2 conditions, then
it is sent to Q_AF1. it is sent to Q_AF1.
This example also uses two qosRandomDropEntry for the two queues it This example also uses two dsRandomDropEntry for the two queues it
measures. Their attribute usage is the same as if for single queue measures. Their attribute usage is the same as if for single queue
random dropper. random dropper.
Other more complex result combinations can be achieved by specifying Other more complex result combinations can be achieved by specifying
a new PRC and referencing this new PRC with qosAlgDropSpecific of a new PRC and referencing this new PRC with dsAlgDropSpecific of the
the anchoring qosAlgDropEntry. More simple usage can also be anchoring dsAlgDropEntry. More simple usage can also be achieved
achieved when a single set of drop parameters are used for all when a single set of drop parameters are used for all queues being
queues being measured. This again can be referenced by the measured. This again can be referenced by the anchoring
anchoring qosAlgDropSpecific. These are not defined in this PIB. dsAlgDropSpecific. These are not defined in this PIB.
5.6. Queue and Scheduler Example 5.6. Queue and Scheduler Example
The queue and scheduler example will continue from the dropper The queue and scheduler example will continue from the dropper
example in previous section. Concentrating in the queue and example in previous section. Concentrating in the queue and
scheduler Diffserv datapath functional elements. Notice a shaper is scheduler Diffserv datapath functional elements. Notice a shaper is
constructed using queue and scheduler with MaxRate parameters. constructed using queue and scheduler with MaxRate parameters.
+------------+ +-----------------+ +------------+ +-----------------+
---->|Q | +->|Scheduler | ---->|Q | +->|Scheduler |
skipping to change at page 25, line 12 skipping to change at page 26, line 12
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 This section provides an operation overview of configuring DiffServ
QoS 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 example, the PEP will provide to the PDP the PIB Provisioning
Classes (PRCs), interface types, and interface type capabilities it classes (PRCs), interface types, and interface type capabilities it
supports. supports.
The PRCs supported by the PEP are reported to the PDP in the PRC The PRCs supported by the PEP are reported to the PDP in the PRC
Support Table, frwkPrcSupportTable defined in the framework PIB [FR- Support Table, frwkPrcSupportTable defined in the framework PIB [FR-
PIB]. Each instance of the frwkPrcSupportTable indicates a PRC that PIB]. Each instance of the frwkPrcSupportTable indicates a PRC that
the PEP understands and for which the PDP can send class instances the PEP understands and for which the PDP can send class instances
as part of the policy information. as part of the policy information.
The interface types the PEP supports are described by rows in the The capabilities of interface types the PEP supports are described
interface type table, frwkIfCapsSetTable. Each row, or instance of by rows in the capability set table, frwkCapabilitySetTable. Each
this class contains a pointer to an instance of a PRC that describes row, or instance of this class contains a pointer to an instance of
the capabilities of the interface type. The capability objects may a PRC that describes the capabilities of the interface type. The
reside in the qosIfClassifierCapsTable, the qosIfMeterCapsTable, the capability objects may reside in the dsIfClassifierCapsTable, the
qosIfSchedulerCapsTable, the qosIfElmDepthCapsTable, the dsIfMeterCapsTable, the dsIfSchedulerCapsTable, the
qosIfElmOutputCapsTable, or in a table defined in another PIB. dsIfElmDepthCapsTable, the dsIfElmOutputCapsTable, or in a table
defined in another PIB.
The PDP, with knowledge of the PEP's capabilities, then provides the The PDP, with knowledge of the PEP's capabilities, then provides the
PEP with administration domain and interface-specific policy PEP with administrative domain and interface-type-specific policy
information. information.
Instances of the qosDataPathTable are used to specify the first Instances of the dsDataPathTable are used to specify the first
element in the set of functional elements applied to an interface. element in the set of functional elements applied to an interface
Each instance of the qosDataPathTable applies to an interface type type. Each instance of the dsDataPathTable applies to an interface
defined by its roles and direction (ingress or egress). type defined by its roles and direction (ingress or egress).
8. PIB Definitions
8.1. The DiffServ Base PIB 8. PIB Definition
DIFFSERV-PIB PIB-DEFINITIONS ::= BEGIN DIFFSERV-PIB PIB-DEFINITIONS ::= BEGIN
IMPORTS IMPORTS
Unsigned32, Integer32, MODULE-IDENTITY, MODULE-COMPLIANCE, Unsigned32, MODULE-IDENTITY, MODULE-COMPLIANCE,
OBJECT-TYPE, OBJECT-GROUP, pib, TEXTUAL-CONVENTION OBJECT-TYPE, OBJECT-GROUP, pib, TEXTUAL-CONVENTION
FROM COPS-PR-SPPI FROM COPS-PR-SPPI
InstanceId, ReferenceId, Prid, TagId, TagReferenceId InstanceId, ReferenceId, Prid, TagId, TagReferenceId
FROM COPS-PR-SPPI-TC FROM COPS-PR-SPPI-TC
zeroDotZero zeroDotZero
FROM SNMPv2-SMI FROM SNMPv2-SMI
TruthValue TruthValue, AutonomousType
FROM SNMPv2-TC FROM SNMPv2-TC
RoleCombination, PrcIdentifier, AttrIdentifier RoleCombination, PrcIdentifierOid, PrcIdentifierOidOrZero,
AttrIdentifier
FROM FRAMEWORK-TC-PIB FROM FRAMEWORK-TC-PIB
Dscp Dscp
FROM DIFFSERV-DSCP-TC FROM DIFFSERV-DSCP-TC
IfDirection IfDirection, diffServTBParamSimpleTokenBucket,
diffServTBParamAvgRate, diffServTBParamSrTCMBlind,
diffServTBParamSrTCMAware, diffServTBParamTrTCMBlind,
diffServTBParamTrTCMAware, diffServSchedulerPriority,
diffServSchedulerWRR, diffServSchedulerWFQ
FROM DIFFSERV-MIB FROM DIFFSERV-MIB
BurstSize BurstSize
FROM INTEGRATED-SERVICES-MIB; FROM INTEGRATED-SERVICES-MIB;
qosPolicyPib MODULE-IDENTITY dsPolicyPib 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 "200202281800Z" LAST-UPDATED "200205292300Z"
ORGANIZATION "IETF DIFFSERV WG" ORGANIZATION "IETF DIFFSERV WG"
CONTACT-INFO " CONTACT-INFO "
Michael Fine Michael Fine
Cisco Systems, Inc. Atheros Communications
170 West Tasman Drive 529 Almanor Ave
San Jose, CA 95134-1706 USA Sunnyvale, CA 94085 USA
Phone: +1 408 527 8218 Phone: +1 408 773 5324
Email: mfine@cisco.com Email: mfine@atheros.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
Santa Clara, CA 95054 USA Santa Clara, CA 95054 USA
Phone: +1 408 495 2992 Phone: +1 408 495 2992
Email: jseligso@nortelnetworks.com" Email: jseligso@nortelnetworks.com
Kwok Ho Chan
Nortel Networks, Inc.
600 Technology Park Drive
Billerica, MA 01821 USA
Phone: +1 978 288 8175
Email: khchan@nortelnetworks.com
Differentiated Services Working Group:
diffserv@ietf.org"
DESCRIPTION DESCRIPTION
"The PIB module containing a set of provisioning classes "The PIB module containing a set of provisioning classes
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."
REVISION "200202281800Z" REVISION "200205292300Z"
DESCRIPTION DESCRIPTION
"Initial version, published as RFC xxxx." "Initial version, published as RFC xxxx."
::= { pib xxx } -- xxx to be assigned by IANA ::= { pib xxx } -- xxx to be assigned by IANA
qosCapabilityClasses OBJECT IDENTIFIER ::= { qosPolicyPib 1 } dsCapabilityClasses OBJECT IDENTIFIER ::= { dsPolicyPib 1 }
qosPolicyClasses OBJECT IDENTIFIER ::= { qosPolicyPib 2 } dsPolicyClasses OBJECT IDENTIFIER ::= { dsPolicyPib 2 }
qosPolicyParameters OBJECT IDENTIFIER ::= { qosPolicyPib 3 } dsPolicyPibConformance OBJECT IDENTIFIER ::= { dsPolicyPib 3 }
qosPolicyPibConformance OBJECT IDENTIFIER ::= { qosPolicyPib 4 }
-- --
-- Interface Capabilities Group -- Interface Type 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 -- be associated with interfaces of a specific type.
-- defines three such tables: a classification capabilities table, a -- This PIB defines capability tables for Diffserv Functionalities.
-- metering capabilities table and a scheduling capabilities table. --
-- Other PIBs may define other capability tables to augment the
-- capability definitions of these tables or to introduce completely
-- new capabilities.
-- --
-- The Base Capability Table -- The Base Capability Table
-- --
qosBaseIfCapsTable OBJECT-TYPE dsBaseIfCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosBaseIfCapsEntry SYNTAX SEQUENCE OF DsBaseIfCapsEntry
PIB-ACCESS notify PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Base Interface Capability class. This class represents "The Base Interface Type Capability class. This class
a generic capability supported by a device in the ingress, represents a generic capability supported by a device in the
egress or both directions." ingress, egress, or both directions."
::= { qosCapabilityClasses 1 } ::= { dsCapabilityClasses 1 }
dsBaseIfCapsEntry OBJECT-TYPE
qosBaseIfCapsEntry OBJECT-TYPE SYNTAX DsBaseIfCapsEntry
SYNTAX QosBaseIfCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the qosBaseIfCaps class." "An instance of this class describes the dsBaseIfCaps class."
PIB-INDEX { qosBaseIfCapsPrid } PIB-INDEX { dsBaseIfCapsPrid }
::= { qosBaseIfCapsTable 1 } ::= { dsBaseIfCapsTable 1 }
QosBaseIfCapsEntry ::= SEQUENCE {
qosBaseIfCapsPrid InstanceId, DsBaseIfCapsEntry ::= SEQUENCE {
qosBaseIfCapsDirection Integer32 dsBaseIfCapsPrid InstanceId,
dsBaseIfCapsDirection INTEGER
} }
qosBaseIfCapsPrid OBJECT-TYPE dsBaseIfCapsPrid 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."
::= { qosBaseIfCapsEntry 1 } ::= { dsBaseIfCapsEntry 1 }
qosBaseIfCapsDirection OBJECT-TYPE dsBaseIfCapsDirection OBJECT-TYPE
SYNTAX Integer32 { SYNTAX INTEGER {
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 "This object specifies the direction(s) for which the
capability applies. A value of 'inbound(1)' means the capability applies. A value of 'inbound(1)' means the
capability applies only to the ingress direction. A value of capability applies only to the ingress direction. A value of
'outbound(2)' means the capability applies only to the egress 'outbound(2)' means the capability applies only to the egress
direction. A value of 'inAndOut(3)' means the capability direction. A value of 'inAndOut(3)' means the capability
applies to both directions." applies to both directions."
::= { qosBaseIfCapsEntry 2 } ::= { dsBaseIfCapsEntry 2 }
-- --
-- The Classification Capability Table -- The Classification Capability Table
-- --
qosIfClassificationCapsTable OBJECT-TYPE dsIfClassificationCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfClassificationCapsEntry SYNTAX SEQUENCE OF DsIfClassificationCapsEntry
PIB-ACCESS notify PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the classification capabilities of an "This class specifies the classification capabilities of
interface type" a Capability Set."
::= { qosCapabilityClasses 2 } ::= { dsCapabilityClasses 2 }
dsIfClassificationCapsEntry OBJECT-TYPE
qosIfClassificationCapsEntry OBJECT-TYPE SYNTAX DsIfClassificationCapsEntry
SYNTAX QosIfClassificationCapsEntry
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 a Capability Set."
EXTENDS { qosBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection,
qosIfClassificationCapsSpec }
::= { qosIfClassificationCapsTable 1 }
QosIfClassificationCapsEntry ::= SEQUENCE { EXTENDS { dsBaseIfCapsEntry }
qosIfClassificationCapsSpec BITS UNIQUENESS { dsBaseIfCapsDirection,
dsIfClassificationCapsSpec }
::= { dsIfClassificationCapsTable 1 }
DsIfClassificationCapsEntry ::= SEQUENCE {
dsIfClassificationCapsSpec BITS
} }
qosIfClassificationCapsSpec OBJECT-TYPE dsIfClassificationCapsSpec OBJECT-TYPE
SYNTAX BITS { SYNTAX BITS {
ipSrcAddrClassification(0), ipSrcAddrClassification(0),
-- indicates the ability to classify based on -- indicates the ability to classify based on
-- IP source addresses -- IP source addresses
ipDstAddrClassification(1), ipDstAddrClassification(1),
-- indicates the ability to classify based on -- indicates the ability to classify based on
-- IP destination addresses -- IP destination addresses
ipProtoClassification(2), ipProtoClassification(2),
-- indicates the ability to classify based on -- indicates the ability to classify based on
-- IP protocol numbers -- IP protocol numbers
skipping to change at page 29, line 41 skipping to change at page 30, line 48
-- indicates the ability to classify based on -- indicates the ability to classify based on
-- IPv6 FlowIDs. -- 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 } ::= { dsIfClassificationCapsEntry 1 }
-- --
-- Metering Capabilities -- Metering Capabilities
-- --
dsIfMeteringCapsTable OBJECT-TYPE
qosIfMeteringCapsTable OBJECT-TYPE SYNTAX SEQUENCE OF DsIfMeteringCapsEntry
SYNTAX SEQUENCE OF QosIfMeteringCapsEntry
PIB-ACCESS notify PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the metering capabilities of an "This class specifies the metering capabilities of a
interface type" Capability Set."
::= { qosCapabilityClasses 3 } ::= { dsCapabilityClasses 3 }
qosIfMeteringCapsEntry OBJECT-TYPE
SYNTAX QosIfMeteringCapsEntry dsIfMeteringCapsEntry OBJECT-TYPE
SYNTAX DsIfMeteringCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the classification "An instance of this class describes the metering
capabilities of an interface." capabilities of a Capability Set."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { dsBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { dsBaseIfCapsDirection,
qosIfMeteringCapsSpec } dsIfMeteringCapsSpec }
::= { qosIfMeteringCapsTable 1 } ::= { dsIfMeteringCapsTable 1 }
QosIfMeteringCapsEntry ::= SEQUENCE { DsIfMeteringCapsEntry ::= SEQUENCE {
qosIfMeteringCapsSpec BITS dsIfMeteringCapsSpec BITS
} }
qosIfMeteringCapsSpec OBJECT-TYPE dsIfMeteringCapsSpec OBJECT-TYPE
SYNTAX BITS { SYNTAX BITS {
SimpleTokenBucket(1), zeroNotUsed(0),
AvgRate(2), simpleTokenBucket(1),
SrTCMBlind(3), avgRate(2),
SrTCMAware(4), srTCMBlind(3),
TrTCMBlind(5), srTCMAware(4),
TrTCMAware(6), trTCMBlind(5),
TswTCM(7) 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 } ::= { dsIfMeteringCapsEntry 1 }
-- --
-- Algorithmic Dropper Capabilities -- Algorithmic Dropper Capabilities
-- --
-- This capability table indicates the types of algorithmic
-- drop supported by an interface type for a specific flow
-- direction.
-- Additional capabilities affecting the drop functionalities
-- are determined based on queue capabilities associated with
-- specific instance of a dropper, hence not specified by
-- this table.
--
qosIfAlgDropCapsTable OBJECT-TYPE dsIfAlgDropCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfAlgDropCapsEntry SYNTAX SEQUENCE OF DsIfAlgDropCapsEntry
PIB-ACCESS notify PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the algorithmic dropper "This class specifies the algorithmic dropper
capabilities of an interface type" capabilities of a Capability Set.
::= { qosCapabilityClasses 4 }
qosIfAlgDropCapsEntry OBJECT-TYPE This capability table indicates the types of algorithmic
SYNTAX QosIfAlgDropCapsEntry drop supported by a Capability Set for a specific flow
direction.
Additional capabilities affecting the drop functionalities
are determined based on queue capabilities associated with
specific instance of a dropper, hence not specified by
this class."
::= { dsCapabilityClasses 4 }
dsIfAlgDropCapsEntry OBJECT-TYPE
SYNTAX DsIfAlgDropCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the algorithm dropper "An instance of this class describes the algorithmic dropper
capabilities of an interface." capabilities of a Capability Set."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { dsBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { dsBaseIfCapsDirection,
qosIfAlgDropCapsType, dsIfAlgDropCapsType,
qosIfAlgDropCapsMQCount } dsIfAlgDropCapsMQCount }
::= { qosIfAlgDropCapsTable 1 } ::= { dsIfAlgDropCapsTable 1 }
QosIfAlgDropCapsEntry ::= SEQUENCE { DsIfAlgDropCapsEntry ::= SEQUENCE {
qosIfAlgDropCapsType BITS, dsIfAlgDropCapsType BITS,
qosIfAlgDropCapsMQCount Unsigned32 dsIfAlgDropCapsMQCount Unsigned32
} }
qosIfAlgDropCapsType OBJECT-TYPE dsIfAlgDropCapsType OBJECT-TYPE
SYNTAX BITS { SYNTAX BITS {
zeroNotUsed(0),
oneNotUsed(1),
tailDrop(2), tailDrop(2),
headDrop(3), headDrop(3),
randomDrop(4), randomDrop(4),
alwaysDrop(5), alwaysDrop(5),
mQDrop(6) } 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 the tail of the queue when the associated queue's MaxQueueSize
is 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 MaxQueueSize is exceeded. The randomDrop(4) algorithm means
that 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. The alwaysDrop(5) will drop every packet dsRandomDropTable. The alwaysDrop(5) will drop every packet
presented to it. The mQDrop(6) algorithm will drop packets presented to it. The mQDrop(6) algorithm will drop packets
based on measurement from multiple queues." based on measurement from multiple queues."
::= { qosIfAlgDropCapsEntry 1 } ::= { dsIfAlgDropCapsEntry 1 }
qosIfAlgDropCapsMQCount OBJECT-TYPE dsIfAlgDropCapsMQCount OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Indicates the number of queues measured for the drop "Indicates the number of queues measured for the drop
algorithm. algorithm.
This attribute is ignored when alwaysDrop(5) algorithm is This attribute is ignored when alwaysDrop(5) algorithm is
used. This attribute contains the value of 1 for all drop used. This attribute contains the value of 1 for all drop
algorithm types except for mQDrop(6), where this attribute algorithm types except for mQDrop(6), where this attribute
is used to indicate the maximum number of qosMQAlgDropEntry is used to indicate the maximum number of dsMQAlgDropEntry
that can be chained together." that can be chained together."
DEFVAL { 1 } ::= { dsIfAlgDropCapsEntry 2 }
::= { qosIfAlgDropCapsEntry 2 }
-- --
-- Queue Capabilities -- Queue Capabilities
-- --
qosIfQueueCapsTable OBJECT-TYPE dsIfQueueCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfQueueCapsEntry SYNTAX SEQUENCE OF DsIfQueueCapsEntry
PIB-ACCESS notify PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the scheduling capabilities of an "This class specifies the queueing capabilities of a
interface type" Capability Set."
::= { qosCapabilityClasses 5 } ::= { dsCapabilityClasses 5 }
qosIfQueueCapsEntry OBJECT-TYPE dsIfQueueCapsEntry OBJECT-TYPE
SYNTAX QosIfQueueCapsEntry SYNTAX DsIfQueueCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the queue "An instance of this class describes the queue
capabilities of an interface type." capabilities of a Capability Set."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { dsBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { dsBaseIfCapsDirection,
qosIfQueueCapsMinQueueSize, dsIfQueueCapsMinQueueSize,
qosIfQueueCapsMaxQueueSize, dsIfQueueCapsMaxQueueSize,
qosIfQueueCapsTotalQueueSize } dsIfQueueCapsTotalQueueSize }
::= { qosIfQueueCapsTable 1 } ::= { dsIfQueueCapsTable 1 }
QosIfQueueCapsEntry ::= SEQUENCE { DsIfQueueCapsEntry ::= SEQUENCE {
qosIfQueueCapsMinQueueSize Unsigned32, dsIfQueueCapsMinQueueSize Unsigned32,
qosIfQueueCapsMaxQueueSize Unsigned32, dsIfQueueCapsMaxQueueSize Unsigned32,
qosIfQueueCapsTotalQueueSize Unsigned32 dsIfQueueCapsTotalQueueSize Unsigned32
} }
qosIfQueueCapsMinQueueSize OBJECT-TYPE dsIfQueueCapsMinQueueSize OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (0..4294967295)
UNITS "Bytes"
STATUS current STATUS current
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 minimum size that configured. This attribute specifies the minimum size that
can be configured for a queue, specified in bytes." can be configured for a queue, specified in bytes.
::= { qosIfQueueCapsEntry 1 } dsIfQueueCapsMinQueueSize must be less than or equals to
dsIfQueueCapsMinQueueSize when both are specified.
A zero value indicates not specified."
::= { dsIfQueueCapsEntry 1 }
qosIfQueueCapsMaxQueueSize OBJECT-TYPE dsIfQueueCapsMaxQueueSize OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (0..4294967295)
UNITS "Bytes"
STATUS current STATUS current
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 } dsIfQueueCapsMinQueueSize must be less than or equals to
dsIfQueueCapsMinQueueSize when both are specified.
A zero value indicates not specified."
::= { dsIfQueueCapsEntry 2 }
qosIfQueueCapsTotalQueueSize OBJECT-TYPE dsIfQueueCapsTotalQueueSize OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (0..4294967295)
UNITS "Bytes"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Some interfaces may have a limited buffer space to be shared "Some interfaces may have a limited buffer space to be
amongst all queues of that interface while also allowing the shared amongst all queues of that interface while also
size of each queue to be configurable. To prevent the allowing the size of each queue to be configurable. To
situation where the PDP configures the sizes of the queues in prevent the situation where the PDP configures the sizes of
excess of the total buffer available to the interface, the PEP the queues in excess of the total buffer available to the
can report the total buffer space in bytes available with this interface, the PEP can report the total buffer space in
capability." bytes available with this capability.
::= { qosIfQueueCapsEntry 3 } A zero value indicates not specified."
::= { dsIfQueueCapsEntry 3 }
-- --
-- Scheduler Capabilities -- Scheduler Capabilities
-- --
qosIfSchedulerCapsTable OBJECT-TYPE dsIfSchedulerCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfSchedulerCapsEntry SYNTAX SEQUENCE OF DsIfSchedulerCapsEntry
PIB-ACCESS notify PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the scheduler capabilities of an "This class specifies the scheduler capabilities of a
interface type" Capability Set."
::= { qosCapabilityClasses 6 } ::= { dsCapabilityClasses 6 }
dsIfSchedulerCapsEntry OBJECT-TYPE
qosIfSchedulerCapsEntry OBJECT-TYPE SYNTAX DsIfSchedulerCapsEntry
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 a Capability Set."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { dsBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { dsBaseIfCapsDirection,
qosIfSchedulerCapsServiceDisc, dsIfSchedulerCapsServiceDisc,
qosIfSchedulerCapsMaxInputs } dsIfSchedulerCapsMaxInputs }
::= { qosIfSchedulerCapsTable 1 } ::= { dsIfSchedulerCapsTable 1 }
QosIfSchedulerCapsEntry ::= SEQUENCE { DsIfSchedulerCapsEntry ::= SEQUENCE {
qosIfSchedulerCapsServiceDisc OBJECT IDENTIFIER, dsIfSchedulerCapsServiceDisc AutonomousType,
qosIfSchedulerCapsMaxInputs Unsigned32, dsIfSchedulerCapsMaxInputs Unsigned32,
qosIfSchedulerCapsMinMaxRate BITS dsIfSchedulerCapsMinMaxRate INTEGER
} }
qosIfSchedulerCapsServiceDisc OBJECT-TYPE dsIfSchedulerCapsServiceDisc OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER SYNTAX AutonomousType
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 scheduling disciplines are general purpose and well-known scheduling disciplines are
defined in the Scheduler Method Parameters section of this shared with and defined in the Diffserv MIB.
PIB.
These include Priority, WRR, WFQ."
::= { qosIfSchedulerCapsEntry 1 }
qosIfSchedulerCapsMaxInputs OBJECT-TYPE These include diffServSchedulerPriority,
SYNTAX Unsigned32 diffServSchedulerWRR, diffServSchedulerWFQ."
::= { dsIfSchedulerCapsEntry 1 }
dsIfSchedulerCapsMaxInputs OBJECT-TYPE
SYNTAX Unsigned32 (0..4294967295)
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum number of queues and/or schedulers that can "The maximum number of queues and/or schedulers that can
feed into a scheduler indicated by this capability entry feed into a scheduler indicated by this capability entry.
for this interface type. A value of zero means there A value of zero means there is no maximum."
is no maximum." ::= { dsIfSchedulerCapsEntry 2 }
::= { qosIfSchedulerCapsEntry 2 }
qosIfSchedulerCapsMinMaxRate OBJECT-TYPE dsIfSchedulerCapsMinMaxRate OBJECT-TYPE
SYNTAX BITS { SYNTAX INTEGER {
MinRate(0), minRate(1),
MaxRate(1), maxRate(2),
MinAndMaxRates(2) minAndMaxRates(3)
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Scheduler capability indicating ability to handle inputs "Scheduler capability indicating ability to handle inputs
with minimum rate, maximum rate, or both." with minimum rate, maximum rate, or both."
::= { qosIfSchedulerCapsEntry 3 } ::= { dsIfSchedulerCapsEntry 3 }
-- --
-- Maximum Rate Capabilities -- Maximum Rate Capabilities
-- --
qosIfMaxRateCapsTable OBJECT-TYPE dsIfMaxRateCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfMaxRateCapsEntry SYNTAX SEQUENCE OF DsIfMaxRateCapsEntry
PIB-ACCESS notify PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the maximum rate capabilities of an "This class specifies the maximum rate capabilities of a
interface type" Capability Set."
::= { qosCapabilityClasses 7 } ::= { dsCapabilityClasses 7 }
qosIfMaxRateCapsEntry OBJECT-TYPE dsIfMaxRateCapsEntry OBJECT-TYPE
SYNTAX QosIfMaxRateCapsEntry SYNTAX DsIfMaxRateCapsEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An instance of this class describes the maximum rate "An instance of this class describes the maximum rate
capabilities of an interface type." capabilities of a Capability Set."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { dsBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { dsBaseIfCapsDirection,
qosIfMaxRateCapsMaxLevels } dsIfMaxRateCapsMaxLevels }
::= { qosIfMaxRateCapsTable 1 } ::= { dsIfMaxRateCapsTable 1 }
QosIfMaxRateCapsEntry ::= SEQUENCE { DsIfMaxRateCapsEntry ::= SEQUENCE {
qosIfMaxRateCapsMaxLevels Unsigned32 dsIfMaxRateCapsMaxLevels Unsigned32
} }
qosIfMaxRateCapsMaxLevels OBJECT-TYPE dsIfMaxRateCapsMaxLevels OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum number of levels a maximum rate specification "The maximum number of levels a maximum rate specification
may have for this interface type and flow direction." may have for this Capability Set and flow direction."
::= { qosIfMaxRateCapsEntry 1 } ::= { dsIfMaxRateCapsEntry 1 }
-- --
-- Datapath Element Linkage Capabilities -- Datapath Element Linkage Capabilities
-- --
-- --
-- Datapath Element Cascade Depth -- Datapath Element Cascade Depth
-- --
qosIfElmDepthCapsTable OBJECT-TYPE dsIfElmDepthCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfElmDepthCapsEntry SYNTAX SEQUENCE OF DsIfElmDepthCapsEntry
PIB-ACCESS notify PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies the number of elements of the same "This class 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 } ::= { dsCapabilityClasses 8 }
dsIfElmDepthCapsEntry OBJECT-TYPE
qosIfElmDepthCapsEntry OBJECT-TYPE SYNTAX DsIfElmDepthCapsEntry
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 functional datapath 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 class can be assumed to have no specific maximum
depth." depth."
EXTENDS { qosBaseIfCapsEntry } EXTENDS { dsBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { dsBaseIfCapsDirection,
qosIfElmDepthCapsPrc } dsIfElmDepthCapsPrc }
::= { qosIfElmDepthCapsTable 1 } ::= { dsIfElmDepthCapsTable 1 }
QosIfElmDepthCapsEntry ::= SEQUENCE { DsIfElmDepthCapsEntry ::= SEQUENCE {
qosIfElmDepthCapsPrc PrcIdentifier, dsIfElmDepthCapsPrc PrcIdentifierOid,
qosIfElmDepthCapsCascadeMax Unsigned32 dsIfElmDepthCapsCascadeMax Unsigned32
} }
qosIfElmDepthCapsPrc OBJECT-TYPE
SYNTAX PrcIdentifier dsIfElmDepthCapsPrc OBJECT-TYPE
SYNTAX PrcIdentifierOid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The object identifier of a PRC that represents a functional "The object identifier of a PRC that represents a functional
datapath element. This may be one of: qosClfrElementEntry, datapath element. This may be one of: dsClfrElementEntry,
qosMeterEntry, qosActionEntry, qosAlgDropEntry, qosQEntry, or dsMeterEntry, dsActionEntry, dsAlgDropEntry, dsQEntry, or
qosSchedulerEntry. The value is the OID of the table entry. dsSchedulerEntry.
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 dsIfElmDepthCapsPrc and same value of
::= { qosIfElmDepthCapsEntry 1 } dsBaseIfCapsDirection. Must not contain the value of
zeroDotZero."
::= { dsIfElmDepthCapsEntry 1 }
qosIfElmDepthCapsCascadeMax OBJECT-TYPE dsIfElmDepthCapsCascadeMax OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (0..4294967295)
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum number of elements of type qosIfElmDepthCapsPrc "The maximum number of elements of type dsIfElmDepthCapsPrc
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 } ::= { dsIfElmDepthCapsEntry 2 }
-- --
-- Datapath Element Linkage Types -- Datapath Element Linkage Types
-- --
qosIfElmLinkCapsTable OBJECT-TYPE dsIfElmLinkCapsTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosIfElmLinkCapsEntry SYNTAX SEQUENCE OF DsIfElmLinkCapsEntry
PIB-ACCESS notify PIB-ACCESS notify
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table specifies what types of datapath functional "This class 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 } ::= { dsCapabilityClasses 9 }
qosIfElmLinkCapsEntry OBJECT-TYPE dsIfElmLinkCapsEntry OBJECT-TYPE
SYNTAX QosIfElmLinkCapsEntry SYNTAX DsIfElmLinkCapsEntry
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 { dsBaseIfCapsEntry }
UNIQUENESS { qosBaseIfCapsDirection, UNIQUENESS { dsBaseIfCapsDirection,
qosIfElmLinkCapsPrc, dsIfElmLinkCapsPrc,
qosIfElmLinkCapsAttr, dsIfElmLinkCapsAttr,
qosIfElmLinkCapsNextPrc } dsIfElmLinkCapsNextPrc }
::= { qosIfElmLinkCapsTable 1 } ::= { dsIfElmLinkCapsTable 1 }
QosIfElmLinkCapsEntry ::= SEQUENCE { DsIfElmLinkCapsEntry ::= SEQUENCE {
qosIfElmLinkCapsPrc PrcIdentifier, dsIfElmLinkCapsPrc PrcIdentifierOid,
qosIfElmLinkCapsAttr AttrIdentifier, dsIfElmLinkCapsAttr AttrIdentifier,
qosIfElmLinkCapsNextPrc PrcIdentifier dsIfElmLinkCapsNextPrc PrcIdentifierOidOrZero
} }
qosIfElmLinkCapsPrc OBJECT-TYPE dsIfElmLinkCapsPrc OBJECT-TYPE
SYNTAX PrcIdentifier SYNTAX PrcIdentifierOid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The value is the OID of a PRC that represents a " The object identifier of a PRC that represents a functional
functional datapath element. This OID must not have datapath element. This may be one of: dsClfrElementEntry,
the value zeroDotZero." dsMeterEntry, dsActionEntry, dsAlgDropEntry, dsQEntry, or
::= { qosIfElmLinkCapsEntry 1 } dsSchedulerEntry.
This must not have the value zeroDotZero."
::= { dsIfElmLinkCapsEntry 1 }
qosIfElmLinkCapsAttr OBJECT-TYPE dsIfElmLinkCapsAttr OBJECT-TYPE
SYNTAX AttrIdentifier SYNTAX AttrIdentifier
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The value represents the attribute in the PRC "The value represents the attribute in the PRC
indicated by qosIfElmLinkCapsPrc that is used to indicated by dsIfElmLinkCapsPrc 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 ::= { dsIfElmLinkCapsEntry 2 }
the attribute appears in the definition of the PRC.
A value of 1 indicates the first attribute of the PRC,
a value of 2 indicates the second attribute of the
PRC, and so forth."
::= { qosIfElmLinkCapsEntry 2 }
qosIfElmLinkCapsNextPrc OBJECT-TYPE dsIfElmLinkCapsNextPrc OBJECT-TYPE
SYNTAX PrcIdentifier SYNTAX PrcIdentifierOidOrZero
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The value is the OID of a PRC table entry from which "The value is the OID of a PRC table entry from which
instances can be referenced by the attribute indicated instances can be referenced by the attribute indicated
by qosIfElmLinkCapsPrc and qosIfElmLinkAttr. by dsIfElmLinkCapsPrc and dsIfElmLinkAttr.
For example, suppose a meter's success output can be an For example, suppose a meter's success output can be an
action or another meter, and the fail output can only be action or another meter, and the fail output can only be
an action. This can be expressed as follows: an action. This can be expressed as follows:
Prid Prc Attr NextPrc Prid Prc Attr NextPrc
1 qosMeterEntry qosMeterSucceedNext qosActionEntry 1 dsMeterEntry dsMeterSucceedNext dsActionEntry
2 qosMeterEntry qosMeterSucceedNext qosMeterEntry 2 dsMeterEntry dsMeterSucceedNext dsMeterEntry
3 qosMeterEntry qosMeterFailNext qosActionEntry. 3 dsMeterEntry dsMeterFailNext dsActionEntry.
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 dsIfElmLinkCapsPrc
is the last functional data path element." is the last functional data path element."
::= { qosIfElmLinkCapsEntry 3 } ::= { dsIfElmLinkCapsEntry 3 }
-- --
-- Policy Classes -- Policy Classes
-- --
-- --
-- Data Path Table -- Data Path Table
-- --
-- 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
-- for each specific datapath. Each datapath is defined by the
-- interface role combination and direction. This table can
-- therefore have up to two entries for each role combination,
-- ingress and egress.
qosDataPathTable OBJECT-TYPE dsDataPathTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosDataPathEntry SYNTAX SEQUENCE OF DsDataPathEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The data path table indicates the start of "The data path table indicates the start of
functional data paths in this device." functional data paths in this device.
::= { qosPolicyClasses 1 } 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 for each specific datapath.
Each datapath is defined by the interface set's capability
set name, role combination, and direction. This class can
therefore have up to two entries for each interface set,
ingress and egress."
::= { dsPolicyClasses 1 }
qosDataPathEntry OBJECT-TYPE dsDataPathEntry OBJECT-TYPE
SYNTAX QosDataPathEntry SYNTAX DsDataPathEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Each entry in this table indicates the start of a single "Each entry in this class indicates the start of a single
functional data path, defined by its interface name, functional data path, defined by its capability set name,
role combination and traffic direction. The first role combination and traffic direction. The first
functional datapath element to handle traffic for each functional datapath element to handle traffic for each
data path is defined by the qosDataPathStart attribute data path is defined by the dsDataPathStart attribute
of each table entry. of each table entry.
Notice for each entry: Notice for each entry:
1. qosDataPathIfName must reference an existing interface 1. dsDataPathCapSetName must reference an existing capability
capability name in frwkIfCapSetTable [FR-PIB]. set name in frwkCapabilitySetTable [FR-PIB].
2. qosDataPathRoles must reference existing Role Combination 2. dsDataPathRoles must reference existing Role Combination
in frwkIfRoleComboTable [FR-PIB]. in frwkIfRoleComboTable [FR-PIB].
3. qosDataPathStart must reference an existing entry in a 3. dsDataPathStart must reference an existing entry in a
functional data path element table. functional data path element table.
If any one or more of these three requirements is not If any one or more of these three requirements is not
satisfied, the qosDataPathEntry will not be installed." satisfied, the dsDataPathEntry will not be installed."
PIB-INDEX { qosDataPathPrid } PIB-INDEX { dsDataPathPrid }
UNIQUENESS { qosDataPathIfName, UNIQUENESS { dsDataPathCapSetName,
qosDataPathRoles, dsDataPathRoles,
qosDataPathIfDirection } dsDataPathIfDirection }
::= { qosDataPathTable 1 } ::= { dsDataPathTable 1 }
QosDataPathEntry ::= SEQUENCE { DsDataPathEntry ::= SEQUENCE {
qosDataPathPrid InstanceId, dsDataPathPrid InstanceId,
qosDataPathIfName SnmpAdminString, dsDataPathCapSetName SnmpAdminString,
qosDataPathRoles RoleCombination, dsDataPathRoles RoleCombination,
qosDataPathIfDirection IfDirection, dsDataPathIfDirection IfDirection,
qosDataPathStart Prid dsDataPathStart Prid
} }
qosDataPathPrid OBJECT-TYPE dsDataPathPrid 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."
::= { qosDataPathEntry 1 } ::= { dsDataPathEntry 1 }
qosDataPathIfName OBJECT-TYPE dsDataPathCapSetName OBJECT-TYPE
SYNTAX SnmpAdminString SYNTAX SnmpAdminString
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The interface capability set to which this data path entry "The capability set associated with this data path entry.
applies. The interface capability name specified by this The capability set name specified by this attribute
attribute must exist in the frwkIfCapSetTable [FR-PIB] prior must exist in the frwkCapabilitySetTable [FR-PIB]
to association with an instance of this class." prior to association with an instance of this class."
::= { qosDataPathEntry 2 } ::= { dsDataPathEntry 2 }
qosDataPathRoles OBJECT-TYPE dsDataPathRoles 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 frwkIfRoleComboTable [FR-PIB] specifying in the frwkIfRoleComboTable [FR-PIB] specifying
this role combination, together with the interface this role combination, together with the capability
capability set specified by qosDataPathIfName, prior to set specified by dsDataPathCapSetName, prior to
association with an instance of this class." association with an instance of this class."
::= { qosDataPathEntry 3 } ::= { dsDataPathEntry 3 }
qosDataPathIfDirection OBJECT-TYPE dsDataPathIfDirection 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
entry applies on this interface." entry applies."
::= { qosDataPathEntry 4 } ::= { dsDataPathEntry 4 }
qosDataPathStart OBJECT-TYPE dsDataPathStart OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
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 dsClfrEntry
qosMeterEntry dsMeterEntry
qosActionEntry dsActionEntry
qosAlgDropEntry dsAlgDropEntry
qosQEntry dsQEntry
The PRI pointed 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 } ::= { dsDataPathEntry 5 }
-- --
-- Classifiers -- Classifiers
-- --
-- Classifier allows multiple classifier elements, of same or -- Classifier allows multiple classifier elements, of same or
-- different types, to be used together. -- different types, to be used together.
-- A classifier must completely classify all packets presented to -- A classifier must completely classify all packets presented to
-- it. This means all traffic handled by a classifier must match -- it. This means all traffic handled by a classifier must match
-- at least one classifier element within the classifier, -- at least one classifier element within the classifier,
-- with the classifier element parameters specified by a filter. -- with the classifier element parameters specified by a filter.
-- It is the PDP's responsibility to create a _catch all_ classifier -- It is the PDP's responsibility to create a _catch all_ classifier
-- element and filter that matches all packet. This _catch all_ -- element and filter that matches all packet. This _catch all_
-- classifier element should have the lowest Precedence value. -- classifier element should have the lowest Precedence value.
--
-- If there is ambiguity between classifier elements of different -- If there is ambiguity between classifier elements of different
-- classifier, classifier linkage order indicates their precedence; -- classifier, classifier linkage order indicates their precedence;
-- the first classifier in the link is applied to the traffic first. -- the first classifier in the link is applied to the traffic first.
--
-- Each entry in the classifier table represents a classifier, with -- Each entry in the classifier table represents a classifier, with
-- classifier element table handling the fan-out functionality of a -- classifier element table handling the fan-out functionality of a
-- classifier, and filter table defining the classification -- classifier, and filter table defining the classification
-- patterns. -- 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 dsClfrTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosClfrEntry SYNTAX SEQUENCE OF DsClfrEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates all the Diffserv classifier functional "This table enumerates all the Diffserv classifier functional
data path elements of this device. The actual classification data path elements of this device. The actual classification
definitions are detailed in qosClfrElementTable entries definitions are detailed in dsClfrElementTable entries
belonging to each classifier. belonging to each classifier. Each classifier is referenced
by its classifier elements using its classifier ID.
An entry in this table, referenced by an upstream functional An entry in this table, referenced by an upstream functional
data path element or a datapath table entry, is the entry data path element or a datapath table entry, is the entry
point to the classifier functional data path element. point to the classifier functional data path element.
The qosClfrId of each entry is used to organize all The dsClfrId of each entry is used to organize all
classifier elements belonging to the same classifier." classifier elements belonging to the same classifier."
REFERENCE REFERENCE
"[MODEL] section 4.1" "[MODEL] section 4.1"
::= { qosPolicyClasses 2 } ::= { dsPolicyClasses 2 }
qosClfrEntry OBJECT-TYPE
SYNTAX QosClfrEntry dsClfrEntry OBJECT-TYPE
SYNTAX DsClfrEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the classifier table describes a single "An entry in the classifier table describes a single
classifier. Each classifier element belonging to this classifier. Each classifier element belonging to this
classifier must have its qosClfrElementClfrId attribute equal classifier must have its dsClfrElementClfrId attribute equal
to qosClfrId." to dsClfrId."
PIB-INDEX { qosClfrPrid } PIB-INDEX { dsClfrPrid }
UNIQUENESS { qosClfrId } UNIQUENESS { dsClfrId }
::= { qosClfrTable 1 } ::= { dsClfrTable 1 }
QosClfrEntry ::= SEQUENCE { DsClfrEntry ::= SEQUENCE {
qosClfrPrid InstanceId, dsClfrPrid InstanceId,
qosClfrId TagReferenceId dsClfrId TagReferenceId
} }
qosClfrPrid OBJECT-TYPE dsClfrPrid 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."
::= { qosClfrEntry 1 } ::= { dsClfrEntry 1 }
qosClfrId OBJECT-TYPE dsClfrId OBJECT-TYPE
SYNTAX TagReferenceId SYNTAX TagReferenceId
PIB-TAG { qosClfrElementClfrId } PIB-TAG { dsClfrElementClfrId }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Identifies a Classifier. A Classifier must be "Identifies a Classifier. A Classifier must be
complete, this means all traffic handled by a complete, this means all traffic handled by a
Classifier must match at least one Classifier Classifier must match at least one Classifier
Element within the Classifier." Element within the Classifier."
::= { qosClfrEntry 2 } ::= { dsClfrEntry 2 }
-- --
-- Classifier Element Table -- Classifier Element Table
-- --
-- Entries in the classifier element table serves as
-- the anchor for each classification pattern, defined
-- in filter table entries. Each classifier element
-- table entry also specifies the subsequent downstream
-- diffserv functional datapath element when the
-- classification pattern is satisfied.
-- Each entry in the classifier element table describes
-- one branch of the fan-out characteristic of a classifier
-- indicated in [MODEL] section 4.1. A classifier is made up
-- 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 dsClfrElementTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosClfrElementEntry SYNTAX SEQUENCE OF DsClfrElementEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The classifier element table enumerates the relationship "Entries in the classifier element table serves as
the anchor for each classification pattern, defined
in filter table entries. Each classifier element
table entry also specifies the subsequent downstream
diffserv functional datapath element when the
classification pattern is satisfied. Hence
the classifier element table enumerates the relationship
between classification patterns and subsequent downstream between classification patterns and subsequent downstream
diffserv functional data path elements. Classification diffserv functional data path elements, describing one
parameters are defined by entries of filter tables pointed branch of the fan-out characteristic of a classifier
to by qosClfrElementSpecific. There can be filter tables of indicated in [Model].
different types, and they can be inter-mixed and used within
a classifier. An example of a filter table is the
frwkIpFilterTable, defined in [FR-PIB], for IP Multi-Field
Classifiers (MFCs)."
REFERENCE
"[MODEL] section 4.1"
::= { qosPolicyClasses 3 }
qosClfrElementEntry OBJECT-TYPE Classification parameters are defined by entries of filter
SYNTAX QosClfrElementEntry tables pointed to by dsClfrElementSpecific. There can be
filter tables of different types, and they can be inter-mixed
and used within a classifier. An example of a filter table is
the frwkIpFilterTable [FR-PIB], for IP Multi-Field
Classifiers (MFCs).
If there is ambiguity between classifier elements of the same
classifier, then dsClfrElementPrecedence needs to be used."
::= { dsPolicyClasses 3 }
dsClfrElementEntry OBJECT-TYPE
SYNTAX DsClfrElementEntry
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 { dsClfrElementPrid }
UNIQUENESS { qosClfrElementClfrId, UNIQUENESS { dsClfrElementClfrId,
qosClfrElementPrecedence, dsClfrElementPrecedence,
qosClfrElementSpecific } dsClfrElementSpecific }
::= { qosClfrElementTable 1 } ::= { dsClfrElementTable 1 }
QosClfrElementEntry ::= SEQUENCE { DsClfrElementEntry ::= SEQUENCE {
qosClfrElementPrid InstanceId, dsClfrElementPrid InstanceId,
qosClfrElementClfrId TagId, dsClfrElementClfrId TagId,
qosClfrElementPrecedence Unsigned32, dsClfrElementPrecedence Unsigned32,
qosClfrElementNext Prid, dsClfrElementNext Prid,
qosClfrElementSpecific Prid dsClfrElementSpecific Prid
} }
qosClfrElementPrid OBJECT-TYPE dsClfrElementPrid 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."
::= { qosClfrElementEntry 1 } ::= { dsClfrElementEntry 1 }
qosClfrElementClfrId OBJECT-TYPE
dsClfrElementClfrId OBJECT-TYPE
SYNTAX TagId SYNTAX TagId
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A classifier is composed of one or more classifier "A classifier is composed of one or more classifier
elements. Each classifier element belonging to elements. Each classifier element belonging to
the same classifier uses the same classifier ID. the same classifier uses the same classifier ID.
Hence, A classifier Id identifies which classifier Hence, A classifier Id identifies which classifier
this classifier element is a part of. This needs to be this classifier element is a part of. This must be
the value of qosClfrId attribute for an existing the value of dsClfrId attribute for an existing
instance of qosClfrEntry." instance of dsClfrEntry."
::= { qosClfrElementEntry 2 } ::= { dsClfrElementEntry 2 }
qosClfrElementPrecedence OBJECT-TYPE dsClfrElementPrecedence OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
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
precedence must be unambiguous i.e. they must define same precedence must be unambiguous i.e. they must
non-overlapping patterns, and are considered to be define non-overlapping patterns, and are considered to
applied simultaneously to the traffic stream. Clas- be applied simultaneously to the traffic stream.
sifier elements with different precedence may overlap Classifier elements with different precedence may
in their filters: the classifier element with the highest overlap in their filters: the classifier element with
precedence that matches is taken. the highest precedence that matches is taken.
On a given interface, there must be a complete clas- On a given interface, there must be a complete
sifier in place at all times in the classifier in place at all times in the ingress
ingress direction. This means that there will always direction. This means that there will always be one
be one or more filters that match every possible pat- or more filters that match every possible pattern
tern that could be presented in an incoming packet. 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 } ::= { dsClfrElementEntry 3 }
qosClfrElementNext OBJECT-TYPE dsClfrElementNext OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This attribute provides one branch of the fan-out "This attribute provides one branch of the fan-out
functionality of a classifier described in [MODEL] functionality of a classifier described in Diffserv
section 4.1. Model section 4.1.
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 marks the end of DiffServ processing A value of zeroDotZero marks the end of DiffServ processing
for this data path. Any other value must point to a for this data path. Any other value must point to a
valid (pre-existing) instance of one of: valid (pre-existing) instance of one of:
qosClfrEntry dsClfrEntry
qosMeterEntry dsMeterEntry
qosActionEntry dsActionEntry
qosAlgDropEntry dsAlgDropEntry
qosQEntry." dsQEntry."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosClfrElementEntry 4 } ::= { dsClfrElementEntry 4 }
dsClfrElementSpecific OBJECT-TYPE
qosClfrElementSpecific OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A pointer to a valid entry in another table that "A pointer to a valid entry in another table that
describes the applicable classification filter, e.g. describes the applicable classification filter, e.g.
an entry in frwkIpFilterTable [FR-PIB]. an entry in frwkIpFilterTable (Framework 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 } ::= { dsClfrElementEntry 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. -- 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 -- using their dsMeterSucceedNext and dsMeterFailNext pointers if
-- required. -- 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. -- 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 -- to be functionally equivalent to multiple level conformance
-- determination of a packet. The sequential nature of the -- determination of a packet. The sequential nature of the
-- representation is merely a notational convenience for this PIB. -- representation is merely a notational 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 -- dsMeterEntry and dsTBParamEntry. 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
-- qosMeterEntry and qosTBParamEntry. First set specifies the -- dsMeterEntry and dsTBParamEntry. First set specifies the
-- Committed Information Rate and Committed Burst Size -- Committed Information Rate and Committed Burst Size
-- token-bucket. Second set specifies the Peak Information -- token-bucket. Second set specifies the Peak Information
-- Rate and Peak Burst Size token-bucket. -- Rate and Peak Burst Size token-bucket.
-- --
-- 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 -- dsMeterEntry and dsTBParamEntry. 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. dsTBParamInterval in each
-- token bucket reflects the Average Interval. -- token bucket reflects the Average Interval.
-- --
qosMeterTable OBJECT-TYPE dsMeterTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosMeterEntry SYNTAX SEQUENCE OF DsMeterEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates specific meters that a system "This class 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 class. This may include
all traffic on an interface. all traffic on an interface.
Specific meter details are to be found in table entry Specific meter details are to be found in table entry
referenced by qosMeterSpecific." referenced by dsMeterSpecific."
REFERENCE "[MODEL] section 5.1" REFERENCE "[MODEL] section 5"
::= { qosPolicyClasses 4 } ::= { dsPolicyClasses 4 }
qosMeterEntry OBJECT-TYPE dsMeterEntry OBJECT-TYPE
SYNTAX QosMeterEntry SYNTAX DsMeterEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the meter table describes a single "An entry in the meter table describes a single
conformance level of a meter." conformance level of a meter."
PIB-INDEX { qosMeterPrid } PIB-INDEX { dsMeterPrid }
UNIQUENESS { qosMeterSucceedNext, UNIQUENESS { dsMeterSucceedNext,
qosMeterFailNext, dsMeterFailNext,
qosMeterSpecific } dsMeterSpecific }
::= { qosMeterTable 1 } ::= { dsMeterTable 1 }
QosMeterEntry ::= SEQUENCE { DsMeterEntry ::= SEQUENCE {
qosMeterPrid InstanceId, dsMeterPrid InstanceId,
qosMeterSucceedNext Prid, dsMeterSucceedNext Prid,
qosMeterFailNext Prid, dsMeterFailNext Prid,
qosMeterSpecific Prid dsMeterSpecific Prid
} }
qosMeterPrid OBJECT-TYPE dsMeterPrid 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."
::= { qosMeterEntry 1 } ::= { dsMeterEntry 1 }
qosMeterSucceedNext OBJECT-TYPE dsMeterSucceedNext OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"If the traffic does conform, this selects the next "If the traffic does conform, this selects the next
diffserv functional datapath element to handle diffserv functional datapath element to handle
traffic for this data path. traffic for this data path.
The value zeroDotZero in this variable indicates no The value zeroDotZero in this variable 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 dsClfrEntry
qosMeterEntry dsMeterEntry
qosActionEntry dsActionEntry
qosAlgDropEntry dsAlgDropEntry
qosQEntry." dsQEntry."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosMeterEntry 2 } ::= { dsMeterEntry 2 }
qosMeterFailNext OBJECT-TYPE dsMeterFailNext OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"If the traffic does not conform, this selects the "If the traffic does not conform, this selects the
next diffserv functional datapath element to handle next diffserv functional datapath element to handle
traffic for this data path. traffic for this data path.
The value zeroDotZero in this variable indicates no The value zeroDotZero in this variable 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 dsClfrEntry
qosMeterEntry dsMeterEntry
qosActionEntry dsActionEntry
qosAlgDropEntry dsAlgDropEntry
qosQEntry." dsQEntry."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosMeterEntry 3 } ::= { dsMeterEntry 3 }
qosMeterSpecific OBJECT-TYPE dsMeterSpecific OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This indicates the behaviour of the meter by point- "This indicates the behaviour of the meter by point-
ing to an entry containing detailed parameters. Note ing to an entry containing detailed parameters. Note
that entries in that specific table must be managed that entries in that specific table must be managed
explicitly. explicitly.
For example, qosMeterSpecific may point to an For example, dsMeterSpecific may point to an
entry in qosTBMeterTable, which contains an entry in dsTBMeterTable, which contains an
instance of a single set of Token Bucket parameters. instance of a single set of Token Bucket parameters.
The PRI pointed to must exist prior to installing this The PRI pointed to must exist prior to installing this
Meter datapath element." Meter datapath element."
::= { qosMeterEntry 4 } ::= { dsMeterEntry 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 dsMeterTable entries.
-- --
qosTBParamTable OBJECT-TYPE dsTBParamTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosTBParamEntry SYNTAX SEQUENCE OF DsTBParamEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates token-bucket meter parameter sets "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 parameter sets are modelled here as each having a single Such parameter sets are modelled here as each having a single
rate and a single burst size. Multiple entries are used rate 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 } ::= { dsPolicyClasses 5 }
qosTBParamEntry OBJECT-TYPE dsTBParamEntry OBJECT-TYPE
SYNTAX QosTBParamEntry SYNTAX DsTBParamEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry that describes a single token-bucket "An entry that describes a single token-bucket
parameter set." parameter set."
PIB-INDEX { qosTBParamPrid } PIB-INDEX { dsTBParamPrid }
UNIQUENESS { qosTBParamType, UNIQUENESS { dsTBParamType,
qosTBParamRate, dsTBParamRate,
qosTBParamBurstSize, dsTBParamBurstSize,
qosTBParamInterval } dsTBParamInterval }
::= { qosTBParamTable 1 } ::= { dsTBParamTable 1 }
QosTBParamEntry ::= SEQUENCE { DsTBParamEntry ::= SEQUENCE {
qosTBParamPrid InstanceId, dsTBParamPrid InstanceId,
qosTBParamType OBJECT IDENTIFIER, dsTBParamType AutonomousType,
qosTBParamRate Unsigned32, dsTBParamRate Unsigned32,
qosTBParamBurstSize BurstSize, dsTBParamBurstSize BurstSize,
qosTBParamInterval Unsigned32 dsTBParamInterval Unsigned32
} }
qosTBParamPrid OBJECT-TYPE dsTBParamPrid 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."
::= { qosTBParamEntry 1 } ::= { dsTBParamEntry 1 }
qosTBParamType OBJECT-TYPE dsTBParamType OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER SYNTAX AutonomousType
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Metering algorithm associated with the "The Metering algorithm associated with the
Token-Bucket parameters. zeroDotZero indicates this Token-Bucket parameters. zeroDotZero indicates this
is unknown. is unknown.
Standard values for generic algorithms are as follows: Standard values for generic algorithms are as follows:
qosTBParamSimpleTokenBucket, qosTBParamAvgRate, diffServTBParamSimpleTokenBucket, diffServTBParamAvgRate,
qosTBParamSrTCMBlind, qosTBParamSrTCMAware, diffServTBParamSrTCMBlind, diffServTBParamSrTCMAware,
qosTBParamTrTCMBlind, qosTBParamTrTCMAware, diffServTBParamTrTCMBlind, diffServTBParamTrTCMAware,
qosTBParamTswTCM diffServTBParamTswTCM
These are specified in this PIB as OBJECT-IDENTITYs These are specified in the Diffserv MIB."
under qosPolicyParameters; additional values may be
further specified in other PIBs."
REFERENCE REFERENCE
"[MODEL] section 5" "[MODEL] section 5.1"
::= { qosTBParamEntry 2 } ::= { dsTBParamEntry 2 }
qosTBParamRate OBJECT-TYPE dsTBParamRate OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
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: (kbps). This attribute is used for:
1. CIR in RFC 2697 for srTCM 1. CIR in RFC 2697 for srTCM
2. CIR and PIR in RFC 2698 for trTCM 2. CIR and PIR in RFC 2698 for trTCM
3. CTR and PTR in RFC 2859 for TSWTCM 3. CTR and PTR in RFC 2859 for TSWTCM
4. AverageRate in [MODEL] section 5." 4. AverageRate in [MODEL] section 5.1.1"
::= { qosTBParamEntry 3 } ::= { dsTBParamEntry 3 }
qosTBParamBurstSize OBJECT-TYPE dsTBParamBurstSize 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: burst. This attribute is used for:
1. CBS and EBS in RFC 2697 for srTCM 1. CBS and EBS in RFC 2697 for srTCM
2. CBS and PBS in FRC 2698 for trTCM 2. CBS and PBS in RFC 2698 for trTCM
3. Burst Size in [MODEL] section 5." 3. Burst Size in [MODEL] section 5."
::= { qosTBParamEntry 4 } ::= { dsTBParamEntry 4 }
qosTBParamInterval OBJECT-TYPE dsTBParamInterval OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
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, 1. Average Rate Meter, [MODEL] section 5.1.1,
-Delta. -Delta.
2. Simple Token Bucket Meter, [MODEL] section 2. Simple Token Bucket Meter, [MODEL] section
5.1, - time interval t. 5.1.3, - time interval t.
3. RFC 2859 TSWTCM, - AVG_INTERVAL. 3. RFC 2859 TSWTCM, - AVG_INTERVAL.
4. RFC 2697 srTCM, RFC 2698 trTCM, - 4. RFC 2697 srTCM, RFC 2698 trTCM, -
token bucket update time interval." token bucket update time interval."
::= { qosTBParamEntry 5 } ::= { dsTBParamEntry 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 dsActionTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosActionEntry SYNTAX SEQUENCE OF DsActionEntry
PIB-ACCESS install 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.
of traffic exiting from a meter, a device can then
perform a mark action of the conforming or non-
conforming traffic.
Specific actions are indicated by qosAction- Specific actions are indicated by dsAction-
Specific which points to an entry of a specific Specific which points to an entry of a specific
action type parameterizing the action in detail." action type parameterizing the action in detail."
REFERENCE REFERENCE
"[MODEL] section 6." "[MODEL] section 6."
::= { qosPolicyClasses 6 } ::= { dsPolicyClasses 6 }
qosActionEntry OBJECT-TYPE dsActionEntry OBJECT-TYPE
SYNTAX QosActionEntry SYNTAX DsActionEntry
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 { dsActionPrid }
UNIQUENESS { qosActionNext, UNIQUENESS { dsActionNext,
qosActionSpecific } dsActionSpecific }
::= { qosActionTable 1 } ::= { dsActionTable 1 }
QosActionEntry ::= SEQUENCE { DsActionEntry ::= SEQUENCE {
qosActionPrid InstanceId, dsActionPrid InstanceId,
qosActionNext Prid, dsActionNext Prid,
qosActionSpecific Prid dsActionSpecific Prid
} }
qosActionPrid OBJECT-TYPE dsActionPrid 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."
::= { qosActionEntry 1 } ::= { dsActionEntry 1 }
qosActionNext OBJECT-TYPE dsActionNext 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 variable 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 dsClfrEntry
qosMeterEntry dsMeterEntry
qosActionEntry dsActionEntry
qosAlgDropEntry dsAlgDropEntry
qosQEntry." dsQEntry."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosActionEntry 2 } ::= { dsActionEntry 2 }
qosActionSpecific OBJECT-TYPE dsActionSpecific OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A pointer to an object instance providing additional "A pointer to an object instance providing additional
information for the type of action indicated by this information for the type of action indicated by this
action table entry. action table entry.
For the standard actions defined by this PIB module, For the standard actions defined by this PIB module,
this should point to an instance of qosDscpMarkActEntry. this should point to an instance of dsDscpMarkActEntry.
For other actions, it may point to an instance of a For other actions, it may point to an instance of a
PRC defined in some other PIB. PRC defined in some other PIB.
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 } ::= { dsActionEntry 3 }
-- DSCP Mark Action Table -- DSCP Mark Action Table
-- --
-- Rows of this table are pointed to by qosActionSpecific -- Rows of this class are pointed to by dsActionSpecific
-- 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 -- This class should at most contain one entry for each supported
-- DSCP value. These entries should be reused by different -- DSCP value. These entries should be reused by different
-- qosActionEntry in same or different data paths. -- dsActionEntry in same or different data paths.
-- --
qosDscpMarkActTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosDscpMarkActEntry dsDscpMarkActTable OBJECT-TYPE
SYNTAX SEQUENCE OF DsDscpMarkActEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates specific DSCPs used for marking or "This class enumerates specific DSCPs used for marking or
remarking the DSCP field of IP packets. The entries of this remarking the DSCP field of IP packets. The entries of this
table may be referenced by a qosActionSpecific attribute." table may be referenced by a dsActionSpecific attribute."
REFERENCE REFERENCE
"[MODEL] section 6.1" "[MODEL] section 6.1"
::= { qosPolicyClasses 7 } ::= { dsPolicyClasses 7 }
qosDscpMarkActEntry OBJECT-TYPE dsDscpMarkActEntry OBJECT-TYPE
SYNTAX QosDscpMarkActEntry SYNTAX DsDscpMarkActEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the DSCP mark action table that describes a "An entry in the DSCP mark action table that describes a
single DSCP used for marking." single DSCP used for marking."
PIB-INDEX { qosDscpMarkActPrid } PIB-INDEX { dsDscpMarkActPrid }
UNIQUENESS { qosDscpMarkActDscp } UNIQUENESS { dsDscpMarkActDscp }
::= { qosDscpMarkActTable 1 } ::= { dsDscpMarkActTable 1 }
QosDscpMarkActEntry ::= SEQUENCE { DsDscpMarkActEntry ::= SEQUENCE {
qosDscpMarkActPrid InstanceId, dsDscpMarkActPrid InstanceId,
qosDscpMarkActDscp Dscp dsDscpMarkActDscp Dscp
} }
qosDscpMarkActPrid OBJECT-TYPE dsDscpMarkActPrid 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."
::= { qosDscpMarkActEntry 1 } ::= { dsDscpMarkActEntry 1 }
qosDscpMarkActDscp OBJECT-TYPE dsDscpMarkActDscp OBJECT-TYPE
SYNTAX Dscp SYNTAX Dscp
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"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 class. 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 } ::= { dsDscpMarkActEntry 2 }
-- --
-- Algorithmic Drop Table -- Algorithmic Drop Table
-- --
-- Algorithmic Drop Table is the entry point for the Algorithmic -- Algorithmic Drop Table is the entry point for the Algorithmic
-- Dropper functional data path element. -- Dropper functional data path element.
-- For a simple algorithmic dropper, a single algorithmic drop entry -- For a simple algorithmic dropper, a single algorithmic drop entry
-- will be sufficient to parameterize the dropper. -- will be sufficient to parameterize the dropper.
-- For more complex algorithmic dropper, the qosAlgDropSpecific -- For more complex algorithmic dropper, the dsAlgDropSpecific
-- attribute can be used to reference an entry in a parameter table, -- attribute can be used to reference an entry in a parameter table,
-- e.g. qosRandomDropTable for random dropper. -- e.g. dsRandomDropTable for random dropper.
-- For yet more complex dropper, for example, dropper that measures -- For yet more complex dropper, for example, dropper that measures
-- multiple queues, each queue with its own algorithm, can use a -- multiple queues, each queue with its own algorithm, can use a
-- qosAlgDropTable entry as the entry point for Algorithm Dropper -- dsAlgDropTable entry as the entry point for Algorithmic Dropper
-- functional data path element, leaving the dropper parameters -- functional data path element, leaving the dropper parameters
-- for each queue be specified by entries of qosMQAlgDropTable. -- for each queue be specified by entries of dsMQAlgDropTable.
-- In such usage, the anchoring qosAlgDropEntry's qosAlgDropType -- In such usage, the anchoring dsAlgDropEntry's dsAlgDropType
-- should be mQDrop, and its qosAlgDropQMeasure should reference -- should be mQDrop, and its dsAlgDropQMeasure should reference
-- the subsequent qosMQAlgDropEntry's, its qosAlgDropSpecific -- the subsequent dsMQAlgDropEntry's, its dsAlgDropSpecific
-- should be used to reference parameters applicable to all the -- should be used to reference parameters applicable to all the
-- queues being measured. -- queues being measured.
-- The subsequent qosMQAlgDropEntry's will provide the parameters, -- The subsequent dsMQAlgDropEntry's will provide the parameters,
-- one for each queue being measured. The qosMQAlgDropEntry's are -- one for each queue being measured. The dsMQAlgDropEntry's are
-- chained using their qosMQAlgDropNext attributes. -- chained using their dsMQAlgDropNext attributes.
-- --
qosAlgDropTable OBJECT-TYPE dsAlgDropTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosAlgDropEntry SYNTAX SEQUENCE OF DsAlgDropEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The algorithmic drop table contains entries describ- "The algorithmic drop table contains entries describ-
ing a functional data path element that drops ing a functional data path element that drops
packets according to some algorithm." packets according to some algorithm."
REFERENCE REFERENCE
"[MODEL] section 7.1.3" "[MODEL] section 7.1.3"
::= { qosPolicyClasses 9 } ::= { dsPolicyClasses 8 }
qosAlgDropEntry OBJECT-TYPE dsAlgDropEntry OBJECT-TYPE
SYNTAX QosAlgDropEntry SYNTAX DsAlgDropEntry
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 dsAlgDropType
and with more detail parameter entry pointed to by and with more detail parameter entry pointed to by
qosAlgDropSpecific when necessary." dsAlgDropSpecific when necessary."
PIB-INDEX { qosAlgDropPrid } PIB-INDEX { dsAlgDropPrid }
UNIQUENESS { qosAlgDropType, UNIQUENESS { dsAlgDropType,
qosAlgDropNext, dsAlgDropNext,
qosAlgDropQMeasure, dsAlgDropQMeasure,
qosAlgDropQThreshold, dsAlgDropQThreshold,
qosAlgDropSpecific } dsAlgDropSpecific }
::= { qosAlgDropTable 1 } ::= { dsAlgDropTable 1 }
QosAlgDropEntry ::= SEQUENCE { DsAlgDropEntry ::= SEQUENCE {
qosAlgDropPrid InstanceId, dsAlgDropPrid InstanceId,
qosAlgDropType INTEGER, dsAlgDropType INTEGER,
qosAlgDropNext Prid, dsAlgDropNext Prid,
qosAlgDropQMeasure Prid, dsAlgDropQMeasure Prid,
qosAlgDropQThreshold Unsigned32, dsAlgDropQThreshold Unsigned32,
qosAlgDropSpecific Prid dsAlgDropSpecific Prid
} }
qosAlgDropPrid OBJECT-TYPE dsAlgDropPrid 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."
::= { qosAlgDropEntry 1 } ::= { dsAlgDropEntry 1 }
qosAlgDropType OBJECT-TYPE dsAlgDropType 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) 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), headDrop(3), or alwaysDrop(5) represents of tailDrop(2), headDrop(3), or alwaysDrop(5) represents
an algorithm 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 dsAlgDropSpecific 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 dsAlgDropQThreshold represents the depth of the
queue, pointed to by qosAlgDropQMeasure, at queue, pointed to by dsAlgDropQMeasure, at
which all newly arriving packets will be dropped. which all newly arriving packets will be dropped.
The headDrop(3) algorithm is described as follows: if The headDrop(3) algorithm is described as follows: if
a packet arrives when the current depth of the queue, a packet arrives when the current depth of the queue,
pointed to by qosAlgDropQMeasure, is at pointed to by dsAlgDropQMeasure, is at
qosAlgDropQThreshold, packets currently at the head of dsAlgDropQThreshold, packets currently at the head of
the queue are dropped to make room for the new packet the queue are dropped to make room for the new packet
to be enqueued at the tail of the queue. to be enqueued at the tail of the queue.
The randomDrop(4) algorithm is described as follows: The randomDrop(4) algorithm is described as follows:
on packet arrival, an algorithm is executed which may on packet arrival, an algorithm is executed which may
randomly drop the packet, or drop other packet(s) randomly drop the packet, or drop other packet(s)
from the queue in its place. The specifics of the from the queue in its place. The specifics of the
algorithm may be proprietary. For this algorithm, algorithm may be proprietary. For this algorithm,
qosAlgDropSpecific points to a qosRandomDropEntry dsAlgDropSpecific points to a dsRandomDropEntry
that describes the algorithm. For this that describes the algorithm. For this
algorithm, qosAlgQThreshold is understood to be algorithm, dsAlgQThreshold 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 dsRandomDropTable.
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 dsAlgDropNext, dsAlgDropQMeasure, and
qosAlgDropSpecific should be all set to zeroDotZero. dsAlgDropSpecific should be all set to zeroDotZero.
The mQDrop(6) algorithm measures multiple queues for The mQDrop(6) algorithm measures multiple queues for
the drop algorithm. The queues measured are represented the drop algorithm. The queues measured are represented
by having qosAlgDropQMeasure referencing a qosMQAlgDropEntry. by having dsAlgDropQMeasure referencing a dsMQAlgDropEntry.
Each of the chained qosMQAlgDropEntry is used to describe Each of the chained dsMQAlgDropEntry is used to describe
the drop algorithm for one of the measured queues." the drop algorithm for one of the measured queues."
::= { qosAlgDropEntry 2 } ::= { dsAlgDropEntry 2 }
qosAlgDropNext OBJECT-TYPE dsAlgDropNext 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 attribute 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 dsClfrEntry
qosMeterEntry dsMeterEntry
qosActionEntry dsActionEntry
qosAlgDropEntry dsAlgDropEntry
qosQEntry. dsQEntry.
When qosAlgDropType is alwaysDrop(5), this attribute is When dsAlgDropType is alwaysDrop(5), this attribute is
Ignored." Ignored."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosAlgDropEntry 3 } ::= { dsAlgDropEntry 3 }
qosAlgDropQMeasure OBJECT-TYPE dsAlgDropQMeasure OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Points to a PRI to indicate the queues that a drop algorithm "Points to a PRI to indicate the queues that a drop algorithm
is to monitor when deciding whether to drop a packet. is to monitor when deciding whether to drop a packet.
For alwaysDrop(5), this attribute should be zeroDotZero. For alwaysDrop(5), this attribute should be zeroDotZero.
For tailDrop(2), headDrop(3), randomDrop(4), this should For tailDrop(2), headDrop(3), randomDrop(4), this should
point to an entry in the qosQTable. point to an entry in the dsQTable.
For mQDrop(6), this should point to a qosMQAlgDropEntry that For mQDrop(6), this should point to a dsMQAlgDropEntry that
Describe one of the queues being measured for multiple Describe one of the queues being measured for multiple
queue dropper. 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 } ::= { dsAlgDropEntry 4 }
qosAlgDropQThreshold OBJECT-TYPE dsAlgDropQThreshold OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
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, unless qosAlgDropType is alwaysDrop(5) ping algorithm, unless dsAlgDropType is alwaysDrop(5)
where this attribute is ignored. 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 dsAlgDropQMeasure, 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 } ::= { dsAlgDropEntry 5 }
qosAlgDropSpecific OBJECT-TYPE dsAlgDropSpecific OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Points to a table entry that provides further detail "Points to a table entry that provides further detail
regarding a drop algorithm. The PRI pointed to regarding a drop algorithm. The PRI pointed to
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 dsAlgDropType 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 dsAlgDropType equal to random-
Drop(4) must have this point to an entry in Drop(4) must have this point to an entry in
qosRandomDropTable. dsRandomDropTable.
Entries with qosAlgDropType equal to mQDrop(6) can use this Entries with dsAlgDropType equal to mQDrop(6) can use this
attribute to reference parameters that is used by all the attribute to reference parameters that is used by all the
queues of the multiple queues being measured. 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 } ::= { dsAlgDropEntry 6 }
-- --
-- Multiple Queue Algorithmic Drop Table -- Multiple Queue Algorithmic Drop Table
-- --
-- Entries of this table should be referenced by qosAlgDropQMeasure -- Entries of this table should be referenced by dsAlgDropQMeasure
-- when qosAlgDropType is mQDrop(6) for droppers measuring multiple -- when dsAlgDropType is mQDrop(6) for droppers measuring multiple
-- queues for its drop algorithm. -- queues for its drop algorithm.
-- Each entry of the table is used to describe the drop algorithm -- Each entry of the table is used to describe the drop algorithm
-- for a single queue within the multiple queues being measured. -- for a single queue within the multiple queues being measured.
-- --
-- Entries of this table, qosMQAlgDropEntry, is extended from -- Entries of this table, dsMQAlgDropEntry, is extended from
-- qosAlgDropEntry, with usage of corresponding parameters the same -- dsAlgDropEntry, with usage of corresponding parameters the same
-- except: -- except:
-- qosMQAlgDropNext is used to point to the next diffserv -- dsAlgDropNext is used to point to the next diffserv
-- functional data path element when the packet is not dropped. -- functional data path element when the packet is not dropped.
-- qosMQAlgDropExceedNext is used to point to the next -- dsMQAlgDropExceedNext is used to point to the next
-- qosMQAlgDropEntry for chaining together the multiple -- dsMQAlgDropEntry for chaining together the multiple
-- qosMQAlgDropEntry's for the multiple queues being measured. -- dsMQAlgDropEntry's for the multiple queues being measured.
-- --
qosMQAlgDropTable OBJECT-TYPE dsMQAlgDropTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosMQAlgDropEntry SYNTAX SEQUENCE OF DsMQAlgDropEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The multiple queue algorithmic drop table contains entries "The multiple queue algorithmic drop table contains entries
describing each queue being measured for the multiple queue describing each queue being measured for the multiple queue
algorithmic dropper." algorithmic dropper."
::= { qosPolicyClasses 10 } ::= { dsPolicyClasses 9 }
qosMQAlgDropEntry OBJECT-TYPE dsMQAlgDropEntry OBJECT-TYPE
SYNTAX QosMQAlgDropEntry SYNTAX DsMQAlgDropEntry
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. Each entry is used for according to some algorithm. Each entry is used for
each of the multiple queues being measured. Each entry each of the multiple queues being measured. Each entry
extends the basic qosAlgDropEntry with adding of a extends the basic dsAlgDropEntry with adding of a
qosMQAlgDropExceedNext attribute. dsMQAlgDropExceedNext attribute.
Further details of the algorithm type are to be found in Further details of the algorithm type are to be found in
qosAlgDropType and with more detail parameter entry pointed dsAlgDropType and with more detail parameter entry pointed
to by qosMQAlgDropSpecific when necessary." to by dsMQAlgDropSpecific when necessary."
EXTENDS { qosAlgDropEntry } EXTENDS { dsAlgDropEntry }
UNIQUENESS { qosMQAlgDropExceedNext } UNIQUENESS { dsMQAlgDropExceedNext }
::= { qosMQAlgDropTable 1 } ::= { dsMQAlgDropTable 1 }
QosMQAlgDropEntry ::= SEQUENCE { DsMQAlgDropEntry ::= SEQUENCE {
qosMQAlgDropExceedNext Prid dsMQAlgDropExceedNext Prid
} }
qosMQAlgDropExceedNext OBJECT-TYPE dsMQAlgDropExceedNext OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Used for linking of multiple qosMQAlgDropEntry for mQDrop. "Used for linking of multiple dsMQAlgDropEntry for mQDrop.
A value of zeroDotZero indicates this is the last of a A value of zeroDotZero indicates this is the last of a
chain of qosMQAlgDropEntry." chain of dsMQAlgDropEntry."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosMQAlgDropEntry 1 } ::= { dsMQAlgDropEntry 1 }
-- --
-- Random Drop Table -- Random Drop Table
-- --
qosRandomDropTable OBJECT-TYPE dsRandomDropTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosRandomDropEntry SYNTAX SEQUENCE OF DsRandomDropEntry
PIB-ACCESS install 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 dsAlgDropSpecific
qosAlgDropSpecific." when dsAlgDropType is randomDrop(4)."
REFERENCE REFERENCE
"[MODEL] section 7.1.3" "[MODEL] section 7.1.3"
::= { qosPolicyClasses 11 } ::= { dsPolicyClasses 10 }
qosRandomDropEntry OBJECT-TYPE dsRandomDropEntry OBJECT-TYPE
SYNTAX QosRandomDropEntry SYNTAX DsRandomDropEntry
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 { dsRandomDropPrid }
UNIQUENESS { qosRandomDropMinThreshBytes, UNIQUENESS { dsRandomDropMinThreshBytes,
qosRandomDropMinThreshPkts, dsRandomDropMinThreshPkts,
qosRandomDropMaxThreshBytes, dsRandomDropMaxThreshBytes,
qosRandomDropMaxThreshPkts, dsRandomDropMaxThreshPkts,
qosRandomDropProbMax, dsRandomDropProbMax,
qosRandomDropWeight, dsRandomDropWeight,
qosRandomDropSamplingRate dsRandomDropSamplingRate
} }
::= { qosRandomDropTable 1 } ::= { dsRandomDropTable 1 }
QosRandomDropEntry ::= SEQUENCE { DsRandomDropEntry ::= SEQUENCE {
qosRandomDropPrid InstanceId, dsRandomDropPrid InstanceId,
qosRandomDropMinThreshBytes Unsigned32, dsRandomDropMinThreshBytes Unsigned32,
qosRandomDropMinThreshPkts Unsigned32, dsRandomDropMinThreshPkts Unsigned32,
qosRandomDropMaxThreshBytes Unsigned32, dsRandomDropMaxThreshBytes Unsigned32,
qosRandomDropMaxThreshPkts Unsigned32, dsRandomDropMaxThreshPkts Unsigned32,
qosRandomDropProbMax Unsigned32, dsRandomDropProbMax Unsigned32,
qosRandomDropWeight Unsigned32, dsRandomDropWeight Unsigned32,
qosRandomDropSamplingRate Unsigned32 dsRandomDropSamplingRate Unsigned32
} }
qosRandomDropPrid OBJECT-TYPE dsRandomDropPrid 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."
::= { qosRandomDropEntry 1 } ::= { dsRandomDropEntry 1 }
qosRandomDropMinThreshBytes OBJECT-TYPE dsRandomDropMinThreshBytes OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
UNITS "bytes" UNITS "bytes"
STATUS current STATUS current
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 } ::= { dsRandomDropEntry 2 }
qosRandomDropMinThreshPkts OBJECT-TYPE dsRandomDropMinThreshPkts OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
UNITS "packets" UNITS "packets"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The average queue depth in packets, beyond which traffic has "The average queue depth in packets, beyond which traffic has
a non-zero probability of being dropped." a non-zero probability of being dropped."
::= { qosRandomDropEntry 3 } ::= { dsRandomDropEntry 3 }
qosRandomDropMaxThreshBytes OBJECT-TYPE dsRandomDropMaxThreshBytes OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
UNITS "bytes" UNITS "bytes"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The average queue depth beyond which traffic has a "The average queue depth beyond which traffic has a
probability indicated by qosRandomDropProbMax of being dropped probability indicated by dsRandomDropProbMax of being dropped
or marked. Note that this differs from the physical queue or marked. Note that this differs from the physical queue
limit, which is stored in qosAlgDropQThreshold." limit, which is stored in dsAlgDropQThreshold."
::= { qosRandomDropEntry 4 } ::= { dsRandomDropEntry 4 }
qosRandomDropMaxThreshPkts OBJECT-TYPE dsRandomDropMaxThreshPkts OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
UNITS "packets" UNITS "packets"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The average queue depth beyond which traffic has a "The average queue depth beyond which traffic has a
probability indicated by qosRandomDropProbMax of being dropped probability indicated by dsRandomDropProbMax of being dropped
or marked. Note that this differs from the physical queue or marked. Note that this differs from the physical queue
limit, which is stored in qosAlgDropQThreshold." limit, which is stored in dsAlgDropQThreshold."
::= { qosRandomDropEntry 5 } ::= { dsRandomDropEntry 5 }
qosRandomDropProbMax OBJECT-TYPE dsRandomDropProbMax OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (0..1000)
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The worst case random drop probability, expressed in drops "The worst case random drop probability, expressed in drops
per 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 (100%), this has the value 1000. Alternatively, if in the
worst case one percent (1%) of traffic may be dropped, it has worst case one percent (1%) of traffic may be dropped, it has
the value 10." the value 10."
::= { qosRandomDropEntry 6 } ::= { dsRandomDropEntry 6 }
qosRandomDropWeight OBJECT-TYPE dsRandomDropWeight OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (0..4294967295)
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 dsRandomDropWeight/MaxValue as the coefficient for the new
sample in the equation, and sample in the equation, and
(MaxValue - qosRandomDropWeight)/MaxValue as the coefficient (MaxValue - dsRandomDropWeight)/MaxValue as the coefficient
of 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." dsRandomDropWeight via the capability tables."
::= { qosRandomDropEntry 7 } ::= { dsRandomDropEntry 7 }
qosRandomDropSamplingRate OBJECT-TYPE dsRandomDropSamplingRate OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (0..1000000)
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 average calculation. A value of zero means the queue is
sampled approximately each time a packet is enqueued (or sampled approximately each time a packet is enqueued (or
dequeued)." dequeued)."
::= { qosRandomDropEntry 8 } ::= { dsRandomDropEntry 8 }
-- --
-- Queue Table -- Queue Table
-- --
-- --
-- An entry of qosQTable represents a FIFO queue diffserv -- An entry of dsQTable 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, dsQNext.
-- 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. -- dsQMinRate and dsQMaxRate.
-- --
-- Notice one or more upstream diffserv functional data path element -- Notice one or more upstream diffserv functional data path element
-- may share, point to, a qosQTable entry as described in [MODEL] -- may share, point to, a dsQTable entry as described in [MODEL]
-- section 7.1.1. -- section 7.1.1.
-- --
qosQTable OBJECT-TYPE dsQTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosQEntry SYNTAX SEQUENCE OF DsQEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Queue Table enumerates the queues." "The Queue Table enumerates the queues."
::= { qosPolicyClasses 12 } ::= { dsPolicyClasses 11 }
qosQEntry OBJECT-TYPE dsQEntry OBJECT-TYPE
SYNTAX QosQEntry SYNTAX DsQEntry
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
as a functional data path element." as a functional data path element."
PIB-INDEX { qosQPrid } PIB-INDEX { dsQPrid }
UNIQUENESS { qosQNext, UNIQUENESS { dsQNext,
qosQMinRate, dsQMinRate,
qosQMaxRate } dsQMaxRate }
::= { qosQTable 1 } ::= { dsQTable 1 }
QosQEntry ::= SEQUENCE { DsQEntry ::= SEQUENCE {
qosQPrid InstanceId, dsQPrid InstanceId,
qosQNext Prid, dsQNext Prid,
qosQMinRate Prid, dsQMinRate Prid,
qosQMaxRate Prid dsQMaxRate Prid
} }
qosQPrid OBJECT-TYPE dsQPrid 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 } ::= { dsQEntry 1 }
qosQNext OBJECT-TYPE dsQNext OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This selects the next diffserv scheduler. This must point "This selects the next diffserv scheduler. This must point
to a qosSchedulerEntry. to a dsSchedulerEntry.
A value of zeroDotZero in this attribute indicates an A value of zeroDotZero in this attribute indicates an
incomplete qosQEntry instance. In such a case, the entry incomplete dsQEntry instance. In such a case, the entry
has no operational effect, since it has no parameters to has no operational effect, since it has no parameters to
give it meaning." give it meaning."
::= { qosQEntry 2 } ::= { dsQEntry 2 }
qosQMinRate OBJECT-TYPE dsQMinRate OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This Prid indicates the entry in qosMinRateTable "This Prid indicates the entry in dsMinRateTable
the scheduler, pointed to by qosQNext, should use to service the scheduler, pointed to by dsQNext, should use to service
this queue. this queue.
If this value is zeroDotZero, then minimum rate and priority If this value is zeroDotZero, then minimum rate and priority
is unspecified. is unspecified.
If this value is not zeroDotZero then the instance pointed to If this value is not zeroDotZero then the instance pointed to
must exist prior to installing this entry." must exist prior to installing this entry."
::= { qosQEntry 3 } ::= { dsQEntry 3 }
qosQMaxRate OBJECT-TYPE dsQMaxRate OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This Prid indicates the entry in qosMaxRateTable "This Prid indicates the entry in dsMaxRateTable
the scheduler, pointed to by qosQNext, should use to service the scheduler, pointed to by dsQNext, should use to service
this queue. this queue.
If this value is zeroDotZero, then the maximum rate is the If this value is zeroDotZero, then the maximum rate is the
line speed of the interface. line speed of the interface.
If this value is not zeroDotZero 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 } ::= { dsQEntry 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 -- servicing multiple queues, to be used on the same
-- logical/physical interface of a data path. -- 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. -- 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 -- The dsSchedulerMinRate and dsSchedulerMaxRate attributes are
-- used for specifying the servicing parameters for output of a -- used for specifying the servicing parameters for output of a
-- scheduler when its downstream functional data path element -- scheduler when its downstream functional data path element
-- is another scheduler. -- 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 dsSchedulerTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosSchedulerEntry SYNTAX SEQUENCE OF DsSchedulerEntry
PIB-ACCESS install 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
datapath, with each algorithm described by one datapath, with each algorithm described by one
qosSchedulerEntry." dsSchedulerEntry."
REFERENCE REFERENCE
"[MODEL] section 7.1.2" "[MODEL] section 7.1.2"
::= { qosPolicyClasses 13 } ::= { dsPolicyClasses 12 }
qosSchedulerEntry OBJECT-TYPE dsSchedulerEntry OBJECT-TYPE
SYNTAX QosSchedulerEntry SYNTAX DsSchedulerEntry
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 { dsSchedulerPrid }
UNIQUENESS { qosSchedulerNext, UNIQUENESS { dsSchedulerNext,
qosSchedulerMethod, dsSchedulerMethod,
qosSchedulerMinRate, dsSchedulerMinRate,
qosSchedulerMaxRate } dsSchedulerMaxRate }
::= { qosSchedulerTable 1 } ::= { dsSchedulerTable 1 }
QosSchedulerEntry ::= SEQUENCE { DsSchedulerEntry ::= SEQUENCE {
qosSchedulerPrid InstanceId, dsSchedulerPrid InstanceId,
qosSchedulerNext Prid, dsSchedulerNext Prid,
qosSchedulerMethod OBJECT IDENTIFIER, dsSchedulerMethod AutonomousType,
qosSchedulerMinRate Prid, dsSchedulerMinRate Prid,
qosSchedulerMaxRate Prid dsSchedulerMaxRate Prid
} }
qosSchedulerPrid OBJECT-TYPE dsSchedulerPrid 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 } ::= { dsSchedulerEntry 1 }
qosSchedulerNext OBJECT-TYPE dsSchedulerNext 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.
This attribute normally have a value of zeroDotZero to This attribute normally have a value of zeroDotZero to
indicate no further Diffserv treatment is performed on indicate no further Diffserv treatment is performed on
traffic of this datapath. The use of zeroDotZero is the traffic of this datapath. The use of zeroDotZero is the
normal usage for the last functional datapath element. normal usage for the last functional datapath element.
Any value other than zeroDotZero must point to a valid Any value other than zeroDotZero must point to a valid
(pre-existing) instance of one of: (pre-existing) instance of one of:
qosSchedulerEntry dsSchedulerEntry
qosQEntry, dsQEntry,
or: or:
qosClfrEntry dsClfrEntry
qosMeterEntry dsMeterEntry
qosActionEntry dsActionEntry
qosAlgDropEntry dsAlgDropEntry
This points to another qosSchedulerEntry This points to another dsSchedulerEntry
for implementation of multiple scheduler methods for for implementation of multiple scheduler methods for
the same data path, and for implementation of the same data path, and for implementation of
hierarchical schedulers." hierarchical schedulers."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosSchedulerEntry 2 } ::= { dsSchedulerEntry 2 }
qosSchedulerMethod OBJECT-TYPE dsSchedulerMethod OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER SYNTAX AutonomousType
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The scheduling algorithm used by this Scheduler. "The scheduling algorithm used by this Scheduler.
Standard values for generic algorithms: Standard values for generic algorithms:
qosSchedulerPriority, diffServSchedulerPriority,
qosSchedulerWRR, diffServSchedulerWRR,
qosSchedulerWFQ diffServSchedulerWFQ
are specified in this PIB. are specified in the Diffserv MIB.
Additional values may be further specified in other PIBs. Additional values may be further specified in other PIBs.
A value of zeroDotZero indicates this is unknown." A value of zeroDotZero indicates this is unknown."
REFERENCE REFERENCE
"[MODEL] section 7.1.2" "[MODEL] section 7.1.2"
::= { qosSchedulerEntry 3 } ::= { dsSchedulerEntry 3 }
qosSchedulerMinRate OBJECT-TYPE dsSchedulerMinRate OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This Prid indicates the entry in qosMinRateTable "This Prid indicates the entry in dsMinRateTable
which indicates the priority or minimum output rate from this which indicates the priority or minimum output rate from this
scheduler. This attribute is used only when there is more scheduler. This attribute is used only when there is more
than one level of scheduler. than one level of scheduler.
When it has the value zeroDotZero, it indicates that no When it has the value zeroDotZero, it indicates that no
Minimum rate or priority is imposed." Minimum rate or priority is imposed."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosSchedulerEntry 4 } ::= { dsSchedulerEntry 4 }
qosSchedulerMaxRate OBJECT-TYPE dsSchedulerMaxRate OBJECT-TYPE
SYNTAX Prid SYNTAX Prid
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This Prid indicates the entry in qosMaxRateTable "This Prid indicates the entry in dsMaxRateTable
which indicates the maximum output rate from this scheduler. which indicates the maximum output rate from this scheduler.
When more than one maximum rate applies (e.g. a multi-rate When more than one maximum rate applies (e.g. a multi-rate
shaper is used), it points to the first of the rate entries. shaper is used), it points to the first of the rate entries.
This attribute is only used when there is more than one level This attribute is only used when there is more than one level
of scheduler. of scheduler.
When it has the value zeroDotZero, it indicates that no When it has the value zeroDotZero, it indicates that no
Maximum rate is imposed." Maximum rate is imposed."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { qosSchedulerEntry 5 } ::= { dsSchedulerEntry 5 }
-- --
-- Minimum Rate Parameters Table -- Minimum Rate Parameters Table
-- --
-- The parameters used by a scheduler for its inputs or outputs are -- The parameters used by a scheduler for its inputs or outputs are
-- maintained separately from the Queue or Scheduler table entries -- maintained separately from the Queue or Scheduler table entries
-- for reusability reasons and so that they may be used by both -- for reusability reasons and so that they may be used by both
-- queues and schedulers. This follows the approach for separation -- queues and schedulers. This follows the approach for separation
-- of data path elements from parameterization that is used -- of data path elements from parameterization that is used
-- throughout this PIB. -- throughout this PIB.
-- Use of these Minimum Rate Parameter Table entries by Queues and -- Use of these Minimum Rate Parameter Table entries by Queues and
-- Schedulers allows the modeling of hierarchical scheduling -- Schedulers allows the modeling of hierarchical scheduling
-- systems. -- systems.
-- --
-- Specifically, a Scheduler has one or more inputs and one output. -- Specifically, a Scheduler has one or more inputs and one output.
-- Any queue feeding a scheduler, or any scheduler which feeds a -- Any queue feeding a scheduler, or any scheduler which feeds a
-- second scheduler, might specify a minimum transfer rate by -- second scheduler, might specify a minimum transfer rate by
-- pointing to a Minimum Rate Parameter Table entry. -- pointing to a Minimum Rate Parameter Table entry.
-- --
-- The qosMinRatePriority/Abs/Rel attributes are used as -- The dsMinRatePriority/Absolute/Relative attributes are used as
-- parameters to the work-conserving portion of a scheduler: -- parameters to the work-conserving portion of a scheduler:
-- "work-conserving" implies that the scheduler can continue to emit -- "work-conserving" implies that the scheduler can continue to emit
-- data as long as there is data available at its input(s). This -- data as long as there is data available at its input(s). This
-- has the effect of guaranteeing a certain priority relative to -- has the effect of guaranteeing a certain priority relative to
-- other scheduler inputs and/or a certain minimum proportion of the -- other scheduler inputs and/or a certain minimum proportion of the
-- available output bandwidth. Properly configured, this means a -- available output bandwidth. Properly configured, this means a
-- certain minimum rate, which may be exceeded should traffic be -- certain minimum rate, which may be exceeded should traffic be
-- available should there be spare bandwidth after all other classes -- available should there be spare bandwidth after all other classes
-- have had opportunities to consume their own minimum rates. -- have had opportunities to consume their own minimum rates.
-- --
qosMinRateTable OBJECT-TYPE dsMinRateTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosMinRateEntry SYNTAX SEQUENCE OF DsMinRateEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Minimum 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 14 } ::= { dsPolicyClasses 13 }
qosMinRateEntry OBJECT-TYPE dsMinRateEntry OBJECT-TYPE
SYNTAX QosMinRateEntry SYNTAX DsMinRateEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the Minimum 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 { qosMinRatePrid } PIB-INDEX { dsMinRatePrid }
UNIQUENESS { qosMinRatePriority, UNIQUENESS { dsMinRatePriority,
qosMinRateAbsolute, dsMinRateAbsolute,
qosMinRateRelative } dsMinRateRelative }
::= { qosMinRateTable 1 } ::= { dsMinRateTable 1 }
QosMinRateEntry ::= SEQUENCE { DsMinRateEntry ::= SEQUENCE {
qosMinRatePrid InstanceId, dsMinRatePrid InstanceId,
qosMinRatePriority Unsigned32, dsMinRatePriority Unsigned32,
qosMinRateAbsolute Unsigned32, dsMinRateAbsolute Unsigned32,
qosMinRateRelative Unsigned32 dsMinRateRelative Unsigned32
} }
qosMinRatePrid OBJECT-TYPE dsMinRatePrid 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."
::= { qosMinRateEntry 1 } ::= { dsMinRateEntry 1 }
qosMinRatePriority OBJECT-TYPE dsMinRatePriority OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The priority of this input to the associated scheduler, "The priority of this input to the associated scheduler,
relative to the scheduler's other inputs. Higher Priority relative to the scheduler's other inputs. Higher Priority
value indicates the associated queue/scheduler will get value indicates the associated queue/scheduler will get
service first before others with lower Priority values." service first before others with lower Priority values."
::= { qosMinRateEntry 2 } ::= { dsMinRateEntry 2 }
qosMinRateAbsolute OBJECT-TYPE dsMinRateAbsolute OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
UNITS "kilobits per second" UNITS "kilobits per second"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The minimum absolute rate, in kilobits/sec, that a downstream "The minimum absolute rate, in kilobits/sec, that a downstream
scheduler element should allocate to this queue. If the value scheduler element should allocate to this queue. If the value
is zero, then there is effectively no minimum rate guarantee. is zero, then there is effectively no minimum rate guarantee.
If the value is non-zero, the scheduler will assure the If the value is non-zero, the scheduler will assure the
servicing of this queue to at least this rate. servicing of 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 qosMinRateRelative: changes to one will affect the value of dsMinRateRelative: changes to one will affect the value
of the other. of the other.
[IFMIB] defines ifSpeed as Gauge32 in units of bits per [IFMIB] defines ifSpeed as Gauge32 in units of bits per
second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits
per second. per second.
This yields the following equations: This yields the following equations:
RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000 RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000
Where, 1000 is for converting kbps used by RateAbsolute to bps Where, 1000 is for converting kbps used by RateAbsolute to bps
skipping to change at page 71, line 17 skipping to change at page 72, line 17
RateRelative = RateRelative =
{ [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } * { [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } *
1,000 1,000
Where, 1000 and 1,000,000 is for converting kbps used by Where, 1000 and 1,000,000 is for converting kbps used by
RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is
for 'in units of 1/1,000 of 1' for RateRelative." for 'in units of 1/1,000 of 1' for RateRelative."
REFERENCE REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]" "ifSpeed, ifHighSpeed from [IFMIB]"
::= { qosMinRateEntry 3 } ::= { dsMinRateEntry 3 }
qosMinRateRelative OBJECT-TYPE dsMinRateRelative OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
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/1,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 qosMinRateAbsolute: changes to one will of dsMinRateAbsolute: 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 [IFMIB] defines ifSpeed as Gauge32 in units of bits per
second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits
per second. per second.
This yields the following equations: This yields the following equations:
RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000 RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000
Where, 1000 is for converting kbps used by RateAbsolute to bps Where, 1000 is for converting kbps used by RateAbsolute to bps
skipping to change at page 72, line 5 skipping to change at page 73, line 5
RateRelative = RateRelative =
{ [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } * { [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } *
1,000 1,000
Where, 1000 and 1,000,000 is for converting kbps used by Where, 1000 and 1,000,000 is for converting kbps used by
RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is
for 'in units of 1/1,000 of 1' for RateRelative." for 'in units of 1/1,000 of 1' for RateRelative."
REFERENCE REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]" "ifSpeed, ifHighSpeed from [IFMIB]"
::= { qosMinRateEntry 4 } ::= { dsMinRateEntry 4 }
-- --
-- Maximum Rate Parameters Table -- Maximum Rate Parameters Table
-- --
-- The parameters used by a scheduler for its inputs or outputs are -- The parameters used by a scheduler for its inputs or outputs are
-- maintained separately from the Queue or Scheduler table entries -- maintained separately from the Queue or Scheduler table entries
-- for reusability reasons and so that they may be used by both -- for reusability reasons and so that they may be used by both
-- queues and schedulers. This follows the approach for separation -- queues and schedulers. This follows the approach for separation
-- of data path elements from parameterization that is used -- of data path elements from parameterization that is used
-- throughout this MIB. -- throughout this PIB.
-- Use of these Maximum Rate Parameter Table entries by Queues and -- Use of these Maximum Rate Parameter Table entries by Queues and
-- Schedulers allows the modeling of hierarchical scheduling -- Schedulers allows the modeling of hierarchical scheduling
-- systems. -- systems.
-- --
-- Specifically, a Scheduler has one or more inputs and one output. -- Specifically, a Scheduler has one or more inputs and one output.
-- Any queue feeding a scheduler, or any scheduler which feeds a -- Any queue feeding a scheduler, or any scheduler which feeds a
-- second scheduler, might specify a maximum transfer rate by -- second scheduler, might specify a maximum transfer rate by
-- pointing to a Maximum Rate Parameter Table entry. Multi-rate -- pointing to a Maximum Rate Parameter Table entry. Multi-rate
-- shapers, such as a Dual Leaky Bucket algorithm, specify their -- shapers, such as a Dual Leaky Bucket algorithm, specify their
-- rates using multiple Maximum Rate Parameter Entries with the same -- rates using multiple Maximum Rate Parameter Entries with the same
-- qosMaxRateId but different qosMaxRateLevels. -- dsMaxRateId but different dsMaxRateLevels.
-- --
-- The qosMaxRateLevel/Abs/Rel attributes are used as -- The dsMaxRateLevel/Absolute/Relative attributes are used as
-- parameters to the non-work-conserving portion of a scheduler: -- parameters to the non-work-conserving portion of a scheduler:
-- non-work-conserving implies that the scheduler may sometimes not -- non-work-conserving implies that the scheduler may sometimes not
-- emit a packet, even if there is data available at its input(s). -- emit a packet, even if there is data available at its input(s).
-- This has the effect of limiting the servicing of the -- This has the effect of limiting the servicing of the
-- queue/scheduler input or output, in effect performing shaping of -- queue/scheduler input or output, in effect performing shaping of
-- the packet stream passing through the queue/scheduler, as -- the packet stream passing through the queue/scheduler, as
-- described in the Informal Differentiated Services Model -- described in the Informal Differentiated Services Model
-- section 7.2. -- section 7.2.
-- --
qosMaxRateTable OBJECT-TYPE dsMaxRateTable OBJECT-TYPE
SYNTAX SEQUENCE OF QosMaxRateEntry SYNTAX SEQUENCE OF DsMaxRateEntry
PIB-ACCESS install PIB-ACCESS install
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Maximum 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 15 } ::= { dsPolicyClasses 14 }
qosMaxRateEntry OBJECT-TYPE dsMaxRateEntry OBJECT-TYPE
SYNTAX QosMaxRateEntry SYNTAX DsMaxRateEntry
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the Maximum 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 { qosMaxRatePrid } PIB-INDEX { dsMaxRatePrid }
UNIQUENESS { qosMaxRateId, UNIQUENESS { dsMaxRateId,
qosMaxRateLevel, dsMaxRateLevel,
qosMaxRateAbsolute, dsMaxRateAbsolute,
qosMaxRateRelative, dsMaxRateRelative,
qosMaxRateThreshold } dsMaxRateThreshold }
::= { qosMaxRateTable 1 } ::= { dsMaxRateTable 1 }
QosMaxRateEntry ::= SEQUENCE { DsMaxRateEntry ::= SEQUENCE {
qosMaxRatePrid InstanceId, dsMaxRatePrid InstanceId,
qosMaxRateId Unsigned32, dsMaxRateId Unsigned32,
qosMaxRateLevel Unsigned32, dsMaxRateLevel Unsigned32,
qosMaxRateAbsolute Unsigned32, dsMaxRateAbsolute Unsigned32,
qosMaxRateRelative Unsigned32, dsMaxRateRelative Unsigned32,
qosMaxRateThreshold BurstSize dsMaxRateThreshold BurstSize
} }
qosMaxRatePrid OBJECT-TYPE dsMaxRatePrid 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."
::= { qosMaxRateEntry 1 } ::= { dsMaxRateEntry 1 }
qosMaxRateId OBJECT-TYPE dsMaxRateId OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An index used together with qosMaxRateId for representing "An identifier used together with dsMaxRateLevel for
a multi-rate shaper. This attribute is used for associating representing a multi-rate shaper. This attribute is used for
all the rate attributes of a multi-rate shaper. Each associating all the rate attributes of a multi-rate shaper.
qosMaxRateEntry of a multi-rate shaper must have the same Each dsMaxRateEntry of a multi-rate shaper must have the same
value in this attribute. The different rates of a multi-rate value in this attribute. The different rates of a multi-rate
shaper is identified using qosMaxRateLevel. shaper is identified using dsMaxRateLevel.
This attribute uses the value of zero to indicate this This attribute uses the value of zero to indicate this
attribute is not used, for single rate shaper." attribute is not used, for single rate shaper."
DEFVAL { 0 } DEFVAL { 0 }
::= { qosMaxRateEntry 2 } ::= { dsMaxRateEntry 2 }
qosMaxRateLevel OBJECT-TYPE dsMaxRateLevel OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..32)
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 being given its parameters. A multi-rate shaper has some
number of rate levels. Frame Relay's dual rate specification number of rate levels. Frame Relay's dual rate specification
refers to a 'committed' and an 'excess' rate; ATM's dual rate refers to a 'committed' and an 'excess' rate; ATM's dual rate
specification refers to a 'mean' and a 'peak' rate. This table specification refers to a 'mean' and a 'peak' rate. This table
is generalized to support an arbitrary number of rates. The is generalized to support an arbitrary number of rates. The
committed or mean rate is level 1, the peak rate (if any) is committed or mean rate is level 1, the peak rate (if any) is
the highest level rate configured, and if there are other the highest level rate configured, and if there are other
rates they are distributed in monotonically increasing order rates they are distributed in monotonically increasing order
between them. between them.
When the entry is used for a single rate shaper, this When the entry is used for a single rate shaper, this
attribute contains a value of zero." attribute contains a value of zero."
DEFVAL { 0 } DEFVAL { 0 }
::= { qosMaxRateEntry 3 } ::= { dsMaxRateEntry 3 }
qosMaxRateAbsolute OBJECT-TYPE dsMaxRateAbsolute OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
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 qosMaxRateRelative: changes to one will of dsMaxRateRelative: 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 [IFMIB] defines ifSpeed as Gauge32 in units of bits per
second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits
per second. per second.
This yields the following equations: This yields the following equations:
RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000 RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000
Where, 1000 is for converting kbps used by RateAbsolute to bps Where, 1000 is for converting kbps used by RateAbsolute to bps
skipping to change at page 74, line 52 skipping to change at page 75, line 52
or, if appropriate: or, if appropriate:
RateRelative = RateRelative =
{ [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } * { [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } *
1,000 1,000
Where, 1000 and 1,000,000 is for converting kbps used by Where, 1000 and 1,000,000 is for converting kbps used by
RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is
for 'in units of 1/1,000 of 1' for RateRelative." for 'in units of 1/1,000 of 1' for RateRelative."
::= { qosMaxRateEntry 4 } ::= { dsMaxRateEntry 4 }
qosMaxRateRelative OBJECT-TYPE dsMaxRateRelative OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32 (1..4294967295)
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/1,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 qosMaxRateAbsolute: changes to one will of dsMaxRateAbsolute: 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 [IFMIB] defines ifSpeed as Gauge32 in units of bits per
second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits second, and ifHighSpeed as Gauge32 in units of 1,000,000 bits
per second. per second.
This yields the following equations: This yields the following equations:
RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000 RateRelative = [ (RateAbsolute * 1000) / ifSpeed ] * 1,000
Where, 1000 is for converting kbps used by RateAbsolute to bps Where, 1000 is for converting kbps used by RateAbsolute to bps
skipping to change at page 75, line 43 skipping to change at page 76, line 43
RateRelative = RateRelative =
{ [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } * { [ (RateAbsolute * 1000) / 1,000,000 ] / ifHIghSpeed } *
1,000 1,000
Where, 1000 and 1,000,000 is for converting kbps used by Where, 1000 and 1,000,000 is for converting kbps used by
RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is RateAbsolute to 1 million bps used by ifHighSpeed, 1,000 is
for 'in units of 1/1,000 of 1' for RateRelative." for 'in units of 1/1,000 of 1' for RateRelative."
REFERENCE REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]" "ifSpeed, ifHighSpeed from [IFMIB]"
::= { qosMaxRateEntry 5 } ::= { dsMaxRateEntry 5 }
qosMaxRateThreshold OBJECT-TYPE dsMaxRateThreshold 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
"Adaptive Rate Shaper, RFC 2963" "Adaptive Rate Shaper, RFC 2963"
::= { qosMaxRateEntry 6 } ::= { dsMaxRateEntry 6 }
--
-- 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 }
qosSchedulerParameters OBJECT IDENTIFIER
::= { qosPolicyParameters 2 }
-- --
-- Token Bucket Type Parameters -- Conformance Section
-- --
qosTBParamSimpleTokenBucket OBJECT-IDENTITY dsPolicyPibCompliances
STATUS current OBJECT IDENTIFIER ::= { dsPolicyPibConformance 1 }
DESCRIPTION dsPolicyPibGroups
"This value indicates the use of a Two Parameter Token Bucket OBJECT IDENTIFIER ::= { dsPolicyPibConformance 2 }
as described in [MODEL] section 5.2.3."
REFERENCE
"[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 1 }
qosTBParamAvgRate OBJECT-IDENTITY
STATUS current
DESCRIPTION
"This value indicates the use of an Average Rate Meter as
described in [MODEL] section 5.2.1."
REFERENCE
"[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 2 }
qosTBParamSrTCMBlind OBJECT-IDENTITY
STATUS current
DESCRIPTION
"This value indicates the use of Single Rate Three Color
Marker Metering as defined by RFC 2697, with `Color Blind'
mode as described by the RFC."
REFERENCE
"[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 3 }
qosTBParamSrTCMAware OBJECT-IDENTITY
STATUS current
DESCRIPTION
"This value indicates the use of Single Rate Three Color
Marker Metering as defined by RFC 2697, with `Color Aware'
mode as described by the RFC."
REFERENCE
"[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 4 }
qosTBParamTrTCMBlind OBJECT-IDENTITY
STATUS current
DESCRIPTION
"This value indicates the use of Two Rate Three Color Marker
Metering as defined by RFC 2698, with `Color Blind' mode as
described by the RFC."
REFERENCE
"[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 5 }
qosTBParamTrTCMAware OBJECT-IDENTITY
STATUS current
DESCRIPTION
"This value indicates the use of Two Rate Three Color Marker
Metering as defined by RFC 2698, with `Color Aware' mode as
described by the RFC."
REFERENCE
"[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 6 }
qosTBParamTswTCM OBJECT-IDENTITY dsPolicyPibCompliance MODULE-COMPLIANCE
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This value indicates the use of Time Sliding Window "Describes the requirements for conformance to the
Three Color Marker Metering as defined by RFC 2859." QoS Policy PIB."
REFERENCE
"[MODEL] sections 5 and 7.1.2"
::= { qosTBParameters 7 }
-- MODULE FRAMEWORK-PIB
-- Scheduler Method Parameters MANDATORY-GROUPS {
-- frwkPrcSupportGroup,
frwkPibIncarnationGroup,
frwkDeviceIdGroup,
frwkCompLimitsGroup,
frwkCapabilitySetGroup,
frwkRoleComboGroup,
frwkIfRoleComboGroup,
frwkBaseFilterGroup,
frwkIpFilterGroup }
qosSchedulerPriority OBJECT-IDENTITY OBJECT frwkPibIncarnationLongevity
STATUS current PIB-MIN-ACCESS notify
DESCRIPTION
"For use with qosSchedulerMethod and
qosIfSchedulingCapsServiceDisc to indicate Priority
scheduling method, defined as an algorithm in which the
presence of data in a queue or set of queues absolutely
precludes dequeue from another queue or set of queues.
Notice attributes from qosMinRateEntry of the
queues/schedulers feeding this scheduler are used when
determining the next packet to schedule."
REFERENCE
"[MODEL] section 7.1.2"
::= { qosSchedulerParameters 1 }
qosSchedulerWRR OBJECT-IDENTITY
STATUS current
DESCRIPTION DESCRIPTION
"For use with qosSchedulerMethod and "Install support is required if policy expiration is to
qosIfSchedulingCapsServiceDisc to indicate Weighted Round be supported."
Robin scheduling method, defined as any algorithm in which
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
qosMinRateEntry of the queues/schedulers feeding this
scheduler are used when determining the next packet to
schedule."
REFERENCE
"[MODEL] section 7.1.2"
::= { qosSchedulerParameters 2 }
qosSchedulerWFQ OBJECT-IDENTITY OBJECT frwkPibIncarnationTtl
STATUS current PIB-MIN-ACCESS notify
DESCRIPTION DESCRIPTION
"For use with qosSchedulerMethod and "Install support is required if policy expiration is to
qosIfSchedulingCapsServiceDisc to indicate Weighted Fair be supported."
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
attributes from qosMinRateEntry of the queues/schedulers
feeding this scheduler are used when determining the next
packet to schedule."
REFERENCE
"[MODEL] section 7.1.2"
::= { qosSchedulerParameters 3 }
--
-- Conformance Section
--
qosPolicyPibCompliances
OBJECT IDENTIFIER ::= { qosPolicyPibConformance 1 }
qosPolicyPibGroups
OBJECT IDENTIFIER ::= { qosPolicyPibConformance 2 }
qosPolicyPibCompliance MODULE-COMPLIANCE
STATUS current
DESCRIPTION
"Describes the requirements for conformance to the
QoS Policy PIB."
MODULE DIFFSERV-PIB -- this module MODULE DIFFSERV-PIB -- this module
MANDATORY-GROUPS { MANDATORY-GROUPS {
qosPibDataPathGroup, dsPibDataPathGroup,
qosPibClfrGroup, dsPibClfrGroup,
qosPibClfrElementGroup, dsPibClfrElementGroup,
qosPibActionGroup, dsPibActionGroup,
qosPibAlgDropGroup, dsPibAlgDropGroup,
qosPibQGroup, dsPibQGroup,
qosPibSchedulerGroup, dsPibSchedulerGroup,
qosPibMinRateGroup, dsPibMinRateGroup,
qosPibMaxRateGroup } dsPibMaxRateGroup }
GROUP qosPibMeterGroup GROUP dsPibMeterGroup
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 dsPibTBParamGroup
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 dsPibDscpMarkActGroup
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 GROUP dsPibMQAlgDropGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that implement "This group is mandatory for devices that implement
Multiple Queue Measured Algorithmic Drop functions." Multiple Queue Measured Algorithmic Drop functions."
GROUP qosPibRandomDropGroup GROUP dsPibRandomDropGroup
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 dsClfrId
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosClfrElementClfrId OBJECT dsClfrElementClfrId
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosClfrElementPrecedence
PIB-MIN-ACCESS notify OBJECT dsClfrElementPrecedence
PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosClfrElementNext OBJECT dsClfrElementNext
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosClfrElementSpecific OBJECT dsClfrElementSpecific
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMeterSucceedNext OBJECT dsMeterSucceedNext
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMeterFailNext OBJECT dsMeterFailNext
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMeterSpecific OBJECT dsMeterSpecific
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosTBParamType OBJECT dsTBParamType
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosTBParamRate OBJECT dsTBParamRate
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosTBParamBurstSize OBJECT dsTBParamBurstSize
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosTBParamInterval
PIB-MIN-ACCESS notify OBJECT dsTBParamInterval
PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosActionNext OBJECT dsActionNext
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosActionSpecific OBJECT dsActionSpecific
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosAlgDropType OBJECT dsAlgDropType
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosAlgDropNext OBJECT dsAlgDropNext
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosAlgDropQMeasure OBJECT dsAlgDropQMeasure
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosAlgDropQThreshold OBJECT dsAlgDropQThreshold
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosAlgDropSpecific OBJECT dsAlgDropSpecific
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropMinThreshBytes OBJECT dsRandomDropMinThreshBytes
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropMinThreshPkts
PIB-MIN-ACCESS notify OBJECT dsRandomDropMinThreshPkts
PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropMaxThreshBytes OBJECT dsRandomDropMaxThreshBytes
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropMaxThreshPkts OBJECT dsRandomDropMaxThreshPkts
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropProbMax OBJECT dsRandomDropProbMax
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropWeight OBJECT dsRandomDropWeight
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosRandomDropSamplingRate OBJECT dsRandomDropSamplingRate
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosQNext OBJECT dsQNext
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosQMinRate OBJECT dsQMinRate
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosQMaxRate OBJECT dsQMaxRate
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosSchedulerNext
PIB-MIN-ACCESS notify OBJECT dsSchedulerNext
PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosSchedulerMethod OBJECT dsSchedulerMethod
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosSchedulerMinRate OBJECT dsSchedulerMinRate
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosSchedulerMaxRate OBJECT dsSchedulerMaxRate
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMinRatePriority OBJECT dsMinRatePriority
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMinRateAbsolute OBJECT dsMinRateAbsolute
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMinRateRelative OBJECT dsMinRateRelative
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMaxRateId OBJECT dsMaxRateId
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMaxRateLevel OBJECT dsMaxRateLevel
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMaxRateAbsolute
PIB-MIN-ACCESS notify OBJECT dsMaxRateAbsolute
PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMaxRateRelative OBJECT dsMaxRateRelative
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
OBJECT qosMaxRateThreshold OBJECT dsMaxRateThreshold
PIB-MIN-ACCESS notify PIB-MIN-ACCESS not-accessible
DESCRIPTION DESCRIPTION
"Install support is not required." "Install support is not required."
::= { qosPibCompliances 1 } ::= { dsPolicyPibCompliances 1 }
qosPibDataPathGroup OBJECT-GROUP dsPibDataPathGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosDataPathIfName, qosDataPathRoles, dsDataPathCapSetName, dsDataPathRoles,
qosDataPathDirection, qosDataPathStart dsDataPathIfDirection, dsDataPathStart
} }
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."
::= { qosPolicyPibGroups 1 } ::= { dsPolicyPibGroups 1 }
qosPibClfrGroup OBJECT-GROUP dsPibClfrGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosClfrId dsClfrId
} }
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."
::= { qosPolicyPibGroups 2 } ::= { dsPolicyPibGroups 2 }
qosPibClfrElementGroup OBJECT-GROUP dsPibClfrElementGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosClfrElementClfrId, qosClfrElementPrecedence, dsClfrElementClfrId, dsClfrElementPrecedence,
qosClfrElementNext, qosClfrElementSpecific dsClfrElementNext, dsClfrElementSpecific
} }
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."
::= { qosPolicyPibGroups 3 } ::= { dsPolicyPibGroups 3 }
qosPibMeterGroup OBJECT-GROUP dsPibMeterGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosMeterSucceedNext, qosMeterFailNext, dsMeterSucceedNext, dsMeterFailNext,
qosMeterSpecific dsMeterSpecific
} }
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."
::= { qosPolicyPibGroups 4 } ::= { dsPolicyPibGroups 4 }
qosPibTBParamGroup OBJECT-GROUP dsPibTBParamGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosTBParamType, qosTBParamRate, dsTBParamType, dsTBParamRate,
qosTBParamBurstSize, qosTBParamInterval dsTBParamBurstSize, dsTBParamInterval
} }
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."
::= { qosPolicyPibGroups 5 } ::= { dsPolicyPibGroups 5 }
qosPibActionGroup OBJECT-GROUP dsPibActionGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosActionNext, qosActionSpecific dsActionNext, dsActionSpecific
} }
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."
::= { qosPolicyPibGroups 6 } ::= { dsPolicyPibGroups 6 }
qosPibDscpMarkActGroup OBJECT-GROUP dsPibDscpMarkActGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosDscpMarkActDscp dsDscpMarkActDscp
} }
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."
::= { qosPolicyPibGroups 7 } ::= { dsPolicyPibGroups 7 }
qosPibAlgDropGroup OBJECT-GROUP dsPibAlgDropGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosAlgDropType, qosAlgDropNext, dsAlgDropType, dsAlgDropNext,
qosAlgDropQMeasure, qosAlgDropQThreshold, dsAlgDropQMeasure, dsAlgDropQThreshold,
qosAlgDropSpecific dsAlgDropSpecific
} }
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."
::= { qosPolicyPibGroups 8 } ::= { dsPolicyPibGroups 8 }
qosPibMQAlgDropGroup OBJECT-GROUP dsPibMQAlgDropGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosMQAlgDropExceedNext dsMQAlgDropExceedNext
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Multiple Queue Measured Algorithmic Drop Group "The Multiple Queue Measured Algorithmic Drop Group
contains the objects that describe multiple queue contains the objects that describe multiple queue
measured algorithmic dropper operation and configuration." measured algorithmic dropper operation and configuration."
::= { qosPolicyPibGroups 9 } ::= { dsPolicyPibGroups 9 }
qosPibRandomDropGroup OBJECT-GROUP dsPibRandomDropGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosRandomDropMinThreshBytes, dsRandomDropMinThreshBytes,
qosRandomDropMinThreshPkts, dsRandomDropMinThreshPkts,
qosRandomDropMaxThreshBytes, dsRandomDropMaxThreshBytes,
qosRandomDropMaxThreshPkts, dsRandomDropMaxThreshPkts,
qosRandomDropProbMax, dsRandomDropProbMax,
qosRandomDropWeight, dsRandomDropWeight,
qosRandomDropSamplingRate dsRandomDropSamplingRate
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Random Drop Group augments the Algorithmic Drop Group "The Random Drop Group augments the Algorithmic Drop Group
for random dropper operation and configuration." for random dropper operation and configuration."
::= { qosPolicyPibGroups 10 } ::= { dsPolicyPibGroups 10 }
qosPibQGroup OBJECT-GROUP dsPibQGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosQNext, qosQMinRate, qosQMaxRate dsQNext, dsQMinRate, dsQMaxRate
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Queue Group contains the objects that describe "The Queue Group contains the objects that describe
an interface type's queues." an interface type's queues."
::= { qosPolicyPibGroups 11 } ::= { dsPolicyPibGroups 11 }
qosPibSchedulerGroup OBJECT-GROUP dsPibSchedulerGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosSchedulerNext, qosSchedulerMethod, dsSchedulerNext, dsSchedulerMethod,
qosSchedulerMinRate, qosSchedulerMaxRate dsSchedulerMinRate, dsSchedulerMaxRate
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Scheduler Group contains the objects that "The Scheduler Group contains the objects that
describe packet schedulers on interface types." describe packet schedulers on interface types."
::= { qosPolicyPibGroups 12 } ::= { dsPolicyPibGroups 12 }
dsPibMinRateGroup OBJECT-GROUP
qosPibMinRateGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosMinRatePriority, dsMinRatePriority,
qosMinRateAbsolute, qosMinRateRelative dsMinRateAbsolute, dsMinRateRelative
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Minimum Rate Group contains the objects "The Minimum Rate Group contains the objects
that describe packet schedulers' parameters on interface that describe packet schedulers' parameters on interface
types." types."
::= { qosPolicyPibGroups 13 } ::= { dsPolicyPibGroups 13 }
qosPibMaxRateGroup OBJECT-GROUP dsPibMaxRateGroup OBJECT-GROUP
OBJECTS { OBJECTS {
qosMaxRateId, qosMaxRateLevel, qosMaxRateAbsolute, dsMaxRateId, dsMaxRateLevel, dsMaxRateAbsolute,
qosMaxRateRelative, qosMaxRateThreshold dsMaxRateRelative, dsMaxRateThreshold
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Maximum Rate Group contains the objects "The Maximum Rate Group contains the objects
that describe packet schedulers' parameters on interface that describe packet schedulers' parameters on interface
types." types."
::= { qosPolicyPibGroups 14 } ::= { dsPolicyPibGroups 14 }
END END
9. Acknowledgments 9. Acknowledgments
This PIB builds on all the work that has gone into the Informal This PIB builds on all the work that has gone into the Informal
Management Model for Diffserv Routers and Management Information Management Model for Diffserv Routers and Management Information
Base for the Differentiated Services Architecture. Base for the Differentiated Services Architecture.
It has been developed with the active involvement of many people, It has been developed with the active involvement of many people,
but most notably Ravi Sahita and Walter Weiss. but most notably Ravi Sahita and Walter Weiss.
10. Subject Category Considerations 10. Security Considerations
The numbering space used for the DiffServ PIB, as indicated by the
SUBJECT-CATEGORIES clause, will be assigned by the Internet Assigned
Numbers Authority (IANA). Notice the numbering space used by
SUBJECT-CATEGORIES maps to the Client Type numbering space in [COPS-
PR]. This relationship is detailed in section 7.1 of [SPPI]. Due
to the fact that Client Type value of 1 has already been used by
[COPS-RSVP], the numbering space for SUBJECT-CATEGORIES will need to
start with the value of 2.
Other PIB Modules may use the same SUBJECT-CATEGORIES as this
DiffServ PIB Module. In such situations, PRC numbering space under
a specific SUBJECT-CATEGORIES should be coordinated with existing
PIB Modules using the same SUBJECT-CATEGORIES.
11. Security Considerations
The information contained in a PIB when transported by the COPS The information contained in a PIB when transported by the COPS
protocol [COPS-PR] may be sensitive, and its function of protocol [COPS-PR] may be sensitive, and its function of
provisioning a PEP requires that only authorized communication take provisioning a PEP requires that only authorized communication take
place. The use of IPSEC between PDP and PEP, as described in place.
[COPS], provides the necessary protection against these threats.
12. Intellectual Property Considerations There are a number of PRCs in this PIB that may contain information
that may be sensitive from a business perspective, in that they may
represent a customer's service contract or the filters that the
service provider chooses to apply to a customer's traffic. There
are no objects which are sensitive in their own right, such as
passwords or monetary amounts.
The IETF is being notified of intellectual property rights claimed The use of IPSEC between PDP and PEP, as described in [COPS],
provides the necessary protection.
11. Intellectual Property Considerations
The IETF has been notified of intellectual property rights claimed
in regard to some or all of the specification contained in this in regard to some or all of the specification contained in this
document. For more information consult the online list of claimed document. For more information consult the online list of claimed
rights. rights.
13. RFC Editor Considerations 12. RFC Editor Considerations
Some IETF documents this document references are in the IESG last Some IETF documents this document references are in the IESG last
call stage. This document references them as internet drafts. call stage. This document references them as internet drafts.
Please use their corresponding RFC numbers prior to publishing of Please use their corresponding RFC numbers prior to publishing of
this document as a RFC. The referenced IETF documents are [FR-PIB], this document as a RFC. The referenced IETF documents are [FR-PIB],
[MODEL], and [DS-MIB]. [MODEL], and [DS-MIB].
14. IANA Considerations 13. IANA Considerations
This document standardizes a Policy Information Base (PIB) module, This document describes the dsPolicyPib Policy Information Base
requesting an IANA assigned PIB number. (PIB) modules for standardization under the "pib" branch registered
with IANA. An IANA assigned PIB number is requested under the "pib"
branch.
15. Authors' Addresses [SPPI] PIB SUBJECT-CATEGORIES are mapped to COPS Client Types.
IANA Considerations for SUBJECT-CATEGORIES follow the same
requirements as specified in [COPS] IANA Considerations for COPS
Client Types. The DiffServ QoS PIB defines a new COPS Client Type
in the Standards space, hence that needs a COPS client type
assignment from IANA (as described in [COPS] IANA Considerations).
IANA must also update the registry for COPS Client Types as a
result.
14. Authors' Addresses
Michael Fine Michael Fine
Cisco Systems, Inc. Atheros Communications
170 West Tasman Drive 529 Almanor Ave
San Jose, CA 95134-1706 USA Sunnyvale, CA 94085 USA
Phone: +1 408 527 8218 Phone: +1 408 773 5324
Email: mfine@cisco.com Email: mfine@atheros.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.
skipping to change at page 90, line 21 skipping to change at page 89, line 23
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
16. References 15. Normative 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]
skipping to change at page 91, line 19 skipping to change at page 90, line 15
Internet Draft <draft-ietf-rap-frameworkpib-07.txt>, Internet Draft <draft-ietf-rap-frameworkpib-07.txt>,
January 2002. January 2002.
[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 M. Rose and S. Waldbusser, "Structure of Management
Information Information Version 2 (SMIv2)", STD 58, RFC 2578, April 1999.
Version 2 (SMIv2)", STD 58, RFC 2578, April 1999.
[MODEL] [MODEL]
Y. Bernet, S. Blake, D. Grossman, A. Smith "An Informal Y. Bernet, S. Blake, D. Grossman, A. Smith "An Informal
Management Model for Diffser Routers", Management Model for Diffser Routers",
Internet Draft <draft-ietf-diffserv-model-06.txt>, Internet Draft <draft-ietf-diffserv-model-06.txt>,
February 2001. 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 2863, June 2000.
[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-16.txt, November 2001 draft-ietf-diffserv-mib-16.txt, November 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
skipping to change at page 91, line 57 skipping to change at page 90, line 52
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.
[INETADDRESS]
Daniele, M., Haberman, B., Routhier, S., Schoenwaelder, J.,
"Textual Conventions for Internet Network Addresses.",
RFC 2851, June 2000.
[INTSERVMIB] [INTSERVMIB]
F. Baker, J. Krawczyk, A. Sastry, "Integrated Services F. Baker, J. Krawczyk, A. Sastry, "Integrated Services
Management Information Base using SMIv2", RFC 2213, Management Information Base using SMIv2", RFC 2213,
September 1997. September 1997.
[QUEUEMGMT] [QUEUEMGMT]
B. Braden et al., "Recommendations on Queue Management and B. Braden et al., "Recommendations on Queue Management and
Congestion Avoidance in the Internet", RFC 2309, April 1998. Congestion Avoidance in the Internet", RFC 2309, April 1998.
[RED93]
"Random Early Detection", 1993.
[SRTCM] [SRTCM]
J. Heinanen, R. Guerin, "A Single Rate Three Color Marker", J. Heinanen, R. Guerin, "A Single Rate Three Color Marker",
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] [RFC2026]
Bradner, S., "The Internet Standards Process -- Revision 3", Bradner, S., "The Internet Standards Process -- Revision 3",
BCP 9, RFC 2026, October 1996. BCP 9, RFC 2026, October 1996.
[SHAPER] [SHAPER]
"A Rate Adaptive Shaper for Differentiated Services", "A Rate Adaptive Shaper for Differentiated Services",
RFC 2963, October 2000. RFC 2963, October 2000.
17 Full Copyright [POLTERM]
A. Westerinen, J. Schnizlein, J. Strassner, M. Scherling,
B. Quinn, S. Herzog, A. Huynh, M. Carlson, J. Perry, S.
Waldbusser, "Terminology for Policy-Based Management",
RFC 3198, November 2001.
16. Full Copyright
Copyright c The Internet Society (2002). All Rights Reserved. Copyright c The Internet Society (2002). All Rights Reserved.
This document and translations of it may be copied and furnished to This document and translations of it may be copied and furnished to
others, and derivative works that comment on or otherwise explain it others, and derivative works that comment on or otherwise explain it
or assist in its implementation may be prepared, copied, published or assist in its implementation may be prepared, copied, published
and distributed, in whole or in part, without restriction of any and distributed, in whole or in part, without restriction of any
kind, provided that the above copyright notice and this paragraph kind, provided that the above copyright notice and this paragraph
are included on all such copies and derivative works. However, this are included on all such copies and derivative works. However, this
document itself may not be modified in any way, such as by removing document itself may not be modified in any way, such as by removing
skipping to change at page 93, line 14 skipping to change at line 4353
The limited permissions granted above are perpetual and will not be The limited permissions granted above are perpetual and will not be
revoked by the Internet Society or its successors or assigns. revoked by the Internet Society or its successors or assigns.
This document and the information contained herein is provided on an This document and the information contained herein is provided on an
"AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING
TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING
BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION
HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
Table of Contents
1. Glossary..........................................................2
2. Introduction......................................................2
3. Relationship to the Diffserv Informal Management Model............2
3.1. PIB Overview....................................................3
4. Structure of the PIB..............................................5
4.1. General Conventions.............................................5
4.2. DiffServ Data Paths.............................................5
4.2.1. Data Path PRC.................................................5
4.3. Classifiers.....................................................6
4.3.1. Classifier PRC................................................7
4.3.2. Classifier Element PRC.......................................7
4.4. Meters..........................................................8
4.4.1. Meter PRC.....................................................8
4.4.2. Token-Bucket Parameter PRC....................................8
4.5. Actions.........................................................8
4.5.1. DSCP Mark Action PRC..........................................9
4.6. Queueing Elements...............................................9
4.6.1. Algorithmic Dropper PRC.......................................9
4.6.2. Random Dropper PRC...........................................10
4.6.3. Queues and Schedulers........................................12
4.7. Specifying Device Capabilities.................................14
5. PIB Usage Example................................................15
5.1. Data Path Example..............................................15
5.2. Classifier and Classifier Element Example......................15
5.3. Meter Example..................................................17
5.4. Action Example.................................................18
5.5. Dropper Examples...............................................19
5.5.1. Tail Dropper Example.........................................19
5.5.2. Single Queue Random Dropper Example..........................19
5.5.3. Multiple Queue Random Dropper Example........................20
5.6. Queue and Scheduler Example....................................22
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.................................................88
10. Subject Category Considerations.................................88
11. Security Considerations.........................................88
12. Intellectual Property Considerations............................88
13. RFC Editor Considerations.......................................88
14. IANA Considerations.............................................89
15. Authors' Addresses..............................................89
16. References......................................................90
17 Full Copyright....................................................92
 End of changes. 597 change blocks. 
1382 lines changed or deleted 1354 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/