draft-ietf-diffserv-mib-04.txt   draft-ietf-diffserv-mib-05.txt 
Internet Engineering Task Force F. Baker Internet Engineering Task Force F. Baker
Diffserv Working Group Cisco Systems Diffserv Working Group Cisco Systems
INTERNET-DRAFT K. Chan INTERNET-DRAFT K. Chan
Expires January 2001 Nortel Networks Expires June 2001 Nortel Networks
draft-ietf-diffserv-mib-04.txt A. Smith draft-ietf-diffserv-mib-05.txt A. Smith
<editor> <editor>
November 2000
Management Information Base for the Management Information Base for the
Differentiated Services Architecture Differentiated Services Architecture
Status of this Memo Status of this Memo
This document is an Internet-Draft and is in full conformance with all This document is an Internet-Draft and is in full conformance with all
provisions of Section 10 of RFC 2026. Internet-Drafts are working provisions of Section 10 of RFC 2026. Internet-Drafts are working
documents of the Internet Engineering Task Force (IETF), its areas, and documents of the Internet Engineering Task Force (IETF), its areas, and
its working groups. Note that other groups may also distribute working its working groups. Note that other groups may also distribute working
documents as Internet-Drafts. documents as Internet-Drafts.
skipping to change at page 3, line 13 skipping to change at page 4, line 13
MIB. MIB.
2. Introduction 2. Introduction
2.1. Relationship to the Diffserv Informal Management Model 2.1. Relationship to the Diffserv Informal Management Model
This MIB is designed according to the Differentiated Services Informal This MIB is designed according to the Differentiated Services Informal
Management Model documented in [MODEL]. The model describes the way that Management Model documented in [MODEL]. The model describes the way that
ingress and egress interfaces of an 'n'-port router are modelled. It ingress and egress interfaces of an 'n'-port router are modelled. It
describes the configuration and management of a Diffserv interface in describes the configuration and management of a Diffserv interface in
terms of a Transmission Control Block (TCB) which contains, by terms of a Traffic Conditioning Block (TCB) which contains, by
definition, zero or more classifiers, meters, actions, algorithmic definition, zero or more classifiers, meters, actions, algorithmic
droppers, queues and schedulers. These elements are arranged according droppers, queues and schedulers. These elements are arranged according
to the QoS policy being expressed, always in that order. Traffic may be to the QoS policy being expressed, always in that order. Traffic may be
classified; classified traffic may be metered; each stream of traffic classified; classified traffic may be metered; each stream of traffic
identified by a combination of classifiers and meters may have some set identified by a combination of classifiers and meters may have some set
of actions performed on it; it may have dropping algorithms applied and of actions performed on it; it may have dropping algorithms applied and
it may ultimately be stored into a queue before being scheduled out to it may ultimately be stored into a queue before being scheduled out to
its next destination, either onto a link or to another TCB. When the its next destination, either onto a link or to another TCB. When the
treatment for a given packet must have any of those elements repeated in treatment for a given packet must have any of those elements repeated in
a way that breaks the permitted sequence {classifier, meter, action, a way that breaks the permitted sequence {classifier, meter, action,
algorithmic dropper, queue, scheduler}, this must be modelled by algorithmic dropper, queue, scheduler}, this must be modelled by
cascading multiple TCBs. cascading multiple TCBs.
The MIB represents this cascade by following the "Next" attributes of The MIB represents this cascade by following the "Next" attributes of
the various elements. They indicate what the next step in Diffserv the various elements. They indicate what the next step in Diffserv
processing will be, whether it be a classifier, meter, action, processing will be, whether it be a classifier, meter, action,
algorithmic dropper, queue, scheduler or a decision to now forward a algorithmic dropper, queue, scheduler or a decision to now forward a
packet. packet.
The MIB models the individual elements that make up the TCBs - it only The MIB models the individual elements that make up the TCBs. The
refers in passing to the higher-level concept of a TCB when it is higher level concept of a TCB is not required in the parameterization or
necessary to distinguish of which TCB, of several, a particular element in the linking together of the individual elements, hence it is not used
is a part. Literal TCBs are enumerated for Classifier elements: this is in the MIB itself and only mentioned in the text for relating the MIB
necessary to distinguish different, but overlapping, classification with the [MODEL]. The actual distinguishing of which TCB a specific
policies in different TCBs. However, TCBs are not enumerated for other element is a part of is not needed for the instructmentation of a device
elements. When a TCB performs no classification the literal TCB of the to support the functionalities of DiffServ, but it is useful for
succeeding elements is not used in their instance (index) as there is no conceptual reasons. By not including TCB notion in its parameters, this
need to distinguish them - each element is unique already. MIB allow any grouping of elements to construct TCBs, using rules
indicated by the [MODEL]. This will minimize changes to this MIB if
rules in [MODEL] changes.
The notion of a Data Path is used in this MIB to indicate the DiffServ
processing a packet may experience. This Data Path is distinguished
based on the Interface and the Direction of the flow the packet is part
of. A Data Path Table Entry indicates the first of possibly multiple
elements that will apply DiffServ treatment to the packet.
2.2. Relationship to other MIBs and Policy Management 2.2. Relationship to other MIBs and Policy Management
This MIB provides for direct reporting and manipulation of the most This MIB provides for direct reporting and manipulation of the most
detailed functional elements described by the Diffserv Informal detailed functional elements described by the Diffserv Informal
Management Model for management. These elements are instantiated in a Management Model for management. These elements are designed with their
very detailed manner, typically indexed by interface, direction and parameterization tables separated from their data path linkage tables,
other indices. The concept of "interface" is as for the allowing reuse of each table as much as possible. The data path linkage
in this MIB is coupled with interface thru the use of
diffServDataPathTable. The concept of "interface" is as for the
InterfaceIndex/ifIndex of the IETF Interfaces MIB [IFMIB]. InterfaceIndex/ifIndex of the IETF Interfaces MIB [IFMIB].
Other MIBs and data structure definitions for policy management Other MIBs and data structure definitions for policy management
mechanisms other than SNMP/SMIv2 are likely to exist in the future for mechanisms other than SNMP/SMIv2 are likely to exist in the future for
the purposes of abstracting the model in other ways. the purposes of abstracting the model in other ways.
In particular, abstractions in the direction of less detailed In particular, abstractions in the direction of less detailed
definitions of Diffserv functionality are likely e.g. some form of "Per- definitions of Diffserv functionality are likely e.g. some form of
Hop Behaviour"-based definition involving a template of detailed object "Per-Hop Behaviour"-based definition involving a template of detailed
values which is applied to specific instances of objects in this MIB object values which is applied to specific instances of objects in this
semi-automatically. MIB semi-automatically.
Another possible direction of abstraction is one using a concept of Another possible direction of abstraction is one using a concept of
"roles" (often, but not always, applied to interfaces). In this case, it "roles" (often, but not always, applied to interfaces). In this case, it
may be possible to re-use the object definitions in this MIB but with may be possible to re-use the object definitions in this MIB, especially
different indexing variables e.g. by mechanically replacing ifIndex by the parameterization tables. The Data Path table will help in the reuse
some sort of "roleIndex". Work is ongoing in this area. of the data path linkage tables by having the interface specific
information centralized, allowing easier mechanical replacement of
ifIndex by some sort of "roleIndex". Work is ongoing in this area.
2.3. MIB Overview 2.3. MIB Overview
In this MIB, we model the ingress and egress portions of a router This MIB is structured based on the need to describe the sequential
identically, making the distinction between them an index variable. DiffServ treatments being applied to a packet, and the parameterization
Each interface then performs some or all of the following high-level of these treatments. These two requirements are kept separate thru out
functions: the design of this MIB, and are full-filled using separate tables and
data definitions.
In this MIB, we model the ingress and egress portions of a DiffServ
network device identically, making the distinction between them an index
variable. Each interface then performs some or all of the following
high-level functions:
o Classify each packet according to some set of rules o Classify each packet according to some set of rules
o Determine whether the data stream the packet is part of is within o Determine whether the packet's data stream is conforming or not
or outside its rate conforming to its permitted rates
o Perform a set of resulting actions, possibly including counting the o Perform a set of resulting actions, possibly including counting the
traffic, application of an appropriate drop policy and marking of traffic, application of an appropriate drop policy and marking of
the traffic with a Differentiated Services Code Point (DSCP) as the traffic with a Differentiated Services Code Point (DSCP) as
defined in [DSFIELD]. defined in [DSFIELD].
o Enqueue the traffic for output in the appropriate queue, whose o 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 MIB therefore contains the following elements: The MIB therefore contains the following elements:
Data Path Table
A general extensible framework for describing the starting point of
DiffServ datapaths within a single DiffServ device. This table
descibes interface and interface direction specific data paths.
Classifier and Filter Tables Classifier and Filter Tables
A general extensible framework and one example (an IP Six-Tuple A general extensible framework and one example of a
Multi-Field Classification Table). parameterization table - filter table (an IP Six-Tuple Multi-Field
Classification Table).
Meter Tables Meter Tables
A general extensible framework and one example (an exponential A general extensible framework and one example of a
weighted moving average meter). parameterization table - TBMeter table, applicable for Simple Token
Bucket Meter, Average Rate Meter, Single Rate Three Color Meter,
Two Rate Three Color Meter, and Sliding Window Three Color Meter.
Action Tables Action Tables
Absolute Drop, Mark and Count actions. The "multiplexer", A general extensible framework and examples of parameterization
"replicator" and "null" actions described in [MODEL] are tables for Absolute Drop, Mark and Count actions. The
accomplished implicitly by means of the RowPointer structures of "multiplexer", "replicator" and "null" actions described in [MODEL]
the other elements. are accomplished implicitly by means of the RowPointer structures
of the other elements.
Queue, Scheduler and Algorithmic Dropper Tables Queue, Scheduler and Algorithmic Dropper Tables
Queue, Scheduler and Algorithmic Dropper Tables. A general extensible framework for parameterizing queuing and
scheduler systems. The queue measurement dependent algorithmic
droppers are also described here.
3. Structure of this MIB 3. Structure of this MIB
3.1. Classifiers This MIB is structured with separate tables for purpose of DiffServ data
path description and DiffServ treatment parameterization of the DiffServ
device. The data path description and/or the treatment parameterization
tables can each be reuse independently, allowing the flexibility to
maintain a common data construct for DiffServ device configuration and
provisioning, independent of the configuration/provisioning method used.
The classifier and filter tables determine how traffic is sorted out. The definitions in this MIB are intented to be reused by the DiffServ
They identify separable classes of traffic, by reference to an PIB and SNMPCONF working group's DiffServ Policy MIB. The treatment
appropriate filter, which may select anything from an individual micro- parameters can also be reused by other IP based technologies. For
flow to aggregates identified by DSCP. example, IP packet filtering parameters most likely can be reused by
other IP based technologies.
3.1. DiffServ Data Paths
This part of the MIB provide instrumentation for connecting the DiffServ
Functional Elements within a single DiffServ device. Please refer to
the [MODEL] for discussions on the valid sequencing and grouping of
DiffServ Functional Elements. Given some basic information, e.g.
ifIndex and interface direction, the first DiffServ Functional Element
is determined. Subsequent DiffServ Functional Elements are provided by
the "Next" pointer attribute of each entry of data path tables.
Description of how this "Next" pointer is used in each table is provided
in their respective section.
The data path can be redefined to allow a different level of control
other than interface level control currently defined in this MIB. There
is on-going work in this area, most notably the development of Policy
Information Base in DiffServ and RAP working groups, and DiffServ Policy
MIB in SNMPCONF working group.
3.1.1. Data Path Table
Entries in the Data Path Table provide the DiffServ treatment starting
points for all packets of this DiffServ device. Each entry in this table
is indexed by ifIndex and the direction of the packet flow. There
should be at most two entries for each interface, one for ingress and
one for egress. Each entry provides the first DiffServ Functional
Element each packet at a specific interface traveling a specific
relative direction should experience. Notice this table is interface
specific, with the use of ifIndex. As indicated in section 2.2, with
some modification/extension of the Data Path Table, most of the tables
and their entries are reusable by other Policy Management mechanisms.
For indication of none existence of DiffServ Treatments, entries can be
created with zeroDotZero in the diffServDataPathStart attribute to
indicate this explicitly. The none existence of DiffServ Treatment can
also be indicated implicitly by not having the entry at all. The
explicit/implicit selection is up to the implementation. This means
allow normal IP device processing when zeroDotZero is used in the
diffServDataPathStart attribute, or when the entry does not exist.
Normal IP device processing will depend on the device, for example, this
can be forwarding the packet.
3.2. Classifiers
The classifier, classifier element, and filter tables determine how
traffic is sorted out. They identify separable classes of traffic, by
reference to an appropriate filter, which may select anything from an
individual micro-flow to aggregates identified by DSCP.
The classification is used to send these separate streams to appropriate The classification is used to send these separate streams to appropriate
Meter, Action, Queue, Scheduler and Algorithmic Dropper elements. For Meter, Action, Queue, Scheduler and Algorithmic Dropper elements. For
example, to indicate a multi-stage meter, sub-classes of traffic may be example, to indicate a multi-stage meter, sub-classes of traffic may be
sent to different meter stages: e.g. in an implementation of the Assured sent to different meter stages: e.g. in an implementation of the Assured
Forwarding (AF) PHB [AF-PHB], AF11 traffic might be sent to the first Forwarding (AF) PHB [AF-PHB], AF11 traffic might be sent to the first
meter, AF12 traffic might be sent to the second and AF13 traffic sent to meter, AF12 traffic might be sent to the second and AF13 traffic sent to
the second meter stage's out-of-profile action. the second meter stage's out-of-profile action.
3.1.1. Classifier Table The concept of a classifier is the same as described in [MODEL]. The
structure of the classifier and classifier element tables, is the same
The structure of the classifier table, as described in [MODEL], is a as the classifier described in [MODEL]. Within each classifier, it must
sequence of unambiguous tests. Within each stage in the sequence, it not be important in which order the tests are made. This is to
must not be important in which order the tests are made. This is to
facilitate optimized implementations such as index trees. Order is facilitate optimized implementations such as index trees. Order is
present only to resolve ambiguity: for that reason the stage in the present only to resolve ambiguity, by use of "order" here and
sequence is referred to here and in [MODEL] as the "precedence" of the "precedence" in [MODEL]. Filter with higher values of order are
classifier stage: stages with higher values of precedence are compared compared first; the order of tests for entries of the same order is
first; the order of tests for entries of the same precedence is
unimportant. unimportant.
A datapath may consist of more than one classifier. There may be
overlap of filter specification between filters of different
classifiers. The first classifier functional datapath element
encountered, as determined by the sequencing of diffserv functional
datapath elements, will be used first.
An important form of classifier is "everything else": the final stage of An important form of classifier is "everything else": the final stage of
the classifier i.e. the one with the lowest precedence, must be the classifier i.e. the one with the lowest precedence, must be
"complete" since the result of an incomplete classifier is not "complete" since the result of an incomplete classifier is not
necessarily deterministic - see [MODEL] section 4.1.2. necessarily deterministic - see [MODEL] section 4.1.2.
The definition of the actual filter to be used by the classifier is The definition of the actual filter to be used by the classifier is
referenced via a RowPointer: this enables the use of any sort of filter referenced via a RowPointer: this enables the use of any sort of filter
table that one might wish to design, standard or proprietary. The filter table that one might wish to design, standard or proprietary. The filter
table may be, but does not need to be, defined in this MIB module. table may be, but does not need to be, defined in this MIB module.
The classifiers specified here are at the interface level i.e. they are The classifiers specified here are at the interface level, they may be
indexed by ifIndex: they may be derived from some more general policies derived from some more general policies e.g. something based on
e.g. something based on interface roles, but such discussion is outside interface roles, but such discussion is outside the scope of this
the scope of this document. See e.g. [POLTERM] section 4 for a document. See e.g. [POLTERM] section 4 for a discussion of Roles.
discussion of Roles.
3.1.2. IP Six-Tuple Classifier Table 3.2.1. Classifier Table
This MIB includes a definition for an IP Six-Tuple Classifier, used for Classifiers are organized by entries of the Classifier Table. With each
IP traffic classification. Entries in this filter table are referenced entry corresponds to a single Classifier. It is the entries in the
from the RowPointer diffServClassifierPattern attributes of classifier Classifier Table that get linked from the upstream diffserv functional
table entries. datapath element, i.e. an entry in diffServDataPathTable. A data path
may consist of more than one Classifier, the order the classification
processes aplies to the traffic is the same as the order the classifier
table entries are linked in the data path.
3.2.2. Classifier Element Table
While the Classifier Table entries handles the input side of the
Classifier, the Classifier Element Table enumerates each branch of the
fan-out of a Classifier, associating each fan-out branch with a Filter
for discriminating the traffic for that branch. Each Classifier Element
table entry is part of a Classifier, indicated by
diffServClfrElementClfrId.
3.2.3. Filter Table - IP Six-Tuple Classifier Table
This MIB includes one Filter Table, a definition for an IP Six-Tuple
Classifier, used for IP traffic classification. Entries in this filter
table are referenced from the RowPointer diffServClfrElementSpecific
attributes of classifier element table entries.
A Behavior Aggregate (BA) Classifier, acting only on DSCPs, is a simple A Behavior Aggregate (BA) Classifier, acting only on DSCPs, is a simple
form of the IP Six-Tuple Classifier. It is represented by having the form of the IP Six-Tuple Classifier. It is represented by having the
diffServSixTupleClfrDscp attribute set to the desired DSCP and all other diffServSixTupleClfrDscp attribute set to the desired DSCP and all other
classification attributes set to match-all, their default settings. The classification attributes set to match-all, their default settings. The
alternative approach of providing a specific definition in this MIB for alternative approach of providing a specific definition in this MIB for
a BA Classifier was discussed and rejected. a BA Classifier was discussed and rejected.
Each entry in the IP Six-Tuple Classifier Table defines a single filter. Each entry in the IP Six-Tuple Classifier Table defines a single filter.
The textual convention of InetAddress [INETADDR] is used for both IPv4 The textual convention of InetAddress [INETADDR] is used for both IPv4
and IPv6 addressing. The use of IP Six-Tuple Classifiers is discussed and IPv6 addressing. The use of IP Six-Tuple Classifiers is discussed
in [DSARCH] and abstract examples of how they might be configured are in [DSARCH] and abstract examples of how they might be configured are
provided in [MODEL]. provided in [MODEL].
3.2. Meters 3.3. Meters
A meter, according to [MODEL] section 5, measures the rate at which A meter, according to [MODEL] section 5, measures the rate at which
packets making up a stream of traffic pass it, compares this rate to packets making up a stream of traffic pass it, compares this rate to
some set of thresholds and produces some number (two or more) of some set of thresholds and produces some number (two or more) of
potential results. A given packet is said to "conform" to the meter if, potential results. A given packet is said to "conform" to the meter if,
at the time that the packet is being looked at, the stream appears to be at the time that the packet is being looked at, the stream appears to be
within the meter's profile. MIB syntax makes it easiest to define this within the meter's profile. MIB syntax makes it easiest to define this
as a sequence of one or more cascaded pass/fail tests, modeled here as as a sequence of one or more cascaded pass/fail tests, modeled here as
if-then-else constructs. It is important to understand that this way of if-then-else constructs. It is important to understand that this way of
modelling does not imply anything about the implementation being modelling does not imply anything about the implementation being
"sequential": multi-rate/multi-profile meters e.g. those designed to "sequential": multi-rate/multi-profile meters e.g. those designed to
support [SRTCM] or [TRTCM], can still be modelled this way even if they, support [SRTCM] or [TRTCM], can still be modelled this way even if they,
of necessity, share information between the stages: the stages are of necessity, share information between the stages: the stages are
introduced merely as a notational convenience in order to simplify the introduced merely as a notational convenience in order to simplify the
skipping to change at page 6, line 48 skipping to change at page 10, line 17
within the meter's profile. MIB syntax makes it easiest to define this within the meter's profile. MIB syntax makes it easiest to define this
as a sequence of one or more cascaded pass/fail tests, modeled here as as a sequence of one or more cascaded pass/fail tests, modeled here as
if-then-else constructs. It is important to understand that this way of if-then-else constructs. It is important to understand that this way of
modelling does not imply anything about the implementation being modelling does not imply anything about the implementation being
"sequential": multi-rate/multi-profile meters e.g. those designed to "sequential": multi-rate/multi-profile meters e.g. those designed to
support [SRTCM] or [TRTCM], can still be modelled this way even if they, support [SRTCM] or [TRTCM], can still be modelled this way even if they,
of necessity, share information between the stages: the stages are of necessity, share information between the stages: the stages are
introduced merely as a notational convenience in order to simplify the introduced merely as a notational convenience in order to simplify the
MIB structure. MIB structure.
3.2.1. Meter Table 3.3.1. Meter Table
The generic meter table is used as a base for all more specific forms of The generic meter table is used as a base for all more specific forms of
meter. The definition of parameters specific to the type of meter used meter. The definition of parameters specific to the type of meter used
is referenced via a pointer to a table containing those specifics. This
enables the use of any sort of specific meter table that one might wish
to design, standard or proprietary. The specific meter table may be, but
does not need to be, defined in this MIB module.
is referenced via a pointer to a table containing those specifics with 3.3.2. Token-Bucket Meter Table
the instance within that table identified by the same indices as for the
base meter table. This enables the use of any sort of specific meter
table that one might wish to design, standard or proprietary. The
specific meter table may be, but does not need to be, defined in this
MIB module.
3.2.2. Token-Bucket Meter Table
This is included as an example of a common type of meter. Entries in This is included as an example of a common type of meter. Entries in
this table are referenced from the RowPointer diffServMeterSpecific this table are referenced from the RowPointer diffServMeterSpecific
attributes of meter table entries. The parameters are represented by a attributes of meter table entries. The parameters are represented by a
rate diffServTBMeterRate and a burst size diffServTBMeterBurstSize. rate diffServTBMeterRate, a burst size diffServTBMeterBurstSize, and an
interval diffServTBMeterInterval. How these parameters are used depends
on the type of meter being parameterized, this is provided by the
diffServTBMeterType attribute. Additional meter parameterization tables
can be defined in this or other MIB when necessary.
3.3. Actions 3.4. Actions
Actions include "no action", "mark the traffic with a DSCP", "drop the Actions include "no action", "mark the traffic with a DSCP", "drop the
traffic" or "count it". Other tasks such as "shape the traffic" or "drop traffic" or "count it". Other tasks such as "shape the traffic" or "drop
based on some algorithm" are handled elsewhere as queueing mechanisms, based on some algorithm" are handled elsewhere as queueing mechanisms,
rather than actions, consistent with [MODEL]. The "multiplexer", rather than actions, consistent with [MODEL]. The "multiplexer",
"replicator" and "null" actions described in [MODEL] are accomplished "replicator" and "null" actions described in [MODEL] are accomplished
implicitly by means of the RowPointer structures of the other elements. implicitly by means of the RowPointer structures of the other elements.
This MIB uses the Action Table diffServActionTable to organize one This MIB uses the Action Table diffServActionTable to organize one
Action's relationship with the element(s) before and after it. It allows Action's relationship with the element(s) before and after it. It allows
skipping to change at page 7, line 34 skipping to change at page 11, line 4
rather than actions, consistent with [MODEL]. The "multiplexer", rather than actions, consistent with [MODEL]. The "multiplexer",
"replicator" and "null" actions described in [MODEL] are accomplished "replicator" and "null" actions described in [MODEL] are accomplished
implicitly by means of the RowPointer structures of the other elements. implicitly by means of the RowPointer structures of the other elements.
This MIB uses the Action Table diffServActionTable to organize one This MIB uses the Action Table diffServActionTable to organize one
Action's relationship with the element(s) before and after it. It allows Action's relationship with the element(s) before and after it. It allows
Actions to be cascaded to enable multiple Actions be applied to a single Actions to be cascaded to enable multiple Actions be applied to a single
traffic stream by using each entry's diffServActionNext attribute. The traffic stream by using each entry's diffServActionNext attribute. The
diffServActionNext attribute of the last action entry in the chain diffServActionNext attribute of the last action entry in the chain
points to the next element in the TCB, if any, e.g. a Queueing element. points to the next element in the TCB, if any, e.g. a Queueing element.
It may also point at a next TCB. It may also point at a next TCB.
The parameters needed for each Action element will depend on the type of The parameters needed for each Action element will depend on the type of
Action to be taken. Hence there are specific Action Tables for all the Action to be taken. Hence there are specific Action Tables for all the
different Action types. This flexibility allows additional Actions be different Action types. This flexibility allows additional Actions be
specified in future revisions of this MIB, or in other MIBs and also specified in future revisions of this MIB, or in other MIBs and also
allows for the use of proprietary Actions without impact on those allows for the use of proprietary Actions without impact on those
defined here. defined here.
3.3.1. DSCP Mark Action Table 3.4.1. DSCP Mark Action Table
This Action is applied to traffic in order to mark it with a Diffserv This Action is applied to traffic in order to mark it with a Diffserv
Codepoint (DSCP) value, specified in the diffServDscpMarkActTable. Codepoint (DSCP) value, specified in the diffServDscpMarkActTable. Other
Other marking actions might be specified elsewhere - these are outside marking actions might be specified elsewhere - these are outside the
the scope of this MIB. scope of this MIB.
3.3.2. Count Action Table 3.4.2. Count Action Table
Count Actions are used to count the traffic passing along a particular Count Actions are used to count the traffic passing along a particular
path through the model. If specified, they are likely to be placed path through the model. If specified, they are likely to be placed
first, before other types of Action. For example, when both a Count and first, before other types of Action. For example, when both a Count and
an Absolute Dropper Action are specified, the Count Action needs to an Absolute Dropper Action are specified, the Count Action needs to
count the traffic stream before any traffic gets dropped. Note that count the traffic stream before any traffic gets dropped. Note that
there are counters contained directly in Algorithmic Dropper elements to there are counters contained directly in Algorithmic Dropper elements to
indicate the amount of traffic dropped by those elements. indicate the amount of traffic dropped by those elements.
Counters are arranged in a single table but with separate conformance Counters are arranged in a single table but with separate conformance
statements for low-speed and high-speed interfaces, consistent with statements for low-speed and high-speed interfaces, consistent with
[IFMIB]. [IFMIB].
3.3.3. Absolute Drop Action 3.4.3. Absolute Drop Action
This action just silently discards all traffic presented to it, without This action just silently discards all traffic presented to it, without
counting it. This action has no additional parameters and so is counting it. This action has no additional parameters and so is
represented only as a diffServActionSpecific pointing to represented only within diffServActionType without its specific table.
diffServAbsoluteDropAction without any specific parameters.
3.4. Queueing Elements 3.5. Queueing Elements
These include Algorithmic Droppers, Queues and Schedulers which are all These include Algorithmic Droppers, Queues and Schedulers which are all
inter-related in their use of queueing techniques. inter-related in their use of queueing techniques.
3.4.1. Algorithmic Dropper Table 3.5.1. Algorithmic Dropper Table
Algorithmic Droppers have a close relationship with queueing: they are Algorithmic Droppers have a close relationship with queueing: they are
represented in this MIB by entries in an Algorithmic Dropper Table. represented in this MIB by entries in an Algorithmic Dropper Table.
Entries contain a diffServAlgDropNext attribute which indicates to which Entries contain a diffServAlgDropNext attribute which indicates to which
queue they sink their traffic. queue they sink their traffic.
An Algorithmic Dropper is assumed to operate indiscriminately on all An Algorithmic Dropper is assumed to operate indiscriminately on all
packets that are presented at its input. If it is necessary to perform packets that are presented at its input. If it is necessary to perform
additional classification on the stream then a separate TCB must be additional classification on the stream then a separate TCB must be
introduced at this point: Classifier elements here can then distinguish introduced at this point: Classifier elements here can then distinguish
the different types of traffic on which dropping is to act and the the different types of traffic on which dropping is to act and the
treatment for each type is described by a separate diffServAlgDropEntry. treatment for each type is described by a separate diffServAlgDropEntry.
Algorithmic Droppers may also contain a pointer to specific detail of Algorithmic Droppers may also contain a pointer to specific detail of
the drop algorithm. This MIB defines the detail for three drop the drop algorithm, diffServAlgDropSpecific. This MIB defines the detail
algorithms: Tail Drop, Head Drop and Random Drop; other algorithms are for three drop algorithms: Tail Drop, Head Drop and Random Drop; other
outside the scope of this MIB modele but the general framework is algorithms are outside the scope of this MIB module but the general
intended to allow for their inclusion via other MIB modules. framework is intended to allow for their inclusion via other MIB
modules.
One generally-applicable parameter of a dropper is the specification of One generally-applicable parameter of a dropper is the specification of
a queue-depth threshold at which some drop action is to start. This is a queue-depth threshold at which some drop action is to start. This is
represented in this MIB, as a base attribute of the Algorithmic Dropper represented in this MIB, as a base attribute, diffServAlgDropQThreshold,
entry, by pointing to the queue for which depth is to be compared and of the Algorithmic Dropper entry. The queue for which depth is to be
the depth threshold to compare against. compared and the depth threshold to compare against, is specified with
diffServAlgDropQMeasure.
o A Tail Dropper requires the specification of a maximum queue depth o A Tail Dropper requires the specification of a maximum queue depth
threshold: when the queue pointed at by diffServAlgDropQMeasure threshold: when the queue pointed at by diffServAlgDropQMeasure
reaches that depth threshold, diffServAlgDropQThresh, any new reaches that depth threshold, diffServAlgDropQThresh, 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 diffServAlgDropEntry. only parameters that are part of the diffServAlgDropEntry.
o A Head Dropper requires the specification of a maximum queue depth o A Head Dropper requires the specification of a maximum queue depth
threshold: when the queue pointed at by diffServAlgDropQMeasure threshold: when the queue pointed at by diffServAlgDropQMeasure
reaches that depth threshold, diffServAlgDropQThresh, traffic reaches that depth threshold, diffServAlgDropQThresh, traffic
skipping to change at page 9, line 34 skipping to change at page 13, line 5
[QUEUEMGMT] and called for in the [AF-PHB]. Various implementations [QUEUEMGMT] and called for in the [AF-PHB]. Various implementations
exist, which agree on marking or dropping just enough traffic to exist, which agree on marking or dropping just enough traffic to
communicate with TCP-like protocols about congestion avoidance, but communicate with TCP-like protocols about congestion avoidance, but
differ markedly on their specific parameters. This MIB attempts to differ markedly on their specific parameters. This MIB attempts to
offer a minimal set of controls for any random dropper, but expects offer a minimal set of controls for any random dropper, but expects
that vendors will augment the table with additional controls and that vendors will augment the table with additional controls and
status in accordance with their implementation. This algorithm status in accordance with their implementation. This algorithm
requires additional parameters on top of those in requires additional parameters on top of those in
diffServAlgDropEntry: these are discussed below. diffServAlgDropEntry: these are discussed below.
3.4.2. Random Dropper Table 3.5.2. Random Dropper Table
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
the representation chosen in this MIB for this element is shown in representation chosen in this MIB for this element is shown in Figure 1.
Figure 1.
Random droppers often have their drop probability function described as Random droppers often have their drop probability function described as
a plot of drop probability (P) against averaged queue length (Q). a plot of drop probability (P) against averaged queue length (Q).
(Qmin,Pmin) then defines the start of the characteristic plot. Normally (Qmin,Pmin) then defines the start of the characteristic plot. Normally
Pmin=0, meaning with average queue length below Qmin, there will be no Pmin=0, meaning with average queue length below Qmin, there will be no
drops. (Qmax,Pmax) defines a "knee" on the plot, after which point the drops. (Qmax,Pmax) defines a "knee" on the plot, after which point the
drop probability become more progressive (greater slope). (Qclip,1) drop probability become more progressive (greater slope). (Qclip,1)
defines the queue length at which all packets will be dropped. Notice defines the queue length at which all packets will be dropped. Notice
this is different from Tail Drop because this uses an averaged queue this is different from Tail Drop because this uses an averaged queue
length. although it is possible for Qclip = Qmax. In the MIB module, length. although it is possible for Qclip = Qmax. In the MIB module,
diffServRandomDropMinThreshBytes and diffServRandomDropMinThreshPkts diffServRandomDropMinThreshBytes and diffServRandomDropMinThreshPkts
represent Qmin. diffServRandomDropMaxThreshBytes and represent Qmin. diffServRandomDropMaxThreshBytes and
diffServRandomDropMaxThreshPkts represent Qmax. diffServRandomDropMaxThreshPkts represent Qmax.
diffServRandomDropInvProbMax represents Pmax. This MIB does not
represent Pmin (assumed to be zero unless otherwise represented) or
Qclip (assumed to be Qmax unless otherwise represented).
Each random dropper specification is associated with a queue. This
allows multiple drop processes (of same or different types) be
associated with the same queue, as different PHB implementations may
+-------------+ +-----------+ +-------------+ +-----------+
--->| Next --------+-->| Next ---------> to Scheduler --->| Next --------+-->| Next ---------> to Scheduler
| Thresh=100k | | | Min=none | | Thresh=100k | | | Min=none |
| Measure -------+ | Max=none | | Measure -------+ | Max=none |
| Type=random | | Pri=10 | | Type=random | | Pri=10 |
| Specif -------+ | Type=fifo | | Specific ------+ | Type=fifo |
+-------------+ | +-----------+ +-------------+ | +-----------+
AlgDrop.3 | Queue.ifIndex.4 AlgDrop.3 | Queue.4
| |
| +--------------+ | +--------------+
+-->| Minthresh=10k| +-->| Minthresh=10k|
| Maxthresh=80k| | Maxthresh=80k|
| Weight=1/16 | | Weight=1/16 |
| ProbMax= 0.5 | | ProbMax= 0.5 |
+--------------+ +--------------+
RandomDrop.3 RandomDrop.3
Figure 1: Example Use of the RandomDropTable for Random Droppers Figure 1: Example Use of the RandomDropTable for Random Droppers
diffServRandomDropProbMax represents Pmax. This MIB does not represent
Pmin (assumed to be zero unless otherwise represented) or Qclip (assumed
to be Qmax unless otherwise represented).
Each random dropper specification is associated with a queue. This
allows multiple drop processes (of same or different types) be
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.
The calculation of a smoothed queue length may also have an important The calculation of a smoothed queue length may also have an important
bearing on the behaviour of the dropper: parameters may include the bearing on the behaviour of the dropper: parameters may include the
sampling interval and the weight of each sample. The performance may be sampling rate and the weight of each sample. The performance may be very
very sensitive to the values of these parameters and a wide range of sensitive to the values of these parameters and a wide range of possible
possible values may be required due to a wide range of link speeds. Most values may be required due to a wide range of link speeds. Most
algorithms include a sample weight, represented here by algorithms include a sample weight, represented here by
diffServRandomDropInvWeight. Note however that there is ongoing research diffServRandomDropInvWeight. The availability of
on this topic, see e.g. [ACTQMGMT]. diffServRandomDropSamplingRate as readable is important, the information
provided by Sampling Rate is essential to the configuration of
diffServRandomDropInvWeight. Having Sampling Rate be configurable is
also helpful, as line speed increases, the ability to have queue
sampling be less frequent than packet arrival is needed. Note however
that there is ongoing research on this topic, see e.g. [ACTQMGMT] and
[AQMROUTER].
Additional parameters may be added in an enterprise MIB module, e.g. by Additional parameters may be added in an enterprise MIB module, e.g. by
using AUGMENTS on this table, to handle aspects of random drop using AUGMENTS on this table, to handle aspects of random drop
algorithms that are not standardised here. algorithms that are not standardised here.
NOTE: Deterministic Droppers can be viewed as a special case of Random NOTE: Deterministic Droppers can be viewed as a special case of Random
Droppers with the drop probability restricted to 0 and 1. Hence Droppers with the drop probability restricted to 0 and 1. Hence
Deterministic Droppers might be described by a Random Dropper with Pmin Deterministic Droppers might be described by a Random Dropper with Pmin
= 0, Pmax = 1, Qmin = Qmax = Qclip, the averaged queue length at which = 0, Pmax = 1, Qmin = Qmax = Qclip, the averaged queue length at which
dropping occurs. dropping occurs.
3.4.3. Queues and Schedulers 3.5.3. Queues and Schedulers
The Queue Table models simple FIFO queues, as described in [MODEL] The Queue Table models simple FIFO queues, as described in [MODEL]
section 7.1.1. The Scheduler Table allows flexibility in constructing section 7.1.1. The Scheduler Table allows flexibility in constructing
both simple and somewhat more complex queueing hierarchies from those both simple and somewhat more complex queueing hierarchies from those
queues. Of course, since TCBs can be cascaded multiple times on an queues. Of course, since TCBs can be cascaded multiple times on an
interface, even more complex hierarchies can be constructed that way interface, even more complex hierarchies can be constructed that way
also. also.
The entries in the Queue Table have attributes which include a Queue Table entries are pointed at by the "next" attributes of the
specification of the scheduler which services the queue. They are upstream elements e.g. diffServMeterSucceedNext. Note that multiple
pointed at by the "next" attributes of the upstream elements e.g. upstream elements may direct their traffic to the same Queue Table
diffServMeterSucceedNext. Note that multiple upstream elements may entry. For example, the Assured Forwarding PHB suggests that all traffic
direct their traffic to the same Queue Table entry. For example, the marked AF11, AF12 or AF13 be placed in the same queue, after metering,
Assured Forwarding PHB suggests that all traffic marked AF11, AF12 or without reordering. This would be represented by having the
AF13 be placed in the same queue, after metering, without reordering. diffServMeterSucceedNext of each upstream meter point at the same entry
This would be represented by having the diffServMeterSucceedNext of each in the Queue Table.
upstream meter point at the same entry in the Queue Table.
The Scheduler Table represented in this MIB module contains entries, Notice Queue Table and Scheduler Table entries are for data path
each of which represents the algorithm in use for servicing the one or description, they both uses Scheduler Parameterization Table entries for
more queues that feed it. The [MODEL] section 7.1.2 describes a diffserv treatment parameterization.
scheduler with multiple inputs: this is represented in the MIB by
including the scheduling parameters associated with a scheduler input in
the Queue Table entry that feeds it and having that point at one
particular Scheduler Table entry. In this way, sets of Queues can be
grouped together as inputs to the same Scheduler. This table serves to
represent the example scheduler described in the [MODEL]: other more
complex representations might be created outside of this MIB.
Each scheduler input, as represented by a Queue Table entry, is assigned Queue Table entries specify the scheduler it wants service from by use
a priority with respect to all the other inputs feeding the same of its Next pointer.
scheduler. A higher-priority input will be serviced first over a lower-
priority input, assuming that all guarantees have already been met. Each Scheduler Table entry represents the algorithm in use for servicing
This priority parameter, used on its own with default values for the the one or more queues that feed it. The [MODEL] section 7.1.2 describes
other parameters, serves to allow representation of a Strict Priority a scheduler with multiple inputs: this is represented in the MIB by
scheduler. having the scheduling parameters be associated with each input. In this
way, sets of Queues can be grouped together as inputs to the same
Scheduler. This table serves to represent the example scheduler
described in the [MODEL]: other more complex representations might be
created outside of this MIB.
Scheduler Parameter Table entries are used to parameterized each input
that feeds into a scheduler. The inputs can be a mixture of Queue Table
and Scheduler Table entries. Scheduler Parameter Table entries can be
used/reused by one or more Queue and/or Scheduler Table entries.
For representing a Strict Priority scheduler, each scheduler input is
assigned a priority with respect to all the other inputs feeding the
same scheduler, with default values for the other parameters. A
higher-priority input will be serviced first over a lower-priority
input, assuming that all guarantees have already been met.
For Weighted Queueing algorithms e.g. WFQ, WRR, the "weight" of a given For Weighted Queueing algorithms e.g. WFQ, WRR, the "weight" of a given
scheduler input is represented with a Minimum Service Rate leaky-bucket scheduler input is represented with a Minimum Service Rate leaky-bucket
profile which provides guaranteed bandwidth to that input, if required. profile which provides guaranteed bandwidth to that input, if required.
This is represented, as were token-bucket meters, by a rate This is represented, as were token-bucket meters, by a rate
diffServQueueMinRateAbs and a burst size diffServQueueMinBurstSize. The diffServSchdParamMinRateAbs. The rate may, alternatively, be represented
rate may, alternatively, be represented by a relative value, as a by a relative value, as a fraction of the interface's current line rate,
diffServSchdParamMinRateRel to assist in cases where line rates are
fraction of the interface's current line rate, diffServQueueMinRateRel variable or where a higher-level policy might be expressed in terms of
to assist in cases where line rates are variable or where a higher-level fractions of network resources. The two rate parameters are inter-
policy might be expressed in terms of fractions of network resources. related and changes in one may be reflected in the other.
The two rate parameters are inter-related and changes in one may be
reflected in the other.
An input may also be capable of acting as a non-work-conserving [MODEL] An input may also be capable of acting as a non-work-conserving [MODEL]
traffic shaper: this is done by defining a Maximum Service Rate leaky- traffic shaper: this is done by defining a Maximum Service Rate leaky-
bucket profile in order to limit the scheduler bandwidth available to bucket profile in order to limit the scheduler bandwidth available to
that input. This is represented, similarly to the minimum rate, by a that input. This is represented, similarly to the minimum rate, by a
rate diffServQueueMaxRateAbs and a burst size diffServQueueMaxBurstSize. rate diffServSchdParamMaxRateAbs. The rate may, alternatively, be
The rate may, alternatively, be represented by a relative value, as a represented by a relative value, as a fraction of the interface's
fraction of the interface's current line rate, diffServQueueMaxRateRel. current line rate, diffServSchdParamMaxRateRel.
3.4.4. Example of Algorithmic Droppers, Queues and Schedulers Notice hierarchical schedulers can be parameterized using this MIB by
having Scheduler Table entries feeds into Scheduler Table entry.
3.5.4. Example of Algorithmic Droppers, Queues and Schedulers
As an example, the hypothetical queue/scheduler configuration shown in As an example, the hypothetical queue/scheduler configuration shown in
[MODEL] section 8.1 is shown in Table 1. [MODEL] section 8.1 is shown in Table 1.
Queues 1 and 3 are serviced for long enough to give them their promised
bandwidths and burst sizes, if they need them. Queue 2 is then serviced
up to its maximum limit profile. Only then does Queue 4 get an
opportunity to send its traffic. As an example of the use of the MIB
structures, Figure 2 shows how the example would be represented.
QId MinRate MaxRate Priority Scheduler QId MinRate MaxRate Priority Scheduler
--- ---------------- ---------------- -------- --------- --- ---------------- ---------------- -------- ---------
1 100kbps/20kbyte none/none 20 Scheduler.1 1 100kbps/20kbyte none/none 20 Scheduler.1
2 none/none 100kbps/100kbyte 40 Scheduler.1 2 none/none 100kbps/100kbyte 40 Scheduler.1
3 200kbps/20kbyte none/none 20 Scheduler.1 3 200kbps/20kbyte none/none 20 Scheduler.1
4 none/none none/none 10 Scheduler.1 4 none/none none/none 10 Scheduler.1
SchedId Type SchedId Type
------- ------------------ ------- ------------------
1 weightedRoundRobin 1 weightedRoundRobin
Table 1: Example Queue and Scheduler Parameters Table 1: Example Queue and Scheduler Parameters
Queues 1 and 3 are serviced for long enough to give them their promised
bandwidths and burst sizes, if they need them. Queue 2 is then serviced
up to its maximum limit profile. Only then does Queue 4 get an
opportunity to send its traffic. As an example of the use of the MIB
structures, Figure 2 shows how the example would be represented.
+-----------+ +-----------+
----------------------->| Next -----+ ----------------------->| Next -----+
| Min=Profl4| | | Min=Profl4| |
| Max=none | | | Max=none | |
| Pri=20 | | | Pri=20 | |
| Type=fifo | | | Type=fifo | |
+-----------+ | +-----------+ |
Queue.ifIndex.1 | Queue.1 |
| |
+-----------+ +-----------+ | +-----------+ +-----------+ |
--->| Next -----+--->| Next ------+ --->| Next -----+--->| Next ------+
| Thresh=1k | | | Min=none | | | Thresh=1k | | | Min=none | |
| Measure -----+ | Max=Profl5| | | Measure -----+ | Max=Profl5| |
| Type=Tail | | Pri=40 | | | Type=Tail | | Pri=40 | |
| Spec=none | | Type=fifo | | +----------+ | Spec=none | | Type=fifo | | +----------+
+-----------+ +-----------+ +--->| Next -----> 0.0 +-----------+ +-----------+ +--->| Next -----> 0.0
Dropper.1 Queue.ifIndex.2 | | Algrm=wrr| or next TCB Dropper.1 Queue.2 | | Algrm=wrr| or next TCB
| +----------+ | +----------+
+-----------+ +-----------+ | Scheduler.ifIndex.1 +-----------+ +-----------+ | Scheduler.1
--->| Next -----+--->| Next -----+ --->| Next -----+--->| Next -----+
| Thresh=2k | | | Min=Profl3| | | Thresh=2k | | | Min=Profl3| |
| Measure -----+ | Max=none | | | Measure -----+ | Max=none | |
| Type=Tail | | Pri=20 | | | Type=Tail | | Pri=20 | |
| Spec=none | | Type=fifo | | | Spec=none | | Type=fifo | |
+-----------+ +-----------+ | +-----------+ +-----------+ |
Dropper.2 Queue.ifIndex.3 | Dropper.2 Queue.3 |
| |
+-----------+ +-----------+ | +-----------+ +-----------+ |
--->| Next ------+--->| Next -----+ --->| Next ------+--->| Next -----+
| Thresh=4k | | | Min=none | | Thresh=4k | | | Min=none |
| Measure -----+ | Max=none | | Measure -----+ | Max=none |
| Type=Tail | | Pri=10 | | Type=Tail | | Pri=10 |
| Spec=none | | Type=fifo | | Spec=none | | Type=fifo |
+-----------+ +-----------+ +-----------+ +-----------+
Dropper.3 Queue.ifIndex.4 Dropper.3 Queue.4
Figure 2: Example of the use of Queueing elements Figure 2: Example of the use of Queueing elements
4. Conventions used in this MIB 4. MIB Usage Example
4.1. The use of RowPointer This section provides some examples on how the different table entries
of this MIB may be used to parameterize a DiffServ Device. For the
figures, all the MIB table entry and attribute names assumes to have
"diffServ" as their first common initial part of name, with the table
entry name assumed to be their second common initial part of name.
+---------------------+
|DataPath |
| ifIndex=1 |
| IfDirection=Ingress | +------+
| Start --------------+--->|Clfr |
+---------------------+ | Id=1 |
+------+
+------------+ +--------------+ +-----------+
|ClfrElement | +-->|Meter | +-->|Action |
| Id=101 | | | Id=101 | | | Id=101 |
| ClfrId=1 | | | SucceedNext -+--+ | Next -----+---->...
| Order=NA | | | FailNext ----+->... | Specific -+-+
| Next ------+--+ | Specific -+ | | Type=Spcf | |
| Specific --+-+ +-----------+--+ +-----------+ |
+------------+ | | +-------+
| +-------+ | +--------+ | +-----------+
+-->|Filter1| +-->|TBMeter1| +-->|CounterAct1|
+-------+ +--------+ +-----------+
+------------+ +--------------+ +-----------+
|ClfrElement | +-->|Meter | +-->|Action |
| Id=102 | | | Id=102 | | | Id=102 |
| ClfrId=1 | | | SucceedNext -+--+ | Next -----+---->...
| Order=NA | | | FailNext ----+->... | Specific -+-+
| Next ------+--+ | Specific -+ | | Type=Spcf | |
| Specific --+-+ +-----------+--+ +-----------+ |
+------------+ | | +-------+
| +-------+ | +--------+ | +-----------+
+-->|Filter2| +-->|TBMeter2| +-->|CounterAct2|
+-------+ +--------+ +-----------+
+------------+ +--------------+ +-----------+
|ClfrElement | +-->|Meter | +-->|Action |
| Id=103 | | | Id=103 | | | Id=103 |
| ClfrId=1 | | | SucceedNext -+--+ | Next -----+---->...
| Order=NA | | | FailNext ----+->... | Specific -+-+
| Next ------+--+ | Specific -+ | | Type=Spcf | |
| Specific --+-+ +-----------+--+ +-----------+ |
+------------+ | | +-------+
| +-------+ | +--------+ | +-----------+
+-->|Filter3| +-->|TBMeter3| +-->|CounterAct3|
+-------+ +--------+ +-----------+
Figure 3: Data Path Example Part 1
+-------------+ +------------------+ +----------------------+
---->|Q | +->|Scheduler | +->|Scheduler |
| Id=EF | | | Id=DiffServ | | | Id=Shaping |
| Next -------+---+ | Next ------------+--+ | Next=zeroDotZero |
| SchdParam -+| | | Method=priorityq | | Method=priorityq |
+------------++ | | SchdParam -+ | | SchdParam=zeroDotZero|
| | +------------+-----+ +----------------------+
+------------+ | |
| | +------------+
| +-----------+ | |
+->|SchdParamEF| | | +----------------+
+-----------+ | +->|SchdParamShaping|
| +----------------+
|
|
+-----------------------------------------+
|
|
+----------------+ +-------------+ |
--->|AlgDrop | +->|Q | |
| Id=AF11 | | | Id=AF1X | +-------------+ |
| Type=randomDrop| | | Next -------+--->|Scheduler | |
| Next ----------+-+--+ | SchdParam -+| | Id=AF | |
| QMeasure ------+-+ | +------------++ | Next -------+--+
| QThreshold | | | | Method=wfq |
| Specific -+ | | +------------+ | SchdParam -+|
+-----------+----+ | | +------------++
| | | +-------------+ |
+-----------+ | +->|SchdParamAF1X| +------------+
| +--------------+ | +-------------+ |
+->|RandomDropAF11| | | +-----------+
+--------------+ | +->|SchdParamAF|
| +-----------+
+----------------+ |
--->|AlgDrop | |
| Id=AF12 | |
| Type=randomDrop| |
| Next ----------+-+--+
| QMeasure ------+-+
| QThreshold |
| Specific -+ |
+-----------+----+
|
+-----------+
| +--------------+
+->|RandomDropAF12|
+--------------+
Figure 4: Data Path Example Part 2
4.1. Data Path and Classifier Example Discussion
The example in Figure 4 shows a single DataPathTable entry feeding into
a single Classifier entry, with three ClfrElement and Filter Table entry
pairs belonging to this Classifier 1. Notice the three Filters used
here must completely classify all the traffic presented to this data
path.
Another level of classification can be defined that follows the Action
function datapath elements in Figure 3. This second level of
classifiers and their subsequent function datapath elements would be
considered as in another TCB.
This multi-level classification allow the construction of traffic
seperations like:
if (dept1)
{
if (appl1) then take dept1-appl1-action.
if (appl2) then take dept1-appl2-action.
if (appl3) then take dept1-appl3-action.
}
if (dept2)
{
if (appl1) then take dept2-appl1-action.
if (appl2) then take dept2-appl2-action.
if (appl3) then take dept2-appl3-action.
}
if (dept3)
{
if (appl1) then take dept3-appl1-action.
if (appl2) then take dept3-appl2-action.
if (appl3) then take dept3-appl3-action.
}
The filters for appl1, appl2, appl3 may be reused for the above setup.
4.2. Meter and Action Example Discussion
A simple Meter that can be parameterized by a single TBMeter entry is
shown here. For Metering types that require mutliple TBMeter entries
for parameterization, a second level Meter and TBMeter table entries may
be used. For example, for trTCM, with the first level TBMeter entry
used for Peak Information Token Bucket, the first level SucceedNext
points to the second level Meter entry, with second level TBMeter entry
used for Committed Information Token Bucket.
Notice the CountAct Action is shown in Figure 3. This is purposely done
to indicate all datapaths should have at least one CountAct Action.
Other actions can be pointed to by the Next pointer of the CountAct
action, like DSCPMarkAct action.
4.3. Queue and Scheduler Example Discussion
Example in Figure 4 shows three classified input traffic streams, EF,
AF11, and AF12, feeding into their respective queue and algorithmic
droppers. After their respective dropping process, the AF traffic
streams feed into the same queue, QAF1X.
A Scheduler, AF, is shown in Figure 4, as the sink for AF1X queue
traffic, servicing AF1X queue with scheduling parameters indicated by
SchdParamAF1X. This scheduler is used to service traffic from AF1X,
AF2X, AF3X queues using weighted fair queueing method. The AF2X and
AF3X queues are not shown in Figure 4, they can be very much like AF1X
queue setup.
Another traffic stream, EF, is handled by the EF queue. Scheduler
DiffServ services output of EF queue using SchdParamEF, and output of AF
scheduler using SchdParamAF, with Weighted Fair Queueing method.
Notice all the diffserv traffic may go out on a link with traffic
shaping. The traffic shaping can be parameterize using the Shaping
Scheduler in Figure 4. For shaping, the diffServSchdParamMaxRate
attributes should be used. The output of the Shaping Scheduler is
indicated using its Next pointer with value of zeroDotZero, the output
port.
5. Conventions used in this MIB
5.1. The use of RowPointer
RowPointer is a textual convention used to identify a conceptual row in RowPointer is a textual convention used to identify a conceptual row in
an SNMP Table by pointing to one of its objects. In this MIB, it is used an SNMP Table by pointing to one of its objects. In this MIB, it is used
in two ways: to indicate indirection and to indicate succession. in two ways: to indicate indirection and to indicate succession.
When used for indirection as in the diffServClassifierTable, the idea is When used for indirection as in the diffServClassifierTable, the idea is
to allow other MIBs, including proprietary ones, to define new and to allow other MIBs, including proprietary ones, to define new and
arcane classifiers - MAC headers, IPv4 and IPv6 headers, BGP Communities arcane classifiers - MAC headers, IPv4 and IPv6 headers, BGP Communities
and all sorts of other things - whilst still utilising the structures of and all sorts of other things - whilst still utilising the structures of
this MIB. This is a form of class inheritance (in "object oriented" this MIB. This is a form of class inheritance (in "object oriented"
skipping to change at page 14, line 42 skipping to change at page 22, line 32
the agent as if it were operationally deactivated. For example, if an the agent as if it were operationally deactivated. For example, if an
Action element has a dangling diffServActionNext RowPointer that does Action element has a dangling diffServActionNext RowPointer that does
not point to an existent table entry (and is not zeroDotZero), then none not point to an existent table entry (and is not zeroDotZero), then none
of the subsequent elements in that particular chain should have any of the subsequent elements in that particular chain should have any
effect on the traffic proceeding down this chain and the Classification effect on the traffic proceeding down this chain and the Classification
or Meter element which lead to this Action element is not considered to or Meter element which lead to this Action element is not considered to
be active. Other parts of the device configuration remain in effect, of be active. Other parts of the device configuration remain in effect, of
course, but this rule simply removes all ambiguity from the operational course, but this rule simply removes all ambiguity from the operational
system. system.
4.2. Conceptual row creation and deletion 5.2. Conceptual row creation and deletion
A number of conceptual tables defined in this MIB use as an index an A number of conceptual tables defined in this MIB use as an index an
arbitrary integer value, unique across the scope of the agent. In order arbitrary integer value, unique across the scope of the agent. In order
to help with multi-manager row-creation problems, a mechanism must be to help with multi-manager row-creation problems, a mechanism must be
provided to allow a manager to obtain unique values for such an index provided to allow a manager to obtain unique values for such an index
and to ensure that, when used, the manager knows whether it got what it and to ensure that, when used, the manager knows whether it got what it
wanted or not. wanted or not.
Typically, such a table has an associated NextFree variable e.g. Typically, such a table has an associated NextFree variable e.g.
diffServClassifierNextFree which provides a suitable value for the index diffServClassifierNextFree which provides a suitable value for the index
skipping to change at page 15, line 16 skipping to change at page 23, line 4
diffServClassifierNextFree which provides a suitable value for the index diffServClassifierNextFree which provides a suitable value for the index
of the next row to be created e.g. diffServClassifierId. A special of the next row to be created e.g. diffServClassifierId. A special
value, 0, is used to indicate that no more entries can be created by the value, 0, is used to indicate that no more entries can be created by the
agent. The table also has a columnar Status attribute with RowStatus agent. The table also has a columnar Status attribute with RowStatus
syntax [6]. syntax [6].
If a manager attempts to create a conceptual row in the table (by a SET If a manager attempts to create a conceptual row in the table (by a SET
operation that contains a varbind setting the Status to a value of operation that contains a varbind setting the Status to a value of
either createAndGo or createAndWait) and if the agent has sufficient either createAndGo or createAndWait) and if the agent has sufficient
resources and has no other conceptual row with the same indices, the resources and has no other conceptual row with the same indices, the
agent will create the row and return success. If the agent has agent will create the row and return success. If the agent has
insufficient resources or such a row is already existent then it returns insufficient resources or such a row is already existent then it returns
an error. A manager must be prepared to try again in such circumstances, an error. A manager must be prepared to try again in such circumstances,
probably by re-reading the NextFree to obtain a new index value in case probably by re-reading the NextFree to obtain a new index value in case
a second manager had got in between the first manager's read of the a second manager had got in between the first manager's read of the
NextFree value and the first manager's row-creation attempt. The use of NextFree value and the first manager's row-creation attempt. The use of
RowStatus is covered in more detail in [6]. RowStatus is covered in more detail in [6].
5. Editorial information 6. Editorial information
<this section will be removed before publication> <this section will be removed before publication>
5.1. Open Issues resolved in previous drafts 6.1. Open Issues resolved in previous drafts
(0) Terminology is more in line with [MODEL], [POLTERM] and [DSTERM]. (0) Terminology is more in line with [MODEL], [POLTERM] and [DSTERM].
Discarder -> "Algorithmic Dropper", "Monitor" -> "Counter" Discarder -> "Algorithmic Dropper", "Monitor" -> "Counter"
"Classifier element" -> "Filter" "Classifier element" -> "Filter"
(1) Cascaded token-buckets is not equivalent to multi-rate token- (1) Cascaded token-buckets is not equivalent to multi-rate token-
bucket: do we need to fix this by allowing a multi-rate TB in the bucket: do we need to fix this by allowing a multi-rate TB in the
MIB? Or, by defining cascaded buckets to mean "multi-rate". (assume MIB? Or, by defining cascaded buckets to mean "multi-rate". (assume
the latter - see text in 2.3) the latter - see text in 2.3)
skipping to change at page 17, line 36 skipping to change at page 25, line 23
direction (allowed by the model) then we do not have a way to direction (allowed by the model) then we do not have a way to
indicate "this is the 1st one". Moreover, it is a somewhat indicate "this is the 1st one". Moreover, it is a somewhat
convoluted process to then find the 2nd, 3rd etc. ones - you would convoluted process to then find the 2nd, 3rd etc. ones - you would
have to follow the RowPointers to get there: should we explicitly have to follow the RowPointers to get there: should we explicitly
have an index to enable/help these lookup operations? Note: this is have an index to enable/help these lookup operations? Note: this is
not the same issue as needing a "precedence" for each filter entry not the same issue as needing a "precedence" for each filter entry
of a classifier (yes - added another index to classifiers to of a classifier (yes - added another index to classifiers to
represent what TCB they operate at for a given represent what TCB they operate at for a given
interface/direction). interface/direction).
5.2. Open Issues resolved in this draft 6.2. Open Issues resolved in this draft
(13) Droppers: slight change to previous resolution. MIB can now handle (13) Droppers: slight change to previous resolution. MIB can now handle
tail/head/random drop using diffServAlgDropTable and tail/head/random drop using diffServAlgDropTable and
diffServRandomDropTable. diffServRandomDropTable.
(18) Should manager be allowed to create Queue elements or should agent (18) Should manager be allowed to create Queue elements or should agent
be in control of this? (the former) be in control of this? (the former)
(19) Should manager be allowed to create Scheduler elements or should (19) Should manager be allowed to create Scheduler elements or should
agent be in control of this? (the former) agent be in control of this? (the former)
skipping to change at page 18, line 38 skipping to change at page 26, line 26
classification information in order to do their job? If a classification information in order to do their job? If a
Classifier is needed then create a new TCB for it at the point just Classifier is needed then create a new TCB for it at the point just
before the dropper: use ordinary Classifier elements in this TCB. before the dropper: use ordinary Classifier elements in this TCB.
(28) Indexing of table entries and uniqueness hints: is TestAndIncr the (28) Indexing of table entries and uniqueness hints: is TestAndIncr the
correct tool to use? (no: RowStatus is the right tool for ensuring correct tool to use? (no: RowStatus is the right tool for ensuring
uniqueness; use a NextFree variable as a hint). uniqueness; use a NextFree variable as a hint).
(32) Miscellaneous clarifications - thanks Bob. (32) Miscellaneous clarifications - thanks Bob.
5.3. Still Open Issues 6.3. Still Open Issues
(16) Should the creation of counter actions be under the control of (16) Should the creation of counter actions be under the control of
manager or agent: should a diffServActionEntry and manager or agent: should a diffServActionEntry and
diffServCountActEntry appear by magic (does the agent know what diffServCountActEntry appear by magic (does the agent know what
counters it can and cannot maintain on a given interface)? (no) If counters it can and cannot maintain on a given interface)? (no) If
no, should diffServCountActEntry appear magically when a no, should diffServCountActEntry appear magically when a
diffServAction element is created which points at the diffServAction element is created which points at the
diffServCountActTable (then would be no need for diffServCountActTable (then would be no need for
diffServCountActStatus)? (no) diffServCountActStatus)? (no)
skipping to change at page 19, line 33 skipping to change at page 27, line 21
e.g. diffServMeterSpecific, diffServActionSpecific, e.g. diffServMeterSpecific, diffServActionSpecific,
diffServAlgDropSpecific. If this is a RowPointer and points to the diffServAlgDropSpecific. If this is a RowPointer and points to the
associated row in the daughter's table, there is redundant associated row in the daughter's table, there is redundant
information which gives scope for additional error cases. So, information which gives scope for additional error cases. So,
wherever possible, should we remove this redundant information by wherever possible, should we remove this redundant information by
making the "Specific" attribute point only to the base of the making the "Specific" attribute point only to the base of the
daughter table and make it an OBJECT IDENTIFIER? The con is that daughter table and make it an OBJECT IDENTIFIER? The con is that
this is an unusual use of MIB pointers (point at table base, not this is an unusual use of MIB pointers (point at table base, not
individual entries). individual entries).
6. MIB Definition 7. MIB Outline
The authors think a MIB outline will assist the reader and can be used
as a quick reference.
diffServMIBObjects OBJECT IDENTIFIER ::= { diffServMib 1 }
diffServMIBConformance OBJECT IDENTIFIER ::= { diffServMib 2 }
diffServDataPath OBJECT IDENTIFIER ::= { diffServMIBObjects 1 }
diffServDataPathTable OBJECT-TYPE
::= { diffServDataPath 1 }
diffServDataPathEntry OBJECT-TYPE
INDEX { ifIndex, diffServDataPathIfDirection }
::= { diffServDataPathTable 1 }
DiffServDataPathEntry ::= SEQUENCE {
diffServDataPathIfDirection IfDirection,
diffServDataPathStart RowPointer,
diffServDataPathStatus RowStatus
}
diffServClassifier OBJECT IDENTIFIER ::= { diffServMIBObjects 2 }
diffServClfrNextFree OBJECT-TYPE
::= { diffServClassifier 1 }
diffServClfrTable OBJECT-TYPE
::= { diffServClassifier 2 }
diffServClfrEntry OBJECT-TYPE
INDEX { diffServClfrId }
::= { diffServClfrTable 1 }
DiffServClfrEntry ::= SEQUENCE {
diffServClfrId Unsigned32,
diffServClfrStatus RowStatus
}
diffServClfrElementNextFree OBJECT-TYPE
::= { diffServClassifier 3 }
diffServClfrElementTable OBJECT-TYPE
::= { diffServClassifier 4 }
diffServClfrElementEntry OBJECT-TYPE
INDEX { diffServClfrElementClfrId, diffServClfrElementId }
::= { diffServClfrElementTable 1 }
DiffServClfrElementEntry ::= SEQUENCE {
diffServClfrElementId Unsigned32,
diffServClfrElementClfrId Unsigned32,
diffServClfrElementOrder Unsigned32,
diffServClfrElementNext RowPointer,
diffServClfrElementSpecific RowPointer,
diffServClfrElementStatus RowStatus
}
diffServSixTupleClfrNextFree OBJECT-TYPE
::= { diffServClassifier 5 }
diffServSixTupleClfrTable OBJECT-TYPE
::= { diffServClassifier 6 }
diffServSixTupleClfrEntry OBJECT-TYPE
INDEX { diffServSixTupleClfrId }
::= { diffServSixTupleClfrTable 1 }
DiffServSixTupleClfrEntry ::= SEQUENCE {
diffServSixTupleClfrId Unsigned32,
diffServSixTupleClfrDstAddrType InetAddressType,
diffServSixTupleClfrDstAddr InetAddress,
diffServSixTupleClfrDstAddrMask Unsigned32,
diffServSixTupleClfrSrcAddrType InetAddressType,
diffServSixTupleClfrSrcAddr InetAddress,
diffServSixTupleClfrSrcAddrMask Unsigned32,
diffServSixTupleClfrDscp Dscp,
diffServSixTupleClfrProtocol Unsigned32,
diffServSixTupleClfrDstL4PortMin SixTupleClfrL4Port,
diffServSixTupleClfrDstL4PortMax SixTupleClfrL4Port,
diffServSixTupleClfrSrcL4PortMin SixTupleClfrL4Port,
diffServSixTupleClfrSrcL4PortMax SixTupleClfrL4Port,
diffServSixTupleClfrStatus RowStatus
}
diffServMeter OBJECT IDENTIFIER ::= { diffServMIBObjects 3 }
diffServMeterNextFree OBJECT-TYPE
::= { diffServMeter 1 }
diffServMeterTable OBJECT-TYPE
::= { diffServMeter 2 }
diffServMeterEntry OBJECT-TYPE
INDEX { diffServMeterId }
::= { diffServMeterTable 1 }
DiffServMeterEntry ::= SEQUENCE {
diffServMeterId Unsigned32,
diffServMeterSucceedNext RowPointer,
diffServMeterFailNext RowPointer,
diffServMeterSpecific RowPointer,
diffServMeterStatus RowStatus
}
diffServTBMeterNextFree OBJECT-TYPE
::= { diffServMeter 3 }
diffServTBMeterTable OBJECT-TYPE
::= { diffServMeter 4 }
diffServTBMeterEntry OBJECT-TYPE
INDEX { diffServTBMeterId }
::= { diffServTBMeterTable 1 }
DiffServTBMeterEntry ::= SEQUENCE {
diffServTBMeterId Unsigned32,
diffServTBMeterType INTEGER,
diffServTBMeterRate Unsigned32,
diffServTBMeterBurstSize BurstSize,
diffServTBMeterInterval Unsigned32,
diffServTBMeterStatus RowStatus
}
diffServAction OBJECT IDENTIFIER ::= { diffServMIBObjects 4 }
diffServActionNextFree OBJECT-TYPE
::= { diffServAction 1 }
diffServActionTable OBJECT-TYPE
::= { diffServAction 2 }
diffServActionEntry OBJECT-TYPE
INDEX { diffServActionId }
::= { diffServActionTable 1 }
DiffServActionEntry ::= SEQUENCE {
diffServActionId Unsigned32,
diffServActionNext RowPointer,
diffServActionSpecific RowPointer,
diffServActionType INTEGER,
diffServActionStatus RowStatus
}
diffServDscpMarkActNextFree OBJECT-TYPE
::= { diffServAction 3 }
diffServDscpMarkActTable OBJECT-TYPE
::= { diffServAction 4 }
diffServDscpMarkActEntry OBJECT-TYPE
INDEX { diffServDscpMarkActId }
::= { diffServDscpMarkActTable 1 }
DiffServDscpMarkActEntry ::= SEQUENCE {
diffServDscpMarkActId Unsigned32,
diffServDscpMarkActDscp Dscp,
diffServDscpMarkActStatus RowStatus
}
diffServCountActNextFree OBJECT-TYPE
::= { diffServAction 5 }
diffServCountActTable OBJECT-TYPE
::= { diffServAction 6 }
diffServCountActEntry OBJECT-TYPE
INDEX { diffServCountActId }
::= { diffServCountActTable 1 }
DiffServCountActEntry ::= SEQUENCE {
diffServCountActId Unsigned32,
diffServCountActOctets Counter32,
diffServCountActHCOctets Counter64,
diffServCountActPkts Counter32,
diffServCountActHCPkts Counter64,
diffServCountActDiscontTime TimeStamp,
diffServCountActStatus RowStatus
}
diffServAlgDrop OBJECT IDENTIFIER ::= { diffServMIBObjects 5 }
diffServAlgDropNextFree OBJECT-TYPE
::= { diffServAlgDrop 1 }
diffServAlgDropTable OBJECT-TYPE
::= { diffServAlgDrop 2 }
diffServAlgDropEntry OBJECT-TYPE
INDEX { diffServAlgDropId }
::= { diffServAlgDropTable 1 }
DiffServAlgDropEntry ::= SEQUENCE {
diffServAlgDropId Unsigned32,
diffServAlgDropType INTEGER,
diffServAlgDropNext RowPointer,
diffServAlgDropQMeasure RowPointer,
diffServAlgDropQThreshold Unsigned32,
diffServAlgDropSpecific RowPointer,
diffServAlgDropOctets Counter32,
diffServAlgDropHCOctets Counter64,
diffServAlgDropPkts Counter32,
diffServAlgDropHCPkts Counter64,
diffServAlgDropStatus RowStatus
}
diffServRandomDropNextFree OBJECT-TYPE
::= { diffServAlgDrop 3 }
diffServRandomDropTable OBJECT-TYPE
::= { diffServAlgDrop 4 }
diffServRandomDropEntry OBJECT-TYPE
INDEX { diffServRandomDropId }
::= { diffServRandomDropTable 1 }
DiffServRandomDropEntry ::= SEQUENCE {
diffServRandomDropId Unsigned32,
diffServRandomDropMinThreshBytes Unsigned32,
diffServRandomDropMinThreshPkts Unsigned32,
diffServRandomDropMaxThreshBytes Unsigned32,
diffServRandomDropMaxThreshPkts Unsigned32,
diffServRandomDropInvProbMax Unsigned32,
diffServRandomDropInvWeight Unsigned32,
diffServRandomDropSamplingRate Unsigned32,
diffServRandomDropStatus RowStatus
}
diffServQueue OBJECT IDENTIFIER ::= { diffServMIBObjects 6 }
diffServQNextFree OBJECT-TYPE
::= { diffServQueue 1 }
diffServQTable OBJECT-TYPE
::= { diffServQueue 2 }
diffServQEntry OBJECT-TYPE
INDEX { diffServQId }
::= { diffServQTable 1 }
DiffServQEntry ::= SEQUENCE {
diffServQId Unsigned32,
diffServQNext RowPointer,
diffServQSchdParam RowPointer,
diffServQStatus RowStatus
}
diffServScheduler OBJECT IDENTIFIER ::= { diffServMIBObjects 7 }
diffServSchedulerNextFree OBJECT-TYPE
::= { diffServScheduler 1 }
diffServSchedulerTable OBJECT-TYPE
::= { diffServScheduler 2 }
diffServSchedulerEntry OBJECT-TYPE
INDEX { diffServSchedulerId }
::= { diffServSchedulerTable 1 }
DiffServSchedulerEntry ::= SEQUENCE {
diffServSchedulerId Unsigned32,
diffServSchedulerNext RowPointer,
diffServSchedulerMethod INTEGER,
diffServSchedulerSchdParam RowPointer,
diffServSchedulerStatus RowStatus
}
diffServSchdParamNextFree OBJECT-TYPE
::= { diffServScheduler 3 }
diffServSchdParamTable OBJECT-TYPE
::= { diffServScheduler 4 }
diffServSchdParamEntry OBJECT-TYPE
INDEX { diffServSchdParamId }
::= { diffServSchdParamTable 1 }
DiffServSchdParamEntry ::= SEQUENCE {
diffServSchdParamId Unsigned32,
diffServSchdParamPriority Unsigned32,
diffServSchdParamMinRateAbs Unsigned32,
diffServSchdParamMinRateRel Unsigned32,
diffServSchdParamMaxRateAbs Unsigned32,
diffServSchdParamMaxRateRel Unsigned32,
diffServSchdParamStatus RowStatus
}
8. MIB Definition
DIFF-SERV-MIB DEFINITIONS ::= BEGIN DIFF-SERV-MIB DEFINITIONS ::= BEGIN
IMPORTS IMPORTS
Unsigned32, Counter32, Counter64, OBJECT-TYPE, Integer32, Unsigned32, Counter32, Counter64,
MODULE-IDENTITY, OBJECT-IDENTITY, zeroDotZero, mib-2 MODULE-IDENTITY, OBJECT-TYPE, zeroDotZero, mib-2
FROM SNMPv2-SMI FROM SNMPv2-SMI
TEXTUAL-CONVENTION, RowStatus, RowPointer, TimeStamp TEXTUAL-CONVENTION, RowStatus, RowPointer, TimeStamp
FROM SNMPv2-TC FROM SNMPv2-TC
MODULE-COMPLIANCE, OBJECT-GROUP MODULE-COMPLIANCE, OBJECT-GROUP
FROM SNMPv2-CONF FROM SNMPv2-CONF
ifIndex ifIndex
FROM IF-MIB FROM IF-MIB
InetAddressType, InetAddress InetAddressType, InetAddress
FROM INET-ADDRESS-MIB FROM INET-ADDRESS-MIB
BurstSize BurstSize
FROM INTEGRATED-SERVICES-MIB; FROM INTEGRATED-SERVICES-MIB;
diffServMib MODULE-IDENTITY diffServMib MODULE-IDENTITY
LAST-UPDATED "200007130000Z" LAST-UPDATED "200011030000Z"
ORGANIZATION "IETF Diffserv WG" ORGANIZATION "IETF Diffserv WG"
CONTACT-INFO CONTACT-INFO
" Brian Carpenter (co-chair of Diffserv WG) " Fred Baker
c/o iCAIR
1890 Maple Ave, #150
Evanston, IL 60201, USA
Phone: +1 847 467 7811
E-mail: brian@icair.org
Kathleen Nichols (co-chair of Diffserv WG)
Packet Design
E-mail: nichols@packetdesign.com
Fred Baker (author)
Cisco Systems Cisco Systems
519 Lado Drive 519 Lado Drive
Santa Barbara, CA 93111, USA Santa Barbara, CA 93111, USA
E-mail: fred@cisco.com E-mail: fred@cisco.com
Kwok Ho Chan (author) Kwok Ho Chan
Nortel Networks Nortel Networks
600 Technology Park Drive 600 Technology Park Drive
Billerica, MA 01821, USA Billerica, MA 01821, USA
E-mail: khchan@nortelnetworks.com E-mail: khchan@nortelnetworks.com
Andrew Smith
Andrew Smith (author)
E-mail: ah_smith@pacbell.net" E-mail: ah_smith@pacbell.net"
DESCRIPTION DESCRIPTION
"This MIB defines the objects necessary to manage a device that "This MIB defines the objects necessary to manage a
uses the Differentiated Services Architecture described in RFC device that uses the Differentiated Services Archi-
2475 and the Informal Management Model for DiffServ Routers in tecture described in RFC 2475 and the Informal
draft-ietf-diffserv-model-04.txt." Management Model for DiffServ Routers in draft-ietf-
REVISION "200007130000Z" diffserv-model-04.txt."
REVISION "200011030000Z"
DESCRIPTION DESCRIPTION
"Initial version, published as RFC xxxx." "Initial version, published as RFC xxxx."
::= { mib-2 12345 } -- anybody who uses this unassigned ::= { mib-2 12345 } -- anybody who uses this unassigned
-- number deserves the wrath of IANA -- number deserves the wrath of IANA
diffServObjects OBJECT IDENTIFIER ::= { diffServMib 1 } diffServMIBObjects OBJECT IDENTIFIER ::= { diffServMib 1 }
diffServTables OBJECT IDENTIFIER ::= { diffServMib 2 } diffServMIBConformance OBJECT IDENTIFIER ::= { diffServMib 2 }
diffServMIBConformance OBJECT IDENTIFIER ::= { diffServMib 3 }
-- These textual conventions have no effect on either the syntax -- These textual conventions have no effect on either the syntax
-- nor the semantics of any managed object. Objects defined -- nor the semantics of any managed object. Objects defined
-- using this convention are always encoded by means of the -- using this convention are always encoded by means of the
-- rules that define their primitive type. -- rules that define their primitive type.
Dscp ::= TEXTUAL-CONVENTION Dscp ::= TEXTUAL-CONVENTION
DISPLAY-HINT "d" DISPLAY-HINT "d"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The IP header Diffserv Code-Point that may be used for "The IP header Diffserv Code-Point that may be used
discriminating or marking a traffic stream. The value -1 is used for discriminating or marking a traffic stream. The
to indicate a wildcard i.e. any value." value -1 is used to indicate a wildcard i.e. any
SYNTAX INTEGER (-1 | 0..63) value."
SYNTAX Integer32 (-1 | 0..63)
SixTupleClfrL4Port ::= TEXTUAL-CONVENTION SixTupleClfrL4Port ::= TEXTUAL-CONVENTION
DISPLAY-HINT "d" DISPLAY-HINT "d"
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A value indicating a Layer-4 protocol port number." "A value indicating a Layer-4 protocol port number."
SYNTAX INTEGER (0..65535) SYNTAX Unsigned32 (0..65535)
IfDirection ::= TEXTUAL-CONVENTION IfDirection ::= TEXTUAL-CONVENTION
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Specifies a direction of data travel on an interface. 'inbound' "Specifies a direction of data travel on an inter-
traffic is operated on during reception from the interface, while face. 'inbound' traffic is operated on during recep-
'outbound' traffic is operated on prior to transmission on the tion from the interface, while 'outbound' traffic is
interface." operated on prior to transmission on the interface."
SYNTAX INTEGER { SYNTAX INTEGER {
inbound(1), -- ingress interface inbound(1), -- ingress interface
outbound(2) -- egress interface outbound(2) -- egress interface
} }
-- --
-- Data Path
--
diffServDataPath OBJECT IDENTIFIER ::= { diffServMIBObjects 1 }
--
-- Data Path Table
--
-- The Data Path Table enumerates the Differentiated Services
-- Data Paths within this device. Each entry in this table
-- is indexed by ifIndex and ifDirection. Each entry provides
-- the first diffserv functional datapath element to process data
-- flow for each specific datapath. This table should have two
-- entries for each interface on this device; ingress and egress.
--
-- Notice all diffserv functional datapath elements linked together
-- using their individual next pointers and anchored by an entry
-- of the diffServDataPathTable must belong to the same datapath.
-- The use of next pointer to point to diffserv functional datapath
-- element of a different datapath is not allowed.
--
diffServDataPathTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServDataPathEntry
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"The data path table defines the data paths in this
device. Each data path is defined by the interface
and traffic direction. The first diffserv functional
datapath element to handle traffic for this data path
is defined by a RowPointer, diffServDataPathStart, in
the entries of this table."
::= { diffServDataPath 1 }
diffServDataPathEntry OBJECT-TYPE
SYNTAX DiffServDataPathEntry
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"An entry in the data path table describes a single
diffserv datapath in this device."
INDEX { ifIndex, diffServDataPathIfDirection }
::= { diffServDataPathTable 1 }
DiffServDataPathEntry ::= SEQUENCE {
diffServDataPathIfDirection IfDirection,
diffServDataPathStart RowPointer,
diffServDataPathStatus RowStatus
}
diffServDataPathIfDirection OBJECT-TYPE
SYNTAX IfDirection
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"Specifies the direction for which this data path
entry applies on this interface."
::= { diffServDataPathEntry 1 }
diffServDataPathStart OBJECT-TYPE
SYNTAX RowPointer
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"This selects the first diffserv functional datapath
element to handle traffic for this data path. This
RowPointer should point to an instance of one of:
diffServClfrEntry
diffServMeterEntry
diffServActionEntry
diffServAlgDropEntry
diffServQEntry
A value of zeroDotZero in this attribute indicates no
further Diffserv treatment is performed on traffic of
this datapath.
If the row pointed to does not exist, this whole
diffserv datapath is ignored."
::= { diffServDataPathEntry 2 }
diffServDataPathStatus OBJECT-TYPE
SYNTAX RowStatus
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The RowStatus variable controls the activation,
deactivation, or deletion of a row/entry. Any writ-
able variable may be modified whether the row is
active or notInService."
::= { diffServDataPathEntry 3 }
--
-- Classifiers -- Classifiers
-- --
diffServClassifier OBJECT IDENTIFIER ::= { diffServMIBObjects 2 }
-- --
-- Classifier Table -- Classifier Table
-- --
-- Classifier allows multiple classifier elements, of same or different
-- types, to be used together.
-- A classifier must completely classify all packets presented to it,
-- this means all traffic handled by a classifier must match
-- at least one classifier element within the classifier,
-- with the classifier element parameters specified by a filter.
--
-- If there is ambiguity between classifier elements of different
-- classifier, the precedence is indicated by the order the classifiers
-- are linked, the first classifier in the link is applied to the
-- traffic first.
--
diffServClfrNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is
currently unused for a diffServClfrId instance. If a
configuring system attempts to create a new row in
the diffServClfrTable using this value, that opera-
tion will fail if the value has, in the meantime,
been used to create another row that is currently
valid."
::= { diffServClassifier 1 }
diffServClassifierTable OBJECT-TYPE diffServClfrTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServClassifierEntry SYNTAX SEQUENCE OF DiffServClfrEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The classifier table defines the classifiers that are applied to "This table enumerates all the diffserv classifier
traffic arriving at this interface in a particular direction. functional datapath elements of this device. The
Specific classifiers are defined by RowPointers in the entries of actual classification definitions are defined in
this table which identify entries in filter tables of specific diffServClfrElementTable entries belonging to each
types, e.g. Multi-Field Classifiers (MFCs) for IP are defined in classifier."
the diffServSixTupleClfrTable. Other classifier types may be
defined elsewhere."
REFERENCE REFERENCE
"[MODEL] section 4.1" "[MODEL] section 4.1"
::= { diffServTables 1 } ::= { diffServClassifier 2 }
diffServClassifierEntry OBJECT-TYPE diffServClfrEntry OBJECT-TYPE
SYNTAX DiffServClassifierEntry SYNTAX DiffServClfrEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the classifier table describes a single element of "An entry in the classifier table describes a single
the classifier." classifier. All classifier elements belonging to the
INDEX { ifIndex, diffServClassifierIfDirection, same classifier uses the classifier's diffServClfrId
diffServClassifierTcb, diffServClassifierId } in thier diffServClfrElementClfrId attribute."
::= { diffServClassifierTable 1 } INDEX { diffServClfrId }
::= { diffServClfrTable 1 }
DiffServClassifierEntry ::= SEQUENCE {
diffServClassifierIfDirection IfDirection,
diffServClassifierTcb Unsigned32,
diffServClassifierId Unsigned32,
diffServClassifierFilter RowPointer,
diffServClassifierNext RowPointer,
diffServClassifierPrecedence Unsigned32,
diffServClassifierStatus RowStatus
DiffServClfrEntry ::= SEQUENCE {
diffServClfrId Unsigned32,
diffServClfrStatus RowStatus
} }
diffServClassifierIfDirection OBJECT-TYPE diffServClfrId OBJECT-TYPE
SYNTAX IfDirection SYNTAX Unsigned32
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Specifies the direction for which this classifier entry applies "An index that enumerates the classifier entries. The
on this interface." set of such identifiers spans the whole agent.
::= { diffServClassifierEntry 1 } Managers should obtain new values for row creation in
this table by reading diffServClfrNextFree."
::= { diffServClfrEntry 1 }
diffServClassifierTcb OBJECT-TYPE diffServClfrStatus OBJECT-TYPE
SYNTAX RowStatus
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The RowStatus variable controls the activation,
deactivation, or deletion of a classifier. Any writ-
able variable may be modified whether the row is
active or notInService."
::= { diffServClfrEntry 2 }
--
-- 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 madeup
-- of one or more classifier elements.
--
diffServClfrElementNextFree OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is
currently unused for a diffServClfrElementId
instance. If a configuring system attempts to create
a new row in the diffServClfrElementTable using this
value, that opera- tion will fail if the value has,
in the meantime, been used to create another
row that is currently valid."
::= { diffServClassifier 3 }
diffServClfrElementTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServClfrElementEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Specifies the TCB of which this classifier element is a part. "The classifier element table enumerates the rela-
Lower numbers indicate an element that belongs to a classifier tionship between classification patterns and subse-
that is part of a TCB that is, at least conceptually, applied to quent downstream diffserv functional datapath ele-
traffic before those with higher numbers - this is necessary to ments. Classification parameters are defined by
resolve ambiguity in cases where different TCBs contain filters entries of filter tables pointed to by
that overlap with each other. diffServClfrElementSpecific. 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 defined in this MIB is diffServSixTu-
pleClfrTable, for IP Multi-Field Classifiers (MFCs).
Filter tables for other filter types may be defined
elsewhere."
REFERENCE
"[MODEL] section 4.1"
::= { diffServClassifier 4 }
A manager wanting to create a new TCB should either first search diffServClfrElementEntry OBJECT-TYPE
this table for existing entries and pick a value for this SYNTAX DiffServClfrElementEntry
variable that is not currently represented - some form of pseudo- MAX-ACCESS not-accessible
random choice is likely to minimise collisions. After successful STATUS current
creation of a conceptual row using the chosen value, the manager DESCRIPTION
should check again that there are no other rows with this value "An entry in the classifier element table describes a
that have been created by a different manager that could, single element of the classifier."
potentially, interfere with the classifier elements that are INDEX { diffServClfrElementClfrId, diffServClfrElementId }
desired." ::= { diffServClfrElementTable 1 }
::= { diffServClassifierEntry 2 }
diffServClassifierId OBJECT-TYPE DiffServClfrElementEntry ::= SEQUENCE {
diffServClfrElementId Unsigned32,
diffServClfrElementClfrId Unsigned32,
diffServClfrElementOrder Unsigned32,
diffServClfrElementNext RowPointer,
diffServClfrElementSpecific RowPointer,
diffServClfrElementStatus RowStatus
}
diffServClfrElementId OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A classifier ID that enumerates the classifier elements. The set "An index that enumerates the Classifier Element
of such identifiers spans the whole agent. Managers should obtain entries. The set of such identifiers spans the whole
new values for row creation in this table by reading agent. Managers should obtain new values for row
diffServClassifierNextFree." creation in this table by reading
::= { diffServClassifierEntry 3 } diffServClfrElementNextFree."
::= { diffServClfrElementEntry 1 }
diffServClassifierFilter OBJECT-TYPE diffServClfrElementClfrId OBJECT-TYPE
SYNTAX RowPointer SYNTAX Unsigned32
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"A classifier Id identifies which classifier this
classifier element is a part of. This needs to be
the value of diffServClfrId attribute for an existing
row in diffServClfrTable."
::= { diffServClfrElementEntry 2 }
diffServClfrElementOrder OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A pointer to a valid entry in another table that describes the "The relative order in which classifier elements are
applicable classification filter, e.g. an entry in applied: higher numbers represent classifier ele-
diffServSixTupleClfrTable. If the row pointed to does not exist, ment with higher precedence. Classifier elements
the classifier is ignored. with the same order must be unambiguous i.e. they
must define non-overlapping patterns, and are con-
sidered to be applied simultaneously to the
traffic stream. Clas- sifier elements with different
order may overlap in their filters: the classif-
ier element with the highest order that matches is
taken.
The value zeroDotZero is interpreted to match anything not On a given interface, there must be a complete clas-
matched by another classifier - only one such entry may exist in sifier in place at all times in the ingress
this table." direction. This means that there will always be one
DEFVAL { zeroDotZero } or more filters that match every possible pat- tern
::= { diffServClassifierEntry 4 } that could be presented in an incoming packet.
There is no such requirement in the egress direc-
tion."
DEFVAL { 0 }
::= { diffServClfrElementEntry 3 }
diffServClassifierNext OBJECT-TYPE diffServClfrElementNext OBJECT-TYPE
SYNTAX RowPointer SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This selects the next datapath element to handle packets "This attribute provides one branch of the fan-out
matching the filter pattern. For example, this can point to an functionality of a classifier described in [MODEL]
entry in a meter, action, algorithmic dropper or queue table. section 4.1.
If the row pointed to does not exist, the classifier element is This selects the next diffserv functional datapath
ignored." element to handle traffic for this data path. This
::= { diffServClassifierEntry 5 } RowPointer should point to an instance of one of:
diffServClfrEntry
diffServMeterEntry
diffServActionEntry
diffServAlgDropEntry
diffServQEntry
diffServClassifierPrecedence OBJECT-TYPE A value of zeroDotZero in this attribute indicates no
SYNTAX Unsigned32 further Diffserv treatment is performed on traffic of
this datapath.
If the row pointed to does not exist, the treatment
is as if this attribute contains a value of zero-
DotZero."
::= { diffServClfrElementEntry 4 }
diffServClfrElementSpecific OBJECT-TYPE
SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The relative precedence in which classifiers are applied: higher "A pointer to a valid entry in another table,
numbers represent classifiers with higher precedence. filter table, that describes the applicable classif-
Classifiers with the same precedence must be unambiguous i.e. ication parameters, e.g. an entry in diffServSixTu-
they must define non-overlapping patterns, and are considered to pleClfrTable.
be applied simultaneously to the traffic stream. Classifiers with
different precedence may overlap in their filters: the classifier
with the highest precedence that matches is taken.
On a given interface, there must be a complete classifier in If the row pointed to does not exist, the classifier
place at all times for the first TCB (lowest value of element is ignored.
diffServClassifierTcb) in the ingress direction. This means that
there will always be one or more filters that match every
possible pattern that could be presented in an incoming packet.
There is no such requirement for subsequent TCBs in the ingress
direction, nor for any TCB in the egress direction."
DEFVAL { 0 }
::= { diffServClassifierEntry 6 }
diffServClassifierStatus OBJECT-TYPE The value zeroDotZero is interpreted to match any-
thing not matched by another classifier element -
only one such entry may exist for each classifier."
DEFVAL { zeroDotZero }
::= { diffServClfrElementEntry 5 }
diffServClfrElementStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation, or "The RowStatus variable controls the activation,
deletion of a classifier. Any writable variable may be modified deactivation, or deletion of a classifier element.
whether the row is active or notInService." Any writ- able variable may be modified whether
::= { diffServClassifierEntry 7 } the row is active or notInService."
::= { diffServClfrElementEntry 6 }
diffServClassifierNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is currently-unused
for a diffServClassifierId instance. If a configuring system
attempts to create a new row in the diffServClassifierTable using
this value, that operation will fail if the value has, in the
meantime, been used to create another row that is currently
valid."
::= { diffServObjects 1 }
-- --
-- IP Six-Tuple Classification Table -- IP Six-Tuple Classification Table
-- --
-- Classification based on 6 different fields in the IP -- Classification based on 6 different fields in the IP
-- header. This is intended to be IP-version-independent. -- header. This is intended to be IP-version-independent.
-- Filters, entries in this table, may be shared, pointed to,
-- by multiple diffServClfrElementEntry, of same or different
-- datapaths in the same system.
-- --
diffServSixTupleClfrNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is currently unused
for a diffServSixTupleClfrId instance.
If a configuring system attempts to create a new row
in the diffServSixTupleClfrTable using this value, that operation
will fail if the value has, in the meantime, been used
to create another row that is currently valid."
::= { diffServClassifier 5 }
diffServSixTupleClfrTable OBJECT-TYPE diffServSixTupleClfrTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServSixTupleClfrEntry SYNTAX SEQUENCE OF DiffServSixTupleClfrEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A table of IP Six-Tuple Classifier filter entries that a system "A table of IP Six-Tuple Classifier filter entries
may use to identify IP traffic." that a system may use to identify IP traffic."
REFERENCE REFERENCE
"[MODEL] section 4.2.2" "[MODEL] section 4.2.2"
::= { diffServTables 2 } ::= { diffServClassifier 6 }
diffServSixTupleClfrEntry OBJECT-TYPE diffServSixTupleClfrEntry OBJECT-TYPE
SYNTAX DiffServSixTupleClfrEntry SYNTAX DiffServSixTupleClfrEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An IP Six-Tuple Classifier entry describes a single filter." "An IP Six-Tuple Classifier entry describes a single
filter."
INDEX { diffServSixTupleClfrId } INDEX { diffServSixTupleClfrId }
::= { diffServSixTupleClfrTable 1 } ::= { diffServSixTupleClfrTable 1 }
DiffServSixTupleClfrEntry ::= SEQUENCE { DiffServSixTupleClfrEntry ::= SEQUENCE {
diffServSixTupleClfrId Unsigned32, diffServSixTupleClfrId Unsigned32,
diffServSixTupleClfrDstAddrType InetAddressType, diffServSixTupleClfrDstAddrType InetAddressType,
diffServSixTupleClfrDstAddr InetAddress, diffServSixTupleClfrDstAddr InetAddress,
diffServSixTupleClfrDstAddrMask Unsigned32, diffServSixTupleClfrDstAddrMask Unsigned32,
diffServSixTupleClfrSrcAddrType InetAddressType, diffServSixTupleClfrSrcAddrType InetAddressType,
diffServSixTupleClfrSrcAddr InetAddress, diffServSixTupleClfrSrcAddr InetAddress,
diffServSixTupleClfrSrcAddrMask Unsigned32, diffServSixTupleClfrSrcAddrMask Unsigned32,
diffServSixTupleClfrDscp Dscp, diffServSixTupleClfrDscp Dscp,
diffServSixTupleClfrProtocol INTEGER, diffServSixTupleClfrProtocol Unsigned32,
diffServSixTupleClfrDstL4PortMin SixTupleClfrL4Port, diffServSixTupleClfrDstL4PortMin SixTupleClfrL4Port,
diffServSixTupleClfrDstL4PortMax SixTupleClfrL4Port, diffServSixTupleClfrDstL4PortMax SixTupleClfrL4Port,
diffServSixTupleClfrSrcL4PortMin SixTupleClfrL4Port, diffServSixTupleClfrSrcL4PortMin SixTupleClfrL4Port,
diffServSixTupleClfrSrcL4PortMax SixTupleClfrL4Port, diffServSixTupleClfrSrcL4PortMax SixTupleClfrL4Port,
diffServSixTupleClfrStatus RowStatus diffServSixTupleClfrStatus RowStatus
} }
diffServSixTupleClfrId OBJECT-TYPE diffServSixTupleClfrId OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A unique identifier for the filter. Filters may be shared by "An index that enumerates the Six Tuple Classifier
multiple interfaces in the same system. Managers should obtain filter entries. The set of such identifiers spans
new values for row creation in this table by reading the whole agent. Managers should obtain new values
for row creation in this table by reading
diffServSixTupleClfrNextFree." diffServSixTupleClfrNextFree."
::= { diffServSixTupleClfrEntry 1 } ::= { diffServSixTupleClfrEntry 1 }
diffServSixTupleClfrDstAddrType OBJECT-TYPE diffServSixTupleClfrDstAddrType OBJECT-TYPE
SYNTAX InetAddressType SYNTAX InetAddressType
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The type of IP destination address used by this classifier "The type of IP destination address used by this
entry." classifier entry."
::= { diffServSixTupleClfrEntry 2 } ::= { diffServSixTupleClfrEntry 2 }
diffServSixTupleClfrDstAddr OBJECT-TYPE diffServSixTupleClfrDstAddr OBJECT-TYPE
SYNTAX InetAddress SYNTAX InetAddress
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The IP address to match against the packet's destination IP "The IP address to match against the packet's desti-
address." nation IP address."
::= { diffServSixTupleClfrEntry 3 } ::= { diffServSixTupleClfrEntry 3 }
diffServSixTupleClfrDstAddrMask OBJECT-TYPE diffServSixTupleClfrDstAddrMask OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "bits" UNITS "bits"
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The length of a mask for the matching of the destination IP "The length of a mask for the matching of the desti-
address. Masks are constructed by setting bits in sequence from nation IP address. Masks are constructed by setting
the most-significant bit downwards for bits in sequence from the most-significant bit down-
diffServSixTupleClfrDstAddrMask bits length. All other bits in wards for diffServSixTupleClfrDstAddrMask bits
the mask, up to the number needed to fill the length of the length. All other bits in the mask, up to the number
address diffServSixTupleClfrDstAddr are cleared to zero. A zero needed to fill the length of the address diffServSix-
bit in the mask then means that the corresponding bit in the TupleClfrDstAddr are cleared to zero. A zero bit in
the mask then means that the corresponding bit in the
address always matches." address always matches."
DEFVAL {0} DEFVAL {0}
::= { diffServSixTupleClfrEntry 4 } ::= { diffServSixTupleClfrEntry 4 }
diffServSixTupleClfrSrcAddrType OBJECT-TYPE diffServSixTupleClfrSrcAddrType OBJECT-TYPE
SYNTAX InetAddressType SYNTAX InetAddressType
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The type of IP source address used by this classifier entry." "The type of IP source address used by this classif-
ier entry."
::= { diffServSixTupleClfrEntry 5 } ::= { diffServSixTupleClfrEntry 5 }
diffServSixTupleClfrSrcAddr OBJECT-TYPE diffServSixTupleClfrSrcAddr OBJECT-TYPE
SYNTAX InetAddress SYNTAX InetAddress
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The IP address to match against the source IP address of each "The IP address to match against the source IP
packet." address of each packet."
::= { diffServSixTupleClfrEntry 6 } ::= { diffServSixTupleClfrEntry 6 }
diffServSixTupleClfrSrcAddrMask OBJECT-TYPE diffServSixTupleClfrSrcAddrMask OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "bits" UNITS "bits"
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The length of a mask for the matching of the source IP address. "The length of a mask for the matching of the source
Masks are constructed by setting bits in sequence from the most- IP address. Masks are constructed by setting bits in
significant bit downwards for diffServSixTupleClfrSrcAddrMask sequence from the most-significant bit downwards for
bits length. All other bits in the mask, up to the number needed diffServSixTupleClfrSrcAddrMask bits length. All
to fill the length of the address diffServSixTupleClfrSrcAddr are other bits in the mask, up to the number needed to
cleared to zero. A zero bit in the mask then means that the fill the length of the address diffServSixTu-
corresponding bit in the address always matches." pleClfrSrcAddr are cleared to zero. A zero bit in
the mask then means that the corresponding bit in the
address always matches."
DEFVAL {0} DEFVAL {0}
::= { diffServSixTupleClfrEntry 7 } ::= { diffServSixTupleClfrEntry 7 }
diffServSixTupleClfrDscp OBJECT-TYPE diffServSixTupleClfrDscp OBJECT-TYPE
SYNTAX Dscp SYNTAX Dscp
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The value that the DSCP in the packet must have to match this "The value that the DSCP in the packet must have to
entry. A value of -1 indicates that a specific DSCP value has not match this entry. A value of -1 indicates that a
been defined and thus all DSCP values are considered a match." specific DSCP value has not been defined and thus all
DSCP values are considered a match."
DEFVAL {-1} DEFVAL {-1}
::= { diffServSixTupleClfrEntry 8 } ::= { diffServSixTupleClfrEntry 8 }
diffServSixTupleClfrProtocol OBJECT-TYPE diffServSixTupleClfrProtocol OBJECT-TYPE
SYNTAX INTEGER (0..255) SYNTAX Unsigned32 (0..255)
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The IP protocol to match against the IPv4 protocol number in the "The IP protocol to match against the IPv4 protocol
packet. A value of zero means match all." number in the packet. A value of zero means match
all."
DEFVAL {0} DEFVAL {0}
::= { diffServSixTupleClfrEntry 9 } ::= { diffServSixTupleClfrEntry 9 }
diffServSixTupleClfrDstL4PortMin OBJECT-TYPE diffServSixTupleClfrDstL4PortMin OBJECT-TYPE
SYNTAX SixTupleClfrL4Port SYNTAX SixTupleClfrL4Port
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The minimum value that the layer-4 destination port number in "The minimum value that the layer-4 destination port
the packet must have in order to match this classifier entry." number in the packet must have in order to match this
classifier entry."
DEFVAL {0} DEFVAL {0}
::= { diffServSixTupleClfrEntry 10 } ::= { diffServSixTupleClfrEntry 10 }
diffServSixTupleClfrDstL4PortMax OBJECT-TYPE diffServSixTupleClfrDstL4PortMax OBJECT-TYPE
SYNTAX SixTupleClfrL4Port SYNTAX SixTupleClfrL4Port
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum value that the layer-4 destination port number in "The maximum value that the layer-4 destination port
the packet must have in order to match this classifier entry. number in the packet must have in order to match this
This value must be equal to or greater that the value specified classifier entry. This value must be equal to or
for this entry in diffServSixTupleClfrDstL4PortMin." greater than the value specified for this entry in
diffServSixTupleClfrDstL4PortMin."
DEFVAL {65535} DEFVAL {65535}
::= { diffServSixTupleClfrEntry 11 } ::= { diffServSixTupleClfrEntry 11 }
diffServSixTupleClfrSrcL4PortMin OBJECT-TYPE diffServSixTupleClfrSrcL4PortMin OBJECT-TYPE
SYNTAX SixTupleClfrL4Port SYNTAX SixTupleClfrL4Port
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The minimum value that the layer-4 source port number in the "The minimum value that the layer-4 source port
packet must have in order to match this classifier entry." number in the packet must have in order to match this
classifier entry."
DEFVAL {0} DEFVAL {0}
::= { diffServSixTupleClfrEntry 12 } ::= { diffServSixTupleClfrEntry 12 }
diffServSixTupleClfrSrcL4PortMax OBJECT-TYPE diffServSixTupleClfrSrcL4PortMax OBJECT-TYPE
SYNTAX SixTupleClfrL4Port SYNTAX SixTupleClfrL4Port
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum value that the layer-4 source port number in the "The maximum value that the layer-4 source port
packet must have in oder to match this classifier entry. This number in the packet must have in oder to match this
value must be equal to or greater that the value specified for classifier entry. This value must be equal to or
this entry in dsSixTupleIpSrcL4PortMin." greater than the value specified for this entry in
diffServSixTupleClfrSrcL4PortMin."
DEFVAL {65535} DEFVAL {65535}
::= { diffServSixTupleClfrEntry 13 } ::= { diffServSixTupleClfrEntry 13 }
diffServSixTupleClfrStatus OBJECT-TYPE diffServSixTupleClfrStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation, or "The RowStatus variable controls the activation,
deletion of a classifier. Any writable variable may be modified deactivation, or deletion of a classifier. Any writ-
whether the row is active or notInService." able variable may be modified whether the row is
active or notInService."
::= { diffServSixTupleClfrEntry 14 } ::= { diffServSixTupleClfrEntry 14 }
diffServSixTupleClfrNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is currently-unused
for a diffServSixTupleClfrId instance.
If a configuring system attempts to create a new row
in the diffServSixTupleClfrTable using this value, that operation
will fail if the value has, in the meantime, been used
to create another row that is currently valid."
::= { diffServObjects 2 }
-- --
-- Meters -- Meters
-- --
diffServMeter OBJECT IDENTIFIER ::= { diffServMIBObjects 3 }
--
-- This MIB supports a variety of Meters. It includes a
-- specific definition for Meters whose parameter set can
-- be modelled using Token Bucket parameters.
-- Other metering parameter sets can be defined and used
-- when necessary.
--
-- Multiple meter elements may be logically cascaded using
-- their diffServMeterSucceedNext and diffServMeterFailNext
-- pointers if required.
-- One example of this might be for an AF PHB implementation
-- that uses multiple level conformance meters.
--
-- Cascading of individual meter elements in the MIB is
-- intended to be functionally equivalent to multiple level
-- conformance determination of a packet. The sequential
-- nature of the representation is merely a notational
-- convenience for this MIB.
--
-- For example:
-- Conforming to RFC 2697, srTCM can be parameterized using
-- two sets of diffServMeterEntry and diffServTBMeterEntry.
-- With the first set parameterizing the Committed Burst Size
-- token-bucket, second set parameterizing the Excess Burst Size
-- token-bucket. With both set's diffServTBMeterRate parameters
-- being used to reflect the Committed Information Rate value.
--
-- Conforming to RFC 2698, trTCM can be parameterized using
-- two sets of diffServMeterEntry and diffServTBMeterEntry.
-- With the first set parameterizing the Peak Information Rate
-- and Peak Burst Size token-bucket, second set parameterizing
-- the Committed Information Rate and Committed Burst Size
-- token-bucket.
--
-- Conforming to RFC 2859, tswTCM can be parameterized using
-- two sets of diffServMeterEntry and diffServTBMeterEntry.
-- With the first set parameterizing the Committed Target Rate,
-- second set parametering the Peak Target Rate.
-- With both set's diffServTBMeterInterval being used to
-- reflect the Average Interval as specified by RFC 2859.
-- --
diffServMeterNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is
currently unused for a diffServMeterId instance. If
a configuring system attempts to create a new row in
the diffServMeterTable using this value, that opera-
tion will fail if the value has, in the meantime,
been used to create another row that is currently
valid."
::= { diffServMeter 1 }
diffServMeterTable OBJECT-TYPE diffServMeterTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServMeterEntry SYNTAX SEQUENCE OF DiffServMeterEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates generic meters that a system may use to "This table enumerates specific meters that a system
police a stream of traffic. The traffic stream to be metered is may use to police, or shape, a stream of traffic. The
determined by the element(s) upstream of the meter i.e. by the traffic stream to be metered is determined by the
object(s) that point to each entry in this table. This may diffserv functional datapath element(s) upstream of
include all traffic on an interface. the meter i.e. by the object(s) that point to each
entry in this table. This may include all traffic on
an interface.
Specific meter details are to be found in diffServMeterSpecific." Specific meter details are to be found in table entry
referenced by diffServMeterSpecific."
REFERENCE REFERENCE
"[MODEL] section 5.1" "[MODEL] section 5.1"
::= { diffServTables 3 } ::= { diffServMeter 2 }
diffServMeterEntry OBJECT-TYPE diffServMeterEntry OBJECT-TYPE
SYNTAX DiffServMeterEntry SYNTAX DiffServMeterEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the meter table describing a single meter." "An entry in the meter table describes a single con-
INDEX { ifIndex, diffServMeterIfDirection, formance level of a meter."
diffServMeterId } INDEX { diffServMeterId }
::= { diffServMeterTable 1 } ::= { diffServMeterTable 1 }
DiffServMeterEntry ::= SEQUENCE { DiffServMeterEntry ::= SEQUENCE {
diffServMeterIfDirection IfDirection,
diffServMeterId Unsigned32, diffServMeterId Unsigned32,
diffServMeterSucceedNext RowPointer, diffServMeterSucceedNext RowPointer,
diffServMeterFailNext RowPointer, diffServMeterFailNext RowPointer,
diffServMeterSpecific OBJECT IDENTIFIER, diffServMeterSpecific RowPointer,
diffServMeterStatus RowStatus diffServMeterStatus RowStatus
} }
diffServMeterIfDirection OBJECT-TYPE
SYNTAX IfDirection
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"Specifies the direction for which this meter entry applies on
this interface."
::= { diffServMeterEntry 1 }
diffServMeterId OBJECT-TYPE diffServMeterId OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This identifies a meter entry. Managers should obtain new values "An index that enumerates the Meter entries. The set
for row creation in this table by reading diffServMeterNextFree." of such identifiers spans the whole agent. Managers
::= { diffServMeterEntry 2 } should obtain new values for row creation in this
table by reading diffServMeterNextFree."
::= { diffServMeterEntry 1 }
diffServMeterSucceedNext OBJECT-TYPE diffServMeterSucceedNext OBJECT-TYPE
SYNTAX RowPointer SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"If the traffic does conform to the meter, this indicates the "If the traffic does conform, this selects the next
next datapath element to handle the traffic e.g. an Action or diffserv functional datapath element to handle
another Meter datapath element. traffic for this data path. This RowPointer should
point to an instance of one of:
diffServClfrEntry
diffServMeterEntry
diffServActionEntry
diffServAlgDropEntry
diffServQEntry
The value zeroDotZero in this variable indicates no further A value of zeroDotZero in this attribute indicates no
Diffserv treatment is performed on this traffic by the current further Diffserv treatment is performed on traffic of
interface for this interface direction. If the row pointed to this datapath.
does not exist, the meter element is considered inactive."
If the row pointed to does not exist, the treatment
is as if this attribute contains a value of zero-
DotZero."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { diffServMeterEntry 3 } ::= { diffServMeterEntry 2 }
diffServMeterFailNext OBJECT-TYPE diffServMeterFailNext OBJECT-TYPE
SYNTAX RowPointer SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"If the traffic does not conform to the meter, this indicates the "If the traffic does not conform, this selects the
next datapath element to handle the traffic e.g. an Action or next diffserv functional datapath element to handle
Meter datapath element. traffic for this data path. This RowPointer should
point to an instance of one of:
diffServClfrEntry
diffServMeterEntry
diffServActionEntry
diffServAlgDropEntry
diffServQEntry
The value zeroDotZero in this variable indicates no further A value of zeroDotZero in this attribute indicates no
Diffserv treatment is performed on this traffic by the current further Diffserv treatment is performed on traffic of
interface for this interface direction. If the row pointed to this datapath.
does not exist, the meter element is considered inactive."
If the row pointed to does not exist, the treatment
is as if this attribute contains a value of zero-
DotZero."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { diffServMeterEntry 4 } ::= { diffServMeterEntry 3 }
diffServMeterSpecific OBJECT-TYPE diffServMeterSpecific OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This indicates the behaviour of the meter by pointing to a table "This indicates the behaviour of the meter by point-
containing detailed parameters. Note that entries in that ing to an entry containing detailed parameters. Note
specific table must be managed explicitly. that entries in that specific table must be managed
explicitly.
One example of a valid object would be diffServTBMeterTable, For example, diffServMeterSpecific may point to an
whose entries are indexed by the same variables as this table, entry in diffServTBMeterTable, which contains an
for describing an instance of a token-bucket meter." instance of a single set of Token Bucket parameters."
::= { diffServMeterEntry 5 } ::= { diffServMeterEntry 4 }
diffServMeterStatus OBJECT-TYPE diffServMeterStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation, or "The RowStatus variable controls the activation,
deletion of a meter. Any writable variable may be modified deactivation, or deletion of a meter. Any writable
whether the row is active or notInService." variable may be modified whether the row is active or
::= { diffServMeterEntry 6 } notInService."
::= { diffServMeterEntry 5 }
diffServMeterNextFree OBJECT-TYPE --
-- Token Bucket Meter Table
--
-- Each entry in the Token Bucket Meter Table parameterize
-- a single token bucket. Multiple token buckets can be
-- used together to parameterize multiple levels of
-- conformance.
--
-- Note that an entry in the Token Bucket Meter Table can
-- be shared, pointed to, by multiple diffServMeterTable
-- entries.
--
diffServTBMeterNextFree OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This object yields a value when read that is currently-unused "This object yields a value when read that is
for a diffServMeterId instance. If a configuring system attempts currently unused for a diffServTBMeterId instance.
to create a new row in the diffServMeterTable using this value, If a configuring system attempts to create a new row
that operation will fail if the value has, in the meantime, been in the diffServTBMeterTable using this value, that
used to create another row that is currently valid." operation will fail if the value has, in the mean-
::= { diffServObjects 3 } time, been used to create another row that is
currently valid."
::= { diffServMeter 3 }
diffServTBMeterTable OBJECT-TYPE diffServTBMeterTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServTBMeterEntry SYNTAX SEQUENCE OF DiffServTBMeterEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates specific token-bucket meters that a system "This table enumerates a single set of token bucket
may use to police a stream of traffic. Such meters are modelled meter parameters that a system may use to police a
here as having a single rate and a burst size. stream of traffic. Such meters are modelled here as
having a single rate and a single burst size."
Multiple meter elements may be logically cascaded using their
diffServMeterSucceedNext pointers if a multi-rate token bucket is
needed. One example of this might be for an AF PHB
implementation that used two-rate meters. Such cascading of
meter elements of specific type of token-bucket indicates
forwarding behaviour that is functionally equivalent to a multi-
rate meter: the sequential nature of the representation is merely
a notational convenience for this MIB.
Entries in this table share indexing with a parent
diffServMeterEntry although they must be managed (e.g.
created/deleted) by explicit management action, independently of
the associated value of diffServMeterSpecific."
REFERENCE REFERENCE
"[MODEL] section 5.1.3" "[MODEL] section 5.1"
::= { diffServTables 4 } ::= { diffServMeter 4 }
diffServTBMeterEntry OBJECT-TYPE diffServTBMeterEntry OBJECT-TYPE
SYNTAX DiffServTBMeterEntry SYNTAX DiffServTBMeterEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry that describes a single token-bucket meter, indexed by "An entry that describes a single set of token bucket
the same variables as a diffServMeterEntry." meter parameters."
INDEX { ifIndex, diffServMeterIfDirection, INDEX { diffServTBMeterId }
diffServMeterId }
::= { diffServTBMeterTable 1 } ::= { diffServTBMeterTable 1 }
DiffServTBMeterEntry ::= SEQUENCE { DiffServTBMeterEntry ::= SEQUENCE {
diffServTBMeterId Unsigned32,
diffServTBMeterType INTEGER,
diffServTBMeterRate Unsigned32, diffServTBMeterRate Unsigned32,
diffServTBMeterBurstSize BurstSize diffServTBMeterBurstSize BurstSize,
diffServTBMeterInterval Unsigned32,
diffServTBMeterStatus RowStatus diffServTBMeterStatus RowStatus
} }
diffServTBMeterId OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"An index that enumerates the TBMeter entries. The
set of such identifiers spans the whole agent.
Managers should obtain new values for row creation in
this table by reading diffServTBMeterNextFree."
::= { diffServTBMeterEntry 1 }
diffServTBMeterType OBJECT-TYPE
SYNTAX INTEGER {
other(1), -- not listed here
tokenBucket(2), -- Simple Token Bucket
avgRate(3), -- Average Rate
srTCMBlind(4), -- srTCM, Color-blind
srTCMAware(5), -- srTCM, Color-aware
trTCMBlind(6), -- trTCM, Color-blind
trTCMAware(7), -- trTCM, Color-aware
tswTCM(8) -- tswTCM
}
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The type of meter using parameters specified by this
TBMeter entry.
Value of tokenBucket(2) indicates the use of Two
Parameter Token Bucket Meter as described in [MODEL]
section 5.2.3.
Value of avgRate(3) indicates the use of Average Rate
Meter as described in [MODEL] section 5.2.1.
Value of srTCMBlind(4) and srTCMAware(5) indicates
the use of Single Rate Three Color Marker Metering as
defined by RFC 2697, with `Color Blind' and `Color
Aware' mode as described by the RFC.
Value of trTCMBlind(6) and trTCMAware(7) indicates
the use of Two Rate Three Color Marker Metering as
defined by RFC 2698, with `Color Blind' and `Color
Aware' mode as described by the RFC.
Value of tswTCM(8) indicates the use of Time Sliding
Window Three Color Marker Metering as defined by RFC
2859."
REFERENCE
"[MODEL] section 5"
::= { diffServTBMeterEntry 2 }
diffServTBMeterRate OBJECT-TYPE diffServTBMeterRate OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "kilobits per second" UNITS "kilobits per second"
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The token-bucket rate, in kilobits per second (kbps)." "The token-bucket rate, in kilobits per second
::= { diffServTBMeterEntry 1 } (kbps). This attribute is used for: 1. CIR in RFC
2697 for srTCM 2. PIR and CIR in FRC 2698 for trTCM
3. CTR and PTR in RFC 2859 for TSWTCM 4. AverageRate
used in [MODEL] section 5."
::= { diffServTBMeterEntry 3 }
diffServTBMeterBurstSize OBJECT-TYPE diffServTBMeterBurstSize OBJECT-TYPE
SYNTAX BurstSize SYNTAX BurstSize
UNITS "Bytes" UNITS "Bytes"
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum number of bytes in a single transmission burst. The "The maximum number of bytes in a single transmission
interval over which the burst is to be measured can be derived as burst. This attribute is used for: 1. CBS and EBS in
diffServTBMeterBurstSize*8*1000/diffServTBMeterRate." RFC 2697 for srTCM 2. CBS and PBS in FRC 2698 for
::= { diffServTBMeterEntry 2 } trTCM 3. Burst Size used in [MODEL] section 5."
::= { diffServTBMeterEntry 4 }
diffServTBMeterInterval OBJECT-TYPE
SYNTAX Unsigned32
UNITS "microseconds"
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The time interval used with the token bucket. For:
1. Average Rate Meter, [MODEL] section 5.2.1, -
Delta. 2. Simple Token Bucket Meter, [MODEL] section
5.1,
- time interval t. 3. RFC 2859 TSWTCM, -
AVG_INTERVAL. 4. RFC 2697 srTCM, RFC 2698 trTCM, -
token bucket
update time interval."
::= { diffServTBMeterEntry 5 }
diffServTBMeterStatus OBJECT-TYPE diffServTBMeterStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation, or "The RowStatus variable controls the activation,
deletion of a meter. Any writable variable may be modified deactivation, or deletion of a meter. Any writable
whether the row is active or notInService." variable may be modified whether the row is active or
::= { diffServTBMeterEntry 3 } notInService."
::= { diffServTBMeterEntry 6 }
-- --
-- Actions -- Actions
-- --
diffServAction OBJECT IDENTIFIER ::= { diffServMIBObjects 4 }
-- --
-- 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.
-- --
diffServActionNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is
currently unused for a diffServActionId instance. If
a configuring system attempts to create a new row in
the diffServActionTable using this value, that opera-
tion will fail if the value has, in the meantime,
been used to create another row that is currently
valid."
::= { diffServAction 1 }
diffServActionTable OBJECT-TYPE diffServActionTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServActionEntry SYNTAX SEQUENCE OF DiffServActionEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Action Table enumerates actions that can be performed to a "The Action Table enumerates actions that can be per-
stream of traffic. Multiple actions can be concatenated. For formed to a stream of traffic. Multiple actions can
example, after marking a stream of traffic exiting from a meter, be concatenated. For example, after marking a stream
a device can then perform a count action of the conforming or of traffic exiting from a meter, a device can then
non-conforming traffic. perform a count action of the conforming or non-
conforming traffic.
Specific actions are indicated by diffServActionSpecific which Specific actions are indicated by diffServAction-
points to another object which describes the action in further Specific which points to an entry of a specific
detail." action type parameterizing the action in detail."
REFERENCE REFERENCE
"[MODEL] section 6." "[MODEL] section 6."
::= { diffServTables 5 } ::= { diffServAction 2 }
diffServActionEntry OBJECT-TYPE diffServActionEntry OBJECT-TYPE
SYNTAX DiffServActionEntry SYNTAX DiffServActionEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the action table describing the actions applied to "Each entry in the action table allows description of
traffic arriving at its input." one specific action to be applied to traffic."
INDEX { ifIndex, diffServActionIfDirection, INDEX { diffServActionId }
diffServActionId }
::= { diffServActionTable 1 } ::= { diffServActionTable 1 }
DiffServActionEntry ::= SEQUENCE { DiffServActionEntry ::= SEQUENCE {
diffServActionIfDirection IfDirection,
diffServActionId Unsigned32, diffServActionId Unsigned32,
diffServActionNext RowPointer, diffServActionNext RowPointer,
diffServActionSpecific OBJECT IDENTIFIER, diffServActionSpecific RowPointer,
diffServActionType INTEGER,
diffServActionStatus RowStatus diffServActionStatus RowStatus
} }
diffServActionIfDirection OBJECT-TYPE
SYNTAX IfDirection
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"Specifies the direction for which this action entry applies on
this interface."
::= { diffServActionEntry 1 }
diffServActionId OBJECT-TYPE diffServActionId OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This identifies the action entry. Managers should obtain new "An index that enumerates the Action entries. The set
values for row creation in this table by reading of such identifiers spans the whole agent. Managers
diffServActionNextFree." should obtain new values for row creation in this
::= { diffServActionEntry 2 } table by reading diffServActionNextFree."
::= { diffServActionEntry 1 }
diffServActionNext OBJECT-TYPE diffServActionNext OBJECT-TYPE
SYNTAX RowPointer SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Next pointer indicates the next datapath element to handle "This selects the next diffserv functional datapath
the traffic. For example, a queue datapath element. element to handle traffic for this data path. This
RowPointer should point to an instance of one of:
diffServClfrEntry
diffServMeterEntry
diffServActionEntry
diffServAlgDropEntry
diffServQEntry
The value zeroDotZero in this variable indicates no further A value of zeroDotZero in this attribute indicates no
DiffServ treatment is performed on this flow by the current further Diffserv treatment is performed on traffic of
interface for this interface direction. If the row pointed to this datapath.
does not exist, the action element is considered inactive."
If the row pointed to does not exist, the treatment
is as if this attribute contains a value of zero-
DotZero."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { diffServActionEntry 3 } ::= { diffServActionEntry 2 }
diffServActionSpecific OBJECT-TYPE diffServActionSpecific OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A pointer to an object instance providing additional information "A pointer to an object instance providing additional
for the type of action indicated by this action table entry. information for the type of action indicated by this
action table entry.
For the standard actions defined by this MIB module, this should For the standard actions defined by this MIB module,
point to one of the following: a diffServDscpMarkActEntry, a this should point to one of the following: a
diffServCountActEntry, the diffServAbsoluteDropAction OID. For diffServDscpMarkActEntry, a diffServCountActEntry.
other actions, it may point to an object instance defined in some For other actions, it may point to an object instance
other MIB." defined in some other MIB."
::= { diffServActionEntry 3 }
diffServActionType OBJECT-TYPE
SYNTAX INTEGER {
other(1), -- types not specified here
specific(2), -- follow the Specific pointer
absoluteDrop(3) -- disallow traffic
}
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"Indicates the type of action. The values specific(2)
must be associated with additional information,
pointed to by diffServActionSpecific, with the actual
action type indicated by the object being pointed to.
The value absoluteDrop(3) has no associated informa-
tion and will have a diffServActionSpecific value of
zeroDotZero. The use of other(1) is outside the
scope of this definition, although the diffServAc-
tionSpecific pointer may be used in this case, to
indicate other information."
::= { diffServActionEntry 4 } ::= { diffServActionEntry 4 }
diffServActionStatus OBJECT-TYPE diffServActionStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation or "The RowStatus variable controls the activation,
deletion of an action element. Any writable variable may be deactivation or deletion of an action element. Any
modified whether the row is active or notInService." writable variable may be modified whether the row is
active or notInService."
::= { diffServActionEntry 5 } ::= { diffServActionEntry 5 }
diffServActionNextFree OBJECT-TYPE --
-- DSCP Mark Action Table
--
-- Rows of this table are pointed to by diffServActionSpecific
-- to provide detailed parameters specific to the DSCP
-- Mark action.
--
-- A single entry in this table can be shared, pointed to, by
-- multiple diffServActionTable entries, of same or different
-- datapaths.
--
diffServDscpMarkActNextFree OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This object yields a value when read that is currently-unused "This object yields a value when read that is currently unused
for a diffServActionId instance. If a configuring system for a diffServDscpMarkActId instance.
attempts to create a new row in the diffServActionTable using If a configuring system attempts to create a new row
this value, that operation will fail if the value has, in the in the diffServDscpMarkActTable using this value, that operation
meantime, been used to create another row that is currently will fail if the value has, in the meantime, been used
valid." to create another row that is currently valid."
::= { diffServObjects 4 } ::= { diffServAction 3 }
diffServDscpMarkActTable OBJECT-TYPE diffServDscpMarkActTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServDscpMarkActEntry SYNTAX SEQUENCE OF DiffServDscpMarkActEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table enumerates specific DSCPs used for marking or "This table enumerates specific DSCPs used for mark-
remarking the DSCP field of IP packets. The entries of this ing or remarking the DSCP field of IP packets. The
table may be referenced by a diffServActionSpecific attribute entries of this table may be referenced by a diffSer-
that points to diffServDscpMarkActTable." vActionSpecific attribute."
REFERENCE REFERENCE
"[MODEL] section 6.1" "[MODEL] section 6.1"
::= { diffServTables 6 } ::= { diffServAction 4 }
diffServDscpMarkActEntry OBJECT-TYPE diffServDscpMarkActEntry OBJECT-TYPE
SYNTAX DiffServDscpMarkActEntry SYNTAX DiffServDscpMarkActEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the DSCP mark action table that describes a single "An entry in the DSCP mark action table that
DSCP used for marking." describes a single DSCP used for marking."
INDEX { diffServDscpMarkActDscp } INDEX { diffServDscpMarkActId }
::= { diffServDscpMarkActTable 1 } ::= { diffServDscpMarkActTable 1 }
DiffServDscpMarkActEntry ::= SEQUENCE { DiffServDscpMarkActEntry ::= SEQUENCE {
diffServDscpMarkActDscp Dscp diffServDscpMarkActId Unsigned32,
diffServDscpMarkActDscp Dscp,
diffServDscpMarkActStatus RowStatus
} }
diffServDscpMarkActId OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"An index that enumerates the Mark Action entries.
The set of such identifiers spans the whole agent.
Managers should obtain new values for row creation in
this table by reading diffServDscpMarkActNextFree."
::= { diffServDscpMarkActEntry 1 }
diffServDscpMarkActDscp OBJECT-TYPE diffServDscpMarkActDscp OBJECT-TYPE
SYNTAX Dscp SYNTAX Dscp
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The DSCP that this Action uses for marking/remarking traffic. "The DSCP that this Action uses for marking/remarking
Note that a DSCP value of -1 is not permitted in this table. It traffic. Note that a DSCP value of -1 is not permit-
is quite possible that the only packets subject to this Action ted in this table. It is quite possible that the
are already marked with this DSCP. Note also that Diffserv may only packets subject to this Action are already
result in packet remarking both on ingress to a network and on marked with this DSCP. Note also that Diffserv may
egress from it and it is quite possible that ingress and egress result in packet remarking both on ingress to a net-
would occur in the same router." work and on egress from it and it is quite possible
::= { diffServDscpMarkActEntry 1 } that ingress and egress would occur in the same
router."
::= { diffServDscpMarkActEntry 2 }
diffServDscpMarkActStatus OBJECT-TYPE
SYNTAX RowStatus
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The RowStatus variable controls the activation,
deactivation, or deletion of this entry. Any writable
variable may be modified whether the row is active or
notInService."
::= { diffServDscpMarkActEntry 3 }
-- --
-- Count Action Table -- Count Action Table
-- --
-- Due to the fact that the MIB structure allows multiple
-- cascading diffServActionEntry be used to describe
-- multiple actions for a datapath, the counter became an
-- optional action type. In normal implementation, a
-- datapath either have counters or it doesn't, it is not
-- an element the management entity can add or remove.
-- The management entity can choose to read the counter or
-- not. Hence it is recommended for implementation that
-- have counters to always configure the count action as
-- the first of multiple actions, for example before the
-- the absolute drop action.
--
diffServCountActNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is currently unused
for a diffServCountActId instance.
If a configuring system attempts to create a new row
in the diffServCountActTable using this value, that operation
will fail if the value has, in the meantime, been used
to create another row that is currently valid."
::= { diffServAction 5 }
diffServCountActTable OBJECT-TYPE diffServCountActTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServCountActEntry SYNTAX SEQUENCE OF DiffServCountActEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This table contains counters for all the traffic passing through "This table contains counters for all the traffic
an action element." passing through an action element."
REFERENCE REFERENCE
"[MODEL] section 6.5" "[MODEL] section 6.4"
::= { diffServTables 7 } ::= { diffServAction 6 }
diffServCountActEntry OBJECT-TYPE diffServCountActEntry OBJECT-TYPE
SYNTAX DiffServCountActEntry SYNTAX DiffServCountActEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the count action table that describes a single set "An entry in the count action table describes a sin-
of traffic counters. Entries in this table share indexing with gle set of traffic counters."
those in the base diffServActionTable although they must be INDEX { diffServCountActId }
managed (e.g. created/deleted) by explicit management action,
independently of the associated value of diffServActionSpecific."
INDEX { ifIndex, diffServActionIfDirection,
diffServActionId }
::= { diffServCountActTable 1 } ::= { diffServCountActTable 1 }
DiffServCountActEntry ::= SEQUENCE { DiffServCountActEntry ::= SEQUENCE {
diffServCountActId Unsigned32,
diffServCountActOctets Counter32, diffServCountActOctets Counter32,
diffServCountActHCOctets Counter64, diffServCountActHCOctets Counter64,
diffServCountActPkts Counter32, diffServCountActPkts Counter32,
diffServCountActHCPkts Counter64, diffServCountActHCPkts Counter64,
diffServCountActDiscontTime TimeStamp, diffServCountActDiscontTime TimeStamp,
diffServCountActStatus RowStatus diffServCountActStatus RowStatus
} }
diffServCountActId OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"An index that enumerates the Count Action entries.
The set of such identifiers spans the whole agent.
Managers should obtain new values for row creation in
this table by reading diffServCountActNextFree."
::= { diffServCountActEntry 1 }
diffServCountActOctets OBJECT-TYPE diffServCountActOctets OBJECT-TYPE
SYNTAX Counter32 SYNTAX Counter32
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of octets at the Action datapath element. On high "The number of octets at the Action datapath element.
speed devices, this object implements the least significant 32 On high speed devices, this object implements the
bits of diffServcountActHCOctets. least significant 32 bits of diffServCountActHCOc-
tets.
Discontinuities in the value of this counter can occur at re- Discontinuities in the value of this counter can
initialization of the management system and at other times as occur at re-initialization of the management system
indicated by the value of diffServCountActDiscontTime for this and at other times as indicated by the value of
entry." diffServCountActDiscontTime for this entry."
::= { diffServCountActEntry 1 } ::= { diffServCountActEntry 2 }
diffServCountActHCOctets OBJECT-TYPE diffServCountActHCOctets OBJECT-TYPE
SYNTAX Counter64 SYNTAX Counter64
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of octets at the Action datapath element. This "The number of octets at the Action datapath element.
object should be used on high speed interfaces. This object should be used on high speed interfaces.
Discontinuities in the value of this counter can occur at re- Discontinuities in the value of this counter can
initialization of the management system and at other times as occur at re-initialization of the management system
indicated by the value of diffServCountActDiscontTime for this and at other times as indicated by the value of
entry." diffServCountActDiscontTime for this entry."
::= { diffServCountActEntry 2 } ::= { diffServCountActEntry 3 }
diffServCountActPkts OBJECT-TYPE diffServCountActPkts OBJECT-TYPE
SYNTAX Counter32 SYNTAX Counter32
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of packets at the Action datapath element. On high "The number of packets at the Action datapath ele-
speed devices, this object implements the least significant 32 ment. On high speed devices, this object implements
bits of diffServcountActHCPkts. the least significant 32 bits of diffServCoun-
tActHCPkts.
Discontinuities in the value of this counter can occur at re- Discontinuities in the value of this counter can
initialization of the management system and at other times as occur at re-initialization of the management system
indicated by the value of diffServCountActDiscontTime for this and at other times as indicated by the value of
entry." diffServCountActDiscontTime for this entry."
::= { diffServCountActEntry 3 } ::= { diffServCountActEntry 4 }
diffServCountActHCPkts OBJECT-TYPE diffServCountActHCPkts OBJECT-TYPE
SYNTAX Counter64 SYNTAX Counter64
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of packets at the Action datapath element. This "The number of packets at the Action datapath ele-
object should be used on high speed interfaces. ment. This object should be used on high speed
interfaces.
Discontinuities in the value of this counter can occur at re- Discontinuities in the value of this counter can
initialization of the management system and at other times as occur at re-initialization of the management system
indicated by the value of diffServCountActDiscontTime for this and at other times as indicated by the value of
entry." diffServCountActDiscontTime for this entry."
::= { diffServCountActEntry 4 } ::= { diffServCountActEntry 5 }
diffServCountActDiscontTime OBJECT-TYPE diffServCountActDiscontTime OBJECT-TYPE
SYNTAX TimeStamp SYNTAX TimeStamp
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The value of sysUpTime on the most recent occasion at which any "The value of sysUpTime on the most recent occasion
one or more of this entry's counters suffered a discontinuity. If at which any one or more of this entry's counters
no such discontinuities have occurred since the last re- suffered a discontinuity. If no such discontinuities
initialization of the local management subsystem, then this have occurred since the last re-initialization of the
object contains a zero value." local management subsystem, then this object contains
::= { diffServCountActEntry 5 } a zero value."
::= { diffServCountActEntry 6 }
diffServCountActStatus OBJECT-TYPE diffServCountActStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation, or "The RowStatus variable controls the activation,
deletion of this entry. Any writable variable may be modified deactivation, or deletion of this entry. Any writable
whether the row is active or notInService." variable may be modified whether the row is active or
::= { diffServCountActEntry 6 } notInService."
::= { diffServCountActEntry 7 }
diffServAbsoluteDropAction OBJECT-IDENTITY
STATUS current
DESCRIPTION
"This object identifier may be used as the value of a
diffServActionSpecific pointer in order to indicate that all
packets following this path are to be dropped unconditionally at
this point. It is likely, but not required, that this action will
be preceded by a counter action."
::= { diffServObjects 6 }
-- --
-- Algorithmic Drop Table -- Algorithmic Drop Table
-- --
diffServAlgDrop OBJECT IDENTIFIER ::= { diffServMIBObjects 5 }
diffServAlgDropNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is
currently unused for a diffServAlgDropId instance.
If a configuring system attempts to create a new row
in the diffServAlgDropTable using this value, that
operation will fail if the value has, in the mean-
time, been used to create another row that is
currently valid."
::= { diffServAlgDrop 1 }
diffServAlgDropTable OBJECT-TYPE diffServAlgDropTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServAlgDropEntry SYNTAX SEQUENCE OF DiffServAlgDropEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The algorithmic drop table contains entries describing an "The algorithmic drop table contains entries describ-
element that drops packets according to some algorithm." ing an element that drops packets according to some
algorithm."
REFERENCE REFERENCE
"[MODEL] section 7.1.3" "[MODEL] section 7.1.3"
::= { diffServTables 8 } ::= { diffServAlgDrop 2 }
diffServAlgDropEntry OBJECT-TYPE diffServAlgDropEntry OBJECT-TYPE
SYNTAX DiffServAlgDropEntry SYNTAX DiffServAlgDropEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry describes a process that drops packets according to "An entry describes a process that drops packets
some algorithm. Further details of the algorithm type are to be according to some algorithm. Further details of the
found in diffServAlgDropType and may be pointed to by algorithm type are to be found in diffServAlgDropType
diffServAlgDropSpecific." and with more detail parameter entry pointed to by
INDEX { ifIndex, diffServAlgDropIfDirection, diffServAlgDropSpecific when necessary."
diffServAlgDropId } INDEX { diffServAlgDropId }
::= { diffServAlgDropTable 1 } ::= { diffServAlgDropTable 1 }
DiffServAlgDropEntry ::= SEQUENCE { DiffServAlgDropEntry ::= SEQUENCE {
diffServAlgDropIfDirection IfDirection,
diffServAlgDropId Unsigned32, diffServAlgDropId Unsigned32,
diffServAlgDropType INTEGER, diffServAlgDropType INTEGER,
diffServAlgDropNext RowPointer, diffServAlgDropNext RowPointer,
diffServAlgDropQMeasure RowPointer, diffServAlgDropQMeasure RowPointer,
diffServAlgDropQThreshold Unsigned32, diffServAlgDropQThreshold Unsigned32,
diffServAlgDropSpecific OBJECT IDENTIFIER, diffServAlgDropSpecific RowPointer,
diffServAlgDropOctets Counter32, diffServAlgDropOctets Counter32,
diffServAlgDropHCOctets Counter64, diffServAlgDropHCOctets Counter64,
diffServAlgDropPkts Counter32, diffServAlgDropPkts Counter32,
diffServAlgDropHCPkts Counter64, diffServAlgDropHCPkts Counter64,
diffServAlgDropStatus RowStatus diffServAlgDropStatus RowStatus
} }
diffServAlgDropIfDirection OBJECT-TYPE
SYNTAX IfDirection
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"Specifies the direction for which this algorithmic dropper entry
applies on this interface."
::= { diffServAlgDropEntry 1 }
diffServAlgDropId OBJECT-TYPE diffServAlgDropId OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This identifies the drop action entry. Managers should obtain "An index that enumerates the Algorithmic Dropper
new values for row creation in this table by reading entries. The set of such identifiers spans the whole
diffServAlgDropNextFree." agent. Managers should obtain new values for row
::= { diffServAlgDropEntry 2 } creation in this table by reading diffServAlgDrop-
NextFree."
::= { diffServAlgDropEntry 1 }
diffServAlgDropType OBJECT-TYPE diffServAlgDropType OBJECT-TYPE
SYNTAX INTEGER { other(1), tailDrop(2), SYNTAX INTEGER {
headDrop(3), randomDrop(4) } other(1),
tailDrop(2),
headDrop(3),
randomDrop(4)
}
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The type of algorithm used by this dropper. A value of "The type of algorithm used by this dropper. A value
tailDrop(2) or headDrop(3) represents an algorithm that is of tailDrop(2) or headDrop(3) represents an algorithm
completely specified by this MIB. A value of other(1) requires that is completely specified by this MIB. A value of
further specification in some other MIB module. other(1) requires further specification in some other
MIB module.
The tailDrop(2) algorithm is described as follows: The tailDrop(2) algorithm is described as follows:
diffServAlgDropQThreshold represents the depth of the queue diffServAlgDropQThreshold represents the depth of the
diffServAlgDropQMeasure at which all newly arriving packets will queue, pointed to by diffServAlgDropQMeasure, at
be dropped. which all newly arriving packets will be dropped.
The headDrop(3) algorithm is described as follows: if a packet The headDrop(3) algorithm is described as follows: if
arrives when the current depth of the queue a packet arrives when the current depth of the queue,
diffServAlgDropQMeasure is at diffServAlgDropQThreshold, packets pointed to by diffServAlgDropQMeasure, is at diffSer-
currently at the head of the queue are dropped to make room for vAlgDropQThreshold, packets currently at the head of
the new packet to be enqueued at the tail of the queue. the queue are dropped to make room for the new packet
to be enqueued at the tail of the queue.
The randomDrop(4) algorithm is described as follows: on packet The randomDrop(4) algorithm is described as follows:
arrival, an algorithm is executed which may randomly drop the on packet arrival, an algorithm is executed which may
packet, or drop other packet(s) from the queue in its place. The randomly drop the packet, or drop other packet(s)
specifics of the algorithm may be proprietary. For this from the queue in its place. The specifics of the
algorithm, an associated diffServRandomDropEntry is indicated by algorithm may be proprietary. For this algorithm,
pointing diffServAlgDropSpecific at the diffServRandomDropTable. diffServAlgDropSpecific points to a diffServRandom-
The relevant entry in that table is selected by the common DropEntry that describes the algorithm. For this
indexing of the two tables. For this algorithm, algorithm, diffServAlgQThreshold is understood to be
diffServAlgQThreshold is understood to be the absolute maximum the absolute maximum size of the queue and additional
size of the queue and additional parameters are described in parameters are described in diffServRandomDropTable."
diffServRandomDropTable." ::= { diffServAlgDropEntry 2 }
::= { diffServAlgDropEntry 3 }
diffServAlgDropNext OBJECT-TYPE diffServAlgDropNext OBJECT-TYPE
SYNTAX RowPointer SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Next pointer indicates the next datapath element to handle "This selects the next diffserv functional datapath
the traffic e.g. a queue datapath element. element to handle traffic for this data path. This
RowPointer should point to an instance of one of:
diffServClfrEntry
diffServMeterEntry
diffServActionEntry
diffServAlgDropEntry
diffServQEntry
The value zeroDotZero in this variable indicates no further A value of zeroDotZero in this attribute indicates no
DiffServ treatment is performed on this flow by the current further Diffserv treatment is performed on traffic of
interface for this interface direction. If the row pointed to this datapath.
does not exist, the algorithmic dropper element is considered
inactive." If the row pointed to does not exist, the treatment
::= { diffServAlgDropEntry 4 } is as if this attribute contains a value of zero-
DotZero."
::= { diffServAlgDropEntry 3 }
diffServAlgDropQMeasure OBJECT-TYPE diffServAlgDropQMeasure OBJECT-TYPE
SYNTAX RowPointer SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Points to an entry in the diffServQueueTable to indicate the "Points to an entry in the diffServQTable to indicate
queue that a drop algorithm is to monitor when deciding whether the queue that a drop algorithm is to monitor when
to drop a packet. If the row pointed to does not exist, the deciding whether to drop a packet. If the row
algorithmic dropper element is considered inactive." pointed to does not exist, the algorithmic dropper
::= { diffServAlgDropEntry 5 } element is considered inactive."
::= { diffServAlgDropEntry 4 }
diffServAlgDropQThreshold OBJECT-TYPE diffServAlgDropQThreshold OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "Bytes" UNITS "Bytes"
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A threshold on the depth in bytes of the queue being measured at "A threshold on the depth in bytes of the queue being
which a trigger is generated to the dropping algorithm. measured at which a trigger is generated to the drop-
ping algorithm.
For the tailDrop(2) or headDrop(3) algorithms, this represents For the tailDrop(2) or headDrop(3) algorithms, this
the depth of the queue diffServAlgDropQMeasure at which the drop represents the depth of the queue, pointed to by
action will take place. Other algorithms will need to define diffServAlgDropQMeasure, at which the drop action
will take place. Other algorithms will need to define
their own semantics for this threshold." their own semantics for this threshold."
::= { diffServAlgDropEntry 6 } ::= { diffServAlgDropEntry 5 }
diffServAlgDropSpecific OBJECT-TYPE diffServAlgDropSpecific OBJECT-TYPE
SYNTAX OBJECT IDENTIFIER SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Points to a table (not an entry in the table) defined elsewhere "Points to a table entry that provides further detail
that provides further detail regarding a drop algorithm. Entries regarding a drop algorithm.
in such a table are indexed by the same variables as this
diffServAlgDropEntry but note that those entries must be managed
independently of those in this table.
Entries with diffServAlgDropType equal to other(1) may have this Entries with diffServAlgDropType equal to other(1)
point to a table defined in another MIB module. Entries with may have this point to a table defined in another MIB
diffServAlgDropType equal to randomDrop(4) must have this point module.
to diffServRandomDropTable.
Entries with diffServAlgDropType equal to random-
Drop(4) must have this point to an entry in diffSer-
vRandomDropTable.
For all other algorithms, this should take the value For all other algorithms, this should take the value
zeroDotzero." zeroDotzero."
::= { diffServAlgDropEntry 7 } ::= { diffServAlgDropEntry 6 }
diffServAlgDropOctets OBJECT-TYPE diffServAlgDropOctets OBJECT-TYPE
SYNTAX Counter32 SYNTAX Counter32
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of octets that have been dropped by this drop "The number of octets that have been dropped by this
process. On high speed devices, this object implements the least drop process. On high speed devices, this object
significant 32 bits of diffServAlgDropHCOctets. implements the least significant 32 bits of diffSer-
vAlgDropHCOctets.
Discontinuities in the value of this counter can occur at re- Discontinuities in the value of this counter can
initialization of the management system and at other times as occur at re-initialization of the management system
indicated by the value of ifCounterDiscontinuityTime appropriate and at other times as indicated by the value of
to this interface." ifCounterDiscontinuityTime appropriate to this inter-
::= { diffServAlgDropEntry 8 } face."
::= { diffServAlgDropEntry 7 }
diffServAlgDropHCOctets OBJECT-TYPE diffServAlgDropHCOctets OBJECT-TYPE
SYNTAX Counter64 SYNTAX Counter64
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of octets that have been dropped by this drop "The number of octets that have been dropped by this
process. This object should be used on high speed interfaces. drop process. This object should be used on high
speed interfaces.
Discontinuities in the value of this counter can occur at re- Discontinuities in the value of this counter can
initialization of the management system and at other times as occur at re-initialization of the management system
indicated by the value of ifCounterDiscontinuityTime appropriate and at other times as indicated by the value of
to this interface." ifCounterDiscontinuityTime appropriate to this inter-
::= { diffServAlgDropEntry 9 } face."
::= { diffServAlgDropEntry 8 }
diffServAlgDropPkts OBJECT-TYPE diffServAlgDropPkts OBJECT-TYPE
SYNTAX Counter32 SYNTAX Counter32
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of packets that have been dropped by this drop "The number of packets that have been dropped by this
process. On high speed devices, this object implements the least drop process. On high speed devices, this object
significant 32 bits of diffServAlgDropHCPkts. implements the least significant 32 bits of diffSer-
vAlgDropHCPkts.
Discontinuities in the value of this counter can occur at re- Discontinuities in the value of this counter can
initialization of the management system and at other times as occur at re-initialization of the management system
indicated by the value of ifCounterDiscontinuityTime appropriate and at other times as indicated by the value of
to this interface." ifCounterDiscontinuityTime appropriate to this inter-
::= { diffServAlgDropEntry 10 } face."
::= { diffServAlgDropEntry 9 }
diffServAlgDropHCPkts OBJECT-TYPE diffServAlgDropHCPkts OBJECT-TYPE
SYNTAX Counter64 SYNTAX Counter64
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The number of packets that have been dropped by this drop "The number of packets that have been dropped by this
process. This object should be used on high speed interfaces. drop process. This object should be used on high
speed interfaces.
Discontinuities in the value of this counter can occur at re- Discontinuities in the value of this counter can
initialization of the management system and at other times as occur at re-initialization of the management system
indicated by the value of ifCounterDiscontinuityTime appropriate and at other times as indicated by the value of
to this interface." ifCounterDiscontinuityTime appropriate to this inter-
::= { diffServAlgDropEntry 11 } face."
::= { diffServAlgDropEntry 10 }
diffServAlgDropStatus OBJECT-TYPE diffServAlgDropStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation, or "The RowStatus variable controls the activation,
deletion of this entry. Any writable variable may be modified deactivation, or deletion of this entry. Any writable
whether the row is active or notInService." variable may be modified whether the row is active or
::= { diffServAlgDropEntry 12 } notInService."
::= { diffServAlgDropEntry 11 }
diffServAlgDropNextFree OBJECT-TYPE --
-- Random Drop Table
--
diffServRandomDropNextFree OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This object yields a value when read that is currently-unused "This object yields a value when read that is
for a diffServAlgDropId instance. If a configuring system currently unused for a diffServRandomDropId instance.
attempts to create a new row in the diffServAlgDropTable using If a configuring system attempts to create a new row
this value, that operation will fail if the value has, in the in the diffServRandomDropTable using this value, that
meantime, been used to create another row that is currently operation will fail if the value has, in the mean-
valid." time, been used to create another row that is
::= { diffServObjects 7 } currently valid."
::= { diffServAlgDrop 3 }
diffServRandomDropTable OBJECT-TYPE diffServRandomDropTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServRandomDropEntry SYNTAX SEQUENCE OF DiffServRandomDropEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The random drop table augments the algorithmic drop table. It "The random drop table contains entries describing a
contains entries describing a process that drops packets process that drops packets randomly. Entries in this
randomly. This table is intended to be pointed to by the table is intended to be pointed to by diffSer-
associated diffServAlgDropSpecific in such cases." vAlgDropSpecific."
REFERENCE REFERENCE
"[MODEL] section 7.1.3" "[MODEL] section 7.1.3"
::= { diffServTables 9 } ::= { diffServAlgDrop 4 }
diffServRandomDropEntry OBJECT-TYPE diffServRandomDropEntry OBJECT-TYPE
SYNTAX DiffServRandomDropEntry SYNTAX DiffServRandomDropEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry describes a process that drops packets according to a "An entry describes a process that drops packets
random algorithm. Entries in this table share indexing with a according to a random algorithm."
parent diffServAlgDropEntry although they must be managed (e.g. INDEX { diffServRandomDropId }
created/deleted) by explicit management action, independently of
the associated value of diffServAlgDropSpecific."
INDEX { ifIndex, diffServAlgDropIfDirection,
diffServAlgDropId }
::= { diffServRandomDropTable 1 } ::= { diffServRandomDropTable 1 }
DiffServRandomDropEntry ::= SEQUENCE { DiffServRandomDropEntry ::= SEQUENCE {
diffServRandomDropId Unsigned32,
diffServRandomDropMinThreshBytes Unsigned32, diffServRandomDropMinThreshBytes Unsigned32,
diffServRandomDropMinThreshPkts Unsigned32, diffServRandomDropMinThreshPkts Unsigned32,
diffServRandomDropMaxThreshBytes Unsigned32, diffServRandomDropMaxThreshBytes Unsigned32,
diffServRandomDropMaxThreshPkts Unsigned32, diffServRandomDropMaxThreshPkts Unsigned32,
diffServRandomDropInvProbMax Unsigned32,
diffServRandomDropInvWeight Unsigned32, diffServRandomDropInvWeight Unsigned32,
diffServRandomDropProbMax Unsigned32, diffServRandomDropSamplingRate Unsigned32,
diffServRandomDropStatus RowStatus diffServRandomDropStatus RowStatus
} }
diffServRandomDropId OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"An index that enumerates the Random Drop entries.
The set of such identifiers spans the whole agent.
Managers should obtain new values for row creation in
this table by reading diffServRandomDropNextFree."
::= { diffServRandomDropEntry 1 }
diffServRandomDropMinThreshBytes OBJECT-TYPE diffServRandomDropMinThreshBytes OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "bytes" UNITS "bytes"
MAX-ACCESS read-create MAX-ACCESS read-create
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
non-zero probability of being dropped. Changes in this variable traffic has a non-zero probability of being dropped.
may or may not be reflected in the reported value of Changes in this variable may or may not be reflected
diffServRandomDropMinThreshPkts." in the reported value of diffServRandomDrop-
::= { diffServRandomDropEntry 1 } MinThreshPkts."
::= { diffServRandomDropEntry 2 }
diffServRandomDropMinThreshPkts OBJECT-TYPE diffServRandomDropMinThreshPkts OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "packets" UNITS "packets"
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The average queue depth in packets, beyond which traffic has a "The average queue depth in packets, beyond which
non-zero probability of being dropped. Changes in this variable traffic has a non-zero probability of being dropped.
may or may not be reflected in the reported value of Changes in this variable may or may not be reflected
diffServRandomDropMinThreshBytes." in the reported value of diffServRandomDropMinThresh-
::= { diffServRandomDropEntry 2 } Bytes."
::= { diffServRandomDropEntry 3 }
diffServRandomDropMaxThreshBytes OBJECT-TYPE diffServRandomDropMaxThreshBytes OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "bytes" UNITS "bytes"
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The average queue depth beyond which traffic has a probability "The average queue depth beyond which traffic has a
indicated by diffServRandomDropInvMaxProb of being dropped or probability indicated by diffServRandomDropInvProbMax
marked. Note that this differs from the physical queue limit, of being dropped or marked. Note that this differs
which is stored in diffServAlgDropQThreshold. Changes in this from the physical queue limit, which is stored in
variable may or may not be reflected in the reported value of diffServAlgDropQThreshold. Changes in this variable
may or may not be reflected in the reported value of
diffServRandomDropMaxThreshPkts." diffServRandomDropMaxThreshPkts."
::= { diffServRandomDropEntry 3 } ::= { diffServRandomDropEntry 4 }
diffServRandomDropMaxThreshPkts OBJECT-TYPE diffServRandomDropMaxThreshPkts OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
UNITS "packets" UNITS "packets"
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The average queue depth beyond which traffic has a probability "The average queue depth beyond which traffic has a
indicated by diffServRandomDropInvMaxProb of being dropped or probability indicated by diffServRandomDropInvProbMax
marked. Note that this differs from the physical queue limit, of being dropped or marked. Note that this differs
which is stored in diffServAlgDropQThreshold. Changes in this from the physical queue limit, which is stored in
variable may or may not be reflected in the reported value of diffServAlgDropQThreshold. Changes in this variable
may or may not be reflected in the reported value of
diffServRandomDropMaxThreshBytes." diffServRandomDropMaxThreshBytes."
::= { diffServRandomDropEntry 4 } ::= { diffServRandomDropEntry 5 }
diffServRandomDropInvWeight OBJECT-TYPE diffServRandomDropInvProbMax OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The weighting of past history in affecting the calculation of "The worst case random drop probability, expressed as
the current queue average. The moving average of the queue depth the inverse of the drop probability. With special
uses the inverse of this value as the factor for the new queue case of the value zero meaning zero probability of
depth, and one minus that inverse as the factor for the drop.
historical average.
Implementations may choose to limit the acceptable set of values For example, if every packet may be dropped in the
to a specified set, such as powers of 2." worst case (100%), this has the value of
::= { diffServRandomDropEntry 5 } 4,294,967,295."
::= { diffServRandomDropEntry 6 }
diffServRandomDropProbMax OBJECT-TYPE diffServRandomDropInvWeight OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The worst case random drop probability, expressed in drops per "The weighting of past history in affecting the cal-
thousand packets. culation of the current queue average. The moving
average of the queue depth uses the inverse of this
value as the factor for the new queue depth, and one
minus that inverse as the factor for the historical
average.
For example, if every packet may be dropped in the worst case Implementations may choose to limit the acceptable
(100%), this has the value 1000. Alternatively, if in the worst set of values to a specified set, such as powers of
case one percent (1%) of traffic may be dropped, it has the value 2."
10." ::= { diffServRandomDropEntry 7 }
::= { diffServRandomDropEntry 6 }
diffServRandomDropSamplingRate OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The number of times per second the queue is sampled
for queue average calculation. A value of zero means
the queue is sampled approximately each time a packet
is enqueued (or dequeued)."
::= { diffServRandomDropEntry 8 }
diffServRandomDropStatus OBJECT-TYPE diffServRandomDropStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation, or "The RowStatus variable controls the activation,
deletion of this entry. Any writable variable may be modified deactivation, or deletion of this entry. Any writable
whether the row is active or notInService." variable may be modified whether the row is active or
::= { diffServRandomDropEntry 7 } notInService."
::= { diffServRandomDropEntry 9 }
-- --
-- Queue Table -- Queue Table
-- --
diffServQueue OBJECT IDENTIFIER ::= { diffServMIBObjects 6 }
--
-- An entry of diffServQTable represents a FIFO queue diffserv
-- functional datapath element as described in [MODEL] section
-- 7.1.1.
-- Notice the specification of scheduling parameters for a queue
-- as part of the input to a scheduler functional datapath
-- element as described in [MODEL] section 7.1.2. This allows
-- building of hierarchical queueing/scheduling.
-- A queue therefore is parameterized by:
-- 1. Which scheduler will service this queue, diffServQNext.
-- 2. How the scheduler will service this queue, with respect
-- to all the other queues the same scheduler needs to service,
-- diffServQSchdParam.
--
-- Notice one or more upstream diffserv datapath element may share,
-- point to, a diffServQTable entry as described in [MODEL] section
-- 7.1.1.
--
-- Each entry of the diffServQTable belongs to one and only one
-- datapath.
--
diffServQNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is
currently unused for a diffServQId instance. If a
configuring system attempts to create a new row in
the diffServQTable using this value, that operation
will fail if the value has, in the meantime, been
used to create another row that is currently valid."
::= { diffServQueue 1 }
diffServQTable OBJECT-TYPE diffServQTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServQEntry SYNTAX SEQUENCE OF DiffServQEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Queue Table enumerates the individual queues on an "The Queue Table enumerates the individual queues."
interface." REFERENCE
::= { diffServTables 10 } "[MODEL] section 7.1.1"
::= { diffServQueue 2 }
diffServQEntry OBJECT-TYPE diffServQEntry OBJECT-TYPE
SYNTAX DiffServQEntry SYNTAX DiffServQEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the Queue Table describes a single queue in one "An entry in the Queue Table describes a single
direction on an interface." queue. With each entry belonging to one and only one
INDEX { ifIndex, diffServQIfDirection, diffServQId } datapath."
INDEX { diffServQId }
::= { diffServQTable 1 } ::= { diffServQTable 1 }
DiffServQEntry ::= SEQUENCE { DiffServQEntry ::= SEQUENCE {
diffServQIfDirection IfDirection,
diffServQId Unsigned32, diffServQId Unsigned32,
diffServQNext RowPointer, diffServQNext RowPointer,
diffServQPriority Unsigned32, diffServQSchdParam RowPointer,
diffServQMinRateAbs Unsigned32,
diffServQMinRateRel Unsigned32,
diffServQMaxRateAbs Unsigned32,
diffServQMaxRateRel Unsigned32,
diffServQStatus RowStatus diffServQStatus RowStatus
} }
diffServQIfDirection OBJECT-TYPE
SYNTAX IfDirection
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"Specifies the direction for which this queue entry applies on
this interface."
::= { diffServQEntry 1 }
diffServQId OBJECT-TYPE diffServQId OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Queue Id enumerates the Queue entry. Managers should obtain "An index that enumerates the Queue entries. The set
new values for row creation in this table by reading of such identifiers spans the whole agent. Managers
diffServQNextFree." should obtain new values for row creation in this
::= { diffServQEntry 2 } table by reading diffServQNextFree."
::= { diffServQEntry 1 }
diffServQNext OBJECT-TYPE diffServQNext OBJECT-TYPE
SYNTAX RowPointer SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Next pointer indicates the next datapath element to handle "This selects the next diffserv functional datapath
the traffic e.g. a scheduler datapath element. If the row element to handle traffic for this data path. This
pointed to does not exist, the queue element is considered RowPointer must point to an instance of one of:
inactive." diffServSchedulerEntry
::= { diffServQEntry 3 }
diffServQPriority OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The priority of this queue, to be used as a parameter to the
next scheduler element downstream from this one."
::= { diffServQEntry 4 }
diffServQMinRateAbs OBJECT-TYPE
SYNTAX Unsigned32
UNITS "kilobits per second"
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The minimum absolute rate, in kilobits/sec, that a downstream
scheduler element should allocate to this queue. If the value is
zero, then there is effectively no minimum rate guarantee. If
the value is non-zero, the scheduler will assure the servicing of
this queue to at least this rate.
Note that this attribute's value is coupled to that of
diffServQMinRateRel: changes to one will affect the value of the
other. They are linked by the following equation:
diffServQMinRateRel = diffServQMinRateAbs * 10,000,000/ifSpeed
or, if appropriate:
diffServQMinRateRel = diffServQMinRateAbs * 10 / ifHighSpeed"
REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]"
::= { diffServQEntry 5 }
diffServQMinRateRel OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The minimum rate that a downstream scheduler element should
allocate to this queue, relative to the maximum rate of the
interface as reported by ifSpeed or ifHighSpeed, in units of
1/10,000 of 1. If the value is zero, then there is effectively
no minimum rate guarantee. If the value is non-zero, the
scheduler will assure the servicing of this queue to at least
this rate.
Note that this attribute's value is coupled to that of
diffServQMinRateAbs: changes to one will affect the value of the
other. They are linked by the following equation:
diffServQMinRateAbs = ifSpeed * diffServQMinRateRel/10,000,000
or, if appropriate:
diffServQMinRateAbs = ifHighSpeed * diffServQMinRateRel / 10"
REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]"
::= { diffServQEntry 6 }
diffServQMaxRateAbs OBJECT-TYPE
SYNTAX Unsigned32
UNITS "kilobits per second"
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The maximum rate in kilobits/sec that a downstream scheduler
element should allocate to this queue. If the value is zero, then
there is effectively no maximum rate limit and that the scheduler
should attempt to be work-conserving for this queue. If the
value is non-zero, the scheduler will limit the servicing of this
queue to, at most, this rate in a non-work-conserving manner.
Note that this attribute's value is coupled to that of
diffServQMaxRateRel: changes to one will affect the value of the
other. They are linked by the following equation:
diffServQMaxRateRel = diffServQMaxRateAbs * 10,000,000/ifSpeed
or, if appropriate: A value of zeroDotZero in this attribute indicates an
incomplete diffServQEntry instance. An illegal con-
figuration.
diffServQMaxRateRel = diffServQMaxRateAbs * 10 / ifHighSpeed" If the row pointed to does not exist, the treatment
REFERENCE is as if this attribute contains a value of zero-
"ifSpeed, ifHighSpeed from [IFMIB]" DotZero."
::= { diffServQEntry 7 } ::= { diffServQEntry 2 }
diffServQMaxRateRel OBJECT-TYPE diffServQSchdParam OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The maximum rate that a downstream scheduler element should "This RowPointer indicates the entry in
allocate to this queue, relative to the maximum rate of the diffServSchdParamTable the scheduler, pointed to by
interface as reported by ifSpeed or ifHighSpeed, in units of diffServQNext, should use to service this queue.
1/10,000 of 1. If the value is zero, then there is effectively
no maximum rate limit and the scheduler should attempt to be
work-conserving for this queue. If the value is non-zero, the
scheduler will limit the servicing of this queue to, at most,
this rate in a non-work-conserving manner.
Note that this attribute's value is coupled to that of
diffServQMaxRateAbs: changes to one will affect the value of the
other. They are linked by the following equation:
diffServQMaxRateAbs = ifSpeed * diffServQMaxRateRel/10,000,000
or, if appropriate: A value of zeroDotZero in this attribute indicates an
incomplete diffServQEntry instance. An illegal con-
figuration.
diffServQMaxRateAbs = ifHighSpeed * diffServQMaxRateRel / 10" If the row pointed to does not exist, the treatment
REFERENCE is as if this attribute contains a value of zero-
"ifSpeed, ifHighSpeed from [IFMIB]" DotZero."
::= { diffServQEntry 8 } ::= { diffServQEntry 3 }
diffServQStatus OBJECT-TYPE diffServQStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation, or "The RowStatus variable controls the activation,
deletion of a queue. Any writable variable may be modified deactivation, or deletion of a queue. Any writable
whether the row is active or notInService." variable may be modified whether the row is active or
::= { diffServQEntry 9 } notInService."
::= { diffServQEntry 4 }
diffServQNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is currently-unused
for a diffServQId instance. If a configuring system attempts to
create a new row in the diffServQTable using this value, that
operation will fail if the value has, in the meantime, been used
to create another row that is currently valid."
::= { diffServObjects 8 }
-- --
-- Scheduler Table -- Scheduler Table
-- --
diffServScheduler OBJECT IDENTIFIER ::= { diffServMIBObjects 7 }
--
-- The Scheduler Table is used for representing packet schedulers: -- The Scheduler Table is used for representing packet schedulers:
-- it provides flexibility for multiple scheduling algorithms, each -- it provides flexibility for multiple scheduling algorithms, each
-- servicing multiple queues, to be used on the same logical/physical -- servicing multiple queues, to be used on the same logical/physical
-- interface. -- interface.
-- Notice the servicing parameters the scheduler uses is
-- specified by each of its upstream functional datapath elements,
-- most likely queues or schedulers.
-- The coordination and coherency between the servicing parameters
-- of the scheduler's upstream functional datapath elements must
-- be maintained for the scheduler to function correctly.
--
-- The diffServSchedulerSchdParam attribute is used for specifying
-- the servicing parameters for output of a scheduler when its
-- downstream functional datapath element is another scheduler.
-- This is used for building hierarchical queue/scheduler.
--
-- More discussion of the scheduler functional datapath element
-- is in [MODEL] section 7.1.2.
--
diffServSchedulerNextFree OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"This object yields a value when read that is
currently unused for a diffServSchedulerId instance.
If a configuring system attempts to create a new row
in the diffServSchedulerTable using this value, that
operation will fail if the value has, in the mean-
time, been used to create another row that is
currently valid."
::= { diffServScheduler 1 }
diffServSchedulerTable OBJECT-TYPE diffServSchedulerTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServSchedulerEntry SYNTAX SEQUENCE OF DiffServSchedulerEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Scheduler Table enumerates packet schedulers. Multiple "The Scheduler Table enumerates packet schedulers.
scheduling algorithms can be used on a given interface, with each Multiple scheduling algorithms can be used on a given
algorithm described by one diffServSchedulerEntry." datapath, with each algorithm described by one
diffServSchedulerEntry."
REFERENCE REFERENCE
"[MODEL] section 7.1.2" "[MODEL] section 7.1.2"
::= { diffServTables 11 } ::= { diffServScheduler 2 }
diffServSchedulerEntry OBJECT-TYPE diffServSchedulerEntry OBJECT-TYPE
SYNTAX DiffServSchedulerEntry SYNTAX DiffServSchedulerEntry
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"An entry in the Scheduler Table describing a single instance of "An entry in the Scheduler Table describing a single
a scheduling algorithm." instance of a scheduling algorithm."
INDEX { ifIndex, diffServSchedulerIfDirection, INDEX { diffServSchedulerId }
diffServSchedulerId }
::= { diffServSchedulerTable 1 } ::= { diffServSchedulerTable 1 }
DiffServSchedulerEntry ::= SEQUENCE { DiffServSchedulerEntry ::= SEQUENCE {
diffServSchedulerIfDirection IfDirection,
diffServSchedulerId Unsigned32, diffServSchedulerId Unsigned32,
diffServSchedulerMethod INTEGER,
diffServSchedulerNext RowPointer, diffServSchedulerNext RowPointer,
diffServSchedulerMethod INTEGER,
diffServSchedulerSchdParam RowPointer,
diffServSchedulerStatus RowStatus diffServSchedulerStatus RowStatus
} }
diffServSchedulerIfDirection OBJECT-TYPE diffServSchedulerId OBJECT-TYPE
SYNTAX IfDirection SYNTAX Unsigned32
MAX-ACCESS not-accessible MAX-ACCESS not-accessible
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Specifies the direction for which this scheduler entry applies "An index that enumerates the Scheduler entries. The
on this interface." set of such identifiers spans the whole agent.
Managers should obtain new values for row creation in
this table by reading diffServSchedulerNextFree."
::= { diffServSchedulerEntry 1 } ::= { diffServSchedulerEntry 1 }
diffServSchedulerId OBJECT-TYPE diffServSchedulerNext OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX RowPointer
MAX-ACCESS not-accessible MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This identifies the scheduler entry. Managers should obtain new "This selects the next diffserv functional datapath
values for row creation in this table by reading element to handle traffic for this data path. This
diffServSchedulerNextFree." RowPointer should point to an instance of one of:
diffServSchedulerEntry
diffServQEntry As indicated by [MODEL] section
7.1.4.
This should point to another diffServSchedulerEntry
for implementation of multiple scheduler methods for
the same datapath, and for implementation of
hierarchical schedulers.
A value of zeroDotZero in this attribute indicates no
further Diffserv treatment is performed on traffic of
this datapath. The use of zeroDotZero is the normal
usage for the last functional datapath element.
If the row pointed to does not exist, the treatment
is as if this attribute contains a value of zero-
DotZero."
DEFVAL { zeroDotZero }
::= { diffServSchedulerEntry 2 } ::= { diffServSchedulerEntry 2 }
diffServSchedulerMethod OBJECT-TYPE diffServSchedulerMethod OBJECT-TYPE
SYNTAX INTEGER { SYNTAX INTEGER {
other(1), -- not listed here other(1), -- not listed here
priorityq(2), -- Priority Queueing priorityq(2), -- Priority Queueing
wrr(3) -- Weighed Round Robin wrr(3), -- Weighted Round Robin
wfq(4), -- Weighted Fair Queuing
wirr(5), -- Weighted Interleaved Round Robin
bsp(6) -- Bounded Strict Priority
} }
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The scheduling algorithm used by this Scheduler. "The scheduling algorithm used by this Scheduler.
A value of priorityq(2) is used to indicate strict priority A value of priorityq(2) is used to indicate strict
queueing: only the diffServQPriority attributes of the queues priority queueing: only the diffServSchdParamPriority
feeding this scheduler are used when determining the next packet attributes of the queues/schedulers feeding this
scheduler are used when determining the next packet
to schedule. to schedule.
A value of wrr(3) indicates weighted round-robin scheduling. A value of wrr(3) indicates weighted round-robin
Packets are scheduled from each of the queues feeding this scheduling. Packets are scheduled from each of the
scheduler according to all of the parameters of the diffServQueue queues/schedulers feeding this scheduler according to
entry." all of the parameters of their respective
diffServSchdParamEntry.
A value of wfq(4) indicates weighted fair queueing
scheduling. Packets are scheduled from each of the
queues/schedulers feeding this scheduler according to
all of the parameters of their respective
diffServSchdParamEntry.
A value of wirr(5) indicates weighted interleaved
roundrobin queueing scheduling. Packets are
scheduled from each of the queues/schedulers feeding
this scheduler according to all the parameters of
their respective diffServSchdParamEntry.
A value of bsp(6) indicates bounded strict priority
scheduling. Packets are scheduled from each of the
queues/schedulers feeding this scheduler according to
all the parameters of their respective
diffServSchdParamEntry."
REFERENCE REFERENCE
"[MODEL] section 7.1.2" "[MODEL] section 7.1.2"
::= { diffServSchedulerEntry 3 } ::= { diffServSchedulerEntry 3 }
diffServSchedulerNext OBJECT-TYPE diffServSchedulerSchdParam OBJECT-TYPE
SYNTAX RowPointer SYNTAX RowPointer
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"Selects the next data path component, which can be another "This RowPointer indicates the entry in
scheduler or other TC elements. One usage of multiple scheduler diffServSchdParamTable the higher level scheduler,
elements in series is for Class Base Queueing (CBQ). pointed to by diffServSchedulerNext, should use to
service the output of this scheduler. This attribute
The value zeroDotZero in this variable indicates no further is only used when there is more than one level of
DiffServ treatment is performed on this flow by the current scheduler. And should have the value of zeroDotZero
interface for this interface direction. For example, for an when not used."
inbound interface the value zeroDotZero indicates that the packet
flow has now completed inbound DiffServ treatment and should be
forwarded on to the appropriate outbound interface. If the row
pointed to does not exist, the scheduler element is considered
inactive."
DEFVAL { zeroDotZero } DEFVAL { zeroDotZero }
::= { diffServSchedulerEntry 4 } ::= { diffServSchedulerEntry 4 }
diffServSchedulerStatus OBJECT-TYPE diffServSchedulerStatus OBJECT-TYPE
SYNTAX RowStatus SYNTAX RowStatus
MAX-ACCESS read-create MAX-ACCESS read-create
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The RowStatus variable controls the activation, deactivation, or "The RowStatus variable controls the activation,
deletion of a queue. Any writable variable may be modified deactivation, or deletion of a queue. Any writable
whether the row is active or notInService." variable may be modified whether the row is active or
notInService."
::= { diffServSchedulerEntry 5 } ::= { diffServSchedulerEntry 5 }
diffServSchedulerNextFree OBJECT-TYPE --
-- Scheduling Parameter Table
--
-- The scheduling parameters are separate from the Queue Entries
-- for reusability and for usage by both queues and schedulers,
-- and this follows the separation of datapath elements from
-- parameterization approach used throught out this MIB.
-- Usage of scheduling parameter table entry by schedulers allow
-- building of hierarchical scheduling.
--
-- The diffServSchdParamMaxRateAbs/Rel attributes are used to
-- construct non-work-conserving scheduler for the purpose of
-- traffic shaping. These attributes limits the servicing of
-- the queue/scheduler, in affect, shaping the output of the
-- queue/scheduler, as described in [MODEL] section 7.2.
--
diffServSchdParamNextFree OBJECT-TYPE
SYNTAX Unsigned32 SYNTAX Unsigned32
MAX-ACCESS read-only MAX-ACCESS read-only
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This object yields a value when read that is currently-unused "This object yields a value when read that is
for a diffServSchedulerId instance. If a configuring system currently unused for a diffServSchdParamId instance.
attempts to create a new row in the diffServSchedulerTable using If a configuring system attempts to create a new row
this value, that operation will fail if the value has, in the in the diffServSchdParamTable using this value, that
meantime, been used to create another row that is currently operation will fail if the value has, in the mean-
valid." time, been used to create another row that is
::= { diffServObjects 9 } currently valid."
::= { diffServScheduler 3 }
diffServSchdParamTable OBJECT-TYPE
SYNTAX SEQUENCE OF DiffServSchdParamEntry
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"The Scheduling Parameter Table enumerates individual
sets of scheduling parameter that can be used/reused
by Queues and Schedulers."
::= { diffServScheduler 4 }
diffServSchdParamEntry OBJECT-TYPE
SYNTAX DiffServSchdParamEntry
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"An entry in the Scheduling Parameter Table describes
a single set of scheduling parameter for use by
queues and schedulers.
Notice multiple inter-mixed of Queue and Scheduler
entries can use the same Scheduler Parameter entry."
INDEX { diffServSchdParamId }
::= { diffServSchdParamTable 1 }
DiffServSchdParamEntry ::= SEQUENCE {
diffServSchdParamId Unsigned32,
diffServSchdParamPriority Unsigned32,
diffServSchdParamMinRateAbs Unsigned32,
diffServSchdParamMinRateRel Unsigned32,
diffServSchdParamMaxRateAbs Unsigned32,
diffServSchdParamMaxRateRel Unsigned32,
diffServSchdParamStatus RowStatus
}
diffServSchdParamId OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS not-accessible
STATUS current
DESCRIPTION
"An index that enumerates the Scheduler Parameter
entries. The set of such identifiers spans the whole
agent. Managers should obtain new values for row
creation in this table by reading diffServSchdParam-
NextFree."
::= { diffServSchdParamEntry 1 }
diffServSchdParamPriority OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The priority of this queue, to be used as a parame-
ter to the next scheduler element downstream from
this one."
::= { diffServSchdParamEntry 2 }
diffServSchdParamMinRateAbs OBJECT-TYPE
SYNTAX Unsigned32
UNITS "kilobits per second"
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The minimum absolute rate, in kilobits/sec, that a
downstream scheduler element should allocate to this
queue. If the value is zero, then there is effec-
tively no minimum rate guarantee. If the value is
non-zero, the scheduler will assure the servicing of
this queue to at least this rate.
Note that this attribute's value is coupled to that
of diffServSchdParamMinRateRel: changes to one will
affect the value of the other. They are linked by the
following equation:
diffServSchdParamMinRateRel = diffServSchdParamMinRateAbs
* 10,000,000/ifSpeed
or, if appropriate:
diffServSchdParamMinRateRel = diffServSchdParamMinRateAbs
* 10 / ifHighSpeed"
REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]"
::= { diffServSchdParamEntry 3 }
diffServSchdParamMinRateRel OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The minimum rate that a downstream scheduler element
should allocate to this queue, relative to the max-
imum rate of the interface as reported by ifSpeed or
ifHighSpeed, in units of 1/10,000 of 1. If the value
is zero, then there is effectively no minimum rate
guarantee. If the value is non-zero, the scheduler
will assure the servicing of this queue to at least
this rate.
Note that this attribute's value is coupled to that
of diffServSchdParamMinRateAbs: changes to one will
affect the value of the other. They are linked by the
following equation:
diffServSchdParamMinRateAbs = ifSpeed
* diffServSchdParamMinRateRel/10,000,000
or, if appropriate:
diffServSchdParamMinRateAbs = ifHighSpeed
* diffServSchdParamMinRateRel / 10"
REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]"
::= { diffServSchdParamEntry 4 }
diffServSchdParamMaxRateAbs OBJECT-TYPE
SYNTAX Unsigned32
UNITS "kilobits per second"
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The maximum rate in kilobits/sec that a downstream
scheduler element should allocate to this queue. If
the value is zero, then there is effectively no
maximum rate limit and that the scheduler should
attempt to be work-conserving for this queue. If the
value is non-zero, the scheduler will limit the ser-
vicing of this queue to, at most, this rate in a
non-work-conserving manner.
Note that this attribute's value is coupled to that
of diffServSchdParamMaxRateRel: changes to one will
affect the value of the other. They are linked by the
following equation:
diffServSchdParamMaxRateRel = diffServSchdParamMaxRateAbs
* 10,000,000/ifSpeed
or, if appropriate:
diffServSchdParamMaxRateRel = diffServSchdParamMaxRateAbs
* 10 / ifHighSpeed"
REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]"
::= { diffServSchdParamEntry 5 }
diffServSchdParamMaxRateRel OBJECT-TYPE
SYNTAX Unsigned32
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The maximum rate that a downstream scheduler element
should allocate to this queue, relative to the max-
imum rate of the interface as reported by ifSpeed or
ifHighSpeed, in units of 1/10,000 of 1. If the value
is zero, then there is effectively no maximum rate
limit and the scheduler should attempt to be work-
conserving for this queue. If the value is non-zero,
the scheduler will limit the servicing of this queue
to, at most, this rate in a non-work-conserving
manner.
Note that this attribute's value is coupled to that
of diffServSchdParamMaxRateAbs: changes to one will
affect the value of the other. They are linked by the
following equation:
diffServSchdParamMaxRateAbs = ifSpeed
* diffServSchdParamMaxRateRel/10,000,000
or, if appropriate:
diffServSchdParamMaxRateAbs = ifHighSpeed
* diffServSchdParamMaxRateRel / 10"
REFERENCE
"ifSpeed, ifHighSpeed from [IFMIB]"
::= { diffServSchdParamEntry 6 }
diffServSchdParamStatus OBJECT-TYPE
SYNTAX RowStatus
MAX-ACCESS read-create
STATUS current
DESCRIPTION
"The RowStatus variable controls the activation,
deactivation, or deletion of a queue. Any writable
variable may be modified whether the row is active or
notInService."
::= { diffServSchdParamEntry 7 }
-- --
-- MIB Compliance statements. -- MIB Compliance statements.
-- --
diffServMIBCompliances OBJECT IDENTIFIER ::= { diffServMIBConformance 1 } diffServMIBCompliances OBJECT IDENTIFIER ::= { diffServMIBConformance 1 }
diffServMIBGroups OBJECT IDENTIFIER ::= { diffServMIBConformance 2 } diffServMIBGroups OBJECT IDENTIFIER ::= { diffServMIBConformance 2 }
diffServMIBCompliance MODULE-COMPLIANCE diffServMIBCompliance MODULE-COMPLIANCE
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"This MIB may be implemented as a read-only or as a read-create "This MIB may be implemented as a read-only or as a
MIB. As a result, it may be used for monitoring or for read-create MIB. As a result, it may be used for mon-
configuration." itoring or for configuration."
MODULE -- This Module MODULE -- This Module
MANDATORY-GROUPS { MANDATORY-GROUPS {
diffServMIBClassifierGroup, diffServMIBSixTupleClfrGroup, diffServMIBDataPathGroup,
diffServMIBActionGroup, diffServMIBAlgDropGroup, diffServMIBClfrGroup,
diffServMIBQueueGroup, diffServMIBSchedulerGroup } diffServMIBClfrElementGroup,
diffServMIBSixTupleClfrGroup,
diffServMIBActionGroup,
diffServMIBAlgDropGroup,
diffServMIBQGroup, diffServMIBSchedulerGroup,
diffServMIBSchdParamGroup }
-- The groups: -- The groups:
-- diffServMIBCounterGroup -- diffServMIBCounterGroup
-- diffServMIBHCCounterGroup -- diffServMIBHCCounterGroup
-- diffServMIBVHCCounterGroup -- diffServMIBVHCCounterGroup
-- --
-- are mutually exclusive; at most one of these groups is implemented -- are mutually exclusive; at most one of these groups is implemented
-- for a particular interface. When any of these groups is implemented -- for a particular interface. When any of these groups is implemented
-- for a particular interface, then ifCounterDiscontinuityGroup from -- for a particular interface, then ifCounterDiscontinuityGroup from
-- [IFMIB] must also be implemented for that interface. -- [IFMIB] must also be implemented for that interface.
-- note that the diffServMIBStaticGroup is -- note that the diffServMIBStaticGroup is
-- mandatory for implementations that implement a -- mandatory for implementations that implement a
-- read-write or read-create mode. -- read-write or read-create mode.
GROUP diffServMIBCounterGroup GROUP diffServMIBCounterGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for table objects indexed by ifIndex for "This group is mandatory for table objects indexed by
which the value of the corresponding instance of ifSpeed is less ifIndex for which the value of the corresponding
than or equal to 20,000,000 bits/second." instance of ifSpeed is less than or equal to
20,000,000 bits/second."
GROUP diffServMIBHCCounterGroup GROUP diffServMIBHCCounterGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for table objects indexed by ifIndex for "This group is mandatory for table objects indexed by
which the value of the corresponding instance of ifSpeed is ifIndex for which the value of the corresponding
greater than 20,000,000 bits/second." instance of ifSpeed is greater than 20,000,000
bits/second."
GROUP diffServMIBVHCCounterGroup GROUP diffServMIBVHCCounterGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for table objects indexed by ifIndex for "This group is mandatory for table objects indexed by
which the value of the corresponding instance of ifSpeed is ifIndex for which the value of the corresponding
greater than 650,000,000 bits/second." instance of ifSpeed is greater than 650,000,000
bits/second."
GROUP diffServMIBMeterGroup GROUP diffServMIBMeterGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that implement metering "This group is mandatory for devices that implement
functions." metering functions."
GROUP diffServMIBTokenBucketMeterGroup GROUP diffServMIBTBMeterGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that implement token-bucket "This group is mandatory for devices that implement
metering functions." token-bucket metering functions."
GROUP diffServMIBDscpMarkActionGroup GROUP diffServMIBDscpMarkActGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that implement DSCP-Marking "This group is mandatory for devices that implement
functions." DSCP-Marking functions."
GROUP diffServMIBRandomDropGroup GROUP diffServMIBRandomDropGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that implement Random Drop "This group is mandatory for devices that implement
functions." Random Drop functions."
GROUP diffServMIBStaticGroup GROUP diffServMIBStaticGroup
DESCRIPTION DESCRIPTION
"This group is mandatory for devices that allow creation of rows "This group is mandatory for devices that allow crea-
in any of the writable tables of this MIB." tion of rows in any of the writable tables of this
MIB."
OBJECT diffServClassifierFilter OBJECT diffServClfrStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServClassifierNext OBJECT diffServClfrElementOrder
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServClassifierPrecedence OBJECT diffServClfrElementNext
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServClassifierStatus OBJECT diffServClfrElementSpecific
MIN-ACCESS read-only
DESCRIPTION
"Write access is not required."
OBJECT diffServClfrElementStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServSixTupleClfrDstAddrType OBJECT diffServSixTupleClfrDstAddrType
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServSixTupleClfrDstAddr OBJECT diffServSixTupleClfrDstAddr
skipping to change at page 61, line 38 skipping to change at page 105, line 4
OBJECT diffServMeterFailNext OBJECT diffServMeterFailNext
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServMeterSpecific OBJECT diffServMeterSpecific
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServMeterStatus OBJECT diffServMeterStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServTBMeterType
MIN-ACCESS read-only
DESCRIPTION
"Write access is not required."
OBJECT diffServTBMeterRate OBJECT diffServTBMeterRate
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServTBMeterBurstSize OBJECT diffServTBMeterBurstSize
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServTBMeterInterval
MIN-ACCESS read-only
DESCRIPTION
"Write access is not required."
OBJECT diffServTBMeterStatus OBJECT diffServTBMeterStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServActionNext OBJECT diffServActionNext
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServActionSpecific OBJECT diffServActionSpecific
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServActionType
MIN-ACCESS read-only
DESCRIPTION
"Write access is not required."
OBJECT diffServActionStatus OBJECT diffServActionStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServCountActStatus OBJECT diffServCountActStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
skipping to change at page 63, line 19 skipping to change at page 107, line 19
OBJECT diffServAlgDropStatus OBJECT diffServAlgDropStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServRandomDropMinThreshBytes OBJECT diffServRandomDropMinThreshBytes
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServRandomDropMaxThreshPkts OBJECT diffServRandomDropMinThreshPkts
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServRandomDropMinThreshBytes OBJECT diffServRandomDropMaxThreshBytes
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServRandomDropMaxThreshPkts OBJECT diffServRandomDropMaxThreshPkts
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServRandomDropInvProbMax
MIN-ACCESS read-only
DESCRIPTION
"Write access is not required."
OBJECT diffServRandomDropInvWeight OBJECT diffServRandomDropInvWeight
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServRandomDropProbMax OBJECT diffServRandomDropSamplingRate
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServRandomDropStatus OBJECT diffServRandomDropStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServQNext OBJECT diffServQNext
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServQPriority OBJECT diffServQSchdParam
MIN-ACCESS read-only
DESCRIPTION
"Write access is not required."
OBJECT diffServQStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServQMinRateAbs OBJECT diffServSchedulerNext
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServQMinRateRel OBJECT diffServSchedulerMethod
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServQMaxRateAbs OBJECT diffServSchedulerSchdParam
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServQMaxRateRel OBJECT diffServSchedulerStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServQueueStatus OBJECT diffServSchdParamPriority
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServSchedulerMethod OBJECT diffServSchdParamMinRateAbs
MIN-ACCESS read-only
DESCRIPTION
"Write access is not required."
OBJECT diffServSchdParamMinRateRel
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServSchedulerNext OBJECT diffServSchdParamMaxRateAbs
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
OBJECT diffServSchedulerStatus OBJECT diffServSchdParamMaxRateRel
MIN-ACCESS read-only
DESCRIPTION
"Write access is not required."
OBJECT diffServSchdParamStatus
MIN-ACCESS read-only MIN-ACCESS read-only
DESCRIPTION DESCRIPTION
"Write access is not required." "Write access is not required."
::= { diffServMIBCompliances 1 } ::= { diffServMIBCompliances 1 }
diffServMIBClassifierGroup OBJECT-GROUP diffServMIBDataPathGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServClassifierFilter, diffServClassifierNext, diffServDataPathStart, diffServDataPathStatus
diffServClassifierPrecedence, diffServClassifierStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Classifier Group defines the MIB Objects that describe a "The Data Path Group defines the MIB Objects that
generic classifier element." describe a data path."
::= { diffServMIBGroups 1 } ::= { diffServMIBGroups 1 }
diffServMIBClfrGroup OBJECT-GROUP
OBJECTS {
diffServClfrStatus
}
STATUS current
DESCRIPTION
"The Classifier Group defines the MIB Objects that
describe a generic classifier."
::= { diffServMIBGroups 2 }
diffServMIBClfrElementGroup OBJECT-GROUP
OBJECTS {
diffServClfrElementOrder, diffServClfrElementNext,
diffServClfrElementSpecific, diffServClfrElementStatus
}
STATUS current
DESCRIPTION
"The Classifier Element Group defines the MIB Objects
that describe the classifier elements that make up a
generic classifier."
::= { diffServMIBGroups 3 }
diffServMIBSixTupleClfrGroup OBJECT-GROUP diffServMIBSixTupleClfrGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServSixTupleClfrDstAddrType, diffServSixTupleClfrDstAddr, diffServSixTupleClfrDstAddrType, diffServSixTupleClfrDstAddr,
diffServSixTupleClfrDstAddrMask, diffServSixTupleClfrDstAddrType, diffServSixTupleClfrDstAddrMask,
diffServSixTupleClfrSrcAddrType, diffServSixTupleClfrSrcAddrMask, diffServSixTupleClfrSrcAddrType, diffServSixTupleClfrSrcAddr,
diffServSixTupleClfrSrcAddrMask,
diffServSixTupleClfrDscp, diffServSixTupleClfrProtocol, diffServSixTupleClfrDscp, diffServSixTupleClfrProtocol,
diffServSixTupleClfrDstL4PortMin, diffServSixTupleClfrDstL4PortMin,
diffServSixTupleClfrDstL4PortMax, diffServSixTupleClfrDstL4PortMax,
diffServSixTupleClfrSrcL4PortMin, diffServSixTupleClfrSrcL4PortMin,
diffServSixTupleClfrSrcL4PortMax, diffServSixTupleClfrStatus diffServSixTupleClfrSrcL4PortMax,
diffServSixTupleClfrStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Six-tuple Classifier Group defines the MIB Objects that "The Six-tuple Classifier Group defines the MIB
describe a classifier element for matching on 6 fields of an IP Objects that describe a classifier element for match-
and upper-layer protocol header." ing on 6 fields of an IP and upper-layer protocol
::= { diffServMIBGroups 2 } header."
::= { diffServMIBGroups 4 }
diffServMIBMeterGroup OBJECT-GROUP diffServMIBMeterGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServMeterSucceedNext, diffServMeterFailNext, diffServMeterSucceedNext, diffServMeterFailNext,
diffServMeterSpecific, diffServMeterStatus diffServMeterSpecific, diffServMeterStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Meter Group defines the objects used in describing a generic "The Meter Group defines the objects used in describ-
meter element." ing a generic meter element."
::= { diffServMIBGroups 3 } ::= { diffServMIBGroups 5 }
diffServMIBTokenBucketMeterGroup OBJECT-GROUP diffServMIBTBMeterGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServTBMeterRate, diffServTBMeterBurstSize diffServTBMeterType,
diffServTBMeterStatus diffServTBMeterRate, diffServTBMeterBurstSize,
diffServTBMeterInterval, diffServTBMeterStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Token-Bucket Meter Group defines the objects used in "The Token-Bucket Meter Group defines the objects
describing a single-rate token bucket meter element." used in describing a token bucket meter element."
::= { diffServMIBGroups 4 } ::= { diffServMIBGroups 6 }
diffServMIBActionGroup OBJECT-GROUP diffServMIBActionGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServActionNext, diffServActionSpecific, diffServActionNext, diffServActionSpecific,
diffServActionStatus diffServActionType, diffServActionStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Action Group defines the objects used in describing a "The Action Group defines the objects used in
generic action element." describing a generic action element."
::= { diffServMIBGroups 5 } ::= { diffServMIBGroups 7 }
diffServMIBDscpMarkActionGroup OBJECT-GROUP diffServMIBDscpMarkActGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServDscpMarkActDscp diffServDscpMarkActDscp, diffServDscpMarkActStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The DSCP Mark Action Group defines the objects used in "The DSCP Mark Action Group defines the objects used
describing a DSCP Marking Action element." in describing a DSCP Marking Action element."
::= { diffServMIBGroups 6 } ::= { diffServMIBGroups 8 }
diffServMIBCounterGroup OBJECT-GROUP diffServMIBCounterGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServCountActOctets, diffServCountActPkts, diffServCountActOctets,
diffServCountActPkts,
diffServCountActDiscontTime,
diffServCountActStatus, diffServCountActStatus,
diffServAlgDropOctets, diffServAlgDropPkts diffServAlgDropOctets,
diffServAlgDropPkts
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A collection of objects providing information specific to non- "A collection of objects providing information
high speed (non-high speed interfaces transmit and receive at specific to non-high speed (non-high speed interfaces
speeds less than or equal to 20,000,000 bits/second) packet- transmit and receive at speeds less than or equal to
oriented network interfaces." 20,000,000 bits/second) packet-oriented network
::= { diffServMIBGroups 7 } interfaces."
::= { diffServMIBGroups 9 }
diffServMIBHCCounterGroup OBJECT-GROUP diffServMIBHCCounterGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServCountActOctets, diffServCountActHCOctets, diffServCountActOctets, diffServCountActHCOctets,
diffServCountActPkts, diffServCountActStatus, diffServCountActPkts,
diffServCountActDiscontTime,
diffServCountActStatus,
diffServAlgDropOctets, diffServAlgDropHCOctets, diffServAlgDropOctets, diffServAlgDropHCOctets,
diffServAlgDropPkts diffServAlgDropPkts
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A collection of objects providing information specific to non- "A collection of objects providing information
high speed (non-high speed interfaces transmit and receive at specific to high speed (high speed interfaces
speeds less than or equal to 20,000,000 bits/second) packet- transmit and receive at speeds greater than
oriented network interfaces." 20,000,000 but less than or equals to 650,000,000
::= { diffServMIBGroups 8 } bits/second) packet-oriented network interfaces."
::= { diffServMIBGroups 10 }
diffServMIBVHCCounterGroup OBJECT-GROUP diffServMIBVHCCounterGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServCountActOctets, diffServCountActHCOctets, diffServCountActOctets, diffServCountActHCOctets,
diffServCountActPkts, diffServCountActHCPkts, diffServCountActPkts, diffServCountActHCPkts,
diffServCountActStatus, diffServAlgDropOctets, diffServCountActDiscontTime,
diffServAlgDropHCOctets, diffServAlgDropPkts, diffServCountActStatus,
diffServAlgDropHCPkts diffServAlgDropOctets, diffServAlgDropHCOctets,
diffServAlgDropPkts, diffServAlgDropHCPkts
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"A collection of objects providing information specific to non- "A collection of objects providing information
high speed (non-high speed interfaces transmit and receive at specific to very-high speed (very-high speed inter-
speeds less than or equal to 20,000,000 bits/second) packet- faces transmit and receive at speeds greater than
oriented network interfaces." 650,000,000 bits/second) packet-oriented network
::= { diffServMIBGroups 9 } interfaces."
::= { diffServMIBGroups 11 }
diffServMIBAlgDropGroup OBJECT-GROUP diffServMIBAlgDropGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServAlgDropType, diffServAlgDropNext, diffServAlgDropType, diffServAlgDropNext,
diffServAlgDropQMeasure, diffServAlgDropQThreshold, diffServAlgDropQMeasure, diffServAlgDropQThreshold,
diffServAlgDropSpecific, diffServAlgDropStatus diffServAlgDropSpecific, diffServAlgDropStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Algorithmic Drop Group contains the objects that describe "The Algorithmic Drop Group contains the objects that
algorithmic dropper operation and configuration." describe algorithmic dropper operation and configura-
::= { diffServMIBGroups 10 } tion."
::= { diffServMIBGroups 12 }
diffServMIBRandomDropGroup OBJECT-GROUP diffServMIBRandomDropGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServRandomDropMinThreshBytes, diffServRandomDropMinThreshBytes,
diffServRandomDropMinThreshPkts, diffServRandomDropMinThreshPkts,
diffServRandomDropMaxThreshBytes, diffServRandomDropMaxThreshBytes,
diffServRandomDropMaxThreshPkts, diffServRandomDropMaxThreshPkts,
diffServRandomDropInvWeight, diffServRandomDropProbMax diffServRandomDropInvProbMax,
diffServRandomDropInvWeight,
diffServRandomDropSamplingRate,
diffServRandomDropStatus diffServRandomDropStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Random Drop Group augments the Algorithmic Drop Group for "The Random Drop Group augments the Algorithmic Drop Group for
random dropper operation and configuration." random dropper operation and configuration."
::= { diffServMIBGroups 11 } ::= { diffServMIBGroups 13 }
diffServMIBQueueGroup OBJECT-GROUP diffServMIBQGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServQPriority, diffServQNext, diffServQMinRateAbs, diffServQNext, diffServQSchdParam,
diffServQMinRateRel, diffServQMaxRateAbs, diffServQStatus
diffServQMaxRateRel, diffServQStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Queue Group contains the objects that describe an "The Queue Group contains the objects that describe
interface's queues." an interface's queues."
::= { diffServMIBGroups 12 } ::= { diffServMIBGroups 14 }
diffServMIBSchedulerGroup OBJECT-GROUP diffServMIBSchedulerGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServSchedulerMethod, diffServSchedulerNext, diffServSchedulerNext, diffServSchedulerMethod,
diffServSchedulerStatus diffServSchedulerSchdParam, diffServSchedulerStatus
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Scheduler Group contains the objects that describe packet "The Scheduler Group contains the objects that
schedulers on interfaces." describe packet schedulers on interfaces."
::= { diffServMIBGroups 13 } ::= { diffServMIBGroups 15 }
diffServMIBSchdParamGroup OBJECT-GROUP
OBJECTS {
diffServSchdParamPriority,
diffServSchdParamMinRateAbs, diffServSchdParamMinRateRel,
diffServSchdParamMaxRateAbs, diffServSchdParamMaxRateRel,
diffServSchdParamStatus
}
STATUS current
DESCRIPTION
"The Scheduler Parameter Group contains the objects
that describe packet schedulers' parameters on inter-
faces."
::= { diffServMIBGroups 16 }
diffServMIBStaticGroup OBJECT-GROUP diffServMIBStaticGroup OBJECT-GROUP
OBJECTS { OBJECTS {
diffServClassifierNextFree, diffServSixTupleClfrNextFree, diffServClfrNextFree, diffServClfrElementNextFree,
diffServMeterNextFree, diffServActionNextFree, diffServSixTupleClfrNextFree,
diffServAlgDropNextFree, diffServQNextFree, diffServSchedulerNextFree diffServMeterNextFree, diffServTBMeterNextFree,
diffServActionNextFree, diffServDscpMarkActNextFree,
diffServCountActNextFree,
diffServAlgDropNextFree, diffServRandomDropNextFree,
diffServQNextFree, diffServSchedulerNextFree,
diffServSchdParamNextFree
} }
STATUS current STATUS current
DESCRIPTION DESCRIPTION
"The Static Group contains readable scalar objects used in "The Static Group contains readable scalar objects
creating unique identifiers for classifiers, meters, actions and used in creating unique identifiers for classifiers,
queues. These are required whenever row creation operations on meters, actions and queues. These are required when-
such tables are supported." ever row creation operations on such tables are sup-
::= { diffServMIBGroups 14 } ported."
::= { diffServMIBGroups 17 }
END END
7. Acknowledgments 9. Acknowledgments
This MIB builds on all the work that has gone into the Informal This MIB builds on all the work that has gone into the Informal
Management Model for Diffserv routers. It has been developed with the Management Model for Diffserv routers, DiffServ PIB, and DiffServ Policy
active involvement of many people, but most notably Yoram Bernet, Steve MIB (SNMPCONF WG). It has been developed with the active involvement of
Blake, Brian Carpenter, Dave Durham, Jeremy Greene, Dan Grossman, Roch many people, but most notably Yoram Bernet, Steve Blake, Brian
Guerin, Scott Hahn, Keith McCloghrie, Bob Moore, Kathleen Nichols, Ping Carpenter, Dave Durham, Jeremy Greene, Dan Grossman, Roch Guerin, Scott
Pan, Nabil Seddigh and Bert Wijnen. Hahn, Keith McCloghrie, Bob Moore, Kathleen Nichols, Ping Pan, Nabil
Seddigh, Bert Wijnen, Victor Firoiu, John Seligson, Michael Fine, Walter
Weiss, Joel Halpern, and Harrie Hazewinkel.
8. Security Considerations 10. Security Considerations
It is clear that this MIB is potentially useful for configuration, and It is clear that this MIB is potentially useful for configuration, and
anything that can be configured can be misconfigured, with potentially anything that can be configured can be misconfigured, with potentially
disastrous effect. disastrous effect.
At this writing, no security holes have been identified beyond those At this writing, no security holes have been identified beyond those
that SNMP Security is itself intended to address. These relate primarily that SNMP Security is itself intended to address. These relate primarily
to controlled access to sensitive information and the ability to to controlled access to sensitive information and the ability to
configure a device - or which might result from operator error, which is configure a device - or which might result from operator error, which is
beyond the scope of any security architecture. beyond the scope of any security architecture.
skipping to change at page 71, line 15 skipping to change at page 119, line 22
It is recommended that the implementers consider the security features It is recommended that the implementers consider the security features
as provided by the SNMPv3 framework. Specifically, the use of the User- as provided by the SNMPv3 framework. Specifically, the use of the User-
based Security Model [12] and the View-based Access Control Model [15] based Security Model [12] and the View-based Access Control Model [15]
is recommended. is recommended.
It is then a customer/user responsibility to ensure that the SNMP entity It is then a customer/user responsibility to ensure that the SNMP entity
giving access to an instance of this MIB, is properly configured to give giving access to an instance of this MIB, is properly configured to give
access to the objects only to those principals (users) that have access to the objects only to those principals (users) that have
legitimate rights to indeed GET or SET (change/create/delete) them. legitimate rights to indeed GET or SET (change/create/delete) them.
9. References 11. References
[1] Harrington, D., Presuhn, R., and B. Wijnen, "An Architecture for [1] Harrington, D., Presuhn, R., and B. Wijnen, "An Architecture for
Describing SNMP Management Frameworks", RFC 2571, Cabletron Describing SNMP Management Frameworks", RFC 2571, Cabletron
Systems, Inc., BMC Software, Inc., IBM T. J. Watson Research, April Systems, Inc., BMC Software, Inc., IBM T. J. Watson Research, April
1999 1999
[2] Rose, M., and K. McCloghrie, "Structure and Identification of [2] Rose, M., and K. McCloghrie, "Structure and Identification of
Management Information for TCP/IP-based Internets", RFC 1155, STD Management Information for TCP/IP-based Internets", RFC 1155, STD
[3] Rose, M., and K. McCloghrie, "Concise MIB Definitions", RFC 1212, [3] Rose, M., and K. McCloghrie, "Concise MIB Definitions", RFC 1212,
skipping to change at page 73, line 5 skipping to change at page 121, line 11
[16] Case, J., Mundy, R., Partain, D., and B. Stewart, "Introduction to [16] Case, J., Mundy, R., Partain, D., and B. Stewart, "Introduction to
Version 3 of the Internet-standard Network Management Framework", Version 3 of the Internet-standard Network Management Framework",
RFC 2570, SNMP Research, Inc., TIS Labs at Network Associates, RFC 2570, SNMP Research, Inc., TIS Labs at Network Associates,
[ACTQMGMT] [ACTQMGMT]
V. Firoiu, M. Borden "A Study of Active Queue Management for V. Firoiu, M. Borden "A Study of Active Queue Management for
Congestion Control", March 2000, In IEEE Infocom 2000, Congestion Control", March 2000, In IEEE Infocom 2000,
http://www.ieee-infocom.org/2000/papers/405.pdf http://www.ieee-infocom.org/2000/papers/405.pdf
[AQMROUTER]
V.Misra, W.Gong, D.Towsley "Fuid-based analysis of a network of AQM
routers supporting TCP flows with an application to RED", In
SIGCOMM 2000,
http://www.acm.org/sigcomm/sigcomm2000/conf/paper/sigcomm2000-4-
3.ps.gz
[AF-PHB] [AF-PHB]
J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, "Assured Forwarding J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, "Assured Forwarding
PHB Group.", RFC 2597, June 1999. PHB Group.", RFC 2597, June 1999.
[DSARCH] [DSARCH]
S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, "An S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, "An
Architecture for Differentiated Service", RFC 2475, December 1998. Architecture for Differentiated Service", RFC 2475, December 1998.
[DSFIELD] [DSFIELD]
K. Nichols, S. Blake, F. Baker, D. Black, "Definition of the K. Nichols, S. Blake, F. Baker, D. Black, "Definition of the
Differentiated Services Field (DS Field) in the IPv4 and IPv6 Differentiated Services Field (DS Field) in the IPv4 and IPv6
Headers", RFC 2474, December 1998. Headers", RFC 2474, December 1998.
[DSPIB] [DSPIB]
M. Fine, K. McCloghrie, J. Seligson, K. Chan, S. Hahn, A. Smith, M. Fine, K. McCloghrie, J. Seligson, K. Chan, S. Hahn, A. Smith,
"Differentiated Services Policy Information Base", Internet Draft "Differentiated Services Policy Information Base", Internet Draft
[DSTERMS] [DSTERMS]
D. Grossman, "New Terminology for Diffserv", Internet Draft <draft- D. Grossman, "New Terminology for Diffserv", Internet Draft
ietf-diffserv-new-terms-02.txt>, November 1999. <draft-ietf-diffserv-new-terms-02.txt>, November 1999.
[EF-PHB] [EF-PHB]
V. Jacobson, K. Nichols, K. Poduri, "An Expedited Forwarding PHB." V. Jacobson, K. Nichols, K. Poduri, "An Expedited Forwarding PHB."
RFC 2598, June 1999. RFC 2598, June 1999.
[IFMIB] [IFMIB]
K. McCloghrie, F. Kastenholz, "The Interfaces Group MIB using K. McCloghrie, F. Kastenholz, "The Interfaces Group MIB using
SMIv2", RFC 2233, November 1997. SMIv2", RFC 2233, November 1997.
[INETADDRESS] [INETADDRESS]
skipping to change at page 74, line 12 skipping to change at page 122, line 27
F. Reichmeyer, D. Grossman, J. Strassner, M. Condell, "A Common F. Reichmeyer, D. Grossman, J. Strassner, M. Condell, "A Common
Terminology for Policy Management", Internet Draft <draft- Terminology for Policy Management", Internet Draft <draft-
[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] [RED93]
"Random Early Detection", 1993. "Random Early Detection", 1993.
10. Authors' Addresses 12. Authors' Addresses
Fred Baker Fred Baker
Cisco Systems Cisco Systems
519 Lado Drive 519 Lado Drive
Santa Barbara, California 93111 Santa Barbara, California 93111
fred@cisco.com fred@cisco.com
Kwok Ho Chan Kwok Ho Chan
Nortel Networks Nortel Networks
600 Technology Park Drive 600 Technology Park Drive
Billerica, MA 01821 Billerica, MA 01821
khchan@nortelnetworks.com khchan@nortelnetworks.com
Andrew Smith Andrew Smith
ah_smith@pacbell.net ah_smith@pacbell.net
Table of Contents Table of Contents
1 The SNMP Management Framework ................................... 2 1 The SNMP Management Framework ................................... 2
2 Introduction .................................................... 3 2 Introduction .................................................... 4
2.1 Relationship to the Diffserv Informal Management Model ........ 3 2.1 Relationship to the Diffserv Informal Management Model ........ 4
2.2 Relationship to other MIBs and Policy Management .............. 3 2.2 Relationship to other MIBs and Policy Management .............. 5
2.3 MIB Overview .................................................. 4 2.3 MIB Overview ..................................................