Internet Engineering Task Force                                 F. Baker
Diffserv Working Group                                     Cisco Systems
INTERNET-DRAFT                                                   K. Chan
Expires September December 2001                                    Nortel Networks
draft-ietf-diffserv-mib-09.txt
draft-ietf-diffserv-mib-10.txt                                  A. Smith
                                                        Allegro Networks
                  Management Information Base for the
                  Differentiated Services Architecture

Status of this Memo

This document is an Internet-Draft and is in full conformance with all
provisions of Section 10 of RFC 2026. Internet-Drafts are working
documents of the Internet Engineering Task Force (IETF), its areas, and
its working groups.  Note that other groups may also distribute working
documents as Internet-Drafts. Internet- Drafts.

Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet Drafts as reference material
or to cite them other than as "work in progress."

The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt. The list of Internet-Draft
Shadow Directories can be accessed at http://www.ietf.org/shadow.html.

This document is a product of the IETF's Differentiated Services Working
Group.  Comments should be addressed to WG's mailing list at
diffserv@ietf.org.
Differentiated Services@ietf.org. The charter for Differentiated
Services may be found at http://www.ietf.org/html.charters/diffserv-charter.html
http://www.ietf.org/html.charters/Differentiated Services-charter.html

Copyright (C) The Internet Society (2000). All Rights Reserved.
Distribution of this memo is unlimited.

Abstract

This memo describes a an SMIv2 MIB for a device implementing the
Differentiated Services Architecture [DSARCH], described in detail by
the Informal Management Model for Diffserv Differentiated Services Routers
[MODEL].

1.  The SNMP Management Framework

The SNMP Management Framework presently consists of five major
components:

 o      An overall architecture, described in RFC 2571 [1].

 o      Mechanisms for describing and naming objects and events for the
        purpose of management. The first version of this Structure of
        Management Information (SMI) is called SMIv1 and described in
        RFC 1155 [2], RFC 1212 [3] and RFC 1215 [4].  The second
        version, called SMIv2, is described in RFC 2578 [5], RFC 2579
        [6] and RFC 2580 [7].

 o      Message protocols for transferring management information. The
        first version of the SNMP message protocol is called SNMPv1 and
        described in RFC 1157 [8]. A second version of the SNMP message
        protocol, which is not an Internet standards track protocol, is
        called SNMPv2c and described in RFC 1901 [9] and RFC 1906 [10].
        The third version of the message protocol is called SNMPv3 and
        described in RFC 1906 [10], RFC 2572 [11] and RFC 2574 [12].

 o      Protocol operations for accessing management information. The
        first set of protocol operations and associated PDU formats is
        described in RFC 1157 [8]. A second set of protocol operations
        and associated PDU formats is described in RFC 1905 [13].

 o      A set of fundamental applications described in RFC 2573 [14] and
        the view-based access control mechanism described in RFC 2575
        [15].

A more detailed introduction to the current SNMP Management Framework
can be found in RFC 2570 [16].

Managed objects are accessed via a virtual information store, termed the
Management Information Base or MIB. Objects in the MIB are defined using
the mechanisms defined in the SMI.

This memo specifies a MIB module that is compliant to the SMIv2. A MIB
conforming to the SMIv1 can be produced through the appropriate
translations.  The resulting translated MIB must be semantically
equivalent, except where objects or events are omitted because no
translation is possible (use of Counter64). Some machine-readable
information in SMIv2 will be converted into textual descriptions in
SMIv1 during the translation process. However, this loss of machine
readable information is not considered to change the semantics of the
MIB.

2.  Introduction  Relationship to other working group documents

The working group and related working groups developed other documents,
notably the Informal Management Model and the policy configuration
paradigm of SNMPCONF.  The relationship between the MIB and those
documents is clarified here.

2.1.  Relationship to the Informal Management Model for Diffserv Differentiated
Services Router

This MIB is designed according similar in design to [MODEL]. [MODEL], although it can be used to
build functional data paths that the model would not well describe.  The
model conceptually describes the way
that ingress and egress interfaces of an 'n'-port router are modeled. n-port
router, which may find some interfaces at a network edge and others
facing into the network core.  It describes the configuration and
management of a Diffserv Differentiated Services interface in terms of one or
more Traffic Conditioning Block (TCB), each containing, arranged in the
specified order, by definition, zero or more classifiers, meters,
actions, algorithmic droppers, queues and schedulers.  Traffic may be classified;
classified, and classified traffic may be
metered; each metered.  Each stream of
traffic identified by a combination of classifiers and meters may have
some set of actions performed on it; it may have dropping algorithms
applied and it may ultimately be stored into a queue before being
scheduled out to its next destination, either onto a link or to another
TCB. When  At times, the treatment for a given packet must have any of those
elements repeated in a way that breaks the
permitted sequence {classifier, meter, action, algorithmic dropper,
queue, scheduler}, repeated.  [MODEL] models this must be modeled by cascading multiple TCBs. TCBs,
while this MIB describes the policy by directly linking the functional
data path elements.

The MIB represents this cascade by following the "Next" attributes of
the various elements.  They indicate what the next step in Diffserv
Differentiated Services processing will be, whether it be a classifier,
meter, action, algorithmic dropper, queue, scheduler or a decision to
now forward a packet.

The MIB models the individual elements that make up the TCBs.  The higher level concept of a TCB is not required in the
parameterization or in the linking together of the individual elements,
hence it is not used in the MIB itself and is only mentioned in the text
for relating the MIB with the [MODEL].  The actual distinguishing of which TCB a specific
element is a part of is not needed for the instrumentation of a device
to support the functionality of Diffserv, but it is useful for
conceptual reasons.  By not using  Rather, the TCB concept, this MIB allows any
grouping of elements to construct TCBs using the rules defined by
[MODEL]: that document should be consulted for models the allowed combinations
of
individual elements that make up a TCB. the TCBs.

This will minimize changes to this MIB
if rules in [MODEL] changes.

The uses the notion of a Data Path is used in this MIB to indicate the Diffserv Differentiated
Services processing a packet may experience.  This  The Data Path a packet
will initially follow is distinguished
based on the Interface and the Direction an attribute of the flow the packet is part
of. interface in question.  The
Data Path Start Table provides a starting point for each direction
(ingress or egress) on each interface.  A Data Path Table Entry
indicates the first of possibly multiple elements that will apply Diffserv

Differentiated Services treatment to the packet.

2.2.  Relationship to other MIBs and Policy Management

This MIB provides for direct reporting and manipulation of the most detailed
functional elements described by [MODEL]. elements.  These elements are
designed with their parameterization tables separated from their data
path linkage tables, allowing consist of a structural element and
one or more parameter-bearing elements.  While this can be cumbersome,
it allows the reuse of each table as much as possible.
The parameters.  For example, a service provider may
offer three varieties of contracts, and configure three parameter
elements.  Each such data path linkage in this MIB is coupled with an interface through on the use system may then refer to these
sets of parameters.  The diffServDataPathTable couples each direction on
each interface with the diffServDataPathTable. specified data path linkage.  The concept of
"interface" is as defined by InterfaceIndex/ifIndex of the IETF
Interfaces MIB [IFMIB].

Other MIBs and data structure definitions for policy management
mechanisms other than SNMP/SMIv2 are likely to exist in the future for
the purposes of abstracting the model in other ways.

In particular, abstractions in the direction of less detailed
definitions of Diffserv Differentiated Services functionality are likely e.g.
some form of "Per-Hop Behavior"-based definition involving a template of
detailed object values which is applied to specific instances of objects
in this MIB semi-automatically.

Another possible direction of abstraction is one using a concept of
"roles" (often, but not always, applied to interfaces).  In this case,
it may be possible to re-use the object definitions in this MIB,
especially the parameterization tables.  The Data Path table will help
in the reuse 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  This work is ongoing in this area.

2.3. ongoing.

3.  MIB Overview

The Differentiated Services Architecture does not specify how an
implementation should be assembled.  The [MODEL] describes a general
approach to implementation design, or to user interface design.  Its
components could, however, be assembled in a different way.  Traffic
conforming to a meter might be run through a second meter, for example,
or reclassified.

This MIB is structured based on models the need to describe same functional data path elements, allowing the sequential
Diffserv treatments being applied
network manager to a packet, and assemble them in any fashion that meets the parameterization
of these treatments. relevant
policy.  These two requirements are kept separate
throughout the design data path elements include Classifiers, Meters, Actions

of this MIB, and are fulfilled using separate
tables various sorts, Queues, and data definitions. Schedulers.

In this MIB, we model the ingress and egress portions many of these tables, a Diffserv
network device identically, making the distinction is drawn 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 structure of rules

o    Determine whether
the packet's data stream policy (do this, then do that) and the parameters applied to
specific policy elements.  This is conforming or not
     conforming to its permitted rates

o    Perform facilitate configuration, if the
MIB is used for that.  The concept is that a set of resulting actions, possibly including counting parameters, such as
the
     traffic, application values that describe a specific token bucket, might be configured
once and applied to many interfaces.

The RowPointer Textual Convention is therefore used in two ways in this
MIB.  It is defined for the purpose of connecting an appropriate drop policy object to an entry
dynamically; the RowPointer object identifies the first object in the
target Entry, and marking of in so doing points to the traffic with entire entry.  In this MIB,
it is used as a Differentiated Services Code Point (DSCP) connector between successive functional data path
elements, and as
     defined in [DSFIELD].

o    Enqueue the traffic for output in link between the appropriate queue, whose
     scheduler may shape policy structure and the
parameters that are used.  When used as a connector, it says what
happens "next"; what happens to classified traffic, to traffic
conforming or simply forward not conforming to a meter, and so on.  When used to
indicate the parameters applied in a policy, it with some
     minimum rate or maximum latency. says "specifically" what
is meant; the structure points to the parameters of its policy.

The MIB therefore contains use of RowPointers as connectors allows for the following elements:

Data Path Table
     This is simple extension of
the starting MIB.  The RowPointers, whether "next" or "specific", may point to
Entries defined in other MIB modules.  For example, the only type of Diffserv data paths within a single
     Diffserv device.  Data paths
meter defined by in this table are interface
     and interface direction specific.

Classifier and Filter Tables
     A general extensible framework and one example MIB is a token bucket meter; if another type of
meter is required, a filter table
     (an IP Six-Tuple Multi-Field Classification Table).

Meter Tables
     A general extensible framework and one example proprietary MIB or another standard MIB could be
defined describing that type of meter, and diffServMeterSpecific could
point to it.  Similarly, if a
     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
     A general extensible framework and examples new action is required, the "next" pointer
of parameterization
     tables for Absolute Drop, Mark the previous functional datapath element could point to an Entry
defined in a proprietary MIB or one defined in another standard.

3.1.  Processing Path

An interface has an ingress and Count actions.  The
     "multiplexer" an egress direction, and "null" actions described will generally
have a different policy in [MODEL] are
     accomplished implicitly by means of each direction.  As traffic enters an edge
interface, it may be classified, metered, counted, and marked.  Traffic
leaving the RowPointer structures of same interface might be remarked according to the other elements.

Queue, Scheduler contract
with the next network, queued to manage the bandwidth, and Algorithmic Dropper Tables
     A general extensible framework for parameterizing queuing so on.  As
[MODEL] points out, the functional datapath elements used on ingress and
     scheduler systems.  The queue measurement dependent algorithmic
     droppers
egress are also described here.

3.  Structure of this MIB the same type, but may be structured in very different
ways to implement the relevant policies.

3.1.1.  diffServDataPathTable - The Data Path Table

Therefore, when traffic arrives at an ingress or egress interface, the
first step in applying the policy is determining what policy applies.
This MIB is structured with separate tables for purpose does that by providing a table of Diffserv pointers to the first
functional data path description element, indexed by interface and Diffserv treatment parameterization direction on that
interface.  The content of the Diffserv
device.  The diffServDataPathEntry is a single
RowPointer, which points to that functional data path description and/or the treatment parameterization
tables can each be reused independently, allowing the flexibility to
maintain element.

When diffServDataPathStart in a common data construct for Diffserv device configuration and
provisioning, independent of direction on an interface is undefined
or is set to zeroDotZero, the configuration method implication is that there is no specific
policy to apply; the manufacturer's default is used.  The
definitions in this MIB

3.2.  Classifier

Classifiers are intended used to be reusable differentiate among types of traffic.  In the
Differentiated Services architecture, one usually discusses a behavior
aggregate identified by other future

standards.  The treatment parameters can also the application of one or more Differentiated
Services Code Points (DSCPs).  However, especially at network edges
(which include hosts and first hop routers serving hosts), traffic may
arrive unmarked or the marks may not be reused trusted.  In these cases, one
applies a Multi-Field Classifier, which may select an aggregate as
coarse as "all traffic", as fine as a specific microflow identified by other
IP
based technologies.  For example, Addresses, IP packet filtering parameters most
likely Protocol, and TCP/UDP ports, or variety of slice in
between.

Classifiers can be reused by other IP based technologies that rely on packet
classification.

3.1.  Diffserv Data Paths

This part of the MIB provides instrumentation for connecting the
Diffserv Functional Data path Elements within simple or complex.  In a single Diffserv device.
Please refer core interface, one would
expect to find simple behavior aggregate classification to be used.
However, in an edge interface, one might first ask what application is
being used, meter the arriving traffic, and then apply various policies
to the [MODEL] for discussions non-conforming traffic depending on the valid sequencing and
grouping of Diffserv Functional Data path Elements.  Given some basic
information, e.g. ifIndex Autonomous System number
advertising the destination address.  To accomplish such a thing,
traffic must be classified, metered, and interface direction, then reclassified.  To this
end, the first Diffserv
Functional Data path Element MIB defines separate classifiers, which may be applied to a given packet on at any
point in processing, and may have different content as needed.

The MIB also allows for ambiguous classification in a given
interface is determined.  Subsequent Diffserv Functional Elements are
provided by structured
fashion.  In 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 DESCRIPTION clause.

3.1.1.  Data Path Table

Entries in the Data Path Table provide the Diffserv treatment starting
points end, traffic classification must be unambiguous; we
must know for all packets of Diffserv interfaces on this device.  Not all
interfaces on this device need certain what policy to be Diffserv interfaces, hence not all
entries in the ifTable need apply to have corresponding entries in the Data
Path Table.  Each entry in this table any given packet.
However, writing an unambiguous specification is indexed by ifIndex often tedious, while
writing a specification in steps that permits and the
direction excludes various kinds
of the packet flow.  There should traffic may be at most two entries for
each interface, one for ingress simpler and more intuitive.  In such a case, the
classification "steps" are enumerated; all classification elements of
one for egress.  Each entry provides precedence are applied as if in parallel, and then all
classification elements of the first Diffserv Functional Data path Element each packet at a
specific interface traveling next precedence.

This MIB defines a specific relative direction should
experience.  NOTE: this table is interface specific, with single classifier parameter entry, the use Six-Tuple
Classifier.  A degenerate case of
ifIndex.  Entries this multi-field classifier is a
Behavior Aggregate classifier.  Other classifiers may be created with zeroDotZero defined in the
diffServDataPathStart attribute
other MIB modules, to indicate that there are no further
diffserv elements in that data path.  For example, select traffic from a classifier that
should never match anything but is present to debug given layer two neighbor or detect
a given interface, traffic
might use this, although one could argue that it should transit whose addresses belong to a
dropper. given BGP
Community or Autonomous System, and so on.

3.2.1.  diffServClfrElementTable - The non-existence of any Diffserv treatment on an
interface/direction is indicated implicitly by having no corresponding
entry in this table.  This means allowing 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 Table

A classifier element, and filter tables determine how
traffic is sorted out. They identify separable classes consists 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
Meter, Action, Algorithmic Dropper, Queue, and Scheduler classifier elements. For
example, sub-classes  A classifier element
identifies a specific set of traffic may be sent to different meter stages:
e.g. in an implementation that forms part of a behavior
aggregate; other classifier elements within the Assured Forwarding (AF) PHB [AF-PHB],
AF11 same classifier may
identify other traffic might be sent to that also falls into the first meter, AF12 behavior aggregate.  For
example, in identifying AF traffic might be
sent to for the second aggregate AF1, one might
implement separate classifier elements for AF11, AF12, and AF13 traffic sent within
the same classifier and pointing to the second meter stage's
out-of-profile action.

The concept of same subsequent meter.

Generally, one would expect Data Path Entry to point to a classifier
(which is to say, the same as described in [MODEL].  The
structure first of the a set of one or more classifier and
elements), although it may point to something else when appropriate.
Reclassification in a functional data path is achieved by pointing to
another Classifier Entry when appropriate.

A classifier element tables, is the same
as the a structural element, indexed by classifier ID
and element ID.  It has a precedence value, allowing for structured
ambiguity as described in [MODEL].  Within each classifier, it must
not above, a "specific" pointer that identifies what
rule is to be important in which order applied, and a "next" pointer directing traffic matching
the filters are applied. This is classifier to
facilitate optimized implementations such as index trees. Precedence the next functional data path element.  If the "next"
pointer is
used only to resolve ambiguity, as described in [MODEL].  Filter with
higher values of precedence are compared first; zeroDotZero, the order of tests indication is that there is no further
differentiated services processing for
entries of this behavior aggregate.  If the same precedence
"specific" pointer is unimportant.

A data path may consist of more than one classifier.  There may be
overlap of filter specification between filters of different
classifiers.  The first zeroDotZero, however, the device is misconfigured.
In such a case, the classifier functional data path element
encountered, should be operationally treated
as determined by if it were not present.

When the sequencing of diffserv functional data
path elements, will be MIB is used first.

An important form of classification for configuration, diffServClfrNextFree always
contains a legal value for diffServClfrId that is "everything else": not currently used in
the final
stage of system's configuration.  The Network Management Application reads
the classifier i.e. variable and uses the one with value read in a create-and-go or a create-
and-wait SET.  When the lowest order, SET is performed, the agent must be
"complete" since determine
whether the result of an incomplete classifier value is not
necessarily deterministic - see [MODEL] section 4.1.2.

The definition of the actual filter indeed still unused; two network managers may
attempt to be used by create a configuration entry simultaneously and use the classifier same
value.  If it is
referenced via a RowPointer: this enables currently unused, the use of any sort SET succeeds and the agent
changes the value of filter
table that one might wish diffServClfrNextFree according to design, standard or proprietary. an agent-specific
algorithm.  If the value is in use, however, the SET fails.  The filter
table may be, but does not need network
manager must re-read diffServClfrNextFree to be, defined in this obtain a useful value.

Likewise, when the MIB module.

Classifiers, is used in various ingress and egress interfaces, are
organized by the classifier table. Each classifier will isolate for configuration,
diffServClfrElementNextFree always contains a number
of classes of traffic, identified by various kinds of filters. To
enumerate this, we define legal value for
diffServClfrElementClfrId that is not currently used in the classifier table, system's
configuration.  The Network Management Application reads the classifier element
table, variable
and uses the filter table.  A data path entry points to value read in a classifier
entry.  A classifier entry identifies create-and-go or a list of classifier elements.  A
classifier element effectively includes create-and-wait SET.
When the filter entry, and points SET is performed, the agent must determine whether the value is
indeed still unused; two network managers may attempt to create a "next" classifier
configuration entry or other data path functional element.  There
are potentially many types of filters, only one of which simultaneously and use the same value.  If it is specified in
this MIB Module.

3.2.1.  Classifier Table

The classifier table, therefore, identifies
currently unused, the classifiers that are
used in various interfaces. It organizes SET succeeds and the list agent changes the value of classifier elements
that identify
diffServClfrElementNextFree according to an agent-specific algorithm.
If the various classes. value is in use, however, the SET fails.  The network manager
must re-read diffServClfrElementNextFree to obtain a useful value.

3.2.2.  diffServSixTupleClfrTable - The Six-Tuple Classifier Element Table

Classifier elements point to the filters which identify various classes
of traffic. The separation between

This MIB defines a single parameter type for classification, the "classifier element" Six-
Tuple Classifier.  As a parameter, a filter may be specified once and the
"filter" allows us
applied to use many different kinds of filters with the same
essential semantics of "an identified set of traffic". The traffic
matching the filter corresponding to a classifier element is given to
the "next" data path functional element identified in the interfaces, using diffServClfrElementSpecific.  This
classifier
element.

3.2.3.  Filter Table - matches:

 o      IP Six-Tuple Classifier Table

This MIB includes one Filter Table, a definition for an source address prefix, including host, CIDR Prefix, and "any
        source address"

 o      IP Six-Tuple
Classifier, used for destination address prefix, including host, CIDR Prefix, and
        "any destination address"

 o      IP traffic classification. Entries in this filter
table protocol or "any"

 o      TCP/UDP/SCTP source port range, including "any"

 o      TCP/UDP/SCTP destination port range, including "any"

 o      Differentiated Services Code Point

In that ranges or "any" are referenced from the RowPointer diffServClfrElementSpecific
attributes of classifier element table entries.

For example, defined in each case, clearly a wide variety
of filters can be constructed.  The Differentiated Services Behavior
Aggregate (BA) Classifier, acting only on DSCPs, filter is a simple form special case of the IP Six-Tuple Classifier. It is represented by
having the diffServSixTupleClfrDscp attribute set to the desired DSCP
and all other classification attributes set to match-all, their default
settings.

Each entry this filter.

Other MIB modules may define similar filters in the IP Six-Tuple Classifier Table defines same way.  For
example, a single filter.
The textual convention of InetAddress [INETADDR] is used filter for both IPv4 Ethernet information might define source and IPv6 addressing.  The use
destination MAC addresses of IP Six-Tuple Classifiers is discussed
in [DSARCH] "any", Ethernet Packet Type, IEEE 802.2
SAPs, and abstract examples of how they might be configured are
provided in [MODEL].

3.3.  Meters IEEE 802.1 priorities.  A meter, according filter related to [MODEL] section 5, measures policy routing
might be structured like the rate at which
packets making up a stream diffServSixTupleClfrTable, but containing
the BGP Communities of traffic pass it, compares the source and destination prefix rather than the
prefix itself, meaning "any prefix in this rate community".  For such a
filter, a table similar to
some set of thresholds and produces some number (two or more) of
potential results. A given packet diffServSixTupleClfrTable is said constructed, and

diffServClfrElementSpecific configured to "conform" point to it.

When the meter if,
at the time MIB is used for configuration, diffServSixTupleClfrNextFree
always contains a legal value for diffServSixTupleClfrId that the packet is being looked at, not
currently used in the stream appears to be
within system's configuration.  The Network Management
Application reads the meter's profile. MIB syntax makes it easiest to define this
as variable and uses the value read in a sequence of one create-
and-go or more cascaded pass/fail tests, modeled here as
if-then-else constructs. It a create-and-wait SET.  When the SET is important to understand that this way of
modeling does not imply anything about performed, the implementation being

"sequential":  multi-rate/multi-profile meters e.g. those designed to
support [SRTCM], [TRTCM], or [TSWTCM] can agent
must determine whether the value is indeed still be modeled this way even
if they, unused; two network
managers may attempt to create a configuration entry simultaneously and
use the same value.  If it is currently unused, the SET succeeds and the
agent changes the value of necessity, share information between diffServSixTupleClfrNextFree according to an
agent-specific algorithm.  If the stages: value is in use, however, the stages SET
fails.  The network manager must re-read diffServSixTupleClfrNextFree to
obtain a useful value.

3.3.  Metering Traffic

As discussed in [MODEL], a "meter" and a "shaper" are introduced merely as functions that
operate on opposing ends of a notational convenience link.  A shaper schedules traffic for
transmission at specific times in order to simplify
the MIB structure.

3.3.1.  Meter Table

The generic meter table is used as approximate a base for all more specific forms of
meter.  The definition particular line
speed or combination of parameters specific line speeds.  In its simplest form, if the
traffic stream contains constant sized packet, it might transmit one
packet per unit time to build the type equivalent of meter used
is referenced via a pointer CBR circuit.  However,
various factors intervene to a table containing those specifics.  This
enables make the use of any sort approximation inexact; multiple
classes of specific meter table that one might wish
to design, standard traffic may occasionally schedule their traffic and the same
time, the variable length nature of IP traffic may introduce variation,
and factors in the link or proprietary. The specific meter table physical layer may be, but
does not need to be, defined change traffic timing.  A
"meter" integrates the arrival rate of traffic and determines whether
the shaper at the far end was correctly applied, or whether the behavior
of the application in this MIB module.

3.3.2.  Token-Bucket Meter Table

This question is included as an example of naturally close enough to such
behavior to be acceptable under a given contract.

A common type of meter.  Entries in
this table are referenced from the RowPointer diffServMeterSpecific
attributes meter is a Token Bucket meter, such as [SRTCM] or
[TRTCM].  This type of meter table entries.  The parameters are represented by assumes the use of a shaper at a previous
node; applications which send at a constant rate when sending may
conform if the token bucket is properly specified.  It specifies the
acceptable arrival rate diffServTBMeterRate, and quantifies the acceptable variability, often
by specifying a burst size diffServTBMeterBurstSize, and or an
interval diffServTBMeterInterval.  How these parameters are used depends
on the type interval; since rate = quantity/time,
specifying any two of meter being parameterized, this is provided by those parameters implies the
diffServTBMeterType attribute.  Additional meter parameterization tables
can third, and a large
interval provides for a forgiving system.  Multiple rates may be defined
specified, as in other MIBs when necessary.

3.4.  Actions

Actions include "no action", "mark the traffic with a DSCP", "drop the
traffic" or "count it". Other tasks AF, such as "shape that a subset of the traffic" or "drop
based on some algorithm" are handled elsewhere as queuing mechanisms,
rather than actions, consistent traffic (up to one rate)
is accepted with [MODEL].  The "multiplexer",
"replicator" one set of guarantees, and "null" actions described traffic in [MODEL] are accomplished
implicitly by means excess of the RowPointer structures that
but below another rate has a different set of the other elements.

This MIB uses the Action Table diffServActionTable guarantees.  Other types
of meters exist as well.

One use of a meter is when a service provider sells at most a certain

bit rate to organize one
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
traffic stream by using each entry's diffServActionNext attribute.  The
diffServActionNext attribute of the last action entry in the chain
points its customers, and wants to drop the next element in the TCB, if any, e.g.  a Queuing element.
It may also point at excess.  In such
a next TCB.

The parameters needed for each Action element will depend on case, the type fractal nature of
Action to be taken. Hence there are specific Action Tables for all the
different Action types.  This flexibility allows additional Actions normal Internet traffic must be
specified reflected
in future revisions of this MIB, large burst intervals, as TCP frequently sends packet pairs or in other MIBs larger
bursts, and also

allows for responds poorly when more than one packet in a round trip
interval is dropped.  Applications like FTP contain the effect by simply
staying below the target bit rate; this type of configuration very
adversely affects transaction applications like HTTP, however.  Another
use of proprietary Actions without impact on those
defined here.

3.4.1.  DSCP Mark Action Table

This Action a meter is applied to traffic in order to mark it the AF specification, in which excess traffic is
marked with a Diffserv
Codepoint (DSCP) value, specified related DSCP and subjected to slightly more active queue
depth management.  The application is not sharply limited to a
contracted rate in the diffServDscpMarkActTable. Other
marking actions might such a case, but can be specified elsewhere - these are outside the
scope of this MIB.

3.4.2.  Count Action Table

Count Actions are used to count the readily contained should its
traffic passing along create a particular
path through the model. If specified, they are likely to be placed
first, before other types burden.

3.3.1.  diffServMeterTable - The Meter Table

The Meter Table is a structural table, specifying a specific functional
data path element.  Its entry consists essentially of Action. For example, when both three RowPointers
- a Count and
an Absolute Dropper Action are specified, the Count Action needs "succeed" pointer, for traffic conforming to
count the meter, a "fail"
pointer, for traffic stream before any traffic gets dropped.  Note that
there are counters contained directly in Algorithmic Dropper elements not conforming, and a "specific" pointer, to
indicate
identify the amount of traffic dropped by those elements.

Since count actions are defined parameters in this way, they are inherently
optional.  However, the management information necessary to demonstrate
SLA compliance or non-compliance question.  This structure is not available from any other source.
Therefore, practically, count actions may be expected a bow to SNMP's
limitations; it would be included in
each set of actions that a network manager configures.

Counters are arranged in better to have a single table but structure with separate conformance
statements for low-speed N rates and high-speed interfaces, consistent N+1
"next" pointers, with
[IFMIB].

3.4.3.  Absolute Drop Action

This action just silently discards all traffic presented a single algorithm specified.  In this case,
multiple meter entries connected by the "fail" link are understood to it, without
counting it. This action has no additional
contain the parameters for a specified algorithm, and so is
represented traffic conforming
to a given rate follows their "succeed" paths.  Within this MIB, only within diffServActionType without its specific table.

3.5.  Queuing Elements

These include Algorithmic Droppers, Queues and Schedulers which
Token Bucket parameters are all
inter-related in their use specified; other varieties of queuing techniques.

3.5.1.  Algorithmic Dropper Table

Algorithmic Droppers are represented meters may be
designed in this other MIB modules.

When the MIB by entries in an
Algorithmic Dropper Table.  An Algorithmic Dropper is assumed to operate
indiscriminately on all packets that are presented at its input, all
traffic separation should be done by classifiers and meters preceding

it.

Algorithmic Droppers have a close relationship with queuing, each
Algorithmic Dropper Table entry used for configuration, diffServMeterNextFree always
contains a diffServAlgDropQMeasure
attribute, indicating which queue's state affects legal value for diffServMeterId that is not currently used in
the calculation of system's configuration.  The Network Management Application reads
the
Algorithmic Dropper.  Each entry also contains a diffServAlgDropNext
attribute which indicates to which queue variable and uses the Algorithmic Dropper sinks
its traffic.

Algorithmic Droppers may also contain value read in a pointer to specific detail of
the drop algorithm, diffServAlgDropSpecific. This MIB defines create-and-go or a create-
and-wait SET.  When the detail
for three drop algorithms: Tail Drop, Head Drop and Random Drop; other
algorithms are outside SET is performed, the scope of this MIB module but agent must determine
whether the general
framework value is intended indeed still unused; two network managers may
attempt to allow for their inclusion via other MIB
modules.

One generally-applicable parameter of create a dropper configuration entry simultaneously and use the same
value.  If it is currently unused, the specification SET succeeds and the agent
changes the value of
a queue-depth threshold at which some drop action is diffServMeterNextFree according to start. This an agent-
specific algorithm.  If the value is
represented in this MIB, as a base attribute, diffServAlgDropQThreshold,
of use, however, the Algorithmic Dropper entry. SET fails.
The attribute,
diffServAlgDropQMeasure, specifies which queue's depth
diffServAlgDropQThreshold is network manager must re-read diffServMeterNextFree to compare against.

o    A Tail Dropper requires the specification of obtain a maximum queue depth
     threshold: when the queue pointed at by diffServAlgDropQMeasure
     reaches that depth threshold, diffServAlgDropQThresh, any new
     traffic arriving at the dropper
useful value.

3.3.2.  diffServTBParamTable - The Token Bucket Parameters Table

The Token Bucket Parameters Table is discarded. This algorithm uses
     only a set of parameters that are part of the diffServAlgDropEntry.

o    A Head Dropper requires the specification define a
Token Bucket Meter.  As a parameter, a token bucket may be specified

once and applied to many interfaces, using diffServMeterSpecific.
Specifically, several modes of [SRTCM] and [TRTCM] are addressed.  Other
varieties of meters may be specified in other MIB modules.

In general, if a maximum queue depth
     threshold: when Token Bucket has N rates, it has N+1 potential outcomes
- the queue pointed at by diffServAlgDropQMeasure
     reaches that depth threshold, diffServAlgDropQThresh, traffic
     currently at the head of the queue stream is discarded. This algorithm
     uses only parameters that are part slower than and therefore conforms to all of the diffServAlgDropEntry.

o    Random Droppers are recommended as a way to control congestion, in
     [QUEUEMGMT]
rates, it fails the first few but is slower than and called for in therefore conforms
to the [AF-PHB]. Various implementations
     exist, which agree on marking higher rates, or dropping just enough traffic it fails all of them.  As such, multi-rate
meters should specify those rates in montonically increasing order,
passing through the diffServMeterFailNext from more committed to
     communicate with TCP-like protocols about congestion avoidance, but
     differ markedly on their specific parameters. This MIB attempts more
excess rates, and finally falling through diffServMeterFailNext to
     offer a minimal the
set of controls for any random dropper, but expects actions that vendors will augment apply to traffic which conforms to none of the table with additional controls and
     status
specified rates.  DiffServTBParamType in accordance with their implementation.  This the first entry indicates the
algorithm
     requires additional parameters on top of those in
     diffServAlgDropEntry: these are discussed below.

3.5.2.  Random Dropper Table

One example of a random dropper being used.  At each rate, diffServTBParamRate is derivable
from diffServTBParamBurstSize and diffServTBParamInterval; a RED-like dropper. An example superior
implementation will allow the configuration of any two of
diffServTBParamRate, diffServTBParamBurstSize, and
diffServTBParamInterval, and respond "badValue" if all three are
specified but are not mathematically related.

When the
representation chosen in this MIB is used for this element configuration, diffServTBParamNextFree always
contains a legal value for diffServTBParamId that is shown not currently used
in Figure 1.

Random droppers often have their drop probability function described as
a plot of drop probability (P) against averaged queue length (Q).
(Qmin,Pmin) then defines the start of system's configuration.  The Network Management Application reads
the characteristic plot.  Normally
Pmin=0, meaning with average queue length below Qmin, there will be no
drops.  (Qmax,Pmax) defines variable and uses the value read in a "knee" on create- and-go or a create-
and-wait SET.  When the plot, after which point SET is performed, the
drop probability become more progressive (greater slope).  (Qclip,1)
defines agent must determine
whether the queue length at which all packets will be dropped. Notice
this value is different from Tail Drop because this uses an averaged queue
length.  Although indeed still unused; two network managers may
attempt to create a configuration entry simultaneously and use the same
value.  If it is possible for Qclip = Qmax.

In currently unused, the MIB module, diffServRandomDropMinThreshBytes and
diffServRandomDropMinThreshPkts represent Qmin.
diffServRandomDropMaxThreshBytes SET succeeds and diffServRandomDropMaxThreshPkts
represent Qmax.  diffServAlgDropQThreshold represents Qclip.
diffServRandomDropInvProbMax represents Pmax (inverse).  This MIB does
not represent Pmin (assumed to be zero unless otherwise represented).
In addition, since message memory is finite, queues generally have some
upper bound above which they are incapable the agent
changes the value of storing additional
traffic.  Normally this number is equal diffServTBParamNextFree according to Qclip, specified by
diffServeAlgDropQThreshold.

Each random dropper specification an agent-
specific algorithm.  If the value is associated with in use, however, the SET fails.
The network manager must re-read diffServTBParamNextFree to obtain a queue. This
allows multiple drop processes (of same or different types)
useful value.

3.4.  Actions applied to be
associated with packets

"Actions" are the same queue, as different things a differentiated services interface PHB implementations may
require.  This also allows for sequences of multiple droppers if

      AlgDrop                                   Queue
      +-----------------+                       +-------+
  --->| Next   ---------+--+------------------->| Next -+--> ...
      | QMeasure -------+--+                    | ...   |
      | QThreshold      |     RandomDrop        +-------+
      | Type=randomDrop |     +----------------+
      | Specific -------+---->| MinThreshBytes |
      +-----------------+     | MaxThreshBytes |
                              | InvProbMax     |
                              | InvWeight      |
                              | SamplingRate   |
                              +----------------+

  Figure 1: Example Use of the RandomDropTable for Random Droppers

necessary.

The calculation of do
to a smoothed queue length may also have an important
bearing packet in transit.  At minimum, such a policy might calculate
statistics on the behavior traffic in various configured classes, mark it with a
DSCP, drop it, or enqueue it before passing it on for other processing.

Actions are composed of a structural element, the dropper: parameters may include the
sampling interval or rate, diffServActionTable,
and various component action entries that may be applied.  In the weight case
of each sample.  The
performance the Algorithmic Dropper, an additional parameter table may be very sensitive
specified to the values of these parameters control Active Queue Management, as defined in [RED93] and
a wide range
other AQM specifications.

3.4.1.  diffServActionTable - The Action Table

The action table identifies sequences of possible values may actions to be required due applied to a wide range of
link speeds. Most algorithms include a sample weight, represented here
by diffServRandomDropInvWeight.  The availability of
diffServRandomDropSamplingRate as readable is important,
packet.  Successive actions are chained through diffServActionNext,
ultimately terminating in zeroDotZero (indicating that the information
provided by Sampling Rate policy is essential
complete), a pointer to the configuration of
diffServRandomDropInvWeight.  Having Sampling Rate be configurable is
also helpful, as line speed increases, the ability a queue, or a pointer to have queue
sampling be less frequent than packet arrival some other functional
data path element.

When the MIB is needed.  Note however used for configuration, diffServActionNextFree always
contains a legal value for diffServActionId 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
using AUGMENTS on this table, to handle aspects of random drop
algorithms that are not standardized here.

NOTE: Deterministic Droppers can be viewed as a special case of Random
Droppers with currently used
in the drop probability restricted to 0 and 1. Hence
Deterministic Droppers might be described by a Random Dropper with Pmin
= 0, Pmax = 1, Qmin = Qmax = Qclip, system's configuration.  The Network Management Application reads
the averaged queue length at which
dropping occurs.

3.5.3.  Queues variable and Schedulers

The Queue Table models simple FIFO queues, as described in [MODEL]
section 7.1.1.  The Scheduler Table allows flexibility uses the value read in constructing
both simple and somewhat more complex queuing hierarchies from those
queues.  Of course, since TCBs can be cascaded multiple times on an
interface, even more complex hierarchies can be constructed that way
also.

Queue Table entries are pointed at by a create- and-go or a create-
and-wait SET.  When the "next" attributes of SET is performed, the
upstream elements e.g. diffServMeterSucceedNext.  Note that multiple
upstream elements agent must determine
whether the value is indeed still unused; two network managers may direct their traffic
attempt to create a configuration entry simultaneously and use the same Queue Table
entry. For example,
value.  If it is currently unused, the Assured Forwarding PHB suggests that all traffic
marked AF11, AF12 or AF13 be placed in SET succeeds and the same queue, after metering,
without reordering. This would be represented by having agent
changes the
diffServMeterSucceedNext value of each upstream meter point at diffServActionNextFree according to an agent-
specific algorithm.  If the same entry value is in use, however, the Queue Table.

NOTE: Queue Table and Scheduler Table entries are for data path
description, they both uses Scheduler Parameterization Table entries for

diffserv treatment parameterization.

Queue SET fails.
The network manager must re-read diffServActionNextFree to obtain a
useful value.

3.4.2.  diffServCountActTable - The Count Action Table entries specify

The count action accumulates statistics pertaining to traffic passing
through a given path through the scheduler it wants service from by use policy.  It is intended to be useful
for usage-based billing, for statistical studies, or for analysis of its Next pointer.

Each Scheduler Table entry represents the algorithm
behavior of a policy in use for servicing
the one or more queues that feed it. The [MODEL] section 7.1.2 describes a scheduler with multiple inputs: this is represented given network.  The objects in the MIB by
having Count
Action are various counters and a discontinuity time.  The counters
display the scheduling parameters be associated with each input.  In this
way, sets number of Queues can be grouped together as inputs to packets and bytes encountered on the path since
the discontinuity time.  They share the same
Scheduler.  This table serves discontinuity time.

The designers of this MIB expect that every path through a policy should
have a corresponding counter.  In early versions, it was impossible to represent
configure an action without implementing a counter, although the example scheduler
described current
design makes them in effect the [MODEL].   More complex queuing network manager's option, as a result of
making actions consistent in structure and scheduling
structures are possible using extensible.  The assurance of
proper debug and accounting is therefore left with the tables defined in this MIB. policy designer.

When
necessary, more complex constructs may be created outside of this MIB.

Scheduler Parameter Table entries are the MIB is used to parameterize each input
that feeds into for configuration, diffServCountActNextFree always
contains a scheduler. legal value for diffServCountActId that is not currently used
in the system's configuration.  The inputs can be a mixture of Queue Table Network Management Application reads
the variable and Scheduler Table entries.  Scheduler Parameter Table entries can be
used/reused by one or more Queue and/or Scheduler Table entries.

For representing uses the value read in a Strict Priority scheduler, each scheduler input is
assigned create- and-go or a priority with respect to all the other inputs feeding the
same scheduler, with default values for create-
and-wait SET.  When the other parameters.  Higher-
priority traffic that SET is not being delayed for shaping will be serviced
before a lower-priority input.

For Weighted Queuing methods e.g. WFQ, WRR, performed, the "weight" of a given
scheduler input agent must determine
whether the value is represented with a Minimum Service Rate leaky-bucket
profile which provides guaranteed minimum bandwidth indeed still unused; two network managers may
attempt to that input, if
required.  This is represented by create a rate diffServAssuredRateAbs; configuration entry simultaneously and use the
classical weight same
value.  If it is currently unused, the ratio between that rate SET succeeds and the interface speed,
or perhaps the ratio between that rate and agent

changes the sum value of diffServCountActNextFree according to an agent-
specific algorithm.  If the configured
rates for classes. value is in use, however, the SET fails.
The rate may, alternatively, be represented by network manager must re-read diffServCountActNextFree to obtain a
relative value,
useful value.

3.4.3.  diffServDscpMarkActTable - The Mark Action Table

The Mark Action table is an unusual table, both in SNMP and in this MIB.
I might be viewed not so much as an array of single-object entries as an
array of OBJECT-IDENTIFIER conventions, as the OID for a fraction
diffServDscpMarkActDscp instance conveys all of the interface's current line rate,
diffServAssuredRateRel to assist in cases where line rates necessary
information: packets are variable
or where a higher-level policy might to be expressed in terms of fractions
of network resources.  The two rate parameters are inter-related and
changes in one may be reflected in marked with the other.

For weighted scheduling methods, one can say loosely, that WRR focuses
on meeting bandwidth sharing, without concern requisite DSCP.

As such, contrary to common practice, the index for relative delay amongst the queues; where WFQ control table is read-
only, and is both queue service order the Entry's index and amount of
traffic serviced, providing meeting bandwidth sharing its only value.

3.4.4.  diffServAlgDropTable - The Algorithmic Drop Table

The Algorithmic Drop Table identifies a dropping algorithm, drops
packets, and relative delay
ordering amongst counts the queues.

A queue or scheduled set of queues (which is an input to a scheduler)
may also be capable of acting drops.  Classified as a non-work-conserving [MODEL] traffic

shaper: this an action, it is done by defining a Maximum Service Rate leaky-bucket
profile in order to limit the scheduler bandwidth available effect
a method which applies a packet to that
input. This is represented by a rate diffServShapingRateAbs; queue, and may modify either.  When
the
classical weight algorithm is "always drop", this is simple; when the ratio between that rate and the interface speed, algorithm calls
for head-drop, tail-drop, or perhaps a variety of Active Queue Management, the ratio between that rate
queue is inspected, and in the sum case of the configured
rates for classes.  The rate may, alternatively, Active Queue Management,
additional parameters are required.

What may not be represented by a
relative value, as clear from the name is that an Algorithmic Drop action
often does not drop traffic.  Algorithms other than "always drop"
normally drop a fraction few percent of packets at most.  The action inspects the interface's current line rate,
diffServShapingRateRel.  There was discussion
diffServQEntry that diffSeervAlgQMeasure points to in to determine
whether the working group about
alternative modeling approaches, such as defining a shaping action or packet should be dropped.

When the MIB is used for configuration, diffServAlgDropNextFree always
contains a
shaping element. We did not take this approach because shaping legal value for diffServAlgDropId that is not currently used
in the system's configuration.  The Network Management Application reads
the variable and uses the value read in
fact something a scheduler does to its inputs, (which we model as a
queue with a maximum rate create- and-go or a scheduler whose output has create-
and-wait SET.  When the SET is performed, the agent must determine
whether the value is indeed still unused; two network managers may
attempt to create a maximum
rate) and we felt it was simpler configuration entry simultaneously and more elegant to simply describe use the same
value.  If it
in that context.

Other types of priority is currently unused, the SET succeeds and weighted scheduling methods can be defined
using existing parameters in diffServAssuredRateEntry.  NOTE:
diffServSchedulerMethod uses OBJECT IDENTIFIER syntax, with the
different types agent
changes the value of scheduling methods defined as OBJECT-IDENTITY.
Future scheduling methods may be defined in other MIBs.  This requires diffServAlgDropNextFree according to an OBJECT-IDENTITY definition, agent-
specific algorithm.  If the value is in use, however, the SET fails.
The network manager must re-read diffServAlgDropNextFree to obtain a description
useful value.

3.4.5.  diffServRandomDropTable - The Random Drop Parameters Table

The Random Drop Table is an extension of how the existing objects Algorithmic Drop Table
intended for use on queues whose depth is actively managed.  Active
Queue Management algorithms are reused, if they are, and any new objects typified by [RED93], but the parameters
they require.

NOTE: hierarchical schedulers can be parameterized using use vary.  It was deemed for the purposes of this MIB by
having Scheduler Table entries feeds into Scheduler Table entry.

4.  MIB Usage Example

This section provides some examples on how that the different table entries
of this MIB may be used together for a Diffserv Device, with the usage
of each individual attribute be defined within the MIB module itself.
For the figures, all the MIB table entry and attribute names assumes
proper values to
have "diffServ" represent include:

 o      Target case mean queue depth, expressed in bytes or packets

 o      Worst case mean queue depth, expressed in bytes or packets

 o      Maximum drop rate expressed as their first common initial part drops per thousand

 o      Coefficient of name, with an exponentially weighted moving average,
        expressed as the
table entry name assumed to be their second common initial part numerator of name.
"0.0" a fraction whose denominator is being used to mean zeroDotZero.  And for Scheduler Method "= X"
means "using the OID
        65536.

 o      Sampling rate

An example of diffServSchedulerX".

4.1.  Model's Example

As an example, when this MIB's structures are used for the hypothetical
configuration representation chosen in [MODEL] section 8.1, the result this MIB for this element is
shown in Figure 2,
3, and 4.  The parameterization table entries' values are not specified
in detail here, they can 1.

Random droppers often have their drop probability function described as
a plot of drop probability (P) against averaged queue length (Q).
(Qmin,Pmin) then defines the start of the characteristic plot.  Normally
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
drop probability become more progressive (greater slope).  (Qclip,1)
defines the queue length at which all packets will be obtained dropped.  Notice
this is different from [MODEL] section 8.1.

+---------------------+                +------------------------> Q_EF
|DataPath Tail Drop because this uses an averaged queue

      AlgDrop                                   Queue
      +-----------------+                       +-------+
  --->| Next   ---------+--+------------------->| Next -+--> ...
      | QMeasure -------+--+                    | ...   | ifIndex=1
      | QThreshold      |       +--------------+     RandomDrop        +-------+
      | IfDirection=Ingress Type=randomDrop |    +------+     +----------------+
      |  +--->|Action Specific -------+---->| MinThreshBytes |
      +-----------------+     | Start --------------+--->|Clfr MaxThreshBytes |
                              | ProbMax        |
                              | Id=EF2 Weight         |
+---------------------+
                              | Id=1 |    |  |    | Next=0.0     |
                           +------+    |  |    | Specific=0.0 |
                                       |  |    | Type=AbsDrop |
                                       |  |    +--------------+
                                       |  |
                                       |  +-------------------+
                                       |                      |
  +------------+      +--------------+ |     +-----------+    |
  |ClfrElement |  +-->|Meter         | |  +->|Action     |    |
  | Id=EF      |  |   | Id=EF        | |  |  | Id=EF1    |    |
  | ClfrId=1   |  |   | SucceedNext -+-+  |  | Next -----+----+
  | Order=NA   |  |   | FailNext ----+----+  | Specific -+--+
  | Next ------+--+   | Specific -+  |       | Type=Spcf |  |
  | Specific --+-+    +-----------+--+       +-----------+  |
  +------------+ |                |                         |
                 |                |                 +-------+
                 |                |                 |
                 |   +--------+   |   +---------+   |  +--------------+
                 +-->|FilterEF|   +-->|TBMeterEF|   +->|CountActEFDrop|
                     +--------+       +---------+      +--------------+

  +------------+      +----------+      +--------------+
  |ClfrElement |  +-->|Action    |  +-->|AlgDrop       |
  | Id=AF11    |  |   | Id=AF11  |  |   | Id=AF11      |
  | ClfrId=1   |  |   | Next ----+--+   | Type=tailDrop|
  | Order=NA   |  |   | Specific +-+    | Next --------+--+-> Q_AF1
  | Next ------+--+   | Type=Spcf| |    | QMeasure ----+--+
  | Specific --+-+    +----------+ |    | QThreshold   |
  +------------+ |                 |    | Specific=0.0 |
                 |                 |    +--------------+
                 |                 |
                 |  +----------+   |  +------------+
                 +->|FilterAF11|   +->|CountActAF11|
                    +----------+      +------------+

      Figure 2: Example from Model Section 8.1 part 1
  +------------+      +--------------+      +-------------+
  |ClfrElement |  +-->|Meter         |  +-->|Action       |
  | Id=AF21    |  |   | Id=AF21      |  |   | Id=AF21S    |
  | ClfrId=1   |  |   | SucceedNext -+--+   | Next -------+----> Q_AF2
  | Order=NA   |  |   | FailNext +   |      | Specific -+ |
  | Next ------+--+   | Specific --+ |      | Type=Spcf | |
  | Specific --+-+    +----------+-+-+      +-----------+-+
  +------------+ |               | |                    |
                 |               | |                +---+
                 |               | |                |
                 |  +----------+ | |  +-----------+ |  +-------------+
                 +->|FilterAF21| | +->|TBMeterAF21| +->|CountActAF21S|
                    +----------+ |    +-----------+    +-------------+
                                 |
            +--------------------+
            |
            |   +-----------+      +-----------+
            +-->|Action     |  +-->|Action     |
                | Id=AF21F1 |  |   | Id=AF21F2 |
                | Next -----+--+   | Next -----+------> Q_AF2
                | Specific -+-+    | Specific -+-+
                | Type=Spcf | |    | Type=Spcf | |
                +-----------+ |    +-----------+ |
                              |                  |
                              |  +-------------+ |  +---------------+
                              +->|CountActAF21F| +->|DscpMarkActAF22|
                                 +-------------+    +---------------+

  +------------+
  |ClfrElement |  +-----------------------------------------> Q_BE
  | Id=WildCard|  |
  | ClfrId=1   |  |
  | Order=NA   |  |
  | Next ------+--+    +--------------+
  | Specific --+------>|FilterMatchAll|
  +------------+       +--------------+

      Figure 3: Example from Model Section 8.1 part 2
        +-------------+
Q_EF--->|Q            |
        | Id=EF    +--+--------------------------+
        | Next ----+  |   +-----------+          |
        | SchdParam --+-->|SchdParamEF|          |
        +-------------+   +-----------+          |
                                                 |
        +-------------+ SamplingRate   |
                              +----------------+
Q_AF1-->|Q            |                          +->|Scheduler       |
        | Id=AF1   +--+--------------------------+  | Id=Diffserv    |
        | Next ----+  |   +------------+         |  | Next=0.0       |
        | SchdParam --+-->|SchdParamAF1|         |  | Method=Priority|
        +-------------+   +------------+         |  | SchdParam=0.0  |
                                                 |  +----------------+
        +-------------+                          |
Q_AF2-->|Q            |                          |
        | Id=AF2   +--+--------------------------+
        | Next ----+  |   +------------+         |
        | SchdParam --+-->|SchdParamAF2|         |
        +-------------+   +------------+         |
                                                 |
        +-------------+                          |
Q_BE--->|Q            |                          |
        | Id=BE    +--+--------------------------+
        | Next ----+  |   +-----------+
        | SchdParam --+-->|SchdParamBE|
        +-------------+   +-----------+

      Figure 4: Example from Model Section 8.1 part 3

4.2.  Additional Data Path Example

4.2.1.  Data Path

length, although it is possible for Qclip to equal Qmax.

In the MIB module, DiffServRandomDropMinThreshBytes and Classifier Example Discussion

The example in Figure 5 shows a single diffServDataPathTable entry
feeding into a single Classifier entry, with three Classifier Element
DiffServRandomDropMinThreshPkts represent Qmin.
DiffServRandomDropMaxThreshBytes and Filter Table entry pairs belonging DiffServRandomDropMaxThreshPkts
represent Qmax.  DiffServAlgDropQThreshold represents Qclip.
DiffServRandomDropInvProbMax represents Pmax (inverse).  This MIB does
not represent Pmin (assumed to be zero unless otherwise represented).
In addition, since message memory is finite, queues generally have some
upper bound above which they are incapable of storing additional
traffic.  Normally this Classifier 1.  Notice the
three Filters used here must completely classify all the traffic
presented number is equal to Qclip, specified by
diffServAlgDropQThreshold.

Each random dropper specification is associated with a queue.  This
allows multiple drop processes (of same or different types) to this data path.

Another level of classification can be defined that follows
associated with the Action
functional DataPath elements in Figure 5. same queue, as different PHB implementations may
require.  This multi-level
classification allow also allows for sequences of multiple droppers if
necessary.

The calculation of a smoothed queue length may also have an important
bearing on the construction behavior of traffic separations the dropper: parameters may include the
sampling interval or rate, and
specific actions at the weight of each level, like:
  if (dept1) then take dept1-action
  {
    if (appl1) then take dept1-appl1-action.

+---------------------+
|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|  +-->|CountAct1|
                     +-------+        +--------+      +---------+

  +------------+      +--------------+      +-----------+
  |ClfrElement |  +-->|Meter         |  +-->|Action     |
  | Id=102     |  |   | Id=102       |  |   | Id=102    |
  | ClfrId=1   |  |   | SucceedNext -+--+   | Next -----+---->...
  | Order=NA   |  |   | FailNext ----+->... | Specific -+-+
  | Next ------+--+   | Specific -+  |      | Type=Spcf | |
  | Specific --+-+    +-----------+--+      +-----------+ |
  +------------+ |                |               +-------+
                 |   +-------+    |   +--------+  |   +---------+
                 +-->|Filter2|    +-->|TBMeter2|  +-->|CountAct2|
                     +-------+        +--------+      +---------+

  +------------+      +--------------+      +-----------+
  |ClfrElement |  +-->|Meter         |  +-->|Action     |
  | Id=103     |  |   | Id=103       |  |   | Id=103    |
  | ClfrId=1   |  |   | SucceedNext -+--+   | Next -----+---->...
  | Order=NA   |  |   | FailNext ----+->... | Specific -+-+
  | Next ------+--+   | Specific -+  |      | Type=Spcf | |
  | Specific --+-+    +-----------+--+      +-----------+ |
  +------------+ |                |               +-------+
                 |   +-------+    |   +--------+  |   +---------+
                 +-->|Filter3|    +-->|TBMeter3|  +-->|CountAct3|
                     +-------+        +--------+      +---------+

      Figure 5: sample.  The
performance may be very sensitive to the values of these parameters and
a wide range of possible values may be required due to a wide range of
link speeds.  Most algorithms include a sample weight, represented here
by DiffServRandomDropInvWeight.  The availability of
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 Data Path Example Part 1
     +-------------+                          +-----------------+
---->|Q            |                       +->|Scheduler        |
     | Id=EF       |                       |  | Id=Diffserv     |
     | Next -------+-----------------------+  | Next=0.0        |
     | SchdParam -+|                       |  | Method=Priority |
     +------------++                       |  | SchdParam=0.0   | parameters may be added in an enterprise MIB module, e.g.  by
using AUGMENTS on this table, to handle aspects of random drop
algorithms that are not standardized here.

When the MIB is used for configuration, diffServRandomDropNextFree
always contains a legal value for diffServRandomDropId that is not
currently used in the system's configuration.  The Network Management
Application reads the variable and uses the value read in a create-
and-go or a create-and-wait SET.  When the SET is performed, the agent
must determine whether the value is indeed still unused; two network
managers may attempt to create a configuration entry simultaneously and
use the same value.  If it is currently unused, the SET succeeds and the
agent changes the value of diffServRandomDropNextFree according to an

agent-specific algorithm.  If the value is in use, however, the SET
fails.  The network manager must re-read diffServRandomDropNextFree to
obtain a useful value.

3.5.  Queuing and Scheduling of Packets

These include Queues and Schedulers, which are inter-related in their
use of queuing techniques.  By doing so, it is possible to build multi-
level schedulers, such as those which treat a set of queues as having
priority among them, and at a specific priority find a secondary WFQ
scheduler with some number of queues.

3.5.1.  diffServQTable - The Class or Queue Table

The Queue Table models simple FIFO queues.  The Scheduler Table allows
flexibility in constructing both simple and somewhat more complex
queuing hierarchies from those queues.

Queue Table entries are pointed at by the "next" attributes of the
upstream elements, such as DiffServMeterSucceedNext or
diffServActionNext.  Note that multiple upstream elements may direct
their traffic to the same Queue Table entry.  For example, the Assured
Forwarding PHB suggests that all traffic marked AF11, AF12 or AF13 be
placed in the same queue, after metering, without reordering.  To
accomplish that, the upstream diffServAlgDropNext pointers each point to
the same diffServQEntry.

A common requirement of a queue is that its traffic enjoy a certain
minimum or maximum rate, or that it be given a certain priority.
Functionally, the selection of such is a function of a scheduler, as in
Section .sh 4 "The parameter is associated with the queue, however,
using the Assured or Shaping Rate Parameters Table.

When the MIB is used for configuration, diffServQNextFree always
contains a legal value for diffServQId that is not currently used in the
system's configuration.  The Network Management Application reads the
variable and uses the value read in a create-and-go or a create- and-
wait SET.  When the SET is performed, the agent must determine whether
the value is indeed still unused; two network managers may attempt to
create a configuration entry simultaneously and use the same value.  If
it is currently unused, the SET succeeds and the agent changes the value
of diffServQNextFree according to an agent- specific algorithm.  If the
value is in use, however, the SET fails.  The network manager must re-
read diffServQNextFree to obtain a useful value.

3.5.2.  diffServSchedulerTable - The Scheduler Table

The scheduler, and therefore the Scheduler Table, accepts inputs from
either queues or a preceding scheduler.  The Scheduler Table allows
flexibility in constructing both simple and somewhat more complex
queuing hierarchies from those queues.

When the MIB is used for configuration, diffServSchedulerNextFree always
contains a legal value for diffServSchedulerId that is not currently
used in the system's configuration.  The Network Management Application
reads the variable and uses the value read in a create- and-go or a
create-and-wait SET.  When the SET is performed, the agent must
determine whether the value is indeed still unused; two network managers
may attempt to create a configuration entry simultaneously and use the
same value.  If it is currently unused, the SET succeeds and the agent
changes the value of diffServSchedulerNextFree according to an agent-
specific algorithm.  If the value is in use, however, the SET fails.
The network manager must re-read diffServSchedulerNextFree to obtain a
useful value.

3.5.3.  diffServAssuredRateTable - The Assured Rate Table

When the output rate of a queue or scheduler must be given a minimum
rate or a priority, this is done using the diffServAssuredRateTable.
Rates may be expressed as absolute rates, or as a fraction of ifSpeed,
and imply the use of a rate-based scheduler such as WFQ or WRR.  The use
of a priority implies the use of a Priority Scheduler.  Only one of the
Absolute or Relative rate need be set; the other takes the relevant
value as a result.  Excess capacity is distributed proportionally among
the inputs to a scheduler.

The effect of combining priority and rate is to make the rates be in
fact fractions of ifSpeed less the actual amount of traffic passing,
although the fraction is calculated against the ifSpeed value.

When the MIB is used for configuration, diffServAssuredRateNextFree
always contains a legal value for diffServAssuredRateId that is not
currently used in the system's configuration.  The Network Management
Application reads the variable and uses the value read in a create-
and-go or a create-and-wait SET.  When the SET is performed, the agent
must determine whether the value is indeed still unused; two network
managers may attempt to create a configuration entry simultaneously and
use the same value.  If it is currently unused, the SET succeeds and the
agent changes the value of diffServAssuredRateNextFree according to an
agent-specific algorithm.  If the value is in use, however, the SET
fails.  The network manager must re-read diffServAssuredRateNextFree to

obtain a useful value.

3.5.4.  diffServShapingRateTable - The Shaping Rate Table

When the output rate of a queue or scheduler must be limited to at most
a specified maximum rate, this is done using the
diffServShapingRateTable.  Rates may be expressed as absolute rates, or
as a fraction of ifSpeed.  Only one of the Absolute or Relative rate
need be set; the other takes the relevant value as a result.

The definition of a multirate shaper requires multiple
diffServShapingRateEntries.  In this case, an algorithm such as SHAPING
is used.  In that algorithm, more than one rate is specified, and at any
given time traffic is shaped to the lowest specified rate which exceeds
the arrival rate of traffic.

When the MIB is used for configuration, diffServShapingRateNextFree
always contains a legal value for diffServShapingRateId that is not
currently used in the system's configuration.  The Network Management
Application reads the variable and uses the value read in a create-
and-go or a create-and-wait SET.  When the SET is performed, the agent
must determine whether the value is indeed still unused; two network
managers may attempt to create a configuration entry simultaneously and
use the same value.  If it is currently unused, the SET succeeds and the
agent changes the value of diffServShapingRateNextFree according to an
agent-specific algorithm.  If the value is in use, however, the SET
fails.  The network manager must re-read diffServShapingRateNextFree to
obtain a useful value.

3.5.5.  Using queues and schedulers together

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.  Higher-
priority traffic that is not being delayed for shaping will be serviced
before a lower-priority input.  An example is found in Figure 2.

For Weighted Queuing methods, such as WFQ or WRR, the "weight" of a
given scheduler input is represented with a Minimum Service Rate leaky-
bucket profile which provides guaranteed minimum bandwidth to that
input, if required.  This is represented by a rate
DiffServAssuredRateAbs; the classical weight is the ratio between that
rate and the interface speed, or perhaps the ratio between that rate and
the sum of the configured rates for classes.  The rate may be
represented by a relative value, as a fraction of the interface's
                      +-----+
+-------+             | P S |
| Queue +------------>+ r c |
+-------+-+--------+  | i h |
          |Priority|  | o e |
          +--------+  | r d +----------->
+-------+             | i u |
| Queue +------------>+ t l |
+-------+-+--------+  | y e |
          |Priority|  |   r |
          +--------+  +-----+

current line rate.  DiffServAssuredRateRel to assist in cases where line
rates are variable or where a higher-level policy might be expressed in
terms of fractions of network resources.  The two rate parameters are
inter-related and changes in one may be reflected in the other.  An
example is found in figure 4.

For weighted scheduling methods, one can say loosely, that WRR focuses
on meeting bandwidth sharing, without concern for relative delay amongst
the queues; where WFQ control both queue service order and amount of
traffic serviced, providing meeting bandwidth sharing and relative delay
ordering amongst the queues.

A queue or scheduled set of queues (which is an input to a scheduler)
may also be capable of acting as a non-work-conserving [MODEL] traffic
shaper: this is done by defining a Maximum Service Rate leaky-bucket

                      +-----+
+-------+             | W S |
| Queue +------------>+ R c |
+-------+-+--------+  | R h |
          |  Rate  |  |   e |
          +--------+  | o d +----------->
+-------+             | r u |
| Queue +------------>+   l |
+-------+-+--------+  | W e |
          |  Rate  |  | F r |
          +--------+  | Q   |
                      +-----+

profile in order to limit the scheduler bandwidth available to that
input.  This is represented by a rate, in DiffServShapingRateAbs; the
classical weight is the ratio between that rate and the interface speed,
or perhaps the ratio between that rate and the sum of the configured
rates for classes.  The rate may be represented by a relative value, as
a fraction of the interface's current line rate, DiffServShapingRateRel.
There was discussion in the working group about alternative modeling
approaches, such as defining a shaping action or a shaping element.
This MIB does not take this approach because shaping is in fact
something a scheduler does to its inputs, (which we model as a queue
with a maximum rate or a scheduler whose output has a maximum rate) and
the authors felt it was simpler and more elegant to simply describe it
in that context.

The same may be done on a queue, if a given class is to be shaped to a
maximum rate without shaping other classes, as in Figure 5.

Other types of priority and weighted scheduling methods can be defined
using existing parameters in DiffServAssuredRateEntry.  NOTE:
DiffServSchedulerMethod uses OBJECT IDENTIFIER syntax, with the
different types of scheduling methods defined as OBJECT-IDENTITY.
Future scheduling methods may be defined in other MIBs.  This requires
an OBJECT-IDENTITY definition, a description of how the existing objects
are reused, if they are, and any new objects they require.

Queue Table entries are pointed at by the "next" attributes of the
upstream elements, such as DiffServMeterSucceedNext or
diffServActionNext.  Note that multiple upstream elements may direct
their traffic to the same Queue Table entry.  For example, the Assured
Forwarding PHB suggests that all traffic marked AF11, AF12 or AF13 be

                      +---+
+-------+             | S |
| Queue +------------>+ c |
+-------+-+--------+  | h |
          |        |  | e +----------->
          +--------+  | d +-+-------+
                      | u | |Maximum|
+-------+             | l | | Rate  |
| Queue +------------>+ e | +-------+
+-------+-+--------+  | r |
          |        |  |---+
          +--------+
                      +---+
+-------+             | S |
| Queue +------------>+ c |
+-------+-+--------+  | h |
          |Min Rate|  | e +----------->
          +--------+  | d |  +-----------------+
     +------------+
                      | u |
+-------+             | l |
| Queue +------------>+ e |
+-------+-+--------+  | r |
          |Min Rate|  |   |  +-----------+
          +--------+  |   |
     +->|SchdParamEF|
          |Max Rate|  |
        +-----------+                      +---------------------+   |
    +----------------+       +-------------+
          +--------+  +---+

placed in the same queue, after metering, without reordering.  To
accomplish that, the upstream diffServAlgDropNext pointers each point to
the same diffServQEntry.

A common requirement of a queue is that its traffic enjoy a certain
minimum or maximum rate, or that it be given a certain priority.
Functionally, the selection of such is a function of a scheduler, as in
Section .sh 4 "The parameter is associated with the queue, however,
using the Assured or Shaping Rate Parameters Table.

To implement an EF and two AF classes, one must use a combination of
priority and WRR/WFQ scheduling.  This requires us to cascade two
schedulers.  If we were to additionally shape the output of the system
to a rate lower than the interface rate, we must place an upper bound
rate on the output of the priority scheduler.  See figure 4.

3.6.  Example configuration for AF and EF

For the sake of argument, let us build an example with one EF class and
four AF classes using the constructs in this MIB.

3.6.1.  AF and EF Ingress Interface Configuration

The ingress edge interface identifies traffic into classes, meters it,
and ensures that any excess is appropriately dealth with according to
the PHB.  For AF, this means marking excess; for EF, it means dropping
excess or shaping it to a maximum rate.

                                            +-----+
+-------+                                   | P S |
--->|AlgDrop
|    +->|Q Queue +---------------------------------->+ r c |
+-------+----------------------+--------+   | i h | Id=AF11
                               |Priority|   | o e +----------->
                               +--------+   | r d +-+-------+
                      +------+              | Id=AF1 i u |    +-------------+ |Maximum|
+-------+             | W S  +------------->+ t l | Type=randomDrop| | Rate  | Next -------+--->|Scheduler
| Queue +------------>+ R c  +-+--------+   | y e | Next ----------+-+--+ +-------+
+-------+-+--------+  | SchdParam -+| R h  | Id=AF |Priority|   |   r |
          |Min Rate|  | QMeasure ------+-+   e  |  +------------++ +--------+   +-----+
          +--------+  | Next -------+--+ o d  | QThreshold
+-------+             | r u  |
| Queue +------------>+   l  | Method=WFQ
+-------+-+--------+  | W e  | Specific -+
          |Min Rate|  | F r  |  +------------+
          +--------+  | SchdParam --+--+
    +-----------+----+ Q    |
                      +------+
  +-----------------------+
  |                  +-------------+ diffServDataPathStart |
  +-----------+-----------+
              |
   +----------+
   |
+--+--+     +-----+     +-----+     +-----+     +-----+
| AF1 +-----+ AF2 +-----+ AF3 +-----+ AF4 +-----+ EF  |  +------------+
+--+--+     +--+--+     +--+--+     +--+--+     +--+--+
   |
    +-----------+           |  +->|SchdParamAF1|  +----------------+           |  +--------------+           |     +------------+           |
    +->|RandomDropAF11|
+--+--+     +--+--+     +--+--+     +--+--+     +--+--+
|TRTCM|     |TRTCM|     |TRTCM|     |TRTCM|     |srTCM|
|Meter|     |Meter|     |Meter|     |Meter|     |Meter|
|-+++-|     |-+++-|     |-+++-|     |-+++-|     +-+-+-+
  |||         |||         |||         |||         | |
+-+||---+   +-+||---+   +-+||---+   +-+||---+   +-+-|---+
|+-+|----+  |+-+|----+  |+-+|----+  |+-+|----+  |+--+----+
||+-+-----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||Actions|
+||Actions| +||Actions| +||Actions| +||Actions| +|Below  |
 +|Below  |  +|Below  |  +|Below  |  +|Below  |  +-+-----+
  +-+-----+   +-+-----+   +-+-----+   +-+-----+    |
  |||         |||         |||         |||          |
  VVV         VVV         VVV         VVV          V

        Accepted traffic is sent to IP forwarding

3.6.1.1.  Classification In The Example

A packet arriving at an ingress interface picks up its "program" from
the diffServDataPathTable.  This points to a classifier, which will
select traffic according to some specification for each traffic class.

An example of a classifier for an AFm class would be a succession of
three classifier elements, each pointing to a Six-tuple classification
parameter block identifying one of the AFmn DSCPs.  Alternatively, the
six-tuples might contain selectors for HTTP traffic or some other
application.

An example of a classifier for EF traffic might be either a classifier
element pointing to a six-tuple parameter specifying the EF code point,
or a collection of classifiers with parameter blocks specifying
individual telephone calls, or a variety of other approaches.

Each classifier hands its traffic off to appropriate functional data
path elements.

3.6.1.2.  AF Implementation On an Ingress Edge Interface

Each Afm class applies a Two Rate Three Color Meter, dividing traffic
into three groups.  These groups of traffic conform to both specified
rates, only the higher one, or none.  The intent, on the ingress
interface at the edge of the network, is to measure and appropriately
mark traffic.

3.6.1.2.1.  AF Metering On an Ingress Edge Interface

Each Afm class applies a Two Rate Three Color Meter, dividing traffic
into three groups.  If two rates R and S, with R < S, are specified and
traffic arrives at rate T, traffic comprising up to R bits per second is
considered to conform to the "confirmed" rate, R.  If R < T, traffic
comprising up to S-R bits per second is considered to conform to the
"excess" rate, S.  Any further excess is non- conformant.

To configure this, we apply two Meter Entries, one for the conforming
rate and one for the excess rate.  The rate parameters are stored in
associated Token Bucket Parameter Entries.  The "FailNext" pointer of
the lower rate Meter Entry points to the other Meter Entry; both
"SucceedNext" pointers and the "FailNext" pointer of the higher Meter
Entry point to lists of actions.  In the color-blind mode, all three
classifier "next" entries point to the lower rate meter entry.  In the
color-aware mode, the AFm1 classifier points to the lower rate entry,
the AFm2 classifier points to the higher rate entry (as it is only
compared against that rate), and the AFm3 classifier points directly to
the actions taken when both rates fail.

3.6.1.2.2.  AF Actions On an Ingress Edge Interface

For network planning and perhaps for billing purposes, arriving traffic
is normally counted.  Therefore, a "count" action, consisting of an
action table entry pointing to a count table entry, is configured.

Also, traffic is marked with the appropriate DSCP.  The first R bits per
second are marked AFm1, the next S-R bits per second are marked AFm2,
and the rest is marked AFm3.  It may be that traffic is arriving marked
with the same DSCP, but in general, the additional complexity of
deciding that it is being remarked to the same value is not useful.
Therefore, a "mark" action, consisting of an action table entry pointing
to a mark table entry, is configured.

At this point, the usual case is that traffic is now forwarded in the
usual manner.  To indicate this, we set the "SucceedNext" pointer of the

Mark Action is left at zeroDotZero.

3.6.1.3.  EF Implementation On an Ingress Edge Interface

The EF class applies a Single Rate Two Color Meter, dividing traffic
into "conforming" and "excess" groups.  The intent, on the ingress
interface at the edge of the network, is to measure and appropriately
mark conforming traffic and drop the excess.

3.6.1.3.1.  EF Metering On an Ingress Edge Interface

A single rate two color (SRTCM) meter requires one token bucket.  It is
therefore configured using a single meter entry with a corresponding
Token Bucket Parameter Entry.  Arriving traffic either "succeeds" or
"fails".

3.6.1.3.2.  EF Actions On an Ingress Edge Interface

For network planning and perhaps for billing purposes, arriving traffic
that conforms to the meter is normally counted.  Therefore, a "count"
action, consisting of an action table entry pointing to a count table
entry, is configured.

Also, traffic is (re)marked with the EF DSCP.  Therefore, a "mark"
action, consisting of an action table entry pointing to a mark table
entry, is configured.

At this point, the successful traffic is now forwarded in the usual
manner.  To indicate this, we set the "SucceedNext" pointer of the Mark
Action is left at zeroDotZero.

Traffic that exceeded the arrival policy, however, is to be dropped.  We
can use a count action on this traffic if the several counters are
interesting.  However, since the drop counter in the Algorithmic Drop
Entry will count packets dropped, this is not clearly necessary.  We
configure an Alorithmic Drop Entry of the type "alwaysDrop," with no
successor.

3.7.  AF and EF Egress Edge Interface Configuration

3.7.1.  Classification On an Egress Edge Interface

A packet arriving at an egress interface may have been classified on an
ingress interface, and the egress interface may have access to that
  +-----------------------+
  | diffServDataPathStart |  +-----------+
       +--------------+
  +-----------+-----------+
              |                     +->|SchdParamAF|
   +----------+
   |                        +-----------+
    +----------------+
+--+--+     +-----+     +-----+     +-----+     +-----+
| AF1 +-----+ AF2 +-----+ AF3 +-----+ AF4 +-----+ EF  |
--->|AlgDrop
|-+++-|     |-+++-|     |-+++-|     |-+++-|     +-+-+-+
  |||         |||         |||         |||         | |
|-+++-|     |-+++-|     |-+++-|     |-+++-|     +-+-+-+
|TRTCM|     |TRTCM|     |TRTCM|     |TRTCM|     |srTCM|
|Meter|     |Meter|     |Meter|     |Meter|     |Meter|
|-+++-|     |-+++-|     |-+++-|     |-+++-|     +-+-+-+
  |||         |||         |||         |||         | |
+-+||---+   +-+||---+   +-+||---+   +-+||---+   +-+-|---+
|+-+|----+  |+-+|----+  |+-+|----+  |+-+|----+  |+--+----+
||+-+-----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||Actions|
+||Actions| +||Actions| +||Actions| +||Actions| +|Below  |
 +|Below  |  +|Below  |  +|Below  |  +|Below  |  +-+-----+
  +-+-----+   +-+-----+   +-+-----+   +-+-----+    |
  |||         |||         |||         |||          |
+-+++--+    +-+++--+    +-+++--+    +-+++--+    +--+---+
| Queue|    | Queue|    | Queue|    | Queue|    | Queue|
+--+---+    +--+---+    +--+---+    +--+---+    +--+---+
   |           |           | Id=AF12           |           |
+--+-----------+-----------+-----------+---+       | Type=randomDrop|
|     WFQ/WRR Scheduler                    | Next ----------+-+--+       | QMeasure ------+-+
+--------------------------------------+---+       | QThreshold
                                       |           | Specific -+
                                 +-----+-----------+----+
                                 |
    +-----------+----+  Priority Scheduler  |
    +-----------+
                                 +----------+-----------+
                                            |  +--------------+
    +->|RandomDropAF12|
       +--------------+

      Figure 6: Additional Data Path Example Part 2

    if (appl2) then take dept1-appl2-action.
    if (appl3) then take dept1-appl3-action.

  }
  if (dept2) then take dept2-action
  {
    if (appl1) then take dept2-appl1-action.
    if (appl2) then take dept2-appl2-action.
    if (appl3) then take dept2-appl3-action.
  }
  if (dept3) then take dept3-action
  {
    if (appl1) then take dept3-appl1-action.
    if (appl2) then take dept3-appl2-action.
    if (appl3) then take dept3-appl3-action.
  }

Minimally,
                                            V

information.  If it is relevant, there is no reason not to use that
information.  If it is not available, however, there may be a need to
(re)classify on the egress interface.  In any event, it picks up its
"program" from the diffServDataPathTable.  This points to a classifier,
which will select traffic according to some specification for each
traffic class.

An example of a classifier for an AFm class would be a succession of

three classifier elements, each pointing to a Six-tuple classification
parameter block identifying one of the AFmn DSCPs.  Alternatively, the
six-tuples might contain selectors for HTTP traffic or some other
application.

An example of a classifier for EF traffic might be either a classifier
element pointing to a six-tuple parameter specifying the EF code point,
or a collection of classifiers with parameter blocks specifying
individual telephone calls, or a variety of other approaches.

Each classifier hands its traffic off to appropriate functional data
path elements.

3.7.2.  AF Implementation On an Egress Edge Interface

Each Afm class applies a Two Rate Three Color Meter, dividing traffic
into three groups.  These groups of traffic conform to both specified
rates, only the higher one, or none.  The intent, on the ingress
interface at the edge of the network, is to measure and appropriately
mark traffic.

3.7.2.1.  AF Metering On an Egress Edge Interface

Each Afm class applies a Two Rate Three Color Meter, dividing traffic
into three groups.  If two rates R and S, with R < S, are specified and
traffic arrives at rate T, traffic comprising up to R bits per second is
considered to conform to the "confirmed" rate, R.  If R < T, traffic
comprising up to S-R bits per second is considered to conform to the
"excess" rate, S.  Any further excess is non- conformant.

To configure this, we apply two Meter Entries, one for the conforming
rate and one for the excess rate.  The rate parameters are stored in
associated Token Bucket Parameter Entries.  The "FailNext" pointer of
the lower rate Meter Entry points to the other Meter Entry; both
"SucceedNext" pointers and the "FailNext" pointer of the higher Meter
Entry point to lists of actions.  In the color-blind mode, all three
classifier "next" entries point to the lower rate meter entry.  In the
color-aware mode, the AFm1 classifier points to the lower rate entry,
the AFm2 classifier points to the higher rate entry (as it is only
compared against that rate), and the AFm3 classifier points directly to
the actions taken when both rates fail.

3.7.2.2.  AF Actions On an Egress Edge Interface

For network planning and perhaps for billing purposes, departing traffic
is normally counted.  Therefore, a "count" action, consisting of an
action table entry pointing to a count table entry, is configured.

Also, traffic may be marked with an appropriate DSCP.  The first R bits
per second are marked AFm1, the next S-R bits per second are marked
AFm2, and the filters for appl1, appl2, appl3 rest is marked AFm3.  It may be reused that traffic is arriving
marked with the same DSCP, but in general, the additional complexity of
deciding that it is being remarked to the same value is not useful.
Therefore, a "mark" action, consisting of an action table entry pointing
to a mark table entry, is configured.

At this point, the usual case is that traffic is now queued for
transmission.  The queue uses Active Queue Management, using an
algorithm such as RED.  Therefore, an Algorithmic Dropper is configured
for each AFmn traffic stream, with a slightly lower min- threshold (and
possibly lower max-threshold) for the
above setup.

4.2.2.  Meter excess traffic than for the
committed traffic.

3.7.2.3.  AF Rate-based Queuing On an Egress Edge Interface

The queue expected by AF is normally a work-conserving queue.  It
usually has a specified minimum rate, and Action Example Discussion

A simple Meter may have a maximum rate below
the bandwidth of the interface.  In concept, it will use as much
bandwidth as is available to it, but assure the lower bound.

Common ways to implement this include various forms of Weighted Fair
Queuing (WFQ) or Weighted Round Robin (WRR).  Integrated over a longer
interval, these give each class a predictable throughput rate.  They
differ in that can be parameterized by over short intervals they will order traffic differently.
In general, traffic classes that keep traffic in queue will tend to
absorb latency from queues with lower mean occupancy, in exchange for
which they make use of any available capacity.

3.7.3.  EF Implementation On an Egress Edge Interface

The EF class applies a Single Rate Two Color Meter, dividing traffic
into "conforming" and "excess" groups.  The intent, on the egress
interface at the edge of the network, is to measure and appropriately
mark conforming traffic and drop the excess.

3.7.3.1.  EF Metering On an Egress Edge Interface

A single rate two color (SRTCM) meter requires one token bucket.  It is
therefore configured using a single TBMeter meter entry is
shown here.  For Metering types that require multiple TBMeter entries
for parameterization, with a second level Meter and TBMeter table entries may
be used. corresponding
Token Bucket Parameter Entry.  Arriving traffic either "succeeds" or
"fails".

3.7.3.2.  EF Actions On an Egress Edge Interface

For example, network planning and perhaps for [TRTCM], with billing purposes, departing traffic
that conforms to the first level TBMeter meter is normally counted.  Therefore, a "count"
action, consisting of an action table entry
used for Peak Information Token Bucket, the first level SucceedNext
points pointing to the second level Meter a count table
entry, with second level TBMeter entry
used for Committed Information Token Bucket.

Notice the CountAct Action is shown in Figure 5.  This configured.

Also, traffic is purposely done
to indicate that every DataPath should have at least one CountAct
Action.  Other actions can be pointed to by the Next pointer of (re)marked with the
CountAct EF DSCP.  Therefore, a "mark"
action, like DscpMarkAct action.

4.2.3.  Queue and Scheduler Example Discussion

Example in Figure 6 shows three classified input traffic streams, EF,
AF11, and AF12, feeding into their respective queue and algorithmic
droppers.  After their respective dropping process, consisting of an action table entry pointing to a mark table
entry, is configured.

At this point, the AF successful traffic
streams feed into the same queue, QAF1X.

A Scheduler, AF, is shown in Figure 6, as the sink now queued for AF1X transmission,
using a priority queue
traffic, servicing AF1X or perhaps a rate-based queue with scheduling parameters indicated by
SchdParamAF1X.  This scheduler is used to service traffic from AF1X,
AF2X, AF3X queues using weighted fair queuing method.  The AF2X and AF3X
queues are not shown in Figure 6, they can be very much like AF1X queue
setup.

Another traffic stream, EF, is handled by significant
over-provision.  Since the EF queue.  Scheduler
Diffserv services output amount of EF traffic present is known, one might
not drop from this queue using SchdParamEF, and output of AF
scheduler using SchdParamAF, with Priority Queue scheduling method.

Notice all at all.

Traffic that exceeded the diffserv traffic may go out on policy, however, is dropped.  We can use a link with traffic
shaping.  The
count action on this traffic shaping can be parameterize using if the Shaping
Scheduler several counters are interesting.
However, since the drop counter in Figure 6.  For shaping, the diffServShapingRate attributes
should be used.  The Shaping Scheduler Algorithmic Drop Entry will count
packets dropped, this is indicated as the last diffserv
functional element not clearly necessary.  We configure an
Alorithmic Drop Entry of this data path by using its Next pointer the type "alwaysDrop," with
value of zeroDotZero.

5. no successor.

3.7.3.3.  EF Priority Queuing On an Egress Edge Interface

The normal implementation is a priority queue, to minimize induced
jitter.  By this, we mean that a separate queue is used for each EF
class, with a strict ordering.

4.  Conventions used in this MIB

5.1.

4.1.  The use of RowPointer to indicate data path linkage

RowPointer is a textual convention used to identify a conceptual row in
an SNMP Table by pointing to one of its objects. One of the ways it is
used in this
MIB uses it is to indicate succession, pointing to data path linkage
table entries.

For succession, it answers the question "what happens next?". Rather
than presume that the next table must be as specified next table must be as specified in the conceptual
model [MODEL] and providing its index, the RowPointer takes you to the
MIB row representing that thing. In the DiffServMeterTable, for example,
the DiffServMeterFailNext RowPointer might take you to another meter,
while the DiffServMeterSucceedNext RowPointer would take you to an
action.

Since a RowPointer is not tied to any specific object except by the
value it contains, it is possible and acceptable to use RowPointers to
merge data paths.  An obvious example of such a use is in the
classifier: traffic matching the DSCPs AF11, AF12, and AF13 might be
presented to the same meter in order to perform the processing described
in the Assured Forwarding PHB. Another use would be to merge data paths
from several interfaces; if they represent a single service contract,
having them share a common set of counters and common policy may be a
desireable configuration. Note well, however, that suchconfigurations
may have related implementation issues - if Differentiated Services
processing for the interfaces is implemented in multiple forwarding
engines, the conceptual
model [MODEL] and providing its index, the RowPointer takes you engines will need to the
MIB row representing communicate if they are to implement
such a feature. An implementation that thing. In the diffServMeterTable, for example,
the diffServMeterFailNext RowPointer might take you fails to another meter,
while the diffServMeterSucceedNext RowPointer would take you provide this capability
is not considered to have failed the intention of this MIB or of the
[MODEL]; an
action. implementation that does provide it is not considered
superior from a standards perspective.

     NOTE -- the RowPointer construct is used to build connect the TCBs
     described in [MODEL]: this MIB functional
     data paths.  The [MODEL] describes these as TCBs, as an aid to
     understanding. This MIB, however, does not model TCBs directly - it directly. It
     operates at a lower level of abstraction using only individual
     elements, connected in succession by RowPointers. Therefore, the
     concept of TCBs enclosing individual functional DataPath Functional Data Path elements
     is not directly applicable to this MIB, although such a concept may be
     employed by management tools
     that use this MIB. MIB may employ such a concept.

It is possible that a path through a device following a set of
RowPointers is indeterminate i.e. it ends in a dangling RowPointer.
Guidance is provided in the MIB module's DESCRIPTION-clause for each of
the linkage attribute.  In general, for both zeroDotZero and dangling
RowPointer, it is assumed the data path ends and the traffic should be
given to the next logical part of the device, usually a forwarding
process or a transmission engine, or the proverbial bit-bucket. Any
variation from this usage is indicated by the attribute affected.

5.2.

4.2.  The use of RowPointer to indicate parameters

RowPointer is also used in this MIB to indicate parameterization, for
pointing to parameterization table entries.

For indirection (as in the diffServClfrElementTable), DiffServClfrElementTable), the idea is to
allow other MIBs, including proprietary ones, to define new and arcane
filters - MAC headers, IPv4 and IPv6 headers, BGP Communities and all
sorts of other things - whilst still utilizing the structures of this
MIB. This is a form of class inheritance (in "object oriented"
language): it allows base object definitions ("classes") to be extended
in proprietary or standard ways, in the future, by other documents.

RowPointer also clearly indicates the identified conceptual row's
content does not change, hence they can be simultaneously used, pointed
to, by more than one data path linkage table entries.  The
identification of RowPointer allows higher level policy mechanisms to
take advantage of this characteristic.

5.3.

4.3.  Conceptual row creation and deletion

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
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
and to ensure that, when used, the manager knows whether it got what it
wanted or not.

Typically, such a table has an associated NextFree variable e.g.
diffServClfrNextFree
DiffServClfrNextFree which provides a suitable value for the index of
the next row to be created e.g. diffServClfrId. A special value, 0, DiffServClfrElementClfrId. The value
zero is used to indicate that the agent can configure no more entries can be configured by the agent. entries.
The table also has a columnar Status attribute with RowStatus syntax
[6].

If

Generally, 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 row, using either
createAndGo or createAndWait) and if the agent has sufficient
resources and has no other conceptual row with the same indices, createAndWait, the agent will create the row and return
success. If the agent has insufficient resources or such a row is already existent
exists, then it returns 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 a second manager had got in between the
first manager's read of the NextFree value and the first manager's row-creation row-
creation attempt. The use of RowStatus is covered in more detail in [6].

6.

5.  Extending this MIB

With the structures of this MIB divided into data path linkage tables
and parameterization tables, and with the use of RowPointer, new data
path linkage and parameterization tables can be defined in other MIB
modules, and used with tables defined in this MIB.  This MIB does not

limit on the type of entries its RowPointer attributes can point to,
hence new functional data path elements can be defined in other MIBs and
integrated with functional data path elements of this MIB.  For example,
new Action functional data path element can be defined for Traffic
Engineering and be integrated with Diffserv Differentiated Services functional
data path elements, possibly used within the same data path sharing the
same classifiers and meters.

It is more likely that new parameterization tables will be created in
other MIBs as new methods or proprietary methods get deployed for
existing diffserv Differentiated Services functional data path elements.  For
example, different kinds of filters can be defined by using new filter
parameterization tables.  New scheduling methods can be deployed by
defining new scheduling method OIDs and new scheduling parameter tables.

Notice both new data path linkage tables and parameterization tables can
be added without needing to change this MIB document or affect existing
tables and their usage.

7.

6.  MIB Definition

DIFFSERV-DSCP-TC DEFINITIONS ::= BEGIN

    IMPORTS
    Integer32, MODULE-IDENTITY, mib-2
         FROM SNMPv2-SMI
    TEXTUAL-CONVENTION
         FROM SNMPv2-TC;

diffServDSCPTC MODULE-IDENTITY
    LAST-UPDATED "200101080000Z" "0101080000Z"
    ORGANIZATION "IETF Diffserv Differentiated Services WG"
    CONTACT-INFO
       "       Fred Baker
               Cisco Systems
               519 Lado Drive
               Santa Barbara, CA 93111, USA
               E-mail: fred@cisco.com

               Kwok Ho Chan
               Nortel Networks
               600 Technology Park Drive
               Billerica, MA 01821, USA
               E-mail: khchan@nortelnetworks.com

               Andrew Smith
               Allegro Networks
               6399 San Ignacio Ave
               San Jose, CA 95119, USA
               E-mail: andrew@allegronetworks.com" andrew@allegronetworks.com

                 Differentiated Services Working Group:
                 diffserv@ietf.org"
    DESCRIPTION
       "The Textual Conventions defined in this module should be used
       whenever the Diffserv a Differentiated Services Code Point is used in a MIB."
    REVISION "200101080000Z" "0106030000Z"
    DESCRIPTION
       "Initial version, published as RFC xxxx."
    ::= { mib-2 12344 }  -- to be assigned by IANA

Dscp ::= TEXTUAL-CONVENTION
    DISPLAY-HINT "d"
    STATUS   current
    DESCRIPTION
       "The IP header Diffserv
       "A Differentiated Services Code-Point that may be used for
       discriminating or
       marking a traffic stream."
    REFERENCE
        "RFC 2474, RFC 2780"
    SYNTAX   Integer32 (0..63)

DscpOrAny ::= TEXTUAL-CONVENTION
    DISPLAY-HINT "d"
    STATUS   current
    DESCRIPTION
       "The IP header Diffserv Differentiated Services Code-Point that may be
       used for discriminating or marking a among traffic stream. streams. The value -1 is
       used to indicate a wild card i.e. any value."
    REFERENCE
        "RFC 2474, RFC 2780"
    SYNTAX   Integer32 (-1 | 0..63)
END

DIFFSERV-MIB DEFINITIONS ::= BEGIN

    IMPORTS
    Unsigned32, Counter32, Counter64,
    MODULE-IDENTITY, OBJECT-TYPE, OBJECT-IDENTITY,
    zeroDotZero, mib-2
         FROM SNMPv2-SMI
    TEXTUAL-CONVENTION, RowStatus, RowPointer, TimeStamp
         FROM SNMPv2-TC
    MODULE-COMPLIANCE, OBJECT-GROUP
         FROM SNMPv2-CONF
    ifIndex
        FROM IF-MIB
    InetAddressType, InetAddress, InetAddressPrefixLength,
    InetPortNumber
        FROM INET-ADDRESS-MIB
    BurstSize
        FROM INTEGRATED-SERVICES-MIB
    Dscp, DscpOrAny
        FROM DIFFSERV-DSCP-TC;

diffServMib MODULE-IDENTITY
    LAST-UPDATED "200102210000Z" "0102210000Z"
    ORGANIZATION "IETF Diffserv Differentiated Services WG"
    CONTACT-INFO
       "       Fred Baker
               Cisco Systems
               519 Lado Drive
               Santa Barbara, CA 93111, USA
               E-mail: fred@cisco.com

               Kwok Ho Chan
               Nortel Networks
               600 Technology Park Drive
               Billerica, MA 01821, USA
               E-mail: khchan@nortelnetworks.com

               Andrew Smith
               Allegro Networks
               6399 San Ignacio Ave
               San Jose, CA 95119, USA
               E-mail: andrew@allegronetworks.com" andrew@allegronetworks.com

               Differentiated Services Working Group:
               diffserv@ietf.org"
    DESCRIPTION
       "This MIB defines the objects necessary to manage a device that
       uses the Differentiated Services Architecture described in RFC
       2475 and the Informal Management
       2475. The Conceptual Model for Diffserv Routers in
       draft-ietf-diffserv-model-06.txt." of a Differentiated Services Router
       provides supporting information on how such a router is modeled."
    REVISION "200103020000Z" "0106030000Z"
    DESCRIPTION
       "Initial version, published as RFC xxxx."
    ::= { mib-2 12345 1 }  -- anybody who uses this unassigned
                         -- number deserves the wrath of IANA

diffServMIBObjects     OBJECT IDENTIFIER ::= { diffServMib 1 }
diffServMIBConformance OBJECT IDENTIFIER ::= { diffServMib 2 }

-- These textual conventions have no effect on either the syntax
-- nor or the semantics of any managed object.  Objects defined
-- using
-- this convention are always encoded by means of the
-- rules that
-- define their primitive type.

IfDirection ::= TEXTUAL-CONVENTION
    STATUS current
    DESCRIPTION
       "Specifies
       "IfDirection specifies a direction of data travel on an
       interface. 'inbound' traffic is operated on during reception from
       the interface, while 'outbound' traffic is operated on prior to
       transmission on the interface."
    SYNTAX  INTEGER {
                inbound(1),     -- ingress interface
                outbound(2)     -- egress interface
}

--
-- Data Path
--

diffServDataPath       OBJECT IDENTIFIER ::= { diffServMIBObjects 1 }

--
-- Data Path Table
--
-- The Data Path Table enumerates the Differentiated Services
-- Functional Data Paths within this device.  Each entry in this table
-- table is indexed by ifIndex and ifDirection.  Each entry provides
-- the first diffserv functional data path element Differentiated Services Functional Data Path Element to
-- process data
-- flow for each flowing along specific data path.  This table should
-- have at most
-- two entries for each DiffServ capable interface capable of Differentiated
-- Services processing on this device;
-- device: ingress and egress.

-- Note that Differentiated Services Functional Data Path Elements
-- Notice all diffserv functional data path elements linked together
-- using their individual next pointers and anchored
-- by an entry
-- of the diffServDataPathTable must belong to the same data path.
-- The use of next pointer to point to diffserv constitute a functional data path
-- element of a different data path is not allowed. path.
--

diffServDataPathTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServDataPathEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The data path table defines contains RowPointers indicating the data paths in this device. Each
       data path is defined by start of
       the interface and traffic direction. The
       first diffserv functional data path element to handle traffic for each interface and traffic direction
       in this device. These may merge, or be separated into parallel
       data path is defined paths by a RowPointer, diffServDataPathStart,
       in the entries of this table." meters or classifiers."
    ::= { diffServDataPath 1 }

diffServDataPathEntry OBJECT-TYPE
    SYNTAX       DiffServDataPathEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the data path table describes indicates the start of a single diffserv data
       path
       Differentiated Services Functional Data Path 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
       "IfDirection specifies whether the direction for which this data reception or transmission path entry applies
       on
       for this interface." interface is in view."
    ::= { diffServDataPathEntry 1 }

diffServDataPathStart OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This selects the first diffserv functional data path Differentiated Services Functional Data
       Path element to handle traffic for this data path. This
       RowPointer should point to an instance of one of:
         diffServClfrEntry
         diffServClfrElementEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value of zeroDotZero in this attribute indicates that no further
       Diffserv
       Differentiated Services treatment is performed on traffic of this
       data path. The
       use of zeroDotZero is the normal usage for A pointer with the last value zeroDotZero normally
       terminates a functional data path element of the current data path.

       If the row pointed to does not exist, the treatment is as if this
       attribute contains a value of zeroDotZero."
    ::= { 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 writable variable may be modified
       whether the row is active or notInService."
    ::= { diffServDataPathEntry 3 }

--
-- Classifiers
--

diffServClassifier     OBJECT IDENTIFIER ::= { diffServMIBObjects 2 }

--
-- Classifier Table
--
--
--The Classifier Table allows multiple classifier elements, of same or
--or different
-- types, to be used together.
-- A classifier must completely classify
--classify all packets presented to it,
-- this it. This means that all traffic handled by
--presented to a classifier must match
-- at least one classifier element within
--within the classifier,
-- with the classifier element parameters specified
--specified by a filter.
--
-- If
--If there is ambiguity between classifier elements of different
-- classifier, elements of different
--classifier, classifier linkage order indicates their precedence;
--the first classifier in the link is applied to the traffic first.
--
--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 precedence is indicated by subsequent
--downstream Differentiated Services Functional Data Path element
--when the order classification pattern is satisfied. Each entry in the classifiers
-- are linked,
--classifier element table describes one branch of the first fan-out
--characteristic of a classifier indicated in the link [MODEL] section 4.1.
--A classifier is applied to the
-- traffic first.
-- composed of one or more classifier elements.

diffServClfrNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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 operation will fail if the value has,
       but an instance has been created or is in the meantime, been
       used to create another row process of being
       created, that is currently valid." operation will fail."
    ::= { diffServClassifier 1 }

diffServClfrTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServClfrEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This table enumerates all the diffserv classifier functional
       data path elements of this device.  The actual classification
       definitions are defined in diffServClfrElementTable entries
       belonging to each classifier."
    REFERENCE
        "[MODEL] section 4.1"
    ::= { diffServClassifier 2 }

diffServClfrEntry OBJECT-TYPE
    SYNTAX       DiffServClfrEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the classifier table describes a single classifier.
       All classifier elements belonging to the same classifier uses the
       classifier's diffServClfrId in their diffServClfrElementClfrId
       attribute."
    INDEX { diffServClfrId }
    ::= { diffServClfrTable 1 }

DiffServClfrEntry ::= SEQUENCE  {
    diffServClfrId              Unsigned32,
    diffServClfrDataPathStart   RowPointer,
    diffServClfrStatus          RowStatus
}

diffServClfrId OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the classifier entries. The set of such
       identifiers spans the whole agent. Managers should obtain new
       values for row creation in this table by reading
       diffServClfrNextFree."
    ::= { diffServClfrEntry 1 }

diffServClfrStatus

diffServClfrDataPathStart OBJECT-TYPE
    SYNTAX       RowStatus       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The RowStatus variable controls
       "This selects the activation, deactivation, or
       deletion first Differentiated Services Functional Data
       Path element to handle traffic for this classifier. This
       RowPointer should point to an instance of a classifier. Any writable variable may be modified
       whether the row
       diffServClfrElementEntry. It is active or notInService."
    ::= { diffServClfrEntry 2 }

--
-- Classifier Element Table
--
-- Entries primarily useful in indicating
       the first classifier element table serves as
-- in a classifier other than the anchor one
       pointed to by diffServClfrDataPathStart, although it may be used
       for each classification pattern, defined
-- those classifiers as well.

       A value of zeroDotZero in filter table entries.  Each classifier element
-- table entry also specifies this attribute indicates that no
       Differentiated Services treatment is performed on traffic of this
       data path. A pointer with the subsequent downstream
-- diffserv value zeroDotZero normally
       terminates a functional data path element when path.

       If the
-- classification pattern is satisfied.

-- Each entry in row pointed to does not exist, the classifier element table describes
-- one branch treatment is as if this
       attribute contains a value of zeroDotZero."
    ::= { diffServClfrEntry 2 }

diffServClfrStatus OBJECT-TYPE
    SYNTAX       RowStatus
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The RowStatus variable controls the fan-out characteristic activation, deactivation, or
       deletion of a classifier
-- indicated in [MODEL] section 4.1.  A classifier classifier. Any writable variable may be modified
       whether the row is made up
-- of one active or more classifier elements. notInService."
    ::= { diffServClfrEntry 3 }

-- Classifier Element Table
--
diffServClfrElementNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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, but an instance has been created or is in the  meantime, been  used  to
       create  another row
       process of being created, that is currently valid." operation will fail."
    ::= { diffServClassifier 3 }

diffServClfrElementTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServClfrElementEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The classifier element table enumerates the relationship between
       classification patterns and subsequent downstream diffserv
       functional data path Differentiated
       Services Functional Data Path elements. Classification parameters are
       defined by entries of filter tables pointed
       diffServClfrElementSpecific points to by
       diffServClfrElementSpecific. There can be a filter that specifies the
       classification parameters. A classifier may use filter tables of
       different types, and they can be inter-mixed and used within a
       classifier. An types together.

       One example of a filter table defined in this MIB is
       diffServSixTupleClfrTable, for IP Multi-Field Classifiers (MFCs).
       Such an entry might identify anything from a single micro-flow
       (an identifiable sub-session packet stream directed from one
       sending transport to the receiving transport or transports), or
       aggregates of those such as the traffic from a host, traffic for
       an application, or traffic between two hosts using an application
       and a given DSCP. The standard Behavior Aggregate used in the
       Differentiated Services Architecture is encoded as a degenerate
       case of such an aggregate - the traffic using a particular DSCP
       value.

       Filter tables for other filter types may be defined elsewhere."
    REFERENCE
        "[MODEL] section 4.1"
    ::= { diffServClassifier 4 }

diffServClfrElementEntry OBJECT-TYPE
    SYNTAX       DiffServClfrElementEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the classifier element table describes a single
       element of the classifier."
    INDEX { diffServClfrElementClfrId, diffServClfrElementId }
    ::= { diffServClfrElementTable 1 }

DiffServClfrElementEntry ::= SEQUENCE  {
    diffServClfrElementId          Unsigned32,
    diffServClfrElementClfrId      Unsigned32,      INTEGER,
    diffServClfrElementId          INTEGER,
    diffServClfrElementPrecedence  Unsigned32,
    diffServClfrElementNext        RowPointer,
    diffServClfrElementSpecific    RowPointer,
    diffServClfrElementStatus      RowStatus
}

diffServClfrElementId

diffServClfrElementClfrId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the Classifier Element classifier entries. The set of such
       identifiers spans the whole agent. Managers should obtain new values for
       row creation in this table by reading
       diffServClfrElementNextFree."
    ::= { diffServClfrElementEntry 1 }

diffServClfrElementClfrId OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "A diffServClfrNextFree.

       A classifier Id identifies which classifier this classifier
       element is a part of.  This needs to be of."
    ::= { diffServClfrElementEntry 1 }

diffServClfrElementId OBJECT-TYPE
    SYNTAX       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the value Classifier Element entries. The set
       of
       diffServClfrId attribute such identifiers spans the whole agent. Managers obtain new
       values for an existing row creation in
       diffServClfrTable." this table by reading
       diffServClfrElementNextFree."
    ::= { diffServClfrElementEntry 2 }

diffServClfrElementPrecedence OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The relative order in which classifier elements are applied:
       higher numbers represent classifier element with higher
       precedence.  Classifier elements with the same order must be
       unambiguous i.e. they must define non-overlapping patterns, and
       are considered to be applied simultaneously to the traffic
       stream. Clas- sifier Classifier elements with different order may overlap in
       their filters:  the classifier element with the highest order
       that matches is taken.

       On a given interface, there must be a complete  clas- sifier classifier in
       place at all times in the ingress direction.  This means
       that there will always be one or
       more filters that must match every any possible pat- tern  that  could be presented in an incoming
       packet. pattern. There is no such
       requirement in the egress direction."
    DEFVAL { 0 }
    ::= { diffServClfrElementEntry 3 }

diffServClfrElementNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This attribute provides one branch of the fan-out functionality
       of a classifier described in [MODEL] section 4.1.

       This selects the next diffserv functional data path Differentiated Services Functional Data
       Path element to handle traffic for this data path. This
       RowPointer should point to an instance of one of:
         diffServClfrEntry
         diffServClfrElementEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value of zeroDotZero in this attribute indicates no further
       Diffserv
       Differentiated Services treatment is performed on traffic of this
       data path. The use of zeroDotZero is the normal usage for the
       last functional data path element of the current data path.

       If the row pointed to does not exist, the treatment is as if this
       attribute contains a value of zeroDotZero."

    ::= { diffServClfrElementEntry 4 }

diffServClfrElementSpecific OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "A pointer to a valid entry in another table, filter table, that
       describes the applicable classification parameters, e.g. an entry
       in diffServSixTupleClfrTable.

       If the row pointed to does not exist, the classifier element is
       ignored.

       The value zeroDotZero is interpreted to match anything not
       matched by another classifier element - only one such entry may
       exist for each classifier."
    DEFVAL { zeroDotZero }
    ::= { diffServClfrElementEntry 5 }

diffServClfrElementStatus OBJECT-TYPE
    SYNTAX       RowStatus
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The RowStatus variable controls the activation, deactivation, or
       deletion of a classifier element. Any writ- able variable may be
       modified whether the row is active or notInService."
    ::= { diffServClfrElementEntry 6 }

--
-- IP Six-Tuple Classification Table
--
-- Classification
--Classification based on 6 six different fields in the IP
-- header. This is intended to be IP-version-independent.
-- Filters, entries in this table,
--Functional Data Paths may be shared, pointed to,
-- share definitions by multiple diffServClfrElementEntry, of same or different
-- data paths in using the same system. entry.
--

diffServSixTupleClfrNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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, but an instance has
       been created or is in the meantime, been used
       to create another row process of being created, that is currently valid." operation will fail."
    ::= { diffServClassifier 5 }

diffServSixTupleClfrTable OBJECT-TYPE
    SYNTAX   SEQUENCE OF DiffServSixTupleClfrEntry
    MAX-ACCESS   not-accessible
    STATUS   current
    DESCRIPTION
       "A table of IP Six-Tuple Classifier filter entries that a system
       may use to identify IP traffic."
    REFERENCE
        "[MODEL] section 4.2.2"
    ::= { diffServClassifier 6 }

diffServSixTupleClfrEntry OBJECT-TYPE
    SYNTAX       DiffServSixTupleClfrEntry
    MAX-ACCESS   not-accessible
    STATUS   current
    DESCRIPTION
       "An IP Six-Tuple Classifier entry describes a single filter."
    INDEX { diffServSixTupleClfrId }
    ::= { diffServSixTupleClfrTable 1 }

DiffServSixTupleClfrEntry ::= SEQUENCE {
    diffServSixTupleClfrId           Unsigned32,           INTEGER,
    diffServSixTupleClfrDstAddrType  InetAddressType,
    diffServSixTupleClfrDstPrefixLength InetAddressPrefixLength,
    diffServSixTupleClfrDstAddr      InetAddress,
    diffServSixTupleClfrDstPrefixLength InetAddressPrefixLength,
    diffServSixTupleClfrSrcAddrType  InetAddressType,
    diffServSixTupleClfrSrcPrefixLength InetAddressPrefixLength,
    diffServSixTupleClfrSrcAddr      InetAddress,
    diffServSixTupleClfrSrcPrefixLength InetAddressPrefixLength,
    diffServSixTupleClfrDscp         DscpOrAny,
    diffServSixTupleClfrProtocol     Unsigned32,
    diffServSixTupleClfrDstL4PortMin InetPortNumber,
    diffServSixTupleClfrDstL4PortMax InetPortNumber,
    diffServSixTupleClfrSrcL4PortMin InetPortNumber,
    diffServSixTupleClfrSrcL4PortMax InetPortNumber,
    diffServSixTupleClfrStatus       RowStatus
}

diffServSixTupleClfrId OBJECT-TYPE
    SYNTAX         Unsigned32         INTEGER (1..2147483647)
    MAX-ACCESS     not-accessible
    STATUS     current
    DESCRIPTION
       "An index that enumerates the Six Tuple Classifier filter
       entries.  The set of such identifiers spans the whole agent.
       Managers should obtain new values for row creation in this table by
       reading diffServSixTupleClfrNextFree."

    ::= { diffServSixTupleClfrEntry 1 }

diffServSixTupleClfrDstAddrType OBJECT-TYPE
    SYNTAX         InetAddressType
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The type of IP destination address used by this classifier
       entry."
    ::= { diffServSixTupleClfrEntry 2 }

diffServSixTupleClfrDstAddr OBJECT-TYPE
    SYNTAX         InetAddress
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The IP address to match against the packet's destination IP
       address. diffServSixTupleClfrDstPrefixLength indicates the number
       of bits that are relevant."
    ::= { diffServSixTupleClfrEntry 3 }

diffServSixTupleClfrDstPrefixLength OBJECT-TYPE
    SYNTAX         InetAddressPrefixLength
    UNITS          "bits"
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The length of the CIDR Prefix carried in
       diffServSixTupleClfrDstAddr. In IPv4 addresses, a length of 0
       indicates a match of any address; a length of 32 indicates a
       match of a single host address, and a length between 0 and 32
       indicates the use of a CIDR Prefix. IPv6 is similar, except that
       prefix lengths range from 0..128."
    DEFVAL         { 0 }
    ::= { diffServSixTupleClfrEntry 3 4 }

diffServSixTupleClfrSrcAddrType OBJECT-TYPE
    SYNTAX         InetAddressType
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The type of IP source address used by this classifier entry."
    ::= { diffServSixTupleClfrEntry 4 5 }

diffServSixTupleClfrDstAddr

diffServSixTupleClfrSrcAddr OBJECT-TYPE
    SYNTAX         InetAddress
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The IP address to match against the packet's destination source IP address.  diffServSixTupleClfrDstPrefixLength
       diffServSixTupleClfrSrcPrefixLength indicates the number of bits
       that are relevant."
    ::= { diffServSixTupleClfrEntry 5 6 }

diffServSixTupleClfrSrcPrefixLength OBJECT-TYPE
    SYNTAX         InetAddressPrefixLength
    UNITS          "bits"
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The length of the CIDR Prefix carried in
       diffServSixTupleClfrSrcAddr. In IPv4 addresses, a length of 0
       indicates a match of any address; a length of 32 indicates a
       match of a single host address, and a length between 0 and 32
       indicates the use of a CIDR Prefix. IPv6 is similar, except that
       prefix lengths range from 0..128."
    DEFVAL         { 0 }
    ::= { diffServSixTupleClfrEntry 6 }

diffServSixTupleClfrSrcAddr OBJECT-TYPE
    SYNTAX         InetAddress
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The IP address to match against the packet's source IP address.
       diffServSixTupleClfrSrcPrefixLength indicates the number of bits
       that are relevant."
    ::= { diffServSixTupleClfrEntry 7 }

diffServSixTupleClfrDscp OBJECT-TYPE
    SYNTAX         DscpOrAny
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The value that the DSCP in the packet must have to match this
       entry. A value of -1 indicates that a specific DSCP value has not
       been defined and thus all DSCP values are considered a match."
    DEFVAL         { -1 }
    ::= { diffServSixTupleClfrEntry 8 }

diffServSixTupleClfrProtocol OBJECT-TYPE
    SYNTAX         Unsigned32 (0..255)
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The IP protocol to match against the IPv4 protocol number or the
       IPv6 Next-Header Next- Header number in the packet. A value of 255 means
       match all.  Note the protocol number of 255 is reserved by IANA,
       and Next-Header number of 0 is used in IPv6."
    DEFVAL         { 255 }
    ::= { diffServSixTupleClfrEntry 9 }

diffServSixTupleClfrDstL4PortMin OBJECT-TYPE
    SYNTAX         InetPortNumber
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The minimum value that the layer-4 destination port number in
       the packet must have in order to match this classifier entry."
    DEFVAL         { 0 }
    ::= { diffServSixTupleClfrEntry 10 }

diffServSixTupleClfrDstL4PortMax OBJECT-TYPE
    SYNTAX         InetPortNumber
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The maximum value that the layer-4 destination port number in
       the packet must have in order to match this classifier entry.
       This value must be equal to or greater than the value specified
       for this entry in diffServSixTupleClfrDstL4PortMin."
    DEFVAL         { 65535 }
    ::= { diffServSixTupleClfrEntry 11 }

diffServSixTupleClfrSrcL4PortMin OBJECT-TYPE
    SYNTAX         InetPortNumber
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The minimum value that the layer-4 source port number in the
       packet must have in order to match this classifier entry."
    DEFVAL         { 0 }
    ::= { diffServSixTupleClfrEntry 12 }

diffServSixTupleClfrSrcL4PortMax OBJECT-TYPE
    SYNTAX         InetPortNumber
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The maximum value that the layer-4 source port number in the
       packet must have in oder to match this classifier entry. This
       value must be equal to or greater than the value specified for
       this entry in diffServSixTupleClfrSrcL4PortMin."
    DEFVAL         { 65535 }
    ::= { diffServSixTupleClfrEntry 13 }

diffServSixTupleClfrStatus OBJECT-TYPE
    SYNTAX      RowStatus
    MAX-ACCESS  read-create
    STATUS      current
    DESCRIPTION
       "The RowStatus variable controls the activation, deactivation, or
       deletion of a classifier. Any writable variable may be modified
       whether the row is active or notInService."
    ::= { diffServSixTupleClfrEntry 14 }

--
-- 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 modeled using Token Bucket parameters. Meter, which are but one type of
-- specification. Other metering parameter sets can be defined and used
-- when necessary. sets can be defined in other MIBs.
--
-- Multiple meter elements may be logically cascaded using
-- their
-- diffServMeterSucceedNext and diffServMeterFailNext
-- pointers if required.
-- 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 meters (RFC 2697) can be parameterized specified using
-- two sets of a single diffServMeterEntry
-- and diffServTBParamEntry.
-- With the first set parameterizing It specifies the Committed Burst Size
-- token-bucket, second set parameterizing the Excess Burst Size
-- token-bucket.  With both set's diffServTBParamRate parameters
-- being used to reflect reflects the Committed Information Rate value. Rate.
--
-- Conforming to RFC 2698, trTCM meters (RFC 2698) can be parameterized specified using
-- a two sets of diffServMeterEntry and diffServTBParamEntry. diffServMeterEntries
-- With and diffServTBParamEntries. It specifies the first set parameterizing Committed Burst Size in the Peak Information Rate
-- first token-bucket, and Peak the Excess Burst Size token-bucket, second set parameterizing in the second.
-- diffServTBParamRate in the first token bucket reflects the Committed Information Rate and Committed Burst Size
-- token-bucket. Information Rate.
--
-- Conforming to RFC 2859, tswTCM meters (RFC 2859) can be parameterized specified using
-- a two sets of diffServMeterEntry and diffServTBParamEntry. diffServMeterEntries
-- With the first set parameterizing and diffServTBParamEntries. It specifies the Committed Target Rate, Rate in the
-- second set parametering first token-bucket, and the Peak Excess Target Rate. Rate in the second.
-- With both set's diffServTBParamInterval being used to
-- reflect in each token bucket reflects the Average Interval as specified by RFC 2859.
-- Interval.

diffServMeterNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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 operation will fail if the value has,
       but an instance has been created or is in the meantime, been
       used to create another row process of being
       created, that is currently valid." operation will fail."
    ::= { diffServMeter 1 }

diffServMeterTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServMeterEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This table enumerates specific meters that a system may use to
       police, or shape, a stream of traffic. The traffic stream to be
       metered is determined by the diffserv functional data path Differentiated Services Functional
       Data Path element(s) upstream of 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 table entry referenced
       by diffServMeterSpecific."
           REFERENCE
               "[MODEL] section 5.1"
    ::= { diffServMeter 2 }

diffServMeterEntry OBJECT-TYPE
    SYNTAX       DiffServMeterEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the meter table describes a single conformance level
       of a meter."
    INDEX { diffServMeterId }
    ::= { diffServMeterTable 1 }

DiffServMeterEntry ::= SEQUENCE  {
    diffServMeterId                Unsigned32,                INTEGER,
    diffServMeterSucceedNext       RowPointer,
    diffServMeterFailNext          RowPointer,
    diffServMeterSpecific          RowPointer,
    diffServMeterStatus            RowStatus
}

diffServMeterId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the Meter entries. The set of such
       identifiers spans the whole agent. Managers should obtain new values for
       row creation in this table by reading diffServMeterNextFree."
    ::= { diffServMeterEntry 1 }

diffServMeterSucceedNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "If the traffic does conform, this selects the next diffserv
       functional data path
       Differentiated Services Functional Data Path element to handle
       traffic for this data path. This RowPointer should point to an
       instance of one of:
         diffServClfrEntry
         diffServClfrElementEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value of zeroDotZero in this attribute indicates that no
       further
       Diffserv Differentiated Services treatment is performed on traffic
       of this data path. The use of zeroDotZero is the normal usage for
       the last functional data path element of the current data path.

       If the row pointed to does not exist, the treatment is as if this
       attribute contains a value of zeroDotZero."
    DEFVAL      { zeroDotZero }
    ::= { diffServMeterEntry 2 }

diffServMeterFailNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "If the traffic does not conform, this selects the next diffserv
       functional data path
       Differentiated Services Functional Data Path element to handle
       traffic for this data path. This RowPointer should point to an
       instance of one of:
         diffServClfrEntry
         diffServClfrElementEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value of zeroDotZero in this attribute indicates no further
       Diffserv
       Differentiated Services treatment is performed on traffic of this
       data path. The use of zeroDotZero is the normal usage for the
       last functional data path element of the current data path.

       If the row pointed to does not exist, the treatment is as if this
       attribute contains a value of zeroDotZero."
    DEFVAL      { zeroDotZero }
    ::= { diffServMeterEntry 3 }

diffServMeterSpecific OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This indicates the behavior of the meter by pointing to an entry
       containing detailed parameters. Note that entries in that
       specific table must be managed explicitly.

       For example, diffServMeterSpecific may point to an entry in
       diffServTBParamTable, which contains an instance of a single set
       of Token Bucket parameters."
    ::= { diffServMeterEntry 4 }

diffServMeterStatus OBJECT-TYPE
    SYNTAX       RowStatus
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The RowStatus variable controls the activation, deactivation, or
       deletion of a meter. Any writable variable may be modified
       whether the row is active or notInService."
    ::= { diffServMeterEntry 5 }

--
-- Token Bucket Parameter Table
--

diffServTBParam        OBJECT IDENTIFIER ::= { diffServMIBObjects 4 }

-- Each entry in the Token Bucket Parameter Table parameterize
-- a single
-- token bucket.  Multiple token buckets can be
-- used together to
-- parameterize multiple levels of
-- conformance.
--
-- Entries of this table are used for both policing, as token
-- bucket parameters, and shaping, as leaky bucket parameters.
--
-- Note that an entry in the Token Bucket Parameter Table can
-- be shared, pointed to, shared
-- by multiple diffServMeterTable
-- and diffServSchedulerTable entries.
--

diffServTBParamNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a value when read that is currently unused
       for a diffServTBParamId instance. If a configuring system
       attempts to create a new row in the diffServTBParamTable using
       this value, that operation will fail if the value has, but an instance has been created or is in the
       meantime, been used to create another row process
       of being created, that is currently
       valid." operation will fail."
    ::= { diffServTBParam 1 }

diffServTBParamTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServTBParamEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This table enumerates a single set of token bucket meter
       parameters that a system may use to police or shape a stream of
       traffic. Such meters are modeled here as having a single rate and
       a single burst size. Multiple entries are used when multiple
       rates/burst sizes are needed."
    REFERENCE
        "[MODEL] section 5.1"
    ::= { diffServTBParam 2 }

diffServTBParamEntry OBJECT-TYPE
    SYNTAX       DiffServTBParamEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry that describes a single set of token bucket
       parameters."
    INDEX { diffServTBParamId }
    ::= { diffServTBParamTable 1 }

DiffServTBParamEntry ::= SEQUENCE  {
    diffServTBParamId              Unsigned32,              INTEGER,
    diffServTBParamType            OBJECT IDENTIFIER,
    diffServTBParamRate            Unsigned32,
    diffServTBParamBurstSize       BurstSize,
    diffServTBParamInterval        Unsigned32,
    diffServTBParamStatus          RowStatus
}

diffServTBParamId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the TBParam Token Bucket Parameter entries. The
       set of such identifiers spans the whole agent. Managers should obtain
       new values for row creation in this table by reading
       diffServTBParamNextFree."
    ::= { diffServTBParamEntry 1 }

diffServTBParamType OBJECT-TYPE
    SYNTAX       OBJECT IDENTIFIER
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The Metering/Shaping algorithm associated with the Token/Leaky Token Bucket
       parameters.

       { 0 0 }

       zeroDotZero indicates this is unknown.

       Standard values for generic algorithms:
       diffServTBParamSimpleTokenBucket, diffServTBParamAvgRate,
       diffServTBParamSrTCMBlind, diffServTBParamSrTCMAware,
       diffServTBParamTrTCMBlind, diffServTBParamTrTCMAware, and
       diffServTBParamTswTCM are specified in this MIB as OBJECT-IDENTITYS; OBJECT-
       IDENTITYS; additional values may be further specified in other
       MIBs."
    REFERENCE
        "[MODEL] section 5"
    ::= { diffServTBParamEntry 2 }

diffServTBParamRate OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "kilobits per second"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The token-bucket rate, in kilobits per second (kbps). This
       attribute is used for:
       1. CIR in RFC 2697 for srTCM
       2. PIR and CIR in RFC 2698 for trTCM
       3. CTR and PTR in RFC 2859 for TSWTCM
       4. AverageRate used in [MODEL] section 5."
    ::= { diffServTBParamEntry 3 }

diffServTBParamBurstSize OBJECT-TYPE
    SYNTAX       BurstSize
    UNITS        "Bytes"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The maximum number of bytes in a single transmission burst. This
       attribute is used for:
       1. CBS and EBS in RFC 2697 for srTCM
       2. CBS and PBS in RFC 2698 for trTCM
       3. Burst Size used in [MODEL] section 5."
    ::= { diffServTBParamEntry 4 }

diffServTBParamInterval 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."
    ::= { diffServTBParamEntry 5 }

diffServTBParamStatus OBJECT-TYPE
    SYNTAX       RowStatus
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The RowStatus variable controls the activation, deactivation, or
       deletion of a meter. Any writable variable may be modified
       whether the row is active or notInService."
    ::= { diffServTBParamEntry 6 }

diffServTBParamSimpleTokenBucket OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "Value of
       "The value tokenBucket(2) indicates the use of Two Parameter
       Token Bucket Meter as described in [MODEL] section 5.2.3."
    REFERENCE
        "[MODEL] sections 5 and 7.1.2"
    ::= { diffServTBParam 3 }

diffServTBParamAvgRate OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "Value of
       "The value avgRate(3) indicates the use of Average Rate Meter as
       described in [MODEL] section 5.2.1."
    REFERENCE
        "[MODEL] sections 5 and 7.1.2"
    ::= { diffServTBParam 4 }

diffServTBParamSrTCMBlind OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "Value of
       "The values srTCMBlind(4) and srTCMAware(5) indicates indicate the use of
       Single Rate Three Color Marker Metering as defined by RFC 2697,
       with
       in either the `Color Blind' and `Color Aware' mode as described
       by the RFC."
    REFERENCE
        "[MODEL] sections 5 and 7.1.2"
    ::= { diffServTBParam 5 }

diffServTBParamSrTCMAware OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "Value of
       "The values srTCMBlind(4) and srTCMAware(5) indicates indicate the use of
       Single Rate Three Color Marker Metering as defined by RFC 2697,
       with
       in either the `Color Blind' and `Color Aware' mode as described
       by the RFC."
    REFERENCE
        "[MODEL] sections 5 and 7.1.2"
    ::= { diffServTBParam 6 }

diffServTBParamTrTCMBlind OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "Value of
       "The values trTCMBlind(6) and trTCMAware(7) indicates indicate the use of
       Two Rate Three Color Marker Metering as defined by RFC 2698, with in
       either the `Color Blind' and `Color Aware' mode as described by
       the RFC."
    REFERENCE
        "[MODEL] sections 5 and 7.1.2"
    ::= { diffServTBParam 7 }

diffServTBParamTrTCMAware OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "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."
    REFERENCE
        "[MODEL] sections 5 and 7.1.2"
    ::= { diffServTBParam 8 }

diffServTBParamTswTCM OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "Value of
       "The value tswTCM(8) indicates the use of Time Sliding Window
       Three Color Marker Metering as defined by RFC 2859."
    REFERENCE
        "[MODEL] sections 5 and 7.1.2"
    ::= { diffServTBParam 9 }

--
-- Actions
--

diffServAction         OBJECT IDENTIFIER ::= { diffServMIBObjects 5 }

--
-- The Action Table allows enumeration of the different
-- types of actions to be applied to a traffic flow.
--

diffServActionNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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 operation will fail if the value has,
       but an instance has been created or is in the
       meantime, been used to create another row process of being
       created, that is currently
       valid." operation will fail."
    ::= { diffServAction 1 }

diffServActionTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServActionEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The Action Table enumerates actions that can be performed to a
       stream of traffic. Multiple actions can be concatenated. For
       example, after marking a stream of traffic exiting from a meter,
       a device can then perform meter may be counted, marked, and
       potentially dropped before entering a count action of the conforming or
       non-conforming traffic. queue.

       Specific actions are indicated by diffServActionSpecific which
       points to an entry of a specific action type parameterizing the
       action in detail."
    REFERENCE
        "[MODEL] section 6."
    ::= { diffServAction 2 }

diffServActionEntry OBJECT-TYPE
    SYNTAX       DiffServActionEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "Each entry in the action table allows description of one
       specific action to be applied to traffic."
    INDEX { diffServActionId }
    ::= { diffServActionTable 1 }

DiffServActionEntry ::= SEQUENCE  {
    diffServActionId                Unsigned32,                INTEGER,
    diffServActionNext              RowPointer,
    diffServActionSpecific          RowPointer,
    diffServActionType              INTEGER,
    diffServActionStatus            RowStatus
}

diffServActionId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the Action entries. The set of such
       identifiers spans the whole agent. Managers should obtain new values for
       row creation in this table by reading diffServActionNextFree."
    ::= { diffServActionEntry 1 }

diffServActionNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This selects the next diffserv functional data path Differentiated Services Functional Data
       Path element to handle traffic for this data path. This
       RowPointer should point to an instance of one of:
         diffServClfrEntry
         diffServClfrElementEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value of zeroDotZero in this attribute indicates no further
       Diffserv
       Differentiated Services treatment is performed on traffic of this
       data path. The use of zeroDotZero is the normal usage for the
       last functional data path element of the current data path.

       If the row pointed to does not exist, the treatment is as if this
       attribute contains a value of zeroDotZero."
    DEFVAL      { zeroDotZero }
    ::= { diffServActionEntry 2 }

diffServActionSpecific OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "A pointer to an object instance providing additional information
       for the type of action indicated by this action table entry.

       For the standard actions defined by this MIB module, this should
       point to one of the following: a diffServDscpMarkActEntry, a
       diffServCountActEntry. For other actions, it may point to an
       object instance 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 information and will have a diffServActionSpecific
       value of zeroDotZero.  The use of other(1) is outside the scope
       of this definition, although the diffServActionSpecific pointer
       may be used in this case, to indicate other information."
    ::= { diffServActionEntry 4 }

diffServActionStatus OBJECT-TYPE
    SYNTAX       RowStatus
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The RowStatus variable controls the activation, deactivation or
       deletion of an action element. Any writable variable may be
       modified whether the row is active or notInService."
    ::= { diffServActionEntry 5 4 }

--
-- 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, shared by
-- multiple diffServActionTable entries, of same or different
-- data paths. diffServActionTable entries.
--

diffServDscpMarkActTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServDscpMarkActEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This table enumerates specific DSCPs used for marking or
       remarking the DSCP field of IP packets. The entries of this table
       may be referenced by a diffServActionSpecific attribute."
    REFERENCE
        "[MODEL] section 6.1"
    ::= { diffServAction 3 }

diffServDscpMarkActEntry OBJECT-TYPE
    SYNTAX       DiffServDscpMarkActEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the DSCP mark action table that describes a single
       DSCP used for marking."
    INDEX { diffServDscpMarkActDscp }
    ::= { diffServDscpMarkActTable 1 }

DiffServDscpMarkActEntry ::= SEQUENCE  {
    diffServDscpMarkActDscp          Dscp
}

diffServDscpMarkActDscp OBJECT-TYPE
    SYNTAX       Dscp
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The DSCP that this Action uses for marking/remarking traffic.
       Note that a will store into the DSCP value field of -1 is not permitted in this table. the
       subject. It is quite possible that the only packets subject to
       this Action are already marked with this DSCP. Note also that Diffserv
       Differentiated Services processing may result in packet remarking both being
       marked on both ingress to a network and on egress from it it, and it is quite possible
       that ingress and egress
       would can occur in the same router." router.

       Normally, index variables are not-accessible. However, in this
       case the OID of the entry serves as a OBJECT-IDENTITY indicating
       that traffic should be marked in a certain way, and specifying a
       second object seems redundant."
    ::= { diffServDscpMarkActEntry 1 }

--
-- Count Action Table
--
-- Due to the fact that Because the MIB structure allows multiple
-- cascading
-- diffServActionEntry be used to describe
-- multiple actions for a
-- data path, the counter became an
-- optional action type.  In normal
-- implementation, either a
-- data path either have has counters or it doesn't, it is not
-- an element the management entity can add or remove. does not,
-- as opposed to being configurable. The management entity can may choose
-- to read the counter or
-- not.  Hence it is recommended for implementation that
-- that have counters to always configure the count action as
-- the first
-- of multiple actions, for example before the
-- the absolute a drop action.
--

diffServCountActNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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, but an instance has been
       created or is in the meantime, been used
       to create another row process of being created, that is currently valid." operation will fail."
    ::= { diffServAction 4 }

diffServCountActTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServCountActEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This table contains counters for all the traffic passing through
       an action element."
    REFERENCE
        "[MODEL] section 6.4"
    ::= { diffServAction 5 }

diffServCountActEntry OBJECT-TYPE
    SYNTAX       DiffServCountActEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the count action table describes a single set of
       traffic counters."
    INDEX { diffServCountActId }
    ::= { diffServCountActTable 1 }

DiffServCountActEntry ::= SEQUENCE  {
    diffServCountActId           Unsigned32,           INTEGER,
    diffServCountActOctets       Counter32,
    diffServCountActHCOctets     Counter64,
    diffServCountActPkts         Counter32,
    diffServCountActHCPkts       Counter64,
    diffServCountActDiscontTime  TimeStamp,
    diffServCountActStatus       RowStatus
}

diffServCountActId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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
    SYNTAX       Counter32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of octets at the Action data path element. On high high-
       speed devices, this object implements the least significant 32
       bits of diffServCountActHCOctets.

       Discontinuities in the value of this counter can occur at re-
       initialization of the management system and at other times as
       indicated by the value of diffServCountActDiscontTime for this
       entry."
    ::= { diffServCountActEntry 2 }

diffServCountActHCOctets OBJECT-TYPE
    SYNTAX       Counter64
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of octets at the Action data path element. This
       object should be used on high speed high-speed interfaces.

       Discontinuities in the value of this counter can occur at re-
       initialization of the management system and at other times as
       indicated by the value of diffServCountActDiscontTime for this
       entry."
    ::= { diffServCountActEntry 3 }

diffServCountActPkts OBJECT-TYPE
    SYNTAX       Counter32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of packets at the Action data path element. On high high-
       speed devices, this object implements the least significant 32
       bits of diffServCountActHCPkts.

       Discontinuities in the value of this counter can occur at re-
       initialization of the management system and at other times as
       indicated by the value of diffServCountActDiscontTime for this
       entry."
    ::= { diffServCountActEntry 4 }

diffServCountActHCPkts OBJECT-TYPE
    SYNTAX       Counter64
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of packets at the Action data path element. This
       object should be used on high speed high-speed interfaces.

       Discontinuities in the value of this counter can occur at re-
       initialization of the management system and at other times as
       indicated by the value of diffServCountActDiscontTime for this
       entry."
    ::= { diffServCountActEntry 5 }

diffServCountActDiscontTime OBJECT-TYPE
    SYNTAX       TimeStamp
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The value of sysUpTime on the most recent occasion at which any
       one or more of this entry's counters suffered a discontinuity. If
       no such discontinuities have occurred since the last re-
       initialization of the local management subsystem, then this
       object contains a zero value."
    ::= { diffServCountActEntry 6 }

diffServCountActStatus 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."
    ::= { diffServCountActEntry 7 }

--
-- Algorithmic Drop Table
--

diffServAlgDrop        OBJECT IDENTIFIER ::= { diffServMIBObjects 6 }

diffServAlgDropNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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, but an instance has been created or is in the
       meantime, been used to create another row process
       of being created, that is currently
       valid." operation will fail."
    ::= { diffServAlgDrop 1 }

diffServAlgDropTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServAlgDropEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The algorithmic drop table contains entries describing an
       element that drops packets according to some algorithm."
    REFERENCE
        "[MODEL] section 7.1.3"
    ::= { diffServAlgDrop 2 }

diffServAlgDropEntry OBJECT-TYPE
    SYNTAX       DiffServAlgDropEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry describes a process that drops packets according to
       some algorithm. Further details of the algorithm type are to be
       found in diffServAlgDropType and with more detail parameter entry
       pointed to by diffServAlgDropSpecific when necessary."
    INDEX { diffServAlgDropId }
    ::= { diffServAlgDropTable 1 }

DiffServAlgDropEntry ::= SEQUENCE  {
    diffServAlgDropId               Unsigned32,               INTEGER,
    diffServAlgDropType             INTEGER,
    diffServAlgDropNext             RowPointer,
    diffServAlgDropQMeasure         RowPointer,
    diffServAlgDropQThreshold       Unsigned32,
    diffServAlgDropSpecific         RowPointer,
    diffServAlgDropOctets           Counter32,
    diffServAlgDropHCOctets         Counter64,
    diffServAlgDropPkts             Counter32,
    diffServAlgDropHCPkts           Counter64,
    diffServAlgDropDiscontinuityTime TimeStamp,
    diffServAlgDropStatus           RowStatus
}

diffServAlgDropId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the Algorithmic Dropper entries. The
       set of such identifiers spans the whole agent. Managers should obtain
       new values for row creation in this table by reading
       diffServAlgDropNextFree."
    ::= { diffServAlgDropEntry 1 }

diffServAlgDropType OBJECT-TYPE
    SYNTAX       INTEGER {
                     other(1),
                     tailDrop(2),
                     headDrop(3),
                     randomDrop(4)
                     randomDrop(4),
                     alwaysDrop(5)
}
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The type of algorithm used by this dropper. A value of
       tailDrop(2) or headDrop(3) represents an algorithm that is
       completely specified by this MIB.  A The value of other(1)
       requires further specification in some other MIB module.

       The

       In the tailDrop(2) algorithm is described as follows: algorithm, diffServAlgDropQThreshold
       represents the maximum depth of the queue, pointed to by
       diffServAlgDropQMeasure, at beyond which all newly arriving packets
       will be dropped.

       The

       In the headDrop(3) algorithm is described as follows: algorithm, if a packet arrives when the
       current depth of the queue, pointed to by
       diffServAlgDropQMeasure, is at diffServAlgDropQThreshold, packets
       currently at the head of the queue are dropped to make room for
       the new packet to be enqueued at the tail of the queue.

       The

       In the randomDrop(4) algorithm is described as follows: algorithm, on packet arrival, an Active
       Queue Management algorithm is executed which may randomly randomly drop a
       packet. This algorithm may be proprietary, and it may drop either
       the
       packet, arriving packet or drop other packet(s) from the queue another packet in its place. The
       specifics of the algorithm may be proprietary. For this
       algorithm, queue.
       diffServAlgDropSpecific points to a diffServRandomDropEntry that
       describes the algorithm. For this algorithm,
       diffServAlgQThreshold is understood to be the absolute maximum
       size of the queue and additional parameters are described in diffServRandomDropTable."
       diffServRandomDropTable.

       The alwaysDrop(5) algorithm is as its name specifies; always
       drop. In this case, the other configuration values in this Entry
       are not meaningful; There is no useful the queue are not useful.
       Therefore, diffServAlgQNext, diffServAlgQMeasure, and
       diffServAlgQSpecific are all zeroDotZero."
    ::= { diffServAlgDropEntry 2 }

diffServAlgDropNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This selects the next diffserv functional data path Differentiated Services Functional Data
       Path element to handle traffic for this data path. This
       RowPointer should point to an instance of one of:
         diffServClfrEntry
         diffServClfrElementEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value of zeroDotZero in this attribute indicates no further
       Diffserv
       Differentiated Services treatment is performed on traffic of this
       data path. The use of zeroDotZero is the normal usage for the
       last functional data path element of the current data path.

       If the row pointed to does not exist, the treatment is as if this
       attribute contains a value of zeroDotZero."
    ::= { diffServAlgDropEntry 3 }

diffServAlgDropQMeasure OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "Points to an entry in the diffServQTable to indicate the queue
       that a drop algorithm is to monitor when deciding whether to drop
       a packet. If the row pointed to does not exist, the algorithmic
       dropper element is considered inactive."
    ::= { diffServAlgDropEntry 4 }

diffServAlgDropQThreshold OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "Bytes"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "A threshold on the depth in bytes of the queue being measured at
       which a trigger is generated to the dropping algorithm.

       For the tailDrop(2) or headDrop(3) algorithms, this represents
       the depth of the queue, pointed to by diffServAlgDropQMeasure, at
       which the drop action will take place. Other algorithms will need
       to define their own semantics for this threshold."
    ::= { diffServAlgDropEntry 5 }

diffServAlgDropSpecific OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "Points to a table entry that provides further detail regarding a
       drop algorithm.

       Entries with diffServAlgDropType equal to other(1) may have this
       point to a table defined in another MIB module.

       Entries with diffServAlgDropType equal to randomDrop(4) must have
       this point to an entry in diffServRandomDropTable.

       For all other algorithms, algorithms specified in this MIB, this should take
       the value zeroDotzero."
    ::= { diffServAlgDropEntry 6 }

diffServAlgDropOctets OBJECT-TYPE
    SYNTAX       Counter32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of octets that have been dropped by this drop
       process. On high speed high-speed devices, this object implements the least
       significant 32 bits of diffServAlgDropHCOctets.

       Discontinuities in the value of this counter can occur at re-
       initialization of the management system and at other times as
       indicated by the value of ifCounterDiscontinuityTime appropriate
       to diffServAlgDropDiscontinuityTime for
       this interface." Entry."
    ::= { diffServAlgDropEntry 7 }

diffServAlgDropHCOctets OBJECT-TYPE
    SYNTAX       Counter64
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of octets that have been dropped by this drop
       process. This object should be used on high speed high-speed interfaces.

       Discontinuities in the value of this counter can occur at re-
       initialization of the management system and at other times as
       indicated by the value of ifCounterDiscontinuityTime appropriate
       to diffServAlgDropDiscontinuityTime for
       this interface." Entry."
    ::= { diffServAlgDropEntry 8 }

diffServAlgDropPkts OBJECT-TYPE
    SYNTAX       Counter32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of packets that have been dropped by this drop
       process. On high high- speed devices, this object implements the least
       significant 32 bits of diffServAlgDropHCPkts.

       Discontinuities in the value of this counter can occur at re-
       initialization of the management system and at other times as
       indicated by the value of ifCounterDiscontinuityTime appropriate
       to diffServAlgDropDiscontinuityTime for
       this interface." Entry."
    ::= { diffServAlgDropEntry 9 }

diffServAlgDropHCPkts OBJECT-TYPE
    SYNTAX       Counter64
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of packets that have been dropped by this drop
       process. This object should be used on high speed high-speed interfaces.

       Discontinuities in the value of this counter can occur at re-
       initialization of the management system and at other times as
       indicated by the value of ifCounterDiscontinuityTime appropriate
       to diffServAlgDropDiscontinuityTime for
       this interface." Entry."
    ::= { diffServAlgDropEntry 10 }

diffServAlgDropDiscontinuityTime OBJECT-TYPE
    SYNTAX       TimeStamp
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The value of sysUpTime on the most recent occasion at which any
       one or more of this entry's counters suffered a discontinuity. If
       no such discontinuities have occurred since the last re-
       initialization of the local management subsystem, then this
       object contains a zero value."
    ::= { diffServAlgDropEntry 11 }

diffServAlgDropStatus 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."
    ::= { diffServAlgDropEntry 11 12 }

--
-- Random Drop Table
--

diffServRandomDropNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a value when read that is currently unused
       for a diffServRandomDropId instance. If a configuring system
       attempts to create a new row in the diffServRandomDropTable using
       this value, that operation will fail if the value has, but an instance has been created or is in the
       meantime, been used to create another row process
       of being created, that is currently
       valid." operation will fail."
    ::= { diffServAlgDrop 3 }

diffServRandomDropTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServRandomDropEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The random drop table contains entries describing a process that
       drops packets randomly. Entries in this table is intended to be are pointed to by
       diffServAlgDropSpecific."
    REFERENCE
        "[MODEL] section 7.1.3"
    ::= { diffServAlgDrop 4 }

diffServRandomDropEntry OBJECT-TYPE
    SYNTAX       DiffServRandomDropEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry describes a process that drops packets according to a
       random algorithm."
    INDEX { diffServRandomDropId }
    ::= { diffServRandomDropTable 1 }

DiffServRandomDropEntry ::= SEQUENCE  {
    diffServRandomDropId               Unsigned32,               INTEGER,
    diffServRandomDropMinThreshBytes   Unsigned32,
    diffServRandomDropMinThreshPkts    Unsigned32,
    diffServRandomDropMaxThreshBytes   Unsigned32,
    diffServRandomDropMaxThreshPkts    Unsigned32,
    diffServRandomDropProbMax       Unsigned32,
    diffServRandomDropInvWeight        Unsigned32,          INTEGER,
    diffServRandomDropWeight           INTEGER,
    diffServRandomDropSamplingRate     Unsigned32,     INTEGER,
    diffServRandomDropStatus           RowStatus
}

diffServRandomDropId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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
    SYNTAX       Unsigned32
    UNITS        "bytes"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The average queue depth in bytes, beyond which traffic has a
       non-zero probability of being dropped. Changes in this variable
       may or may not be reflected in the reported value of
       diffServRandomDropMinThreshPkts."
    ::= { diffServRandomDropEntry 2 }

diffServRandomDropMinThreshPkts OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "packets"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The average queue depth in packets, beyond which traffic has a
       non-zero probability of being dropped. Changes in this variable
       may or may not be reflected in the reported value of
       diffServRandomDropMinThreshBytes."
    ::= { diffServRandomDropEntry 3 }

diffServRandomDropMaxThreshBytes OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "bytes"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The average queue depth beyond which traffic has a probability
       indicated by diffServRandomDropProbMax of being dropped or
       marked. Note that this differs from the physical queue limit,
       which is stored in diffServAlgDropQThreshold. Changes in this
       variable may or may not be reflected in the reported value of
       diffServRandomDropMaxThreshPkts."
    ::= { diffServRandomDropEntry 4 }

diffServRandomDropMaxThreshPkts OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "packets"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The average queue depth beyond which traffic has a probability
       indicated by diffServRandomDropProbMax of being dropped or
       marked. Note that this differs from the physical queue limit,
       which is stored in diffServAlgDropQThreshold. Changes in this
       variable may or may not be reflected in the reported value of
       diffServRandomDropMaxThreshBytes."
    ::= { diffServRandomDropEntry 5 }

diffServRandomDropProbMax OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (0..1000)
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The worst case random drop probability, expressed in drops per
       thousand packets.

       For example, if in the worst case every arriving packet may be
       dropped in the worst case
       (100%), (100%) for a period, this has the value 1000.
       Alternatively, if in the worst case only one percent (1%) of
       traffic may be dropped, it has the value 10."
   ::= { diffServRandomDropEntry 6 }

diffServRandomDropInvWeight

diffServRandomDropWeight OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (0..65536)
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The weighting of past history in affecting the calculation of Exponentially
       Weighted Moving Average function which calculates the current queue average.  The moving
       average of the queue depth depth.  The equation uses the inverse of this value
       diffServRandomDropWeight/65536 as the factor coefficient for the new queue
       depth,
       sample in the equation, and one minus that inverse (65536 -
       diffServRandomDropWeight)/65536 as the factor for coefficient of the
       historical average. old
       value.

       Implementations may choose to limit the acceptable set of values of diffServRandomDropWeight
       to a specified set, subset of the possible range of values, such as powers of 2."
       two. Doing this would facilitate implementation of the
       Exponentially Weighted Moving Average using shift instructions or
       registers."
    ::= { diffServRandomDropEntry 7 }

diffServRandomDropSamplingRate OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (0..1000000)
    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 is used to mean that the
       queue is sampled approximately each time a packet is enqueued (or
       dequeued)."
    ::= { diffServRandomDropEntry 8 }

diffServRandomDropStatus 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."
    ::= { diffServRandomDropEntry 9 }

--
-- Queue Table
--

diffServQueue          OBJECT IDENTIFIER ::= { diffServMIBObjects 7 }

--
-- An entry of diffServQTable represents a FIFO queue diffserv Differentiated
-- functional data path Services Functional Data Path element as described in [MODEL] section
-- 7.1.1.
-- Notice Note that the specification of scheduling parameters for a queue
-- queue as part of the input to a scheduler functional data path
-- element
-- as described in [MODEL] section 7.1.2. This allows
-- building of
-- hierarchical queuing/scheduling.
-- A queue therefore is parameterized by: has these attributes:
-- 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,
--    diffServQRate.
--
-- Notice one or more Note that upstream diffserv data path element may share, Differentiated Services Functional Data Path
-- elements may point to, to a shared diffServQTable entry as described
-- in [MODEL] section
-- 7.1.1.
--
-- Each entry of the diffServQTable belongs to one and only one
-- data path.
--

diffServQNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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, but an
       instance has been created or is in the meantime, been used
       to create another row process of being created,
       that is currently valid." operation will fail."
    ::= { diffServQueue 1 }

diffServQTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServQEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The Queue Table enumerates the individual queues."
    REFERENCE
        "[MODEL] section 7.1.1"
    ::= { diffServQueue 2 }

diffServQEntry OBJECT-TYPE
    SYNTAX       DiffServQEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the Queue Table describes a single queue. With each
       entry belonging to one and only one data path."
    INDEX { diffServQId }
    ::= { diffServQTable 1 }

DiffServQEntry ::= SEQUENCE  {
    diffServQId                      Unsigned32,                      INTEGER,
    diffServQNext                    RowPointer,
    diffServQRate                    RowPointer,
    diffServQShaper                  RowPointer,
    diffServQStatus                  RowStatus
}

diffServQId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the Queue entries. The set of such
       identifiers spans the whole agent. Managers should obtain new values for
       row creation in this table by reading diffServQNextFree."
    ::= { diffServQEntry 1 }

diffServQNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This selects the next diffserv functional data path Differentiated Services Functional Data
       Path element to handle traffic for this data path. This
       RowPointer must point to a diffServSchedulerEntry.

       A value of zeroDotZero in this attribute indicates an incomplete
       diffServQEntry instance. In such a case, the entry has no
       operational effect, since it has no parameters to give it
       meaning.

       If the row pointed to does not exist, the treatment is as if this
       attribute contains a value of zeroDotZero."
    ::= { diffServQEntry 2 }

diffServQRate OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This RowPointer indicates the entry in diffServAssuredRateTable diffServAssuredRateEntry that the
       scheduler, pointed to by diffServQNext, should use to service
       this queue.

       A value of zeroDotZero in this attribute indicates an incomplete
       diffServQEntry instance.  An illegal configuration.

       If the row pointed to is zeroDotZero or does not exist, the treatment
       minimum rate is as if this
       attribute contains a value of zeroDotZero." unspecified."
    ::= { diffServQEntry 3 }

diffServQShaper OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This RowPointer indicates the entry in diffServShapingRateTable diffServShapingRateEntry that the
       scheduler, pointed to by diffServQNext, should use to service
       this queue.

       A value of zeroDotZero in this attribute indicates an incomplete
       diffServQEntry instance.  An illegal configuration.

       If the row pointed to does not exist, exist or is zeroDotZero, the treatment
       maximum rate is as if this
       attribute contains a value the line speed of zeroDotZero." the interface."
    ::= { diffServQEntry 4 }

diffServQStatus 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."
    ::= { diffServQEntry 5 }

--
-- Scheduler Table
--

diffServScheduler      OBJECT IDENTIFIER ::= { diffServMIBObjects 8 }

--
-- The A Scheduler Table is used for representing Entry represents a packet schedulers: scheduler, such as a priority
-- it scheduler or a WFQ scheduler. It provides flexibility for multiple
-- scheduling algorithms, each
-- servicing multiple queues, to be used on
-- the same logical/physical
-- interface.
-- Notice the servicing parameters the scheduler uses is
-- specified by each of its upstream functional data path elements,
-- most likely Note that upstream queues or schedulers.
-- The coordination and coherency between the servicing parameters
-- schedulers specify several of the
-- scheduler's upstream functional data path elements parameters. These must
-- be maintained for properly specified if the

-- scheduler is to function correctly. behave as expected.
--
-- The diffServSchedulerShaper attribute is used for specifying
-- specifies the servicing parameters for output of a scheduler when its
-- downstream functional data path element when a scheduler's output is sent to another scheduler.
-- This is
-- used for in building hierarchical queue/scheduler. queues or schedulers.
--
-- More discussion of the scheduler functional data path element
-- is
-- in [MODEL] section 7.1.2.
--

diffServSchedulerNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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, but an instance has been created or is in the
       meantime, been used to create another row process
       of being created, that is currently
       valid." operation will fail."
    ::= { diffServScheduler 1 }

diffServSchedulerTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServSchedulerEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The Scheduler Table enumerates packet schedulers. Multiple
       scheduling algorithms can be used on a given data path, with each
       algorithm described by one diffServSchedulerEntry."
    REFERENCE
        "[MODEL] section 7.1.2"
    ::= { diffServScheduler 2 }

diffServSchedulerEntry OBJECT-TYPE
    SYNTAX       DiffServSchedulerEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the Scheduler Table describing a single instance of
       a scheduling algorithm."
    INDEX { diffServSchedulerId }
    ::= { diffServSchedulerTable 1 }

DiffServSchedulerEntry ::= SEQUENCE  {
    diffServSchedulerId                   Unsigned32,                   INTEGER,
    diffServSchedulerNext                 RowPointer,
    diffServSchedulerMethod               OBJECT IDENTIFIER,
    diffServSchedulerRate                 RowPointer,
    diffServSchedulerShaper               RowPointer,
    diffServSchedulerStatus               RowStatus
}

diffServSchedulerId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the Scheduler entries. The set of such
       identifiers spans the whole agent. Managers should obtain new values for
       row creation in this table by reading diffServSchedulerNextFree."
    ::= { diffServSchedulerEntry 1 }

diffServSchedulerNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This selects the next diffserv functional data path Differentiated Services Functional Data
       Path element to handle traffic for this data path. This
       RowPointer should point to an instance of one of:
         diffServSchedulerEntry
         diffServQEntry As as indicated by [MODEL] section 7.1.4.

       But

       However, this RowPointer can may also point to an instance of:
         diffServClfrEntry of:.
         diffServClfrElementEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry For building of multiple TCBs for to extend the same data path.

       This should point to another diffServSchedulerEntry for
       implementation of multiple scheduler methods for the same data
       path, and for implementation of hierarchical schedulers.

       A value of zeroDotZero in this attribute indicates no further
       Diffserv treatment is performed on traffic of this data path.
       The use of zeroDotZero is the normal usage for the last
       functional data path element of the current data path.

       If the row pointed to does not exist, the exist or is zeroDotZero, no
       further Differentiated Services treatment is as if this
       attribute contains a value performed on traffic
       of zeroDotZero." this data path."

    DEFVAL       { zeroDotZero }
    ::= { diffServSchedulerEntry 2 }

diffServSchedulerMethod OBJECT-TYPE
    SYNTAX       OBJECT IDENTIFIER
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The scheduling algorithm used by this Scheduler.  { 0 0 } zeroDotZero
       indicates that this is unknown.  Standard values for generic
       algorithms: diffServSchedulerPriority, diffServSchedulerWRR, and
       diffServSchedulerWFQ are specified in this MIB; additional values
       may be further specified in other MIBs."
    REFERENCE
        "[MODEL] section 7.1.2"
    ::= { diffServSchedulerEntry 3 }

diffServSchedulerRate OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This RowPointer indicates the entry in diffServAssuredRateTable
       which indicates the priority or minimum output rate from this
       scheduler. This attribute is only used only when there is more than
       one level of scheduler.  It should have the value of zeroDotZero
       when not used."
    DEFVAL      { zeroDotZero }
    ::= { diffServSchedulerEntry 4 }

diffServSchedulerShaper OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This RowPointer indicates the entry in diffServShapingRateTable
       which indicates the maximum output rate from this scheduler. This
       attribute is only used only when there is more than one level of
       scheduler.  It should have the value of zeroDotZero when not
       used."
    DEFVAL      { zeroDotZero }
    ::= { diffServSchedulerEntry 5 }

diffServSchedulerStatus OBJECT-TYPE
    SYNTAX       RowStatus
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The RowStatus variable controls the activation, deactivation, or
       deletion of a scheduler. Any writable variable may be modified
       whether the row is active or notInService."
    ::= { diffServSchedulerEntry 6 }

diffServSchedulerPriority OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "For use with diffServSchedulerMethod to indicate
       "When the next scheduler uses Priority
       scheduling method, scheduling, defined as an
       algorithm in which the presence of data in a queue or set of
       queues absolutely precludes dequeue from another queue or set of queues.  Notice
       queues, this indicates the relative priority of the traffic
       stream. Note that attributes from diffServAssuredRateEntry of the
       queues/schedulers feeding this scheduler are used when
       determining the next packet to schedule."
    REFERENCE
        "[MODEL] section 7.1.2"
    ::= { diffServScheduler 3 }

diffServSchedulerWRR OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "For use with diffServSchedulerMethod to indicate Weighted Round
       Robin scheduling method, defined as any algorithm in which a set
       of queues are visited in a fixed order, and varying amounts of
       traffic are removed from each queue in turn to implement an
       average output rate by class. Notice attributes from
       diffServAssuredRateEntry of the queues/schedulers feeding this
       scheduler are used when determining the next packet to schedule."
    REFERENCE
        "[MODEL] section 7.1.2"
    ::= { diffServScheduler 4 }

diffServSchedulerWFQ OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "For use with diffServSchedulerMethod to indicate Weighted Fair
       Queuing scheduling method, defined as any algorithm in which a
       set of queues are conceptually visited in some order, to
       implement an average output rate by class. Notice attributes from
       diffServAssuredRateEntry of the queues/schedulers feeding this
       scheduler are used when determining the next packet to schedule."
    REFERENCE
        "[MODEL] section 7.1.2"
    ::= { diffServScheduler 5 }

--
-- Assured
--Assured Rate Parameters Table
--
-- The parameters used by a scheduler for its inputs or outputs are
-- maintained separately from the Queue or Scheduler table entries for
-- for reusability reasons and so that they may be used by both queues and
-- and schedulers.  This follows the approach for separation of data path
-- path elements from parameterization which that is used throughout this MIB.  Use
-- Use of these Assured Rate Parameter Table entries by Queues and Schedulers
-- Schedulers allows the modelling modeling of hierarchical scheduling systems.
--
-- Specifically, a Scheduler has one or more inputs and one output.  For
-- Any queue feeding a scheduler, or any input that requires work-conserving properties, the input is
-- parameterised by having the preceding element (e.g. scheduler which feeds a Queue Table second
-- entry) point scheduler, might specify a minimum transfer rate by pointing to an Assured Rate Parameter Table entry.  The scheduler
-- output, if it has work-conserving properties, is parameterised by
-- having the Scheduler Table entry itself point to a Assured Rate
-- Parameter Table entry.
--
-- The diffServAssuredRatePriority/Abs/Rel attributes are used as
-- parameters to the work-conserving portion of a scheduler:
-- work-conserving "work-conserving" implies that the scheduler can continue to emit
-- data as
-- long as there is data available at its input(s).  This has
-- the effect
-- of guaranteeing a certain priority relative to other
-- scheduler inputs
-- and/or a certain minimum proportion of the available
-- output bandwidth.
-- Properly configured, this means a certain minimum
-- rate, which may be
-- exceeded should traffic be available should there
-- be spare bandwidth
-- after all other classes have had opportunities to
-- consume their own
-- minimum rates.
--

diffServAssuredRateNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a value when read that is currently unused
       for a diffServAssuredRateId instance. If a configuring system
       attempts to create a new row in the diffServAssuredRateTable
       using this value, that operation will fail if the value has, but an instance has been created or is in the meantime, been used to create another row
       process of being created, that is currently
       valid." operation will fail."
    ::= { diffServScheduler 6 }

diffServAssuredRateTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServAssuredRateEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The Assured Rate Parameters Table enumerates individual sets of
       scheduling parameter that can be used/reused by Queues and
       Schedulers."
    ::= { diffServScheduler 7 }

diffServAssuredRateEntry OBJECT-TYPE
    SYNTAX       DiffServAssuredRateEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the Assured Rate Parameters Table describes a single
       set of scheduling parameters for use by one or more queues or
       schedulers."
    INDEX { diffServAssuredRateId }
    ::= { diffServAssuredRateTable 1 }

DiffServAssuredRateEntry ::= SEQUENCE  {
    diffServAssuredRateId              Unsigned32,              INTEGER,
    diffServAssuredRatePriority        Unsigned32,
    diffServAssuredRateAbs             Unsigned32,
    diffServAssuredRateRel             Unsigned32,
    diffServAssuredRateStatus          RowStatus
}

diffServAssuredRateId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    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
       diffServAssuredRateNextFree."
    ::= { diffServAssuredRateEntry 1 }

diffServAssuredRatePriority OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The priority of this input to the associated scheduler, relative
       to the scheduler's other inputs."
    ::= { diffServAssuredRateEntry 2 }

diffServAssuredRateAbs 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 attribute value is coupled to and that of
       diffServAssuredRateRel: diffServAssuredRateRel
       are coupled: changes to one will affect the value of the other.
       They are linked by the following equation:

         diffServAssuredRateRel = diffServAssuredRateAbs * 10000/ifSpeed 1000/ifSpeed

       or, if appropriate:

         diffServAssuredRateRel = diffServAssuredRateAbs * 10000/ifHighSpeed" 1000/ifHighSpeed"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB]"
    ::= { diffServAssuredRateEntry 3 }

diffServAssuredRateRel 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
       1/1000 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 attribute value is coupled to and that of
       diffServAssuredRateAbs: diffServAssuredRateAbs
       are coupled: changes to one will affect the value of the other.
       They are linked by the following equation:

         diffServAssuredRateRel = diffServAssuredRateAbs * 10000/ifSpeed 1000/ifSpeed

       or, if appropriate:

         diffServAssuredRateRel = diffServAssuredRateAbs * 10000/ifHighSpeed" 1000/ifHighSpeed"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB]"
    ::= { diffServAssuredRateEntry 4 }

diffServAssuredRateStatus 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."
    ::= { diffServAssuredRateEntry 5 }

--
-- Shaping Parameter Table
--
-- The parameters used by a scheduler for its inputs or outputs are
-- maintained separately from the Queue or Scheduler table entries for
-- for reusability reasons and so that they may be used by both queues and
-- and schedulers.  This follows the approach for separation of data path
-- path elements from parameterization which that is used throughout this MIB.  Use
-- Use of these Shaping Parameter Table entries by Queues and Schedulers
-- allows the modelling modeling of hierarchical scheduling systems.
--
-- Specifically, a Scheduler has one or more inputs and one output.  For
-- Any queue feeding a scheduler, or any input that requires non-work-conserving properties, the input is
-- parameterised by having the preceding element (e.g. scheduler which feeds a Queue Table second
-- entry) point scheduler, might specify a maximum transfer rate by pointing to a
-- Shaping Rate Parameter Table entry.  The scheduler Multi-rate shapers, such as a Dual
-- output, if it has non-work-conserving properties, is parameterised Leaky Bucket algorithm, specify their rates by positing multiple
-- having the Scheduler Table entry itself point to a Shaping Rate
-- Parameter Table entry. Entries with the same diffServShapingRateId but
-- different diffServShapingRateLevels.
--
-- The diffServShapingRateLevel/Abs/Rel attributes are used as parameters
-- to the non-work-conserving portion of a scheduler:  non-work-conserving
-- implies that the scheduler may sometimes not emit a packet, even if
-- there is data available at its input(s).  This has the effect of
-- limiting
-- the servicing of the queue/scheduler input or output, in
-- effect performing
-- shaping of the packet stream passing through the
-- queue/scheduler, as
-- described in [MODEL] section 7.2.
--

diffServShapingRateNextFree OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a value when read that is currently unused
       for a diffServShapingRateId instance. If a configuring system
       attempts to create a new row in the diffServShapingRateTable
       using this value, that operation will fail if the value has, but an instance has been created or is in the meantime, been used to create another row
       process of being created, that is currently
       valid." operation will fail."
    ::= { diffServScheduler 8 }

diffServShapingRateTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServShapingRateEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The Shaping Parameter Table enumerates individual sets of
       scheduling parameter that can be used/reused by Queues and
       Schedulers."
    ::= { diffServScheduler 9 }

diffServShapingRateEntry OBJECT-TYPE
    SYNTAX       DiffServShapingRateEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the Shaping Parameter Table describes a single set
       of scheduling parameters for use by one or more queues or
       schedulers."
    INDEX { diffServShapingRateId, diffServShapingRateLevel }
    ::= { diffServShapingRateTable 1 }

DiffServShapingRateEntry ::= SEQUENCE  {
    diffServShapingRateId              Unsigned32,              INTEGER,
    diffServShapingRateLevel           Unsigned32,           INTEGER,
    diffServShapingRateAbs             Unsigned32,
    diffServShapingRateRel             Unsigned32,
    diffServShapingRateThreshold       BurstSize,
    diffServShapingRateStatus          RowStatus
}

diffServShapingRateId OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that enumerates the Shaping Parameter entries. The set
       of such identifiers spans the whole agent. Managers should obtain new
       values for row creation in this table by reading
       diffServShapingRateNextFree."
    ::= { diffServShapingRateEntry 1 }

diffServShapingRateLevel OBJECT-TYPE
    SYNTAX       Unsigned32       INTEGER (1..2147483647)
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that indicates which level of a multi-rate shaper is
       being given its parameters.  In a A multi-rate shaper with has some number
       of rate levels. Frame Relay's dual rate specification refers to a mean
       'committed' and an 'excess' rate; ATM's dual rate specification
       refers to a 'mean' and a peak
       rate, for example, the 'peak' rate. This table is generalized
       to support an arbitrary number of rates. The committed or mean
       rate might be applied first, and is level 1, the peak rate second under a defined circumstance.  By convention,
       increasing levels have (if any) is the highest level rate
       configured, and if there are other rates they are distributed in
       monotonically increasing rates." order between them."
    ::= { diffServShapingRateEntry 2 }

diffServShapingRateAbs 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 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 attribute value is coupled to and that of
       diffServShapingRateRel: diffServShapingRateRel
       are coupled: changes to one will affect the value of the other.
       They are linked by the following equation:

         diffServAssuredRateRel = diffServAssuredRateAbs * 10000/ifSpeed 1000/ifSpeed

       or, if appropriate:

         diffServAssuredRateRel = diffServAssuredRateAbs * 10000/ifHighSpeed" 1000/ifHighSpeed"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB], RFC 2963"
    ::= { diffServShapingRateEntry 3 }

diffServShapingRateRel 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 maximum rate of the
       interface as reported by ifSpeed or ifHighSpeed, in units of
       1/10,000
       1/1000 of 1. If the value is zero, then there is effectively no
       maximum rate limit and the scheduler should attempt to be
       work-conserving 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 attribute value is coupled to and that of
       diffServShapingRateAbs: diffServShapingRateAbs
       are coupled: changes to one will affect the value of the other.
       They are linked by the following equation:

         diffServShapingRateAbs = ifSpeed * diffServShapingRateRel/10000 diffServShapingRateRel/1000

       or, if appropriate:

         diffServShapingRateAbs = ifHighSpeed * diffServShapingRateRel/10000" diffServShapingRateRel/1000"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB], RFC 2963"
    ::= { diffServShapingRateEntry 4 }

diffServShapingRateThreshold OBJECT-TYPE
    SYNTAX       BurstSize
    UNITS        "Bytes"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The number of bytes of queue depth at which the rate of a
       multi-rate scheduler will increase to the next output rate. In
       the last conceptual row for such a shaper, this threshold is
       ignored and by convention is zero."
    REFERENCE
        "RFC 2963"
    ::= { diffServShapingRateEntry 5 }

diffServShapingRateStatus 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."
    ::= { diffServShapingRateEntry 6 }

--
-- MIB Compliance statements.
--

diffServMIBCompliances OBJECT IDENTIFIER ::= { diffServMIBConformance 1 }
diffServMIBGroups      OBJECT IDENTIFIER ::= { diffServMIBConformance 2 }

diffServMIBCompliance MODULE-COMPLIANCE
    STATUS current
    DESCRIPTION
       "This MIB may be implemented as a read-only or as a read-create
       MIB. As a result, it may be used for monitoring or for
       configuration."
    MODULE -- This Module
    MANDATORY-GROUPS {
        diffServMIBDataPathGroup, diffServMIBClfrGroup,
        diffServMIBClfrElementGroup, diffServMIBSixTupleClfrGroup,
        diffServMIBActionGroup, diffServMIBAlgDropGroup,
        diffServMIBQGroup, diffServMIBSchedulerGroup,
        diffServMIBShapingRateGroup, diffServMIBAssuredRateGroup }

-- The groups:
--        diffServMIBCounterGroup
--        diffServMIBHCCounterGroup
--        diffServMIBVHCCounterGroup
--
-- 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, then ifCounterDiscontinuityGroup from
-- [IFMIB]  must also be implemented for that interface.
-- note
-- Note that the diffServMIBStaticGroup is
-- mandatory for implementations
-- that implement a
-- read-write or read-create mode.

    GROUP diffServMIBCounterGroup
    DESCRIPTION
       "This group is mandatory for table objects indexed by ifIndex for
       which the value of the corresponding instance of ifSpeed is less
       than or equal to 20,000,000 bits/second."

    GROUP diffServMIBHCCounterGroup
    DESCRIPTION
       "This group is mandatory for table objects indexed by ifIndex for
       which the value of the corresponding instance of ifSpeed is
       greater than 20,000,000 bits/second."

    GROUP diffServMIBVHCCounterGroup
    DESCRIPTION
       "This group is mandatory for table objects indexed by ifIndex for
       which the value of the corresponding instance of ifSpeed is
       greater than 650,000,000 bits/second."

    GROUP diffServMIBMeterGroup
    DESCRIPTION
       "This group is mandatory for devices that implement metering
       functions."

    GROUP diffServMIBTBParamGroup
    DESCRIPTION
       "This group is mandatory for devices that implement token-bucket
       metering functions."

    GROUP diffServMIBDscpMarkActGroup
    DESCRIPTION
       "This group is mandatory for devices that implement DSCP-Marking
       functions."

    GROUP diffServMIBRandomDropGroup
    DESCRIPTION
       "This group is mandatory for devices that implement Random Drop
       functions."

    GROUP diffServMIBStaticGroup
    DESCRIPTION
       "This group is mandatory for devices that allow creation of rows
       in any of the writable tables of this MIB."

    OBJECT diffServDataPathStart
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServDataPathStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServClfrDataPathStart
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServClfrStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServClfrElementPrecedence
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServClfrElementNext
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServClfrElementSpecific
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServClfrElementStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrDstAddrType
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrDstAddr
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrDstPrefixLength
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrSrcAddrType
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrSrcAddr
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."
    OBJECT diffServSixTupleClfrSrcPrefixLength
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrDscp
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrProtocol
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrSrcL4PortMin diffServSixTupleClfrDstL4PortMin
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrSrcL4PortMax diffServSixTupleClfrDstL4PortMax
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrDstL4PortMin diffServSixTupleClfrSrcL4PortMin
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrDstL4PortMax diffServSixTupleClfrSrcL4PortMax
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSixTupleClfrStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServMeterSucceedNext
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServMeterFailNext
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServMeterSpecific
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServMeterStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServTBParamType
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServTBParamRate
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServTBParamBurstSize
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServTBParamInterval
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServTBParamStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServActionNext
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServActionSpecific
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."
    OBJECT diffServActionType
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServActionStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServCountActStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAlgDropType
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAlgDropNext
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAlgDropQMeasure
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAlgDropQThreshold
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAlgDropSpecific
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAlgDropStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServRandomDropMinThreshBytes
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServRandomDropMinThreshPkts
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServRandomDropMaxThreshBytes
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServRandomDropMaxThreshPkts
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServRandomDropProbMax
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServRandomDropInvWeight diffServRandomDropWeight
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServRandomDropSamplingRate
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServRandomDropStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServQNext
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServQRate
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServQShaper
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."
    OBJECT diffServQStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSchedulerNext
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSchedulerMethod
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSchedulerRate
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSchedulerShaper
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServSchedulerStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAssuredRatePriority
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAssuredRateAbs
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAssuredRateRel
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAssuredRateStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServShapingRateAbs
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServShapingRateRel
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServShapingRateThreshold
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    OBJECT diffServAssuredRateStatus diffServShapingRateStatus
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."

    ::= { diffServMIBCompliances 1 }

diffServMIBDataPathGroup OBJECT-GROUP
    OBJECTS {
        diffServDataPathStart, diffServDataPathStatus
    }
    STATUS current
    DESCRIPTION
       "The Data Path Group defines the MIB Objects that describe a
       functional data path."
    ::= { diffServMIBGroups 1 }

diffServMIBClfrGroup OBJECT-GROUP
    OBJECTS {
        diffServClfrDataPathStart, diffServClfrStatus
    }
    STATUS current
    DESCRIPTION
       "The Classifier Group defines the MIB Objects that describe a
       generic classifier." the
       list the starts of individual classifiers."
    ::= { diffServMIBGroups 2 }

diffServMIBClfrElementGroup OBJECT-GROUP
    OBJECTS {
        diffServClfrElementPrecedence, 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
    OBJECTS {
        diffServSixTupleClfrDstAddrType, diffServSixTupleClfrDstAddr,
        diffServSixTupleClfrDstPrefixLength,
        diffServSixTupleClfrSrcAddrType, diffServSixTupleClfrSrcAddr,
        diffServSixTupleClfrSrcPrefixLength, diffServSixTupleClfrDscp,
        diffServSixTupleClfrProtocol, diffServSixTupleClfrDstL4PortMin,
        diffServSixTupleClfrDstL4PortMax, diffServSixTupleClfrSrcL4PortMin,
        diffServSixTupleClfrSrcL4PortMax, diffServSixTupleClfrStatus
    }
    STATUS current
    DESCRIPTION
       "The Six-tuple Six-Tuple Classifier Group defines the MIB Objects that
       describe a classifier element for matching on 6 fields of an IP
       and upper-layer protocol header."
    ::= { diffServMIBGroups 4 }

diffServMIBMeterGroup OBJECT-GROUP
    OBJECTS {
        diffServMeterSucceedNext, diffServMeterFailNext,
        diffServMeterSpecific, diffServMeterStatus
    }
    STATUS current
    DESCRIPTION
       "The Meter Group defines the objects used in describing a generic
       meter element."
    ::= { diffServMIBGroups 5 }

diffServMIBTBParamGroup OBJECT-GROUP
    OBJECTS {
        diffServTBParamType, diffServTBParamRate,
        diffServTBParamBurstSize, diffServTBParamInterval,
        diffServTBParamStatus
    }
    STATUS current
    DESCRIPTION
       "The Token-Bucket Meter Group defines the objects used in
       describing a token bucket meter element."
    ::= { diffServMIBGroups 6 }

diffServMIBActionGroup OBJECT-GROUP
    OBJECTS {
        diffServActionNext, diffServActionSpecific,
        diffServActionType, diffServActionStatus
    }
    STATUS current
    DESCRIPTION
       "The Action Group defines the objects used in describing a
       generic action element."
    ::= { diffServMIBGroups 7 }

diffServMIBDscpMarkActGroup OBJECT-GROUP
    OBJECTS {
        diffServDscpMarkActDscp
    }
    STATUS current
    DESCRIPTION
       "The DSCP Mark Action Group defines the objects used in
       describing a DSCP Marking Action element."
    ::= { diffServMIBGroups 8 }

diffServMIBCounterGroup OBJECT-GROUP
    OBJECTS {
    diffServCountActOctets, diffServCountActPkts,
        diffServCountActDiscontTime, diffServCountActStatus,
        diffServAlgDropOctets, diffServAlgDropPkts
    }
    STATUS current
    DESCRIPTION
       "A collection of objects providing information specific to non-
       high speed (non-high (non- high speed interfaces transmit and receive at
       speeds less than or equal to 20,000,000 bits/second) packet-
       oriented network interfaces."
    ::= { diffServMIBGroups 9 }

diffServMIBHCCounterGroup OBJECT-GROUP
    OBJECTS {
        diffServCountActOctets, diffServCountActHCOctets,
        diffServCountActPkts, diffServCountActDiscontTime,
        diffServCountActStatus, diffServAlgDropOctets,
        diffServAlgDropHCOctets, diffServAlgDropPkts
    }
    STATUS current
    DESCRIPTION
       "A collection of objects providing information specific to high
       speed (high speed interfaces transmit and receive at speeds
       greater than 20,000,000 but less than or equals to 650,000,000
       bits/second) packet-oriented network interfaces."
    ::= { diffServMIBGroups 10 }

diffServMIBVHCCounterGroup OBJECT-GROUP
    OBJECTS {
        diffServCountActOctets, diffServCountActHCOctets,
        diffServCountActPkts, diffServCountActHCPkts,
        diffServCountActDiscontTime, diffServCountActStatus,
        diffServAlgDropOctets, diffServAlgDropHCOctets,
        diffServAlgDropPkts, diffServAlgDropHCPkts
    }
    STATUS current
    DESCRIPTION
       "A collection of objects providing information specific to very-
       high speed (very-high speed interfaces transmit and receive at
       speeds greater than 650,000,000 bits/second) packet-oriented
       network interfaces."
    ::= { diffServMIBGroups 11 }

diffServMIBAlgDropGroup OBJECT-GROUP
    OBJECTS {
        diffServAlgDropType, diffServAlgDropNext,
        diffServAlgDropDiscontinuityTime,
        diffServAlgDropQMeasure, diffServAlgDropQThreshold,
        diffServAlgDropSpecific, diffServAlgDropStatus
    }
    STATUS current
    DESCRIPTION
       "The Algorithmic Drop Group contains the objects that describe
       algorithmic dropper operation and configuration."
    ::= { diffServMIBGroups 12 }

diffServMIBRandomDropGroup OBJECT-GROUP
    OBJECTS {
        diffServRandomDropMinThreshBytes,
        diffServRandomDropMinThreshPkts,
        diffServRandomDropMaxThreshBytes,
        diffServRandomDropMaxThreshPkts,
        diffServRandomDropProbMax,
        diffServRandomDropInvWeight,
        diffServRandomDropWeight,
        diffServRandomDropSamplingRate,
        diffServRandomDropStatus
    }
    STATUS current
    DESCRIPTION
       "The Random Drop Group augments the Algorithmic Drop Group for
       random dropper operation and configuration."

    ::= { diffServMIBGroups 13 }

diffServMIBQGroup OBJECT-GROUP
    OBJECTS {
        diffServQNext, diffServQRate, diffServQShaper,
        diffServQStatus
    }
    STATUS current
    DESCRIPTION
       "The Queue Group contains the objects that describe an
       interface's queues."
    ::= { diffServMIBGroups 14 }

diffServMIBSchedulerGroup OBJECT-GROUP
    OBJECTS {
        diffServSchedulerNext, diffServSchedulerMethod,
        diffServSchedulerRate, diffServSchedulerShaper,
        diffServSchedulerStatus
    }
    STATUS current
    DESCRIPTION
       "The Scheduler Group contains the objects that describe packet
       schedulers on interfaces."
    ::= { diffServMIBGroups 15 }

diffServMIBAssuredRateGroup OBJECT-GROUP
    OBJECTS {
        diffServAssuredRatePriority, diffServAssuredRateAbs,
        diffServAssuredRateRel, diffServShapingRateThreshold, diffServAssuredRateStatus
    }
    STATUS current
    DESCRIPTION
       "The Scheduler Parameter Group contains the objects that describe
       packet schedulers' parameters on interfaces."
    ::= { diffServMIBGroups 16 }

diffServMIBShapingRateGroup OBJECT-GROUP
    OBJECTS {
        diffServShapingRateAbs, diffServShapingRateRel,
        diffServShapingRateThreshold, diffServShapingRateStatus
    }
    STATUS current
    DESCRIPTION
       "The Scheduler Parameter Group contains the objects that describe
       packet schedulers' parameters on interfaces."
    ::= { diffServMIBGroups 17 }

diffServMIBStaticGroup OBJECT-GROUP
    OBJECTS {
        diffServClfrNextFree, diffServClfrElementNextFree,
        diffServSixTupleClfrNextFree, diffServMeterNextFree,
        diffServTBParamNextFree, diffServActionNextFree,
        diffServCountActNextFree, diffServAlgDropNextFree,
        diffServRandomDropNextFree, diffServQNextFree,
        diffServSchedulerNextFree, diffServAssuredRateNextFree,
        diffServShapingRateNextFree
    }
    STATUS current
    DESCRIPTION
       "The Static Group contains readable scalar objects used in
       creating unique identifiers for classifiers, meters, actions and
       queues. These are required whenever row creation operations on
       such tables are supported."
    ::= { diffServMIBGroups 18 }

END

8.

7.  Acknowledgments

This MIB builds on all the work that has gone into the Informal
Management Model for Diffserv Differentiated Services Routers, Diffserv Differentiated
Services PIB, and Diffserv Differentiated Services Policy MIB (SNMPCONF WG).

It has been developed with the active involvement of many people, but
most notably Yoram Bernet, Steve Blake, Brian Carpenter, Dave Durham,
Michael Fine, Victor Firoiu, Jeremy Greene, Dan Grossman, Roch Guerin,
Scott Hahn, Joel Halpern, Harrie Hazewinkel, Van Jacobsen, Keith
McCloghrie, Bob Moore, Kathleen Nichols, Ping Pan, Nabil Seddigh, John
Seligson, Walter Weiss, and Bert Wijnen.

9.

8.  Security Considerations

It is clear that this MIB is potentially useful for configuration, and
anything that can be configured can be misconfigured, with potentially
disastrous effect.

At this writing, no security holes have been identified beyond those
that SNMP Security is itself intended to address. These relate primarily
to controlled access to sensitive information and the ability to
configure a device - or which might result from operator error, which is
beyond the scope of any security architecture.

There are a number of many read-write and read-create management objects defined in
this MIB that have a
MAX-ACCESS clause of read-write and/or read-create. MIB. Such objects may be
considered are often sensitive or vulnerable in some network
environments. The support for SET operations in a non-secure environment
without proper protection can have a negative effect on network
operations. The use of SNMP Version 3 is recommended over prior versions
for configuration control as its security model is improved.

There are a number of managed objects in this MIB that may contain
information that may be sensitive from a business perspective, in that
they may represent a customer's service contract or the filters that the
service provider chooses to apply to a customer's ingress or egress
traffic. There are no objects which are sensitive in their own right,
such as passwords or monetary amounts.

It may be important to control even GET access to these objects and
possibly to even encrypt the values of these object when sending them
over the network via SNMP. Not all versions of SNMP provide features for
such a secure environment.

SNMPv1 by itself is not a secure environment. Even if the network itself
is secure (for example by using IPSec), even then, there is no control

as to who on the secure network is allowed to access and GET/SET
(read/change/create/delete) the objects in this MIB.

It is recommended that the implementers consider the security features
as provided by the SNMPv3 framework. Specifically, the use of the User-
based Security Model [12] and the View-based Access Control Model [15]
is recommended.

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
access to the objects only to those principals (users) that have
legitimate rights to indeed GET or SET (change/create/delete) them.

10.

9.  References

[1]  Harrington, D., Presuhn, R., and B. Wijnen, "An Architecture for
     Describing SNMP Management Frameworks", RFC 2571, Cabletron
     Systems, Inc., BMC Software, Inc., IBM T. J. Watson Research, April
     1999

[2]  Rose, M., and K. McCloghrie, "Structure and Identification of
     Management Information for TCP/IP-based Internets", RFC 1155, STD

[3]  Rose, M., and K. McCloghrie, "Concise MIB Definitions", RFC 1212,
     STD 16, Performance Systems International, Hughes LAN Systems,

[4]  M. Rose, "A Convention for Defining Traps for use with the SNMP",

[5]  McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M.,
     and S. Waldbusser, "Structure of Management Information Version 2
     (SMIv2)", RFC 2578, STD 58, Cisco Systems, SNMPinfo, TU
     Braunschweig, SNMP Research, First Virtual Holdings, International

[6]  McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M.,
     and S. Waldbusser, "Textual Conventions for SMIv2", RFC 2579, STD
     58, Cisco Systems, SNMPinfo, TU Braunschweig, SNMP Research, First

[7]  McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M.,
     and S. Waldbusser, "Conformance Statements for SMIv2", RFC 2580,
     STD 58, Cisco Systems, SNMPinfo, TU Braunschweig, SNMP Research,

[8]  Case, J., Fedor, M., Schoffstall, M., and J. Davin, "Simple Network
     Management Protocol", RFC 1157, STD 15, SNMP Research, Performance
     Systems International, Performance Systems International, MIT
     Laboratory for Computer Science, May 1990.

[9]  Case, J., McCloghrie, K., Rose, M., and S. Waldbusser,
     "Introduction to Community-based SNMPv2", RFC 1901, SNMP Research,
     Inc., Cisco Systems, Inc., Dover Beach Consulting, Inc.,
     International Network Services, January 1996.

[10] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Transport
     Mappings for Version 2 of the Simple Network Management Protocol
     (SNMPv2)", RFC 1906, SNMP Research, Inc., Cisco Systems, Inc.,
     Dover Beach Consulting, Inc., International Network Services,
     January 1996.

[11] Case, J., Harrington D., Presuhn R., and B. Wijnen, "Message
     Processing and Dispatching for the Simple Network Management
     Protocol (SNMP)", RFC 2572, SNMP Research, Inc., Cabletron Systems,

[12] Blumenthal, U., and B. Wijnen, "User-based Security Model (USM) for
     version 3 of the Simple Network Management Protocol (SNMPv3)", RFC

[13] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Protocol
     Operations for Version 2 of the Simple Network Management Protocol
     (SNMPv2)", RFC 1905, SNMP Research, Inc., Cisco Systems, Inc.,
     Dover Beach Consulting, Inc., International Network Services,
     January 1996.

[14] Levi, D., Meyer, P., and B. Stewart, "SNMPv3 Applications", RFC
     2573, SNMP Research, Inc., Secure Computing Corporation, Cisco

[15] Wijnen, B., Presuhn, R., and K. McCloghrie, "View-based Access
     Control Model (VACM) for the Simple Network Management Protocol
     (SNMP)", RFC 2575, IBM T. J. Watson Research, BMC Software, Inc.,

[16] Case, J., Mundy, R., Partain, D., and B. Stewart, "Introduction to
     Version 3 of the Internet-standard Network Management Framework",
     RFC 2570, SNMP Research, Inc., TIS Labs at Network Associates,

[ACTQMGMT]
     V. Firoiu, M. Borden "A Study of Active Queue Management for
     Congestion Control", March 2000, In IEEE Infocom 2000,
     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]
     J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, "Assured Forwarding
     PHB Group.", RFC 2597, June 1999.

[DSARCH]
     S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, "An
     Architecture for Differentiated Service", RFC 2475, December 1998.

[DSFIELD]
     K. Nichols, S. Blake, F. Baker, D. Black, "Definition of the
     Differentiated Services Field (DS Field) in the IPv4 and IPv6
     Headers", RFC 2474, December 1998.

[DSPIB]
     M. Fine, K. McCloghrie, J. Seligson, K. Chan, S. Hahn, A. Smith,
     "Differentiated Services Policy Information Base", Internet Draft

[DSTERMS]
     D. Grossman, "New Terminology for Diffserv", Differentiated Services",
     Internet Draft
     <draft-ietf-diffserv-new-terms-02.txt>, <draft-ietf-Differentiated Services-new-terms-
     02.txt>, November 1999.

[EF-PHB]
     V. Jacobson, K. Nichols, K. Poduri, "An Expedited Forwarding PHB."
     RFC 2598, June 1999.

[IFMIB]
     K. McCloghrie, F. Kastenholz, "The Interfaces Group MIB using
     SMIv2", RFC 2233, November 1997.

[INETADDRESS]
     Daniele, M., Haberman, B., Routhier, S., Schoenwaelder, J.,
     "Textual Conventions for Internet Network Addresses.", draft-ietf-
     ops-rfc2851-update-00.txt. [PRIVATE NOTE TO RFC EDITOR: YES, THIS
     IS INDEED A NORMATIVE REFERENCE. JUERGEN TELLS ME THAT HE WILL
     PUBLISH IT POSTE HASTE].

[INTSERVMIB]
     F. Baker, J. Krawczyk, A. Sastry, "Integrated Services Management
     Information Base using SMIv2", RFC 2213, September 1997.

[MODEL]
     Y. Bernet, S. Blake, A. Smith, D. Grossman, "An Informal Management
     Model for Diffserv Differentiated Services Routers", Internet Draft <draft-ietf-diffserv-
     model-04.txt>, <draft-
     ietf-Differentiated Services-model-04.txt>, July 2000.

[POLTERM]
     F. Reichmeyer,  D. Grossman, J. Strassner, M. Condell, "A Common
     Terminology for Policy Management", Internet Draft <draft-

[QUEUEMGMT]
     B. Braden et al., "Recommendations on Queue Management and
     Congestion Avoidance in the Internet", RFC 2309, April 1998.

[RED93]
     "Random Early Detection", 1993.

[SRTCM]
     J. Heinanen, R. Guerin, "A Single Rate Three Color Marker", RFC
     2697, September 1999.

[TRTCM]
     J. Heinanen, R. Guerin, "A Two Rate Three Color Marker", RFC 2698,
     September 1999.

[TSWTCM]
     W. Fang, N. Seddigh, B. Nandy "A Time Sliding Window Three Colour
     Marker", RFC 2859, June 2000.

[SHAPER]
     "A Rate Adaptive Shaper for Differentiated Services" FC 2963,
     October 2000.

11.

10.  Authors' Addresses

     Fred Baker
     Cisco Systems
     519 Lado Drive
     Santa Barbara, California 93111
     fred@cisco.com
     Kwok Ho Chan
     Nortel Networks
     600 Technology Park Drive
     Billerica, MA 01821
     khchan@nortelnetworks.com

     Andrew Smith
     Allegro Networks
     6399 San Ignacio Ave
     San Jose, CA 95119
     andrew@allegronetworks.com

Table of Contents

1 The SNMP Management Framework ...................................    2
2 Introduction .................................................... Relationship to other working group documents ...................    3
2.1  Relationship  to  the   Informal   Management   Model   for  Diffserv
     Differentiated Services Router ....................................................... ...............................    3
2.2 Relationship to other MIBs and Policy Management ..............    4
2.3
3 MIB Overview .................................................. ....................................................    4
3 Structure of this MIB ...........................................    5
3.1 Diffserv Data Paths ...........................................    6 Processing Path ...............................................    5
3.1.1 diffServDataPathTable - The Data Path Table ............................................. .................    6
3.2 Classifiers ................................................... Classifier ....................................................    6
3.2.1 Classifier Table ............................................    8
3.2.2 diffServClfrElementTable - The Classifier Element Table ....................................    8
3.2.3 Filter Table .....    7
3.2.2 diffServSixTupleClfrTable - IP The Six-Tuple Classifier Table ................
     ..............................................................    8
3.3 Meters ........................................................    8 Metering Traffic ..............................................    9
3.3.1 diffServMeterTable - The Meter Table .................................................    9 ........................   10
3.3.2 Token-Bucket Meter diffServTBParamTable - The Token Bucket  Parameters  Table ....................................    9
     ..............................................................   10
3.4 Actions .......................................................    9 applied to packets ....................................   11
3.4.1 DSCP Mark diffServActionTable - The Action Table ......................................   10 ......................   12
3.4.2 diffServCountActTable - The Count Action Table ..........................................   10 ..............   12
3.4.3 Absolute Drop diffServDscpMarkActTable - The Mark Action ........................................   10 Table ............   13
3.4.4 diffServAlgDropTable - The Algorithmic Drop Table ...........   13
3.4.5 diffServRandomDropTable - The Random Drop Parameters Table
     ..............................................................   14
3.5 Queuing Elements ..............................................   10 and Scheduling of Packets .............................   16
3.5.1 Algorithmic Dropper diffServQTable - The Class or Queue Table ...................................   10 ...................   16
3.5.2 Random Dropper diffServSchedulerTable - The Scheduler Table ........................................   12 ................   17
3.5.3 Queues and Schedulers .......................................   13
4 MIB Usage Example ...............................................   15
4.1 Model's Example ...............................................   15
4.2 Additional Data Path Example .................................. diffServAssuredRateTable - The Assured Rate Table ...........   17
3.5.4 diffServShapingRateTable - The Shaping Rate Table ...........   18
4.2.1 Data Path
3.5.5 Using queues and Classifier Example Discussion ................. schedulers together ........................   18
4.2.2 Meter and Action
3.6 Example Discussion ......................... configuration for AF and EF ...........................   21
4.2.3 Queue
3.6.1 AF and Scheduler Example Discussion ...................... EF Ingress Interface Configuration ...................   21
5
3.6.1.1 Classification In The Example .............................   23

3.6.1.2 AF Implementation On an Ingress Edge Interface ............   24
3.6.1.2.1 AF Metering On an Ingress Edge Interface ................   24
3.6.1.2.2 AF Actions On an Ingress Edge Interface .................   24
3.6.1.3 EF Implementation On an Ingress Edge Interface ............   25
3.6.1.3.1 EF Metering On an Ingress Edge Interface ................   25
3.6.1.3.2 EF Actions On an Ingress Edge Interface .................   25
3.7 AF and EF Egress Edge Interface Configuration .................   25
3.7.1 Classification On an Egress Edge Interface ..................   25
3.7.2 AF Implementation On an Egress Edge Interface ...............   27
3.7.2.1 AF Metering On an Egress Edge Interface ...................   27
3.7.2.2 AF Actions On an Egress Edge Interface ....................   28
3.7.2.3 AF Rate-based Queuing On an Egress Edge Interface .........   28
3.7.3 EF Implementation On an Egress Edge Interface ...............   28
3.7.3.1 EF Metering On an Egress Edge Interface ...................   29
3.7.3.2 EF Actions On an Egress Edge Interface ....................   29
3.7.3.3 EF Priority Queuing On an Egress Edge Interface ...........   29
4 Conventions used in this MIB ....................................   22
5.1   29
4.1 The use of RowPointer to indicate data path linkage ...........   22

5.2   29
4.2 The use of RowPointer to indicate parameters ..................   23
5.3   30
4.3 Conceptual row creation and deletion ..........................   23
6   31
5 Extending this MIB ..............................................   24
7   31
6 MIB Definition ..................................................   25
8   33
7 Acknowledgments .................................................   97
9  104
8 Security Considerations .........................................   97
10  104
9 References .....................................................   98
11 ......................................................  105
10 Authors' Addresses .............................................  101

12.  108

11.  Full Copyright

   Copyright (C) The Internet Society (2000). All Rights Reserved.

   This document and translations of it may be copied and furnished to
   others, and derivative works that comment on or otherwise explain it
   or assist in its implementation may be prepared, copied, published
   and distributed, in whole or in part, without restriction of any
   kind, provided that the above copyright notice and this paragraph are
   included on all such copies and derivative works. However, this
   document itself may not be modified in any way, such as by removing
   the copyright notice or references to the Internet Society or other
   Internet organizations, except as needed for the purpose of
   developing Internet standards in which case the procedures for
   copyrights defined in the Internet Standards process must be
   followed, or as required to translate it into languages other than
   English.

   The limited permissions granted above are perpetual and will not be
   revoked by the Internet Society or its successors or assigns.

   This document and the information contained herein is provided on an
   "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING
   TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING
   BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION
   HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF
   MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.