view Side-By-Side changes

Internet Engineering Task Force                                 F. Baker
Diffserv Working Group                                     Cisco Systems
INTERNET-DRAFT                                                   K. Chan
Expires January June 2001                                        Nortel Networks
draft-ietf-diffserv-mib-04.txt
draft-ietf-diffserv-mib-05.txt                                  A. Smith
                                                                <editor>
                                                               July
                                                           November 2000
                  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 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. The charter for Differentiated Services may be found
at http://www.ietf.org/html.charters/diffserv-charter.html

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


Abstract

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





Baker, Chan, Smith         Expires January June 2001            [Page 1]




Internet Draft        Differentiated Services MIB             July          November 2000


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





Baker, Chan, Smith         Expires June 2001            [Page 2]




Internet Draft        Differentiated Services MIB          November 2000


readable information is not considered to change the semantics of the
MIB.

Baker, Chan, Smith         Expires January June 2001            [Page 2] 3]




Internet Draft        Differentiated Services MIB             July          November 2000


2.  Introduction

2.1.  Relationship to the Diffserv Informal Management Model

This MIB is designed according to the Differentiated Services Informal
Management Model documented in [MODEL]. The model describes the way that
ingress and egress interfaces of an 'n'-port router are modelled. It
describes the configuration and management of a Diffserv interface in
terms of a Transmission Control Traffic Conditioning Block (TCB) which contains, by
definition, zero or more classifiers, meters, actions, algorithmic
droppers, queues and schedulers. These elements are arranged according
to the QoS policy being expressed, always in that order. Traffic may be
classified; classified traffic may be 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 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}, this must be modelled by
cascading multiple TCBs.

The MIB represents this cascade by following the "Next" attributes of
the various elements. They indicate what the next step in Diffserv
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 - it only
refers in passing to the higher-level TCBs.  The
higher level concept of a TCB when is not required in the parameterization or
in the linking together of the individual elements, hence it is
necessary to distinguish not used
in the MIB itself and only mentioned in the text for relating the MIB
with the [MODEL].  The actual distinguishing of which TCB, of several, TCB a particular specific
element is a part.  Literal TCBs are enumerated for Classifier elements: this part of is
necessary to distinguish different, but overlapping, classification
policies in different TCBs. However, TCBs are not enumerated needed for other
elements. When the instructmentation of a TCB performs no classification device
to support the literal functionalities of DiffServ, but it is useful for
conceptual reasons.  By not including TCB notion in its parameters, this
MIB allow any grouping of the
succeeding elements to construct TCBs, using rules
indicated by the [MODEL].  This will minimize changes to this MIB if
rules in [MODEL] changes.

The notion of a Data Path is not used in their instance (index) as there is no
need this MIB to distinguish them - each element indicate the DiffServ
processing a packet may experience.  This Data Path is unique already. distinguished
based on the Interface and the Direction of the flow the packet is part
of.  A Data Path Table Entry indicates the first of possibly multiple
elements that will apply DiffServ treatment to the packet.

Baker, Chan, Smith         Expires June 2001            [Page 4]




Internet Draft        Differentiated Services MIB          November 2000


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 the Diffserv Informal
Management Model for management.  These elements are instantiated in a
very detailed manner, typically indexed by interface, direction and
other indices. The concept designed with their
parameterization tables separated from their data path linkage tables,
allowing reuse of "interface" is each table as for the
InterfaceIndex/ifIndex of the IETF Interfaces much as possible.  The data path linkage
in this MIB [IFMIB].






Baker, Chan, Smith        Expires January 2001          [Page 3]

Internet Draft         Differentiated Services is coupled with interface thru the use of
diffServDataPathTable.  The concept of "interface" is as for the
InterfaceIndex/ifIndex of the IETF Interfaces MIB             July 2000 [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 functionality are likely e.g. some form of "Per-
Hop
"Per-Hop Behaviour"-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 but with
different indexing variables e.g. MIB, especially
the parameterization tables.  The Data Path table will help in the reuse
of the data path linkage tables by mechanically replacing having the interface specific
information centralized, allowing easier mechanical replacement of
ifIndex by some sort of "roleIndex".  Work is ongoing in this area.

2.3.  MIB Overview

This MIB is structured based on the need to describe the sequential
DiffServ treatments being applied to a packet, and the parameterization
of these treatments.  These two requirements are kept separate thru out
the design of this MIB, and are full-filled using separate tables and
data definitions.

In this MIB, we model the ingress and egress portions of a router DiffServ
network device identically, making the distinction between them an index
variable. Each interface then performs some or all of the following
high-level functions:

o    Classify each packet according to some set of rules

o    Determine whether the packet's data stream the packet is part of  is within conforming or outside not
     conforming to its rate permitted rates

Baker, Chan, Smith         Expires June 2001            [Page 5]




Internet Draft        Differentiated Services MIB          November 2000


o    Perform a set of resulting actions, possibly including counting the
     traffic, application of an appropriate drop policy and marking of
     the traffic with a Differentiated Services Code Point (DSCP) as
     defined in [DSFIELD].

o    Enqueue the traffic for output in the appropriate queue, whose
     scheduler may shape the traffic or simply forward it with some
     minimum rate or maximum latency.

The MIB therefore contains the following elements:

Data Path Table
     A general extensible framework for describing the starting point of
     DiffServ datapaths within a single DiffServ device.  This table
     descibes interface and interface direction specific data paths.

Classifier and Filter Tables
     A general extensible framework and one example of a
     parameterization table - filter table (an IP Six-Tuple Multi-Field
     Classification Table).

Meter Tables
     A general extensible framework and one example (an exponential
     weighted moving average meter).






Baker, Chan, Smith        Expires January 2001          [Page 4]

Internet Draft         Differentiated Services MIB             July 2000 of 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 of parameterization
     tables for Absolute Drop, Mark and Count actions.  The
     "multiplexer", "replicator" and "null" actions described in [MODEL]
     are accomplished implicitly by means of the RowPointer structures
     of the other elements.

Queue, Scheduler and Algorithmic Dropper Tables
     Queue, Scheduler
     A general extensible framework for parameterizing queuing and Algorithmic Dropper Tables.
     scheduler systems.  The queue measurement dependent algorithmic
     droppers are also described here.

3.  Structure of this MIB

3.1.  Classifiers

The classifier and filter tables determine how traffic

This MIB is sorted out.
They identify separable classes structured with separate tables for purpose 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, Queue, Scheduler DiffServ data
path description and Algorithmic Dropper elements.  For
example, to indicate a multi-stage meter, sub-classes DiffServ treatment parameterization of traffic may the DiffServ
device.  The data path description and/or the treatment parameterization
tables can each be
sent reuse independently, allowing the flexibility to different meter stages: e.g. in an implementation
maintain a common data construct for DiffServ device configuration and
provisioning, independent of the Assured
Forwarding (AF) PHB [AF-PHB], AF11 traffic might be sent configuration/provisioning method used.





Baker, Chan, Smith         Expires June 2001            [Page 6]




Internet Draft        Differentiated Services MIB          November 2000


The definitions in this MIB are intented to the first
meter, AF12 traffic might be sent to reused by the second DiffServ
PIB and AF13 traffic sent to
the second meter stage's out-of-profile action.

3.1.1.  Classifier Table SNMPCONF working group's DiffServ Policy MIB.  The structure of the classifier table, as described in [MODEL], is a
sequence treatment
parameters can also be reused by other IP based technologies.  For
example, IP packet filtering parameters most likely can be reused by
other IP based technologies.

3.1.  DiffServ Data Paths

This part of unambiguous tests. Within each stage in the sequence, it
must not be important in which order MIB provide instrumentation for connecting the tests are made. This is to
facilitate optimized implementations such as index trees. Order is
present only DiffServ
Functional Elements within a single DiffServ device.  Please refer to resolve ambiguity:
the [MODEL] for that reason discussions on the stage in valid sequencing and grouping of
DiffServ Functional Elements.  Given some basic information, e.g.
ifIndex and interface direction, the
sequence first DiffServ Functional Element
is referred to here and in [MODEL] as determined.  Subsequent DiffServ Functional Elements are provided by
the "precedence" "Next" pointer attribute of the
classifier stage: stages with higher values of precedence are compared
first; the order each entry of tests for entries data path tables.
Description of the same precedence how this "Next" pointer is
unimportant.

An important form used in each table is provided
in their respective section.

The data path can be redefined to allow a different level of classifier control
other than interface level control currently defined in this MIB.  There
is "everything else": on-going work in this area, most notably the final stage development of Policy
Information Base in DiffServ and RAP working groups, and DiffServ Policy
MIB in SNMPCONF working group.

3.1.1.  Data Path Table

Entries in the classifier i.e. the one with the lowest precedence, must be
"complete" since Data Path Table provide the result DiffServ treatment starting
points for all packets of an incomplete classifier this DiffServ device. Each entry in this table
is not
necessarily deterministic - see [MODEL] section 4.1.2.

The definition indexed by ifIndex and the direction of the actual filter to packet flow.  There
should be used by at most two entries for each interface, one for ingress and
one for egress.  Each entry provides the classifier is
referenced via first DiffServ Functional
Element each packet at a RowPointer: specific interface traveling a specific
relative direction should experience.  Notice this enables table is interface
specific, with the use of any sort ifIndex.  As indicated in section 2.2, with
some modification/extension of filter
table that one might wish the Data Path Table, most of the tables
and their entries are reusable by other Policy Management mechanisms.
For indication of none existence of DiffServ Treatments, entries can be
created with zeroDotZero in the diffServDataPathStart attribute to design, standard or proprietary.
indicate this explicitly.  The filter
table may be, but does none existence of DiffServ Treatment can
also be indicated implicitly by not need having the entry at all. The
explicit/implicit selection is up to be, defined the implementation.  This means
allow normal IP device processing when zeroDotZero is used in the
diffServDataPathStart attribute, or when the entry does not exist.
Normal IP device processing will depend on the device, for example, this MIB module.
can be forwarding the packet.

Baker, Chan, Smith         Expires January June 2001            [Page 5] 7]




Internet Draft        Differentiated Services MIB             July          November 2000


3.2.  Classifiers

The classifiers specified here are at the interface level i.e. they are
indexed classifier, classifier element, and filter tables determine how
traffic is sorted out. They identify separable classes of traffic, by ifIndex: they
reference to an appropriate filter, which may be derived select anything from some more general policies
e.g. something based on interface roles, but such discussion an
individual micro-flow to aggregates identified by DSCP.

The classification is outside
the scope of this document. See e.g. [POLTERM] section 4 for used to send these separate streams to appropriate
Meter, Action, Queue, Scheduler and Algorithmic Dropper elements. For
example, to indicate a
discussion multi-stage meter, sub-classes of Roles.

3.1.2.  IP Six-Tuple Classifier Table

This MIB includes a definition for an IP Six-Tuple Classifier, used for
IP traffic classification. Entries may be
sent to different meter stages: e.g. in this filter table are referenced
from the RowPointer diffServClassifierPattern attributes of classifier
table entries.

A Behavior Aggregate (BA) Classifier, acting only on DSCPs, is a simple
form an implementation of the IP Six-Tuple Classifier. It is represented by having Assured
Forwarding (AF) PHB [AF-PHB], AF11 traffic might be sent to the
diffServSixTupleClfrDscp attribute set first
meter, AF12 traffic might be sent to the desired DSCP second and all other
classification attributes set AF13 traffic sent to match-all, their default settings.
the second meter stage's out-of-profile action.

The
alternative approach concept of providing a specific definition in this MIB for
a BA Classifier was discussed and rejected.

Each entry in classifier is the IP Six-Tuple Classifier Table defines a single filter. same as described in [MODEL].  The textual convention
structure of InetAddress [INETADDR] is used for both IPv4 the classifier and IPv6 addressing.  The use of IP Six-Tuple Classifiers classifier element tables, is discussed the same
as the classifier described in [DSARCH] and abstract examples of how they might [MODEL].  Within each classifier, it must
not be configured are
provided important in [MODEL].

3.2.  Meters

A meter, according to [MODEL] section 5, measures the rate at which
packets making up a stream of traffic pass it, compares this rate order the tests are made. This is to
some set
facilitate optimized implementations such as index trees. Order is
present only to resolve ambiguity, by use of thresholds "order" here and produces some number (two or more)
"precedence" in [MODEL].  Filter with higher values of
potential results. order are
compared first; the order of tests for entries of the same order is
unimportant.

A given packet datapath may consist of more than one classifier.  There may be
overlap of filter specification between filters of different
classifiers.  The first classifier functional datapath element
encountered, as determined by the sequencing of diffserv functional
datapath elements, will be used first.

An important form of classifier is said to "conform" to "everything else": the meter if,
at final stage of
the time that classifier i.e. the packet one with the lowest precedence, must be
"complete" since the result of an incomplete classifier is being looked at, not
necessarily deterministic - see [MODEL] section 4.1.2.

The definition of the stream appears actual filter to be
within used by the meter's profile. MIB syntax makes it easiest to define this
as a sequence of one or more cascaded pass/fail tests, modeled here as
if-then-else constructs.  It is important to understand that this way of
modelling does not imply anything about the implementation being
"sequential": multi-rate/multi-profile meters e.g. those designed to
support [SRTCM] or [TRTCM], can still be modelled this way even if they,
of necessity, share information between the stages: the stages are
introduced merely as a notational convenience in order to simplify the
MIB structure.

3.2.1.  Meter Table

The generic meter table is used as a base for all more specific forms of
meter.  The definition of parameters specific to the type of meter used





Baker, Chan, Smith        Expires January 2001          [Page 6]

Internet Draft         Differentiated Services MIB             July 2000 classifier is
referenced via a pointer to a table containing those specifics with
the instance within that table identified by the same indices as for the
base meter table.  This RowPointer: this enables the use of any sort of specific meter filter
table that one might wish to design, standard or proprietary. The
specific meter filter
table may be, but does not need to be, defined in this MIB module.

3.2.2.  Token-Bucket Meter Table

This is included as an example of a common type of meter.  Entries in
this table

The classifiers specified here are referenced at the interface level, they may be
derived from some more general policies e.g. something based on
interface roles, but such discussion is outside the RowPointer diffServMeterSpecific
attributes scope of meter table entries.  The parameters this
document. See e.g. [POLTERM] section 4 for a discussion of Roles.

Baker, Chan, Smith         Expires June 2001            [Page 8]




Internet Draft        Differentiated Services MIB          November 2000


3.2.1.  Classifier Table

Classifiers are represented organized by a
rate diffServTBMeterRate and a burst size diffServTBMeterBurstSize.


3.3.  Actions

Actions include "no action", "mark entries of the traffic with Classifier Table.  With each
entry corresponds to a DSCP", "drop the
traffic" or "count it". Other tasks such as "shape single Classifier.  It is the traffic" or "drop
based on some algorithm" are handled elsewhere as queueing mechanisms,
rather than actions, consistent with [MODEL].  The "multiplexer",
"replicator" and "null" actions described entries in [MODEL] are accomplished
implicitly by means of the RowPointer structures
Classifier Table that get linked from the upstream diffserv functional
datapath element, i.e. an entry in diffServDataPathTable.  A data path
may consist of more than one Classifier, the other elements.

This MIB uses order the Action Table diffServActionTable classification
processes aplies 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 is the last action entry in same as the chain
points to order the next element classifier
table entries are linked in the TCB, if any, e.g.  a Queueing element.
It may also point at a next TCB.

The parameters needed for each Action element will depend on data path.

3.2.2.  Classifier Element Table

While the type Classifier Table entries handles the input side of
Action to be taken. Hence there are specific Action Tables for all the
different Action types.  This flexibility allows additional Actions be
specified in future revisions
Classifier, the Classifier Element Table enumerates each branch of this MIB, or in other MIBs and also
allows the
fan-out of a Classifier, associating each fan-out branch with a Filter
for discriminating the use traffic for that branch. Each Classifier Element
table entry is part of proprietary Actions without impact on those
defined here.

3.3.1.  DSCP Mark Action a Classifier, indicated by
diffServClfrElementClfrId.

3.2.3.  Filter Table - IP Six-Tuple Classifier Table

This Action is applied to MIB includes one Filter Table, a definition for an IP Six-Tuple
Classifier, used for IP traffic classification. Entries in order this filter
table are referenced from the RowPointer diffServClfrElementSpecific
attributes of classifier element table entries.


A Behavior Aggregate (BA) Classifier, acting only on DSCPs, is a simple
form of the IP Six-Tuple Classifier. It is represented by having the
diffServSixTupleClfrDscp attribute set to mark it with the desired DSCP and all other
classification attributes set to match-all, their default settings. The
alternative approach of providing a Diffserv
Codepoint (DSCP) value, specified specific definition in this MIB for
a BA Classifier was discussed and rejected.


Each entry in the diffServDscpMarkActTable.
Other marking actions IP Six-Tuple Classifier Table defines a single filter.
The textual convention of InetAddress [INETADDR] is used for both IPv4
and IPv6 addressing.  The use of IP Six-Tuple Classifiers is discussed
in [DSARCH] and abstract examples of how they might be specified elsewhere - these configured are outside
provided in [MODEL].


3.3.  Meters

A meter, according to [MODEL] section 5, measures the scope rate at which
packets making up a stream of traffic pass it, compares this MIB. rate to
some set of thresholds and produces some number (two or more) of





Baker, Chan, Smith         Expires January June 2001            [Page 7] 9]




Internet Draft        Differentiated Services MIB             July          November 2000


3.3.2.  Count Action Table

Count Actions are used


potential results. A given packet is said to "conform" to count the traffic passing along a particular
path through meter if,
at the model. If specified, they are likely to be placed
first, before other types of Action. For example, when both a Count and
an Absolute Dropper Action are specified, time that the Count Action needs to
count packet is being looked at, the traffic stream before any traffic gets dropped.  Note that
there are counters contained directly in Algorithmic Dropper elements appears to
indicate be
within the amount meter's profile. MIB syntax makes it easiest to define this
as a sequence of traffic dropped by one or more cascaded pass/fail tests, modeled here as
if-then-else constructs. It is important to understand that this way of
modelling does not imply anything about the implementation being
"sequential": multi-rate/multi-profile meters e.g. those elements.

Counters designed to
support [SRTCM] or [TRTCM], can still be modelled this way even if they,
of necessity, share information between the stages: the stages are arranged in
introduced merely as a single notational convenience in order to simplify the
MIB structure.

3.3.1.  Meter Table

The generic meter table but with separate conformance
statements is used as a base for low-speed and high-speed interfaces, consistent with
[IFMIB].

3.3.3.  Absolute Drop Action

This action just silently discards all traffic presented to it, without
counting it. This action has no additional more specific forms of
meter.  The definition of parameters and so specific to the type of meter used
is
represented only as referenced via a diffServActionSpecific pointing pointer to
diffServAbsoluteDropAction without any specific parameters.

3.4.  Queueing Elements

These include Algorithmic Droppers, Queues and Schedulers which are all
inter-related in their a table containing those specifics.  This
enables the use of queueing techniques.

3.4.1.  Algorithmic Dropper Table

Algorithmic Droppers have a close relationship with queueing: they are
represented in this MIB by entries in an Algorithmic Dropper Table.
Entries contain a diffServAlgDropNext attribute which indicates any sort of specific meter table that one might wish
to which
queue they sink their traffic.

An Algorithmic Dropper is assumed design, standard or proprietary. The specific meter table may be, but
does not need to operate indiscriminately on all
packets that are presented at its input. If it be, defined in this MIB module.

3.3.2.  Token-Bucket Meter Table

This is necessary to perform
additional classification on the stream then included as an example of a separate TCB must be
introduced at common type of meter.  Entries in
this point: Classifier elements here can then distinguish table are referenced from the different types RowPointer diffServMeterSpecific
attributes of traffic on which dropping is to act and the
treatment for each type is described meter table entries.  The parameters are represented by a separate diffServAlgDropEntry.

Algorithmic Droppers may also contain
rate diffServTBMeterRate, a pointer to specific detail of
the drop algorithm. This MIB defines the detail for three drop
algorithms: Tail Drop, Head Drop burst size diffServTBMeterBurstSize, and Random Drop; other algorithms an
interval diffServTBMeterInterval.  How these parameters are
outside used depends
on the scope type of meter being parameterized, this MIB modele but the general framework is
intended to allow for their inclusion via provided by the
diffServTBMeterType attribute.  Additional meter parameterization tables
can be defined in this or other MIB modules.







Baker, Chan, Smith        Expires January 2001          [Page 8]

Internet Draft         Differentiated Services MIB             July 2000


One generally-applicable parameter of a dropper is when necessary.

3.4.  Actions

Actions include "no action", "mark the specification of traffic with a queue-depth threshold at which some drop action is to start. This is
represented in this MIB, as a base attribute of DSCP", "drop the Algorithmic Dropper
entry, by pointing to
traffic" or "count it". Other tasks such as "shape the queue for which depth is to be compared traffic" or "drop
based on some algorithm" are handled elsewhere as queueing mechanisms,
rather than actions, consistent with [MODEL].  The "multiplexer",
"replicator" and
the depth threshold to compare against.

o    A Tail Dropper requires the specification "null" actions described in [MODEL] are accomplished
implicitly by means of a maximum queue depth
     threshold: when the queue pointed at by diffServAlgDropQMeasure
     reaches that depth threshold, diffServAlgDropQThresh, any new
     traffic arriving at RowPointer structures of the dropper is discarded. other elements.

This algorithm MIB uses
     only parameters that are part of the diffServAlgDropEntry.

o    A Head Dropper requires Action Table diffServActionTable to organize one
Action's relationship with the specification of element(s) before and after it. It allows
Actions to be cascaded to enable multiple Actions be applied to a maximum queue depth
     threshold: when the queue pointed at by diffServAlgDropQMeasure
     reaches that depth threshold, diffServAlgDropQThresh, single
traffic
     currently at the head stream by using each entry's diffServActionNext attribute.  The
diffServActionNext attribute of the queue is discarded. This algorithm
     uses only parameters that are part of last action entry in the diffServAlgDropEntry.

o    Random Droppers are recommended as a way chain
points to control congestion, in
     [QUEUEMGMT] and called for the next element in the [AF-PHB]. Various implementations
     exist, which agree on marking or dropping just enough traffic to
     communicate with TCP-like protocols about congestion avoidance, but
     differ markedly on their specific parameters. This MIB attempts to
     offer TCB, if any, e.g.  a minimal set of controls Queueing element.





Baker, Chan, Smith         Expires June 2001           [Page 10]




Internet Draft        Differentiated Services MIB          November 2000


It may also point at a next TCB.

The parameters needed for any random dropper, but expects
     that vendors each Action element will augment the table with additional controls and
     status in accordance with their implementation. This algorithm
     requires additional parameters depend on top the type of those in
     diffServAlgDropEntry: these
Action to be taken. Hence there are discussed below.

3.4.2.  Random Dropper Table

One example of a random dropper is a RED-like dropper.  An example of specific Action Tables for all the representation chosen
different Action types.  This flexibility allows additional Actions be
specified in future revisions of this MIB MIB, or in other MIBs and also
allows for this element the use of proprietary Actions without impact on those
defined here.

3.4.1.  DSCP Mark Action Table

This Action is shown applied to traffic in
Figure 1.

Random droppers often have their drop probability function described as order to mark it with a plot of drop probability (P) against averaged queue length (Q).
(Qmin,Pmin) then defines the start of Diffserv
Codepoint (DSCP) value, specified in the characteristic plot.  Normally
Pmin=0, meaning with average queue length below Qmin, there will diffServDscpMarkActTable. Other
marking actions might be no
drops.  (Qmax,Pmax) defines a "knee" on specified elsewhere - these are outside the plot, after which point
scope of this MIB.

3.4.2.  Count Action Table

Count Actions are used to count the
drop probability become more progressive (greater slope).  (Qclip,1)
defines traffic passing along a particular
path through the queue length at which all packets will model. If specified, they are likely to be placed
first, before other types of Action. For example, when both a Count and
an Absolute Dropper Action are specified, the Count Action needs to
count the traffic stream before any traffic gets dropped. Notice
this is different from Tail  Note that
there are counters contained directly in Algorithmic Dropper elements to
indicate the amount of traffic dropped by those elements.

Counters are arranged in a single table but with separate conformance
statements for low-speed and high-speed interfaces, consistent with
[IFMIB].

3.4.3.  Absolute Drop because Action

This action just silently discards all traffic presented to it, without
counting it. This action has no additional parameters and so is
represented only within diffServActionType without its specific table.

3.5.  Queueing Elements

These include Algorithmic Droppers, Queues and Schedulers which are all
inter-related in their use of queueing techniques.

3.5.1.  Algorithmic Dropper Table

Algorithmic Droppers have a close relationship with queueing: they are
represented in this uses MIB by entries in an averaged Algorithmic Dropper Table.
Entries contain a diffServAlgDropNext attribute which indicates to which
queue
length.  although it is possible for Qclip = Qmax. In the MIB module,
diffServRandomDropMinThreshBytes and diffServRandomDropMinThreshPkts
represent Qmin.  diffServRandomDropMaxThreshBytes and
diffServRandomDropMaxThreshPkts represent Qmax. they sink their traffic.





Baker, Chan, Smith         Expires January June 2001           [Page 9] 11]




Internet Draft        Differentiated Services MIB             July          November 2000




      +-------------+      +-----------+
  --->| Next   --------+-->| Next    --------->


An Algorithmic Dropper is assumed to Scheduler
      | Thresh=100k |  |   | Min=none  |
      | Measure -------+   | Max=none  |
      | Type=random |      | Pri=10    |
      | Specif  -------+   | Type=fifo |
      +-------------+  |   +-----------+
        AlgDrop.3      |  Queue.ifIndex.4
                       |
                       |   +--------------+
                       +-->| Minthresh=10k|
                           | Maxthresh=80k|
                           | Weight=1/16  |
                           | ProbMax= 0.5 |
                           +--------------+
                            RandomDrop.3

  Figure 1: Example Use of the RandomDropTable for Random Droppers

diffServRandomDropProbMax represents Pmax. This MIB does not represent
Pmin (assumed to be zero unless otherwise represented) or Qclip (assumed
to be Qmax unless otherwise represented).

Each random dropper specification operate indiscriminately on all
packets that are presented at its input. If it is associated with necessary to perform
additional classification on the stream then a queue. This
allows multiple drop processes (of same or different types) separate TCB must be
associated with
introduced at this point: Classifier elements here can then distinguish
the same queue, as different PHB implementations may
require.  This also allows for sequences of multiple droppers if
necessary.

The calculation types of traffic on which dropping is to act and the
treatment for each type is described by a smoothed queue length separate diffServAlgDropEntry.

Algorithmic Droppers may also have an important
bearing on the behaviour contain a pointer to specific detail of
the dropper: parameters may include drop algorithm, diffServAlgDropSpecific. This MIB defines the
sampling interval detail
for three drop algorithms: Tail Drop, Head Drop and Random Drop; other
algorithms are outside the weight scope of each sample. The performance may be
very sensitive to this MIB module but the values general
framework is intended to allow for their inclusion via other MIB
modules.

One generally-applicable parameter of these parameters and a wide range dropper is the specification of
possible values may be required due
a queue-depth threshold at which some drop action is to start. This is
represented in this MIB, as a wide range base attribute, diffServAlgDropQThreshold,
of link speeds. Most
algorithms include a sample weight, represented here the Algorithmic Dropper entry.  The queue for which depth is to be
compared and the depth threshold to compare against, is specified with
diffServAlgDropQMeasure.

o    A Tail Dropper requires the specification of a maximum queue depth
     threshold: when the queue pointed at by
diffServRandomDropInvWeight. Note however diffServAlgDropQMeasure
     reaches that there depth threshold, diffServAlgDropQThresh, any new
     traffic arriving at the dropper is ongoing research
on this topic, see e.g. [ACTQMGMT].

Additional discarded. This algorithm uses
     only parameters may be added in an enterprise MIB module, e.g. that are part of the diffServAlgDropEntry.

o    A Head Dropper requires the specification of a maximum queue depth
     threshold: when the queue pointed at by
using AUGMENTS on this table, to handle aspects diffServAlgDropQMeasure
     reaches that depth threshold, diffServAlgDropQThresh, traffic
     currently at the head of random drop
algorithms the queue is discarded. This algorithm
     uses only parameters that are not standardised here.

NOTE: Deterministic Droppers can be viewed as a special case part of the diffServAlgDropEntry.

o    Random Droppers with the drop probability restricted are recommended as a way to 0 control congestion, in
     [QUEUEMGMT] and 1. Hence
Deterministic Droppers might be described by called for in the [AF-PHB]. Various implementations
     exist, which agree on marking or dropping just enough traffic to
     communicate with TCP-like protocols about congestion avoidance, but
     differ markedly on their specific parameters. This MIB attempts to
     offer a Random Dropper minimal set of controls for any random dropper, but expects
     that vendors will augment the table with Pmin additional controls and
     status in accordance with their implementation. This algorithm
     requires additional parameters on top of those in
     diffServAlgDropEntry: these are discussed below.


Baker, Chan, Smith         Expires January June 2001           [Page 10] 12]




Internet Draft        Differentiated Services MIB             July          November 2000


= 0, Pmax = 1, Qmin = Qmax = Qclip, the averaged queue length at which
dropping occurs.

3.4.3.  Queues and Schedulers

The Queue Table models simple FIFO queues, as described in [MODEL]
section 7.1.1.  The Scheduler


3.5.2.  Random Dropper Table allows flexibility

One example of a random dropper is a RED-like dropper. An example of the
representation chosen in constructing
both simple and somewhat more complex queueing 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.

The entries this MIB for this element is shown in the Queue Table Figure 1.

Random droppers often have attributes which include their drop probability function described as
a
specification plot of drop probability (P) against averaged queue length (Q).
(Qmin,Pmin) then defines the scheduler which services the queue. They are
pointed at by the "next" attributes start of the upstream elements e.g.
diffServMeterSucceedNext.  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 characteristic plot.  Normally
Pmin=0, meaning with average queue length below Qmin, there will be placed in no
drops.  (Qmax,Pmax) defines a "knee" on the same queue, plot, after metering, without reordering.
This would be represented by having the diffServMeterSucceedNext of each
upstream meter which point at the same entry in
drop probability become more progressive (greater slope).  (Qclip,1)
defines the Queue Table.

The Scheduler Table represented in this MIB module contains entries,
each of queue length at which represents the algorithm in use for servicing the one or
more queues that feed it. The [MODEL] section 7.1.2 describes a
scheduler with multiple inputs: all packets will be dropped. Notice
this is represented in the MIB by
including the scheduling parameters associated with a scheduler input in
the Queue Table entry that feeds different from Tail Drop because this uses an averaged queue
length.  although it and having that point at one
particular Scheduler Table entry. is possible for Qclip = Qmax. In this way, sets of Queues can be
grouped together as inputs to the same Scheduler. MIB module,
diffServRandomDropMinThreshBytes and diffServRandomDropMinThreshPkts
represent Qmin.  diffServRandomDropMaxThreshBytes and
diffServRandomDropMaxThreshPkts represent Qmax.
diffServRandomDropInvProbMax represents Pmax. This table serves to MIB does not
represent the example scheduler described in the [MODEL]: other more
complex representations might Pmin (assumed to be created outside of this MIB. zero unless otherwise represented) or
Qclip (assumed to be Qmax unless otherwise represented).

Each scheduler input, as represented by a Queue Table entry, random dropper specification is assigned
a priority associated with respect to all the other inputs feeding the same
scheduler.  A higher-priority input will be serviced first over a lower-
priority input, assuming that all guarantees have already been met. queue. This priority parameter, used on its own
allows multiple drop processes (of same or different types) be
associated with default values for the
other parameters, serves to allow representation of a Strict Priority
scheduler.

For Weighted Queueing algorithms e.g. WFQ, WRR, the "weight" of a given
scheduler input is represented with a Minimum Service Rate leaky-bucket
profile which provides guaranteed bandwidth to that input, if required.
This is represented, same queue, as were token-bucket meters, by a rate
diffServQueueMinRateAbs and a burst size diffServQueueMinBurstSize. The
rate may, alternatively, be represented by a relative value, as a different PHB implementations may


      +-------------+      +-----------+
  --->| Next   --------+-->| Next    ---------> to Scheduler
      | Thresh=100k |  |   | Min=none  |
      | Measure -------+   | Max=none  |
      | Type=random |      | Pri=10    |
      | Specific ------+   | Type=fifo |
      +-------------+  |   +-----------+
        AlgDrop.3      |  Queue.4
                       |
                       |   +--------------+
                       +-->| Minthresh=10k|
                           | Maxthresh=80k|
                           | Weight=1/16  |
                           | ProbMax= 0.5 |
                           +--------------+
                            RandomDrop.3


  Figure 1: Example Use of the RandomDropTable for Random Droppers







Baker, Chan, Smith         Expires January June 2001           [Page 11] 13]




Internet Draft        Differentiated Services MIB             July          November 2000


fraction


require.  This also allows for sequences of the interface's current line rate, diffServQueueMinRateRel
to assist in cases where line rates are variable or where a higher-level
policy might be expressed in terms multiple droppers if
necessary.

The calculation of fractions a smoothed queue length may also have an important
bearing on the behaviour of network resources.
The two rate the dropper: parameters are inter-related may include the
sampling rate and changes in one the weight of each sample. The performance may be
reflected in very
sensitive to the other.

An input values of these parameters and a wide range of possible
values may also be capable required due to a wide range of acting as link speeds. Most
algorithms include a non-work-conserving [MODEL]
traffic shaper: this sample weight, represented here by
diffServRandomDropInvWeight.  The availability of
diffServRandomDropSamplingRate as readable is done important, the information
provided by defining a Maximum Service Sampling Rate leaky-
bucket profile in order is essential to limit the scheduler bandwidth available to
that input.  This configuration of
diffServRandomDropInvWeight.  Having Sampling Rate be configurable is represented, similarly to
also helpful, as line speed increases, the minimum rate, by a
rate diffServQueueMaxRateAbs 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 a burst size diffServQueueMaxBurstSize.
The rate may, alternatively,
[AQMROUTER].

Additional parameters may be represented added in an enterprise MIB module, e.g. by a relative value,
using AUGMENTS on this table, to handle aspects of random drop
algorithms that are not standardised here.

NOTE: Deterministic Droppers can be viewed as a
fraction special case of Random
Droppers with the interface's current line rate, diffServQueueMaxRateRel.

3.4.4.  Example of Algorithmic Droppers, 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, the averaged queue length at which
dropping occurs.

3.5.3.  Queues and Schedulers

As an example, the hypothetical queue/scheduler configuration shown

The Queue Table models simple FIFO queues, as described in [MODEL]
section 8.1 is shown in 7.1.1.  The Scheduler Table 1.



Queues 1 and 3 are serviced for long enough to give them their promised
bandwidths allows flexibility in constructing
both simple and burst sizes, if they need them.  Queue 2 is then serviced
up to its maximum limit profile.  Only then does Queue 4 get an
opportunity to send its traffic.  As somewhat more complex queueing hierarchies from those
queues.  Of course, since TCBs can be cascaded multiple times on an example of
interface, even more complex hierarchies can be constructed that way
also.

Queue Table entries are pointed at by the use "next" attributes of the MIB
structures, Figure 2 shows how the example would be represented.






  QId MinRate           MaxRate           Priority   Scheduler
  --- ----------------  ----------------  --------   ---------
  1   100kbps/20kbyte   none/none           20       Scheduler.1
  2   none/none         100kbps/100kbyte    40       Scheduler.1
  3   200kbps/20kbyte   none/none           20       Scheduler.1
  4   none/none         none/none           10       Scheduler.1

  SchedId   Type
  -------   ------------------
  1         weightedRoundRobin
upstream elements e.g. diffServMeterSucceedNext.  Note that multiple
upstream elements may direct their traffic to the same Queue Table 1: Example
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. This would be represented by having the
diffServMeterSucceedNext of each upstream meter point at the same entry
in the Queue and Scheduler Parameters Table.

Baker, Chan, Smith         Expires January June 2001           [Page 12] 14]




Internet Draft        Differentiated Services MIB             July          November 2000



                          +-----------+
  ----------------------->| Next    -----+
                          | Min=Profl4|  |
                          | Max=none  |  |
                          | Pri=20    |  |
                          | Type=fifo |  |
                          +-----------+  |
                         Queue.ifIndex.1 |
                                         |
      +-----------+       +-----------+  |
  --->| Next    -----+--->| Next   ------+
      | Thresh=1k |  |    | Min=none  |  |
      | Measure -----+    | Max=Profl5|  |
      | Type=Tail |       | Pri=40    |  |
      | Spec=none |       | Type=fifo |  |    +----------+
      +-----------+       +-----------+  +--->|


Notice Queue Table and Scheduler Table entries are for data path
description, they both uses Scheduler Parameterization Table entries for
diffserv treatment parameterization.

Queue Table entries specify the scheduler it wants service from by use
of its Next   -----> 0.0
        Dropper.1        Queue.ifIndex.2 |    | Algrm=wrr| pointer.

Each Scheduler Table entry represents the algorithm in use for servicing
the one or next TCB
                                         |    +----------+
      +-----------+       +-----------+  |   Scheduler.ifIndex.1
  --->| Next    -----+--->| Next    -----+
      | Thresh=2k |  |    | Min=Profl3|  |
      | Measure -----+    | Max=none  |  |
      | Type=Tail |       | Pri=20    |  |
      | Spec=none |       | Type=fifo |  |
      +-----------+       +-----------+  |
        Dropper.2        Queue.ifIndex.3 |
                                         |
      +-----------+       +-----------+  |
  --->| Next   ------+--->| Next    -----+
      | Thresh=4k |  |    | Min=none  |
      | Measure -----+    | Max=none  |
      | Type=Tail |       | Pri=10    |
      | Spec=none |       | Type=fifo |
      +-----------+       +-----------+
        Dropper.3        Queue.ifIndex.4

      Figure 2: Example of the use of Queueing elements

4.  Conventions used in this MIB

4.1. more queues that feed it. The use of RowPointer

RowPointer is a textual convention used to identify [MODEL] section 7.1.2 describes
a conceptual row scheduler with multiple inputs: this is represented in
an SNMP Table the MIB by pointing to one of its objects.
having the scheduling parameters be associated with each input.  In this MIB, it is used
in two ways:
way, sets of Queues can be grouped together as inputs to indicate indirection and the same
Scheduler.  This table serves to indicate succession.






Baker, Chan, Smith        Expires January 2001         [Page 13]

Internet Draft         Differentiated Services MIB             July 2000


When used for indirection as in represent the diffServClassifierTable, example scheduler
described in the idea is
to allow other MIBs, including proprietary ones, to define new and
arcane classifiers - MAC headers, IPv4 and IPv6 headers, BGP Communities
and all sorts of [MODEL]: other things - whilst still utilising the structures more complex representations might be
created outside of this MIB. This is

Scheduler Parameter Table entries are used to parameterized each input
that feeds into a form scheduler.  The inputs can be a mixture of class inheritance (in "object oriented"
language): it allows base object definitions ("classes") to Queue Table
and Scheduler Table entries.  Scheduler Parameter Table entries can be extended
in proprietary
used/reused by one or standard ways, in the future, by other documents.

When used for succession, it answers the question "what happens next?".
Rather than presume that the next table must be as specified in the
conceptual model [MODEL] and providing its index, the RowPointer takes
you to the MIB row more Queue and/or Scheduler Table entries.

For representing that thing. In the diffServMeterTable,
for example, the diffServMeterFailNext RowPointer might take you a Strict Priority scheduler, each scheduler input is
assigned a priority with respect to
another meter, while all the diffServMeterSucceedNext RowPointer would take
you to an action.

     NOTE -- other inputs feeding the RowPointer construct is used to build
same scheduler, with default values for the TCBs
     described in [MODEL]: this MIB does not model TCBs directly - it
     operates at other parameters.  A
higher-priority input will be serviced first over a lower level of abstraction using only individual
     elements, connected in succession by RowPointers. Therefore, lower-priority
input, assuming that all guarantees have already been met.

For Weighted Queueing algorithms e.g. WFQ, WRR, the
     concept "weight" of TCBs enclosing individual functional datapath elements a given
scheduler input is not applicable to this MIB, although such represented with a concept may be
     employed by management tools Minimum Service Rate leaky-bucket
profile which provides guaranteed bandwidth to that use this MIB.

It input, if required.
This is possible that represented, as were token-bucket meters, by a path through rate
diffServSchdParamMinRateAbs. The rate may, alternatively, be represented
by a device following relative value, as a set fraction of
RowPointers is indeterminate i.e. it ends the interface's current line rate,
diffServSchdParamMinRateRel to assist in cases where line rates are
variable or where a dangling RowPointer (or
potentially does higher-level policy might be expressed in the case terms of a Meter element) should
fractions of network resources. The two rate parameters are inter-
related and changes in one may be treated by reflected in the agent other.

An input may also be capable of acting as if it were operationally deactivated. For example, if an
Action element has a dangling diffServActionNext RowPointer that does
not point to an existent table entry (and is not zeroDotZero), then none
of the subsequent elements in that particular chain should have any
effect on the non-work-conserving [MODEL]
traffic proceeding down shaper: this chain and is done by defining a Maximum Service Rate leaky-
bucket profile in order to limit the Classification
or Meter element which lead scheduler bandwidth available to this Action element
that input. This is not considered represented, similarly to
be active.  Other parts of the device configuration remain in effect, of
course, but this rule simply removes all ambiguity from the operational
system.

4.2.  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, minimum rate, by a mechanism must
rate diffServSchdParamMaxRateAbs. The rate may, alternatively, be
provided to allow
represented by a manager to obtain unique values for such an index
and to ensure that, when used, relative value, as a fraction of the manager knows whether it got what it
wanted or not. interface's
current line rate, diffServSchdParamMaxRateRel.

Baker, Chan, Smith         Expires January June 2001           [Page 14] 15]




Internet Draft        Differentiated Services MIB             July          November 2000


Typically, such a table has an associated NextFree variable e.g.
diffServClassifierNextFree which provides a suitable value for the index
of the next row to be created e.g. diffServClassifierId. A special
value, 0, is used to indicate that no more entries


Notice hierarchical schedulers can be created parameterized using this MIB by the
agent. The table also has a columnar Status attribute with RowStatus
syntax [6].

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
having Scheduler Table entries feeds into Scheduler Table entry.

3.5.4.  Example of
either createAndGo or createAndWait) Algorithmic Droppers, Queues and if Schedulers

As an example, the agent has sufficient
resources hypothetical queue/scheduler configuration shown in
[MODEL] section 8.1 is shown in Table 1.


  QId MinRate           MaxRate           Priority   Scheduler
  --- ----------------  ----------------  --------   ---------
  1   100kbps/20kbyte   none/none           20       Scheduler.1
  2   none/none         100kbps/100kbyte    40       Scheduler.1
  3   200kbps/20kbyte   none/none           20       Scheduler.1
  4   none/none         none/none           10       Scheduler.1


  SchedId   Type
  -------   ------------------
  1         weightedRoundRobin


      Table 1: Example Queue and has no other conceptual row with the same indices, the
agent will create the row Scheduler Parameters


Queues 1 and return success. If the agent has
insufficient resources or such a row 3 are serviced for long enough to give them their promised
bandwidths and burst sizes, if they need them. Queue 2 is already existent then it returns serviced
up to its maximum limit profile. Only then does Queue 4 get an error. A manager must be prepared
opportunity to try again in such circumstances,
probably by re-reading send its traffic.  As an example of 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 attempt. The use of
RowStatus is covered in more detail in [6].


5.  Editorial information

<this section will be removed before publication>

5.1.  Open Issues resolved in previous drafts

(0)  Terminology is more in line with [MODEL], [POLTERM] and [DSTERM].
     Discarder -> "Algorithmic Dropper", "Monitor" -> "Counter"
     "Classifier element" -> "Filter"

(1)  Cascaded token-buckets is not equivalent to multi-rate token-
     bucket: do we need to fix this by allowing a multi-rate TB in the
     MIB? Or, by defining cascaded buckets to mean "multi-rate". (assume the latter - see text in 2.3)

(2)  Markers: model only describes DSCP-markers: do we need to be able
     to extend this to other sorts (e.g. 802.1p), even if we do not
     represent them in this MIB today? (yes). No MIB changes, just
     words.

(3)  Counters: should specific blocks include their own or is a "counter
     action", as described in
structures, Figure 2 shows how the Model, sufficient to count all paths
     through a device? (as appropriate). Per-queue counters are
     derivable from "action" ones.  Per-classifier counters: may feed
     through from clasifiers to distinct counter actions. example would be represented.








Baker, Chan, Smith         Expires January June 2001           [Page 15] 16]




Internet Draft        Differentiated Services MIB             July          November 2000


(4)  Queue Sets: are these generally applicable? (no). The example in
     section 2.5.1 is hard to follow: we should describe this example in
     [MODEL] and then show how it maps to MIB in the MIB draft. - DONE

(5)  Do we need scheduling units of "packets"? (NO) Should we use "kbps"
     or just "bps" for



                          +-----------+
  ----------------------->| Next    -----+
                          | Min=Profl4|  |
                          | Max=none  |  |
                          | Pri=20    |  |
                          | Type=fifo |  |
                          +-----------+  |
                         Queue.1         |
                                         |
      +-----------+       +-----------+  |
  --->| Next    -----+--->| Next   ------+
      | Thresh=1k |  |    | Min=none  |  |
      | Measure -----+    | Max=Profl5|  |
      | Type=Tail |       | Pri=40    |  |
      | Spec=none |       | Type=fifo |  |    +----------+
      +-----------+       +-----------+  +--->| Next   -----> 0.0
        Dropper.1        Queue.2         |    | Algrm=wrr|  or next TCB
                                         |    +----------+
      +-----------+       +-----------+  |   Scheduler.1
  --->| Next    -----+--->| Next    -----+
      | Thresh=2k |  |    | Min=Profl3|  |
      | Measure -----+    | Max=none  |  |
      | Type=Tail |       | Pri=20    |  |
      | Spec=none |       | Type=fifo |  |
      +-----------+       +-----------+  |
        Dropper.2        Queue.3         |
                                         |
      +-----------+       +-----------+  |
  --->| Next   ------+--->| Next    -----+
      | Thresh=4k |  |    | Min=none  |
      | Measure -----+    | Max=none  |
      | Type=Tail |       | Pri=10    |
      | Spec=none |       | Type=fifo |
      +-----------+       +-----------+
        Dropper.3        Queue.4


      Figure 2: Example of the use of Queueing elements



4.  MIB Usage Example

This section provides some examples on how the different table entries
of this MIB may be used to parameterize a DiffServ Device.  For the
figures, all the MIB table entry and attribute names assumes to have
"diffServ" as their first common initial part of name, with the table
entry name assumed to be their second common initial part of name.







Baker, Chan, Smith         Expires June 2001           [Page 17]




Internet Draft        Differentiated Services MIB          November 2000



+---------------------+
|DataPath             |
| ifIndex=1           |
| IfDirection=Ingress |    +------+
| Start --------------+--->|Clfr  |
+---------------------+    | Id=1 |
                           +------+

  +------------+      +--------------+      +-----------+
  |ClfrElement |  +-->|Meter         |  +-->|Action     |
  | Id=101     |  |   | Id=101       |  |   | Id=101    |
  | ClfrId=1   |  |   | SucceedNext -+--+   | Next -----+---->...
  | Order=NA   |  |   | FailNext ----+->... | Specific -+-+
  | Next ------+--+   | Specific -+  |      | Type=Spcf | |
  | Specific --+-+    +-----------+--+      +-----------+ |
  +------------+ |                |               +-------+
                 |   +-------+    |   +--------+  |   +-----------+
                 +-->|Filter1|    +-->|TBMeter1|  +-->|CounterAct1|
                     +-------+        +--------+      +-----------+

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

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

      Figure 3: Data Path Example Part 1


Baker, Chan, Smith         Expires June 2001           [Page 18]




Internet Draft        Differentiated Services MIB          November 2000


     +-------------+      +------------------+     +----------------------+
---->|Q            |   +->|Scheduler         |  +->|Scheduler             |
     | Id=EF       |   |  | Id=DiffServ      |  |  | Id=Shaping           |
     | Next -------+---+  | Next ------------+--+  | Next=zeroDotZero     |
     | SchdParam -+|   |  | Method=priorityq |     | Method=priorityq     |
     +------------++   |  | SchdParam -+     |     | SchdParam=zeroDotZero|
                  |    |  +------------+-----+     +----------------------+
     +------------+    |               |
     |                 |  +------------+
     |  +-----------+  |  |
     +->|SchdParamEF|  |  |  +----------------+
        +-----------+  |  +->|SchdParamShaping|
                       |     +----------------+
                       |
                       |
                       +-----------------------------------------+
                                                                 |
                                                                 |
    +----------------+       +-------------+                     |
--->|AlgDrop         |    +->|Q            |                     |
    | Id=AF11        |    |  | Id=AF1X     |    +-------------+  |
    | Type=randomDrop|    |  | Next -------+--->|Scheduler    |  |
    | Next ----------+-+--+  | SchdParam -+|    | Id=AF       |  |
    | QMeasure ------+-+  |  +------------++    | Next -------+--+
    | QThreshold     |    |               |     | Method=wfq  |
    | Specific -+    |    |  +------------+     | SchdParam -+|
    +-----------+----+    |  |                  +------------++
                |         |  |  +-------------+              |
    +-----------+         |  +->|SchdParamAF1X| +------------+
    |  +--------------+   |     +-------------+ |
    +->|RandomDropAF11|   |                     |  +-----------+
       +--------------+   |                     +->|SchdParamAF|
                          |                        +-----------+
    +----------------+    |
--->|AlgDrop         |    |
    | Id=AF12        |    |
    | Type=randomDrop|    |
    | Next ----------+-+--+
    | QMeasure ------+-+
    | QThreshold     |
    | Specific -+    |
    +-----------+----+
                |
    +-----------+
    |  +--------------+
    +->|RandomDropAF12|
       +--------------+

      Figure 4: Data Path Example Part 2



Baker, Chan, Smith         Expires June 2001           [Page 19]




Internet Draft        Differentiated Services MIB          November 2000

4.1.  Data Path and Classifier Example Discussion

The example in Figure 4 shows a single DataPathTable entry feeding into
a single Classifier entry, with three ClfrElement and Filter Table entry
pairs belonging to this Classifier 1.  Notice the three Filters used
here must completely classify all the traffic presented to this data
path.

Another level of classification can be defined that follows the Action
function datapath elements in Figure 3.  This second level of
classifiers and their subsequent function datapath elements would be
considered as in another TCB.

This multi-level classification allow the construction of traffic
seperations like:
  if (dept1)
  {
    if (appl1) then take dept1-appl1-action.
    if (appl2) then take dept1-appl2-action.
    if (appl3) then take dept1-appl3-action.
  }
  if (dept2)
  {
    if (appl1) then take dept2-appl1-action.
    if (appl2) then take dept2-appl2-action.
    if (appl3) then take dept2-appl3-action.
  }
  if (dept3)
  {
    if (appl1) then take dept3-appl1-action.
    if (appl2) then take dept3-appl2-action.
    if (appl3) then take dept3-appl3-action.
  }

The filters for appl1, appl2, appl3 may be reused for the above setup.


4.2.  Meter and Action Example Discussion

A simple Meter that can be parameterized by a single TBMeter entry is
shown here.  For Metering types that require mutliple TBMeter entries
for parameterization, a second level Meter and TBMeter table entries may
be used.  For example, for trTCM, with the first level TBMeter entry
used for Peak Information Token Bucket, the first level SucceedNext
points to the second level Meter entry, with second level TBMeter entry
used for Committed Information Token Bucket.

Notice the CountAct Action is shown in Figure 3.  This is purposely done
to indicate all datapaths should have at least one CountAct Action.
Other actions can be pointed to by the Next pointer of the CountAct





Baker, Chan, Smith         Expires June 2001           [Page 20]




Internet Draft        Differentiated Services MIB          November 2000


action, like DSCPMarkAct action.


4.3.  Queue and Scheduler Example Discussion

Example in Figure 4 shows three classified input traffic streams, EF,
AF11, and AF12, feeding into their respective queue and algorithmic
droppers.  After their respective dropping process, the AF traffic
streams feed into the same queue, QAF1X.

A Scheduler, AF, is shown in Figure 4, as the sink for AF1X queue
traffic, servicing AF1X queue with scheduling parameters indicated by
SchdParamAF1X.  This scheduler is used to service traffic from AF1X,
AF2X, AF3X queues using weighted fair queueing method.  The AF2X and
AF3X queues are not shown in Figure 4, they can be very much like AF1X
queue setup.

Another traffic stream, EF, is handled by the EF queue.  Scheduler
DiffServ services output of EF queue using SchdParamEF, and output of AF
scheduler using SchdParamAF, with Weighted Fair Queueing method.

Notice all the diffserv traffic may go out on a link with traffic
shaping.  The traffic shaping can be parameterize using the Shaping
Scheduler in Figure 4.  For shaping, the diffServSchdParamMaxRate
attributes should be used.  The output of the Shaping Scheduler is
indicated using its Next pointer with value of zeroDotZero, the output
port.


5.  Conventions used in this MIB

5.1.  The use of RowPointer

RowPointer is a textual convention used to identify a conceptual row in
an SNMP Table by pointing to one of its objects. In this MIB, it is used
in two ways: to indicate indirection and to indicate succession.

When used for indirection as in the diffServClassifierTable, the idea is
to allow other MIBs, including proprietary ones, to define new and
arcane classifiers - MAC headers, IPv4 and IPv6 headers, BGP Communities
and all sorts of other things - whilst still utilising 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.

When used for succession, it answers the question "what happens next?".
Rather than presume that the next table must be as specified in the





Baker, Chan, Smith         Expires June 2001           [Page 21]




Internet Draft        Differentiated Services MIB          November 2000


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.

     NOTE -- the RowPointer construct is used to build the TCBs
     described in [MODEL]: this MIB does not model TCBs 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 elements
     is not applicable to this MIB, although such a concept may be
     employed by management tools that use this MIB.

It is possible that a path through a device following a set of
RowPointers is indeterminate i.e. it ends in a dangling RowPointer (or
potentially does in the case of a Meter element) should be treated by
the agent as if it were operationally deactivated. For example, if an
Action element has a dangling diffServActionNext RowPointer that does
not point to an existent table entry (and is not zeroDotZero), then none
of the subsequent elements in that particular chain should have any
effect on the traffic proceeding down this chain and the Classification
or Meter element which lead to this Action element is not considered to
be active.  Other parts of the device configuration remain in effect, of
course, but this rule simply removes all ambiguity from the operational
system.

5.2.  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.
diffServClassifierNextFree which provides a suitable value for the index
of the next row to be created e.g. diffServClassifierId. A special
value, 0, is used to indicate that no more entries can be created by the
agent. The table also has a columnar Status attribute with RowStatus
syntax [6].

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
either createAndGo or createAndWait) and if the agent has sufficient
resources and has no other conceptual row with the same indices, the





Baker, Chan, Smith         Expires June 2001           [Page 22]




Internet Draft        Differentiated Services MIB          November 2000


agent will create the row and return success. If the agent has
insufficient resources or such a row is already existent then it returns
an error. A manager must be prepared to try again in such circumstances,
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 attempt. The use of
RowStatus is covered in more detail in [6].



6.  Editorial information

<this section will be removed before publication>

6.1.  Open Issues resolved in previous drafts

(0)  Terminology is more in line with [MODEL], [POLTERM] and [DSTERM].
     Discarder -> "Algorithmic Dropper", "Monitor" -> "Counter"
     "Classifier element" -> "Filter"

(1)  Cascaded token-buckets is not equivalent to multi-rate token-
     bucket: do we need to fix this by allowing a multi-rate TB in the
     MIB? Or, by defining cascaded buckets to mean "multi-rate". (assume
     the latter - see text in 2.3)

(2)  Markers: model only describes DSCP-markers: do we need to be able
     to extend this to other sorts (e.g. 802.1p), even if we do not
     represent them in this MIB today? (yes). No MIB changes, just
     words.

(3)  Counters: should specific blocks include their own or is a "counter
     action", as described in the Model, sufficient to count all paths
     through a device? (as appropriate). Per-queue counters are
     derivable from "action" ones.  Per-classifier counters: may feed
     through from clasifiers to distinct counter actions.

(4)  Queue Sets: are these generally applicable? (no). The example in
     section 2.5.1 is hard to follow: we should describe this example in
     [MODEL] and then show how it maps to MIB in the MIB draft. - DONE

(5)  Do we need scheduling units of "packets"? (NO) Should we use "kbps"
     or just "bps" for rates? DONE - all rates rates are in kbps.

(6)  Are "absolute" rates sufficient or should we include "relative to
     line speed" ones as well? (yes) - DONE - explained that these are
     interrelated.


Baker, Chan, Smith         Expires June 2001           [Page 23]




Internet Draft        Differentiated Services MIB          November 2000


(7)  Scheduler weights vs. rates vs. priorities: this is confusing -
     suggest we stick to rates and priorities (see Model draft 7.1.2) -
     DONE.

(8)  Queue Measure table:

o    This allows for RIO - multiple averaging functions for the same
     queue: is this needed? OUT OF SCOPE.

o    mixes config with status objects - split these? N/A.

o    do we need floating-point representation for "weight"? N/A.

o    do we need MIB visibility for average queue depth? N/A.

o    do we need MIB-configurable averaging functions (sample
     weight/interval)?  (maybe just "sample weight") - NO: averaging
     functions will be left out although framework allows for their
     inclusion separately.

(9)  Counter compliance: paste text from IF-MIB re line-speeds. Do you
     still have to do the low-speed counters for fast interfaces? YES.
     DONE.

(10) Meters: are these mandatory for compliance? NO

(11) Discussion material: move most of this to Model draft e.g. most of
     3.1, 3.3, "Dropper/discarder" part of 3.4, nearly all of 3.5. Just
     leave the "how does the MIB map from the Model" parts in the MIB
     draft, no general discussion. DONE.

(12) Counters: merged in 32-bit and 64-bit counters - conformance
     statements sort out which ones must be implemented. This is
     consistent with [IFMIB]. DONE.

(13) Droppers: we used to have a common "dropper" table that represented
     all of: dropAlways, randomDrop, tailDrop with just some parameters
     valid for the simpler ones. A simpler representation is to define
     specific dropper tables for each type (e.g. a single OID to point
     at for dropAlways since it is always the last action in a chain)
     but this would mean a larger number of (simpler) MIB objects.
     CHANGES: dropAlways is still an Action but the others are moved to
     a diffServAlgDropTable. This table can handle tail/head/random drop
     - others by extension.

(14) Should TBMeterTable just AUGMENT the MeterTable, should it use same
     indices or are separate structures linked by RowPointers





Baker, Chan, Smith         Expires June 2001           [Page 24]




Internet Draft        Differentiated Services MIB          November 2000


     preferable? (same indices without RowPointer).

(15) Do we need to model multiple queues feeding back into a single
     dropper algorithm? (yes).  If so, the current single-queue pointer
     and threshold will not be adequate - should we leave them in? They
     will be useful for many, but not all, dropper algorithms. (yes)

(17) We have concepts of "inbound" and "outbound" directions: but if we
     have a series of multiple TCBs on a given interface for the same
     direction (allowed by the model) then we do not have a way to
     indicate "this is the 1st one". Moreover, it is a somewhat
     convoluted process to then find the 2nd, 3rd etc. ones - you would
     have to follow the RowPointers to get there: should we explicitly
     have an index to enable/help these lookup operations? Note: this is
     not the same issue as needing a "precedence" for each filter entry
     of a classifier (yes - added another index to classifiers to
     represent what TCB they operate at for a given
     interface/direction).

6.2.  Open Issues resolved in this draft

(13) Droppers: slight change to previous resolution. MIB can now handle
     tail/head/random drop using diffServAlgDropTable and
     diffServRandomDropTable.

(18) Should manager be allowed to create Queue elements or should agent
     be in control of this? (the former)

(19) Should manager be allowed to create Scheduler elements or should
     agent be in control of this? (the former)

(20) Related to (17) above, do we also need a "TCB index" for elements
     other than classifiers? (no)

(21) Do we need diffServAlgDropType of both "headDrop" and "tailDrop" or
     should we just represent the tail dropper by placing a dropper
     after the queue instead of before the queue, as linked by the
     diffServQNext and diffServAlgDropNext RowPointers? (the former -
     dropper is always in front of the queue in this model).

(22) Do we need to support RED algorithms for algorithm parameter
     configuration and monitoring? If so, what variables are needed?
     (Added diffServRandomDropTable).

(24) diffServAlgDropQThreshold needs UNITS (Bytes).

Baker, Chan, Smith         Expires June 2001           [Page 25]




Internet Draft        Differentiated Services MIB          November 2000


(25) Dangling RowPointers: should we mandate that these are never
     permitted? Or just define the behaviour if they do dangle? (We
     define it such that elements that have dangling pointers, as well
     as upstream elements that point to them, are considered "not
     activated")

(26) Discontinuity times for MIB counters - is
     ifCounterDiscontinuityTime adequate? (no: added
     diffServCountActDiscontTime).

(27) How do we handle dropper algorithms that require additional
     classification information in order to do their job? If a
     Classifier is needed then create a new TCB for it at the point just
     before the dropper: use ordinary Classifier elements in this TCB.

(28) Indexing of table entries and uniqueness hints: is TestAndIncr the
     correct tool to use? (no: RowStatus is the right tool for ensuring
     uniqueness; use a NextFree variable as a hint).

(32) Miscellaneous clarifications - thanks Bob.

6.3.  Still Open Issues

(16) Should the creation of counter actions be under the control of
     manager or agent: should a diffServActionEntry and
     diffServCountActEntry appear by magic (does the agent know what
     counters it can and cannot maintain on a given interface)? (no) If
     no, should diffServCountActEntry appear magically when a
     diffServAction element is created which points at the
     diffServCountActTable (then would be no need for
     diffServCountActStatus)? (no)

(23) Do daughter entries of derived table entries need to exist
     independently of the parent?  Examples are
     diffServMeterEntry/diffServTBMeterEntry,
     diffServActionEntry/diffServCountActEntry and
     diffServAlgDropEntry/diffServRandomDropEntry (assume they must be
     independent of the equivalent entry in diffServMeterTable which
     points at the TB table - needs diffServTBMeterStatus: daughters
     must be created explicitly by manager).

(30) Related to (17) - multi-manager creation of TCBs:
     diffServClassifierId is unique across the agent, for all values of
     diffServClassifierTcb but there is no "next free" variable to
     report the next TCB to use. This can lead to a race condition when
     2 managers are duelling to create entries with the same value of
     diffServClassifierTcb. There are also legitimate reasons for





Baker, Chan, Smith         Expires June 2001           [Page 26]




Internet Draft        Differentiated Services MIB          November 2000


     different managers to be "creating" the *same* TCB so a
     conventional "next free" is not a good solution. Is this a rare
     enough occurence given a suitable choice of diffServClassifierTcb
     e.g. pseudo-random? (yes).

(31) When inheritance is needed and parent/daughter share indexing, the
     parent often points to the daughter using a "Specific" attribute
     e.g. diffServMeterSpecific, diffServActionSpecific,
     diffServAlgDropSpecific. If this is a RowPointer and points to the
     associated row in the daughter's table, there is redundant
     information which gives scope for additional error cases. So,
     wherever possible, should we remove this redundant information by
     making the "Specific" attribute point only to the base of the
     daughter table and make it an OBJECT IDENTIFIER? The con is that
     this is an unusual use of MIB pointers (point at table base, not
     individual entries).


7.  MIB Outline

The authors think a MIB outline will assist the reader and can be used
as a quick reference.


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

diffServDataPath       OBJECT IDENTIFIER ::= { diffServMIBObjects 1 }

diffServDataPathTable OBJECT-TYPE
    ::= { diffServDataPath 1 }
diffServDataPathEntry OBJECT-TYPE
    INDEX { ifIndex, diffServDataPathIfDirection }
    ::= { diffServDataPathTable 1 }
DiffServDataPathEntry ::= SEQUENCE  {
    diffServDataPathIfDirection    IfDirection,
    diffServDataPathStart          RowPointer,
    diffServDataPathStatus         RowStatus
}

diffServClassifier     OBJECT IDENTIFIER ::= { diffServMIBObjects 2 }

diffServClfrNextFree OBJECT-TYPE
    ::= { diffServClassifier 1 }
diffServClfrTable OBJECT-TYPE
    ::= { diffServClassifier 2 }
diffServClfrEntry OBJECT-TYPE





Baker, Chan, Smith         Expires June 2001           [Page 27]




Internet Draft        Differentiated Services MIB          November 2000


    INDEX { diffServClfrId }
    ::= { diffServClfrTable 1 }
DiffServClfrEntry ::= SEQUENCE  {
    diffServClfrId              Unsigned32,
    diffServClfrStatus          RowStatus
}

diffServClfrElementNextFree OBJECT-TYPE
    ::= { diffServClassifier 3 }
diffServClfrElementTable OBJECT-TYPE
    ::= { diffServClassifier 4 }
diffServClfrElementEntry OBJECT-TYPE
    INDEX { diffServClfrElementClfrId, diffServClfrElementId }
    ::= { diffServClfrElementTable 1 }
DiffServClfrElementEntry ::= SEQUENCE  {
    diffServClfrElementId          Unsigned32,
    diffServClfrElementClfrId      Unsigned32,
    diffServClfrElementOrder       Unsigned32,
    diffServClfrElementNext        RowPointer,
    diffServClfrElementSpecific    RowPointer,
    diffServClfrElementStatus      RowStatus
}

diffServSixTupleClfrNextFree OBJECT-TYPE
    ::= { diffServClassifier 5 }
diffServSixTupleClfrTable OBJECT-TYPE
    ::= { diffServClassifier 6 }
diffServSixTupleClfrEntry OBJECT-TYPE
    INDEX { diffServSixTupleClfrId }
    ::= { diffServSixTupleClfrTable 1 }
DiffServSixTupleClfrEntry ::= SEQUENCE {
    diffServSixTupleClfrId           Unsigned32,
    diffServSixTupleClfrDstAddrType  InetAddressType,
    diffServSixTupleClfrDstAddr      InetAddress,
    diffServSixTupleClfrDstAddrMask  Unsigned32,
    diffServSixTupleClfrSrcAddrType  InetAddressType,
    diffServSixTupleClfrSrcAddr      InetAddress,
    diffServSixTupleClfrSrcAddrMask  Unsigned32,
    diffServSixTupleClfrDscp         Dscp,
    diffServSixTupleClfrProtocol     Unsigned32,
    diffServSixTupleClfrDstL4PortMin SixTupleClfrL4Port,
    diffServSixTupleClfrDstL4PortMax SixTupleClfrL4Port,
    diffServSixTupleClfrSrcL4PortMin SixTupleClfrL4Port,
    diffServSixTupleClfrSrcL4PortMax SixTupleClfrL4Port,
    diffServSixTupleClfrStatus       RowStatus
}


Baker, Chan, Smith         Expires June 2001           [Page 28]




Internet Draft        Differentiated Services MIB          November 2000


diffServMeter          OBJECT IDENTIFIER ::= { diffServMIBObjects 3 }

diffServMeterNextFree OBJECT-TYPE
    ::= { diffServMeter 1 }
diffServMeterTable OBJECT-TYPE
    ::= { diffServMeter 2 }
diffServMeterEntry OBJECT-TYPE
    INDEX { diffServMeterId }
    ::= { diffServMeterTable 1 }
DiffServMeterEntry ::= SEQUENCE  {
    diffServMeterId                Unsigned32,
    diffServMeterSucceedNext       RowPointer,
    diffServMeterFailNext          RowPointer,
    diffServMeterSpecific          RowPointer,
    diffServMeterStatus            RowStatus
}

diffServTBMeterNextFree OBJECT-TYPE
    ::= { diffServMeter 3 }
diffServTBMeterTable OBJECT-TYPE
    ::= { diffServMeter 4 }
diffServTBMeterEntry OBJECT-TYPE
    INDEX { diffServTBMeterId }
    ::= { diffServTBMeterTable 1 }
DiffServTBMeterEntry ::= SEQUENCE  {
    diffServTBMeterId              Unsigned32,
    diffServTBMeterType            INTEGER,
    diffServTBMeterRate            Unsigned32,
    diffServTBMeterBurstSize       BurstSize,
    diffServTBMeterInterval        Unsigned32,
    diffServTBMeterStatus          RowStatus
}

diffServAction         OBJECT IDENTIFIER ::= { diffServMIBObjects 4 }

diffServActionNextFree OBJECT-TYPE
    ::= { diffServAction 1 }
diffServActionTable OBJECT-TYPE
    ::= { diffServAction 2 }
diffServActionEntry OBJECT-TYPE
    INDEX { diffServActionId }
    ::= { diffServActionTable 1 }
DiffServActionEntry ::= SEQUENCE  {
    diffServActionId                Unsigned32,
    diffServActionNext              RowPointer,
    diffServActionSpecific          RowPointer,
    diffServActionType              INTEGER,





Baker, Chan, Smith         Expires June 2001           [Page 29]




Internet Draft        Differentiated Services MIB          November 2000


    diffServActionStatus            RowStatus
}

diffServDscpMarkActNextFree OBJECT-TYPE
    ::= { diffServAction 3 }
diffServDscpMarkActTable OBJECT-TYPE
    ::= { diffServAction 4 }
diffServDscpMarkActEntry OBJECT-TYPE
    INDEX { diffServDscpMarkActId }
    ::= { diffServDscpMarkActTable 1 }
DiffServDscpMarkActEntry ::= SEQUENCE  {
    diffServDscpMarkActId            Unsigned32,
    diffServDscpMarkActDscp          Dscp,
    diffServDscpMarkActStatus        RowStatus
}

diffServCountActNextFree OBJECT-TYPE
    ::= { diffServAction 5 }
diffServCountActTable OBJECT-TYPE
    ::= { diffServAction 6 }
diffServCountActEntry OBJECT-TYPE
    INDEX { diffServCountActId }
    ::= { diffServCountActTable 1 }
DiffServCountActEntry ::= SEQUENCE  {
    diffServCountActId           Unsigned32,
    diffServCountActOctets       Counter32,
    diffServCountActHCOctets     Counter64,
    diffServCountActPkts         Counter32,
    diffServCountActHCPkts       Counter64,
    diffServCountActDiscontTime  TimeStamp,
    diffServCountActStatus       RowStatus
}

diffServAlgDrop        OBJECT IDENTIFIER ::= { diffServMIBObjects 5 }

diffServAlgDropNextFree OBJECT-TYPE
    ::= { diffServAlgDrop 1 }
diffServAlgDropTable OBJECT-TYPE
    ::= { diffServAlgDrop 2 }
diffServAlgDropEntry OBJECT-TYPE
    INDEX { diffServAlgDropId }
    ::= { diffServAlgDropTable 1 }
DiffServAlgDropEntry ::= SEQUENCE  {
    diffServAlgDropId               Unsigned32,
    diffServAlgDropType             INTEGER,
    diffServAlgDropNext             RowPointer,
    diffServAlgDropQMeasure         RowPointer,





Baker, Chan, Smith         Expires June 2001           [Page 30]




Internet Draft        Differentiated Services MIB          November 2000


    diffServAlgDropQThreshold       Unsigned32,
    diffServAlgDropSpecific         RowPointer,
    diffServAlgDropOctets           Counter32,
    diffServAlgDropHCOctets         Counter64,
    diffServAlgDropPkts             Counter32,
    diffServAlgDropHCPkts           Counter64,
    diffServAlgDropStatus           RowStatus
}

diffServRandomDropNextFree OBJECT-TYPE
    ::= { diffServAlgDrop 3 }
diffServRandomDropTable OBJECT-TYPE
    ::= { diffServAlgDrop 4 }
diffServRandomDropEntry OBJECT-TYPE
    INDEX { diffServRandomDropId }
    ::= { diffServRandomDropTable 1 }
DiffServRandomDropEntry ::= SEQUENCE  {
    diffServRandomDropId               Unsigned32,
    diffServRandomDropMinThreshBytes   Unsigned32,
    diffServRandomDropMinThreshPkts    Unsigned32,
    diffServRandomDropMaxThreshBytes   Unsigned32,
    diffServRandomDropMaxThreshPkts    Unsigned32,
    diffServRandomDropInvProbMax       Unsigned32,
    diffServRandomDropInvWeight        Unsigned32,
    diffServRandomDropSamplingRate     Unsigned32,
    diffServRandomDropStatus           RowStatus
}

diffServQueue          OBJECT IDENTIFIER ::= { diffServMIBObjects 6 }

diffServQNextFree OBJECT-TYPE
    ::= { diffServQueue 1 }
diffServQTable OBJECT-TYPE
    ::= { diffServQueue 2 }
diffServQEntry OBJECT-TYPE
    INDEX { diffServQId }
    ::= { diffServQTable 1 }
DiffServQEntry ::= SEQUENCE  {
    diffServQId                      Unsigned32,
    diffServQNext                    RowPointer,
    diffServQSchdParam               RowPointer,
    diffServQStatus                  RowStatus
}

diffServScheduler      OBJECT IDENTIFIER ::= { diffServMIBObjects 7 }

diffServSchedulerNextFree OBJECT-TYPE





Baker, Chan, Smith         Expires June 2001           [Page 31]




Internet Draft        Differentiated Services MIB          November 2000


    ::= { diffServScheduler 1 }
diffServSchedulerTable OBJECT-TYPE
    ::= { diffServScheduler 2 }
diffServSchedulerEntry OBJECT-TYPE
    INDEX { diffServSchedulerId }
    ::= { diffServSchedulerTable 1 }
DiffServSchedulerEntry ::= SEQUENCE  {
    diffServSchedulerId                   Unsigned32,
    diffServSchedulerNext                 RowPointer,
    diffServSchedulerMethod               INTEGER,
    diffServSchedulerSchdParam            RowPointer,
    diffServSchedulerStatus               RowStatus
}

diffServSchdParamNextFree OBJECT-TYPE
    ::= { diffServScheduler 3 }
diffServSchdParamTable OBJECT-TYPE
    ::= { diffServScheduler 4 }
diffServSchdParamEntry OBJECT-TYPE
    INDEX { diffServSchdParamId }
    ::= { diffServSchdParamTable 1 }
DiffServSchdParamEntry ::= SEQUENCE  {
    diffServSchdParamId              Unsigned32,
    diffServSchdParamPriority        Unsigned32,
    diffServSchdParamMinRateAbs      Unsigned32,
    diffServSchdParamMinRateRel      Unsigned32,
    diffServSchdParamMaxRateAbs      Unsigned32,
    diffServSchdParamMaxRateRel      Unsigned32,
    diffServSchdParamStatus          RowStatus
}




Baker, Chan, Smith         Expires June 2001           [Page 32]




Internet Draft        Differentiated Services MIB          November 2000


8.  MIB Definition



DIFF-SERV-MIB DEFINITIONS ::= BEGIN



    IMPORTS
    Integer32, Unsigned32, Counter32, Counter64,
    MODULE-IDENTITY, OBJECT-TYPE, 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
        FROM INET-ADDRESS-MIB
    BurstSize
        FROM INTEGRATED-SERVICES-MIB;


diffServMib MODULE-IDENTITY
    LAST-UPDATED "200011030000Z"
    ORGANIZATION "IETF Diffserv 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


Baker, Chan, Smith         Expires June 2001           [Page 33]




Internet Draft        Differentiated Services MIB          November 2000


               Andrew Smith
               E-mail: ah_smith@pacbell.net"
    DESCRIPTION
       "This MIB defines the objects necessary to  manage  a
       device  that  uses the Differentiated Services Archi-
       tecture  described  in  RFC  2475  and  the  Informal
       Management  Model for DiffServ Routers in draft-ietf-
       diffserv-model-04.txt."
    REVISION "200011030000Z"
    DESCRIPTION
       "Initial version, published as RFC xxxx."
    ::= { mib-2 12345 }  -- 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 the semantics of any managed object.  Objects defined
-- using this convention are always encoded by means of the
-- rules that define their primitive type.


Dscp ::= TEXTUAL-CONVENTION
    DISPLAY-HINT "d"
    STATUS   current
    DESCRIPTION
       "The IP header Diffserv Code-Point that may  be  used
       for  discriminating or marking a traffic stream.  The
       value -1 is used to  indicate  a  wildcard  i.e.  any
       value."
    SYNTAX   Integer32 (-1 | 0..63)





Baker, Chan, Smith         Expires June 2001           [Page 34]




Internet Draft        Differentiated Services MIB          November 2000


SixTupleClfrL4Port ::= TEXTUAL-CONVENTION
    DISPLAY-HINT "d"
    STATUS   current
    DESCRIPTION
       "A value indicating a Layer-4 protocol port number."
    SYNTAX   Unsigned32 (0..65535)


IfDirection ::= TEXTUAL-CONVENTION
    STATUS current
    DESCRIPTION
       "Specifies a direction of data travel  on  an  inter-
       face.  'inbound' traffic is operated on during recep-
       tion 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
--

Baker, Chan, Smith         Expires June 2001           [Page 35]




Internet Draft        Differentiated Services MIB          November 2000


diffServDataPath       OBJECT IDENTIFIER ::= { diffServMIBObjects 1 }

--
-- Data Path Table
--
-- The Data Path Table enumerates the Differentiated Services
-- Data Paths within this device.  Each entry in this table
-- is indexed by ifIndex and ifDirection.  Each entry provides
-- the first diffserv functional datapath element to process data
-- flow for each specific datapath.  This table should have two
-- entries for each interface on this device; ingress and egress.
--
-- Notice all diffserv functional datapath elements linked together
-- using their individual next pointers and anchored by an entry
-- of the diffServDataPathTable must belong to the same datapath.
-- The use of next pointer to point to diffserv functional datapath
-- element of a different datapath is not allowed.
--


diffServDataPathTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServDataPathEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The data path table defines the data paths  in  this
       device.   Each  data path is defined by the interface
       and traffic direction.  The first diffserv functional
       datapath element to handle traffic for this data path
       is defined by a RowPointer, diffServDataPathStart, in
       the entries of this table."
    ::= { diffServDataPath 1 }


diffServDataPathEntry OBJECT-TYPE
    SYNTAX       DiffServDataPathEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the data path table describes  a  single
       diffserv datapath in this device."
    INDEX { ifIndex, diffServDataPathIfDirection }
    ::= { diffServDataPathTable 1 }


DiffServDataPathEntry ::= SEQUENCE  {
    diffServDataPathIfDirection    IfDirection,





Baker, Chan, Smith         Expires June 2001           [Page 36]




Internet Draft        Differentiated Services MIB          November 2000


    diffServDataPathStart          RowPointer,
    diffServDataPathStatus         RowStatus
}


diffServDataPathIfDirection OBJECT-TYPE
    SYNTAX       IfDirection
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "Specifies the direction for  which  this  data  path
       entry applies on this interface."
    ::= { diffServDataPathEntry 1 }


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

       A value of zeroDotZero in this attribute indicates no
       further Diffserv treatment is performed on traffic of
       this datapath.

       If the row pointed to  does  not  exist,  this  whole





Baker, Chan, Smith         Expires June 2001           [Page 37]




Internet Draft        Differentiated Services MIB          November 2000


       diffserv datapath is ignored."
    ::= { diffServDataPathEntry 2 }


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


--
-- Classifiers
--

diffServClassifier     OBJECT IDENTIFIER ::= { diffServMIBObjects 2 }

--
-- Classifier Table
--
-- Classifier allows multiple classifier elements, of same or different
-- types, to be used together.
-- A classifier must completely classify all packets presented to it,
-- this means all traffic handled by a classifier must match
-- at least one classifier element within the classifier,





Baker, Chan, Smith         Expires June 2001           [Page 38]




Internet Draft        Differentiated Services MIB          November 2000


-- with the classifier element parameters specified by a filter.
--
-- If there is ambiguity between classifier elements of different
-- classifier, the precedence is indicated by the order the classifiers
-- are linked, the first classifier in the link is applied to the
-- traffic first.
--


diffServClfrNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This  object  yields  a  value  when  read  that  is
       currently unused for a diffServClfrId instance.  If a
       configuring system attempts to create a  new  row  in
       the  diffServClfrTable  using this value, that opera-
       tion will fail if the value  has,  in  the  meantime,
       been  used  to  create  another row that is currently
       valid."
    ::= { diffServClassifier 1 }


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

Baker, Chan, Smith         Expires June 2001           [Page 39]




Internet Draft        Differentiated Services MIB          November 2000


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 kbps.

(6)  Are "absolute" rates sufficient or thier diffServClfrElementClfrId attribute."
    INDEX { diffServClfrId }
    ::= { diffServClfrTable 1 }


DiffServClfrEntry ::= SEQUENCE  {
    diffServClfrId              Unsigned32,
    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 we include "relative obtain new values for row creation in
       this table by reading diffServClfrNextFree."
    ::= { diffServClfrEntry 1 }


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


--
-- Classifier Element Table
--
-- Entries in the classifier element table serves as





Baker, Chan, Smith         Expires June 2001           [Page 40]




Internet Draft        Differentiated Services MIB          November 2000


-- the anchor for each classification pattern, defined
-- in filter table entries.  Each classifier element
-- table entry also specifies the subsequent downstream
-- diffserv functional datapath element when the
-- classification pattern is satisfied.
-- Each entry in the classifier element table describes
-- one branch of the fan-out characteristic of a classifier
-- indicated in [MODEL] section 4.1.  A classifier is madeup
-- of one or more classifier elements.
--


diffServClfrElementNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This  object  yields  a  value  when  read  that  is
       currently    unused   for   a   diffServClfrElementId
       instance.  If a configuring system attempts to create
       a  new row in the diffServClfrElementTable using this
       value, that opera- tion will fail if the value   has,
       in   the   meantime,  been  used  to
     line speed" ones as well? (yes) - DONE - explained  create  another
       row that these are
     interrelated.

(7)  Scheduler weights vs. rates vs. priorities: this is confusing -
     suggest we stick currently valid."
    ::= { diffServClassifier 3 }


diffServClfrElementTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServClfrElementEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The classifier element table  enumerates  the  rela-
       tionship  between  classification patterns and subse-





Baker, Chan, Smith         Expires June 2001           [Page 41]




Internet Draft        Differentiated Services MIB          November 2000


       quent downstream diffserv  functional  datapath  ele-
       ments.   Classification  parameters  are  defined  by
       entries   of   filter   tables    pointed    to rates    by
       diffServClfrElementSpecific.   There  can  be  filter
       tables of different types, and priorities (see Model draft 7.1.2) -
     DONE.

(8)  Queue Measure table:

o  they  can  be  inter-
       mixed  and used within a classifier.  An example of a
       filter table defined in this  MIB  is  diffServSixTu-
       pleClfrTable,  for IP Multi-Field Classifiers (MFCs).
       Filter tables for other filter types may  be  defined
       elsewhere."
    REFERENCE
        "[MODEL] section 4.1"
    ::= { diffServClassifier 4 }


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,
    diffServClfrElementOrder       Unsigned32,
    diffServClfrElementNext        RowPointer,
    diffServClfrElementSpecific    RowPointer,
    diffServClfrElementStatus      RowStatus
}

Baker, Chan, Smith         Expires June 2001           [Page 42]




Internet Draft        Differentiated Services MIB          November 2000


diffServClfrElementId OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index  that  enumerates  the  Classifier  Element
       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 classifier Id  identifies  which  classifier  this
       classifier  element  is  a part of.  This allows for RIO - multiple averaging functions needs to be
       the value of diffServClfrId attribute for an existing
       row in diffServClfrTable."
    ::= { diffServClfrElementEntry 2 }


diffServClfrElementOrder OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The relative order in which classifier elements  are
       applied:   higher  numbers  represent classifier ele-
       ment with  higher  precedence.   Classifier  elements
       with the same
     queue: is this needed? OUT OF SCOPE.

o    mixes config with status objects - split these? N/A.

o    do we need floating-point representation for "weight"? N/A.

o    do we need MIB visibility for average queue depth? N/A.

o    do we need MIB-configurable averaging functions (sample
     weight/interval)?  (maybe just "sample weight") - NO: averaging
     functions will order  must  be left out although framework allows for their
     inclusion separately.

(9)  Counter compliance: paste text from IF-MIB re line-speeds. Do you
     still have to do the low-speed counters for fast interfaces? YES.
     DONE.

(10) Meters:  unambiguous  i.e. they
       must define non-overlapping patterns, and  are these mandatory for compliance? NO

(11) Discussion material: move most of this   con-
       sidered   to   be  applied   simultaneously   to Model draft e.g. most of
     3.1, 3.3, "Dropper/discarder" part of 3.4, nearly all of 3.5. Just
     leave the "how does the MIB map from  the Model" parts
       traffic stream. Clas- sifier elements with  different
       order   may  overlap in their  filters:  the MIB
     draft, no general discussion. DONE.

(12) Counters: merged in 32-bit and 64-bit counters - conformance
     statements sort out which ones classif-
       ier element with the highest order  that  matches  is
       taken.

       On a given interface, there must be implemented. This is
     consistent with [IFMIB]. DONE. a complete  clas-
       sifier   in   place   at  all  times in   the ingress


Baker, Chan, Smith         Expires January June 2001           [Page 16] 43]




Internet Draft        Differentiated Services MIB             July          November 2000


(13) Droppers: we used to have a common "dropper" table


       direction.  This means that represented
     all of: dropAlways, randomDrop, tailDrop with just some parameters
     valid for the simpler ones. A simpler representation is to define
     specific dropper tables for each type (e.g. a single OID to point
     at for dropAlways since it is there will always the last action be  one
       or  more  filters that match every possible pat- tern
       that  could  be  presented  in a chain)
     but this would mean a larger number of (simpler) MIB objects.
     CHANGES: dropAlways is still  an Action but  incoming  packet.
       There  is  no  such  requirement in the others are moved to egress direc-
       tion."
    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 diffServAlgDropTable.  classifier described in [MODEL]
       section 4.1.

       This table can handle tail/head/random drop
     - others by extension.

(14) Should TBMeterTable just AUGMENT selects the MeterTable, should it use same
     indices or are separate structures linked by RowPointers
     preferable? (same indices without RowPointer).

(15) Do we need next  diffserv  functional  datapath
       element  to model multiple queues feeding back into a single
     dropper algorithm? (yes).  If so, the current single-queue pointer
     and threshold will not be adequate - should we leave them in? They
     will be useful  handle traffic for many, but not all, dropper algorithms. (yes)

(17) We have concepts this data path.  This
       RowPointer should point to an instance of one of:
         diffServClfrEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value of zeroDotZero in this attribute indicates no
       further Diffserv treatment is performed on traffic of "inbound" and "outbound" directions: but
       this datapath.

       If the row pointed to does not exist,  the  treatment
       is  as  if we
     have  this  attribute contains a series value of multiple TCBs on zero-
       DotZero."
    ::= { diffServClfrElementEntry 4 }


diffServClfrElementSpecific OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "A pointer to a given interface for  valid  entry   in   another   table,
       filter table, that describes  the same
     direction (allowed by applicable classif-
       ication parameters, e.g.  an entry in  diffServSixTu-
       pleClfrTable.


Baker, Chan, Smith         Expires June 2001           [Page 44]




Internet Draft        Differentiated Services MIB          November 2000


       If the model) then we do not have a way row pointed to
     indicate "this is does not exist, the 1st one". Moreover, it  classifier
       element is a somewhat
     convoluted process ignored.

       The value zeroDotZero is interpreted  to then find the 2nd, 3rd etc. ones  match  any-
       thing  not  matched  by  another classifier element - you would
     have to follow
       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 RowPointers to get there: should we explicitly
     have an index  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 based on 6 different fields in the IP
-- header. This is intended to enable/help these lookup operations? Note: be IP-version-independent.
-- Filters, entries in this is
     not table, may be shared, pointed to,
-- by multiple diffServClfrElementEntry, of same or different
-- datapaths in the same issue as needing system.
--


diffServSixTupleClfrNextFree OBJECT-TYPE





Baker, Chan, Smith         Expires June 2001           [Page 45]




Internet Draft        Differentiated Services MIB          November 2000


    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a "precedence" value when read that is currently unused
       for each filter entry
     of a classifier (yes - added another index to classifiers diffServSixTupleClfrId instance.
       If a configuring system attempts to
     represent what TCB they operate at for create a given
     interface/direction).

5.2.  Open Issues resolved new row
       in this draft

(13) Droppers: slight change to previous resolution. MIB can now handle
     tail/head/random drop the diffServSixTupleClfrTable using diffServAlgDropTable and
     diffServRandomDropTable.

(18) Should manager be allowed this value, that operation
       will fail if the value has, in the meantime, been used
       to create Queue elements or should agent
     be in control another row that is currently valid."
    ::= { diffServClassifier 5 }


diffServSixTupleClfrTable OBJECT-TYPE
    SYNTAX   SEQUENCE OF DiffServSixTupleClfrEntry
    MAX-ACCESS   not-accessible
    STATUS   current
    DESCRIPTION
       "A table of this? (the former)

(19) Should manager be allowed IP Six-Tuple  Classifier  filter  entries
       that a system may use to create Scheduler elements or 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 }

Baker, Chan, Smith         Expires June 2001           [Page 46]




Internet Draft        Differentiated Services MIB          November 2000


DiffServSixTupleClfrEntry ::= SEQUENCE {
    diffServSixTupleClfrId           Unsigned32,
    diffServSixTupleClfrDstAddrType  InetAddressType,
    diffServSixTupleClfrDstAddr      InetAddress,
    diffServSixTupleClfrDstAddrMask  Unsigned32,
    diffServSixTupleClfrSrcAddrType  InetAddressType,
    diffServSixTupleClfrSrcAddr      InetAddress,
    diffServSixTupleClfrSrcAddrMask  Unsigned32,
    diffServSixTupleClfrDscp         Dscp,
    diffServSixTupleClfrProtocol     Unsigned32,
    diffServSixTupleClfrDstL4PortMin SixTupleClfrL4Port,
    diffServSixTupleClfrDstL4PortMax SixTupleClfrL4Port,
    diffServSixTupleClfrSrcL4PortMin SixTupleClfrL4Port,
    diffServSixTupleClfrSrcL4PortMax SixTupleClfrL4Port,
    diffServSixTupleClfrStatus       RowStatus
}


diffServSixTupleClfrId OBJECT-TYPE
    SYNTAX         Unsigned32
    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
     agent be obtain  new  values
       for   row   creation   in control   this   table  by  reading
       diffServSixTupleClfrNextFree."
    ::= { diffServSixTupleClfrEntry 1 }


diffServSixTupleClfrDstAddrType OBJECT-TYPE
    SYNTAX         InetAddressType
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The type of this? (the former)

(20) Related to (17) above, do we also need a "TCB index" for elements
     other than classifiers? (no) IP  destination  address  used  by  this
       classifier entry."
    ::= { diffServSixTupleClfrEntry 2 }


diffServSixTupleClfrDstAddr OBJECT-TYPE




Baker, Chan, Smith         Expires January June 2001           [Page 17] 47]




Internet Draft        Differentiated Services MIB             July          November 2000


(21) Do we need diffServAlgDropType of both "headDrop" and "tailDrop" or
     should we just represent the tail dropper by placing a dropper
     after the queue instead of before the queue, as linked by the
     diffServQNext and diffServAlgDropNext RowPointers? (the former -
     dropper is always in front of the queue in this model).

(22) Do we need


    SYNTAX         InetAddress
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The IP address to support RED algorithms for algorithm parameter
     configuration and monitoring?  If so, what variables are needed?
     (Added diffServRandomDropTable).

(24) diffServAlgDropQThreshold needs UNITS (Bytes).

(25) Dangling RowPointers: should we mandate that these are never
     permitted? Or just define match against the behaviour if they do dangle? (We
     define it such that elements that have dangling pointers, as well
     as upstream elements that point to them, are considered "not
     activated")

(26) Discontinuity times for MIB counters - is
     ifCounterDiscontinuityTime adequate?  (no: added
     diffServCountActDiscontTime).

(27) How do we handle dropper algorithms that require additional
     classification information in order to do their job? If a
     Classifier is needed then create packet's  desti-
       nation IP address."
    ::= { diffServSixTupleClfrEntry 3 }


diffServSixTupleClfrDstAddrMask OBJECT-TYPE
    SYNTAX         Unsigned32
    UNITS          "bits"
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The length of a new TCB mask for it at the point just
     before matching of the dropper: use ordinary Classifier elements  desti-
       nation  IP address.  Masks are constructed by setting
       bits in this TCB.

(28) Indexing of table entries and uniqueness hints: is TestAndIncr sequence from the
     correct tool most-significant bit  down-
       wards    for   diffServSixTupleClfrDstAddrMask   bits
       length. All other bits in the mask, up to use? (no: RowStatus is the right tool for ensuring
     uniqueness; use a NextFree variable as a hint).

(32) Miscellaneous clarifications - thanks Bob.

5.3.  Still Open Issues

(16) Should  number
       needed to fill the creation length of counter actions be under the control of
     manager or agent: should a diffServActionEntry and
     diffServCountActEntry appear by magic (does address diffServSix-
       TupleClfrDstAddr are cleared to zero.  A zero bit  in
       the agent know what
     counters it can and cannot maintain on a given interface)? (no) If
     no, should diffServCountActEntry appear magically when a
     diffServAction element is created which points at mask then means that the
     diffServCountActTable (then would be no need for
     diffServCountActStatus)? (no)

(23) Do daughter entries corresponding bit in the
       address always matches."
    DEFVAL         {0}
    ::= { diffServSixTupleClfrEntry 4 }


diffServSixTupleClfrSrcAddrType OBJECT-TYPE
    SYNTAX         InetAddressType
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The type of derived table entries need IP source address used by this  classif-
       ier entry."
    ::= { diffServSixTupleClfrEntry 5 }


diffServSixTupleClfrSrcAddr OBJECT-TYPE
    SYNTAX         InetAddress
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The IP  address  to exist
     independently of  match  against  the parent?  Examples are
     diffServMeterEntry/diffServTBMeterEntry,  source  IP
       address of each packet."
    ::= { diffServSixTupleClfrEntry 6 }


Baker, Chan, Smith         Expires January June 2001           [Page 18] 48]




Internet Draft        Differentiated Services MIB             July          November 2000


     diffServActionEntry/diffServCountActEntry and
     diffServAlgDropEntry/diffServRandomDropEntry (assume they must be
     independent


diffServSixTupleClfrSrcAddrMask OBJECT-TYPE
    SYNTAX         Unsigned32
    UNITS          "bits"
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The length of a mask for the equivalent entry in diffServMeterTable which
     points at matching of the TB table - needs diffServTBMeterStatus: daughters
     must be created explicitly  source
       IP address.  Masks are constructed by manager).

(30) Related to (17) - multi-manager creation of TCBs:
     diffServClassifierId is unique across setting bits in
       sequence from the agent, most-significant bit downwards  for all values of
     diffServClassifierTcb but there is no "next free" variable to
     report
       diffServSixTupleClfrSrcAddrMask   bits   length.  All
       other bits in the next TCB to use. This can lead to a race condition when
     2 managers are duelling mask, up to create entries with the same value of
     diffServClassifierTcb. There are also legitimate reasons for
     different managers  number  needed  to be "creating"
       fill   the *same* TCB so a
     conventional "next free" is not a good solution.  Is this a rare
     enough occurence given a suitable choice   length  of diffServClassifierTcb
     e.g. pseudo-random? (yes).

(31) When inheritance is needed and parent/daughter share indexing,  the
     parent often points  address  diffServSixTu-
       pleClfrSrcAddr are cleared to zero.  A  zero  bit  in
       the daughter using a "Specific" attribute
     e.g. diffServMeterSpecific, diffServActionSpecific,
     diffServAlgDropSpecific. If this is a RowPointer and points to mask then means that the
     associated row corresponding bit in the daughter's table, there is redundant
     information which gives scope for additional error cases. So,
     wherever possible, should we remove this redundant information by
     making the "Specific" attribute point only to
       address always matches."
    DEFVAL         {0}
    ::= { diffServSixTupleClfrEntry 7 }


diffServSixTupleClfrDscp OBJECT-TYPE
    SYNTAX         Dscp
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The value that the base of DSCP in the
     daughter table and make it an OBJECT IDENTIFIER? The con is that packet must  have  to
       match  this is an unusual use  entry.  A  value  of MIB pointers (point at table base, -1 indicates that a
       specific DSCP value has not
     individual entries).


6.  MIB Definition


DIFF-SERV-MIB DEFINITIONS been defined and thus all
       DSCP values are considered a match."
    DEFVAL         {-1}
    ::= BEGIN

    IMPORTS
    Unsigned32, Counter32, Counter64, OBJECT-TYPE,
    MODULE-IDENTITY, 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
        FROM INET-ADDRESS-MIB { diffServSixTupleClfrEntry 8 }


diffServSixTupleClfrProtocol OBJECT-TYPE
    SYNTAX         Unsigned32 (0..255)





Baker, Chan, Smith         Expires January June 2001           [Page 19] 49]




Internet Draft        Differentiated Services MIB             July          November 2000


    BurstSize
        FROM INTEGRATED-SERVICES-MIB;

diffServMib MODULE-IDENTITY
    LAST-UPDATED "200007130000Z"
    ORGANIZATION "IETF Diffserv WG"
    CONTACT-INFO
       "       Brian Carpenter (co-chair of Diffserv WG)
               c/o iCAIR
               1890 Maple Ave, #150
               Evanston, IL 60201, USA
       Phone:  +1 847 467 7811
       E-mail: brian@icair.org

               Kathleen Nichols (co-chair of Diffserv WG)
               Packet Design
       E-mail: nichols@packetdesign.com

               Fred Baker (author)
               Cisco Systems
               519 Lado Drive
               Santa Barbara, CA 93111, USA
       E-mail: fred@cisco.com

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

               Andrew Smith (author)
       E-mail: ah_smith@pacbell.net"


    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "This MIB defines the objects necessary
       "The IP protocol to manage a device that
       uses the Differentiated Services Architecture described in RFC
       2475 and match against the Informal Management Model for DiffServ Routers in
       draft-ietf-diffserv-model-04.txt."
    REVISION "200007130000Z"
    DESCRIPTION
       "Initial version, published as RFC xxxx."
    ::= { mib-2 12345 }  -- anybody who uses this unassigned
                         --  IPv4  protocol
       number deserves  in  the wrath  packet.  A value of IANA

diffServObjects        OBJECT IDENTIFIER zero means match
       all."
    DEFVAL         {0}
    ::= { diffServMib 1 diffServSixTupleClfrEntry 9 }
diffServTables         OBJECT IDENTIFIER


diffServSixTupleClfrDstL4PortMin OBJECT-TYPE
    SYNTAX         SixTupleClfrL4Port
    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}
    ::= { diffServMib 2 diffServSixTupleClfrEntry 10 }
diffServMIBConformance OBJECT IDENTIFIER


diffServSixTupleClfrDstL4PortMax OBJECT-TYPE
    SYNTAX         SixTupleClfrL4Port
    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}
    ::= { diffServMib 3 diffServSixTupleClfrEntry 11 }





Baker, Chan, Smith         Expires January June 2001           [Page 20] 50]




Internet Draft        Differentiated Services MIB             July          November 2000


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

Dscp ::= TEXTUAL-CONVENTION
    DISPLAY-HINT "d"


diffServSixTupleClfrSrcL4PortMin OBJECT-TYPE
    SYNTAX         SixTupleClfrL4Port
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "The IP header Diffserv Code-Point that may be used for
       discriminating or marking a traffic stream.  The minimum  value -1 is used  that  the  layer-4  source  port
       number in the packet must have in order to indicate a wildcard i.e. any value." match this
       classifier entry."
    DEFVAL         {0}
    ::= { diffServSixTupleClfrEntry 12 }


diffServSixTupleClfrSrcL4PortMax OBJECT-TYPE
    SYNTAX   INTEGER (-1 | 0..63)         SixTupleClfrL4Port ::= TEXTUAL-CONVENTION
    DISPLAY-HINT "d"
    MAX-ACCESS     read-create
    STATUS         current
    DESCRIPTION
       "A
       "The maximum  value indicating a Layer-4 protocol  that  the  layer-4  source  port number."
    SYNTAX   INTEGER (0..65535)

IfDirection
       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}
    ::= TEXTUAL-CONVENTION { diffServSixTupleClfrEntry 13 }


diffServSixTupleClfrStatus OBJECT-TYPE
    SYNTAX      RowStatus
    MAX-ACCESS  read-create
    STATUS  current
    DESCRIPTION
       "Specifies a direction
       "The  RowStatus  variable  controls  the  activation,
       deactivation,  or deletion of data travel on an interface. 'inbound'
       traffic is operated on during reception from a classifier. Any writ-
       able variable may be  modified  whether  the interface, while
       'outbound' traffic  row  is operated on prior to transmission on the
       interface."
    SYNTAX  INTEGER
       active or notInService."
    ::= {
                inbound(1),     -- ingress interface
                outbound(2)     -- egress interface diffServSixTupleClfrEntry 14 }




Baker, Chan, Smith         Expires January June 2001           [Page 21] 51]




Internet Draft        Differentiated Services MIB             July          November 2000


--
-- Classifiers Meters
--

diffServMeter          OBJECT IDENTIFIER ::= { diffServMIBObjects 3 }

--
-- Classifier Table This MIB supports a variety of Meters.  It includes a
-- specific definition for Meters whose parameter set can
-- be modelled using Token Bucket parameters.
-- Other metering parameter sets can be defined and used
-- when necessary.
--
-- Multiple meter elements may be logically cascaded using
-- their diffServMeterSucceedNext and diffServMeterFailNext
-- pointers if required.
-- One example of this might be for an AF PHB implementation
-- that uses multiple level conformance meters.
--
-- Cascading of individual meter elements in the MIB is
-- intended to be functionally equivalent to multiple level
-- conformance determination of a packet.  The Classifier Table allows us sequential
-- nature of the representation is merely a notational
-- convenience for this MIB.
--
-- For example:
-- Conforming to RFC 2697, srTCM can be parameterized using
-- two sets of diffServMeterEntry and diffServTBMeterEntry.
-- With the first set parameterizing the Committed Burst Size
-- token-bucket, second set parameterizing the Excess Burst Size
-- token-bucket.  With both set's diffServTBMeterRate parameters
-- being used to enumerate reflect the relationship Committed Information Rate value.
-- between arbitrary classifiers
-- Conforming to RFC 2698, trTCM can be parameterized using
-- two sets of diffServMeterEntry and diffServTBMeterEntry.
-- With the subsequent downstream first set parameterizing the Peak Information Rate
-- and Peak Burst Size token-bucket, second set parameterizing
-- Diffserv elements.

diffServClassifierTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServClassifierEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The classifier table defines the classifiers that are applied Committed Information Rate and Committed Burst Size
-- token-bucket.
--
-- Conforming to
       traffic arriving at this interface in a particular direction.
       Specific classifiers are defined by RowPointers in the entries of
       this table which identify entries in filter tables RFC 2859, tswTCM can be parameterized using
-- two sets of specific
       types, e.g.  Multi-Field Classifiers (MFCs) for IP are defined in diffServMeterEntry and diffServTBMeterEntry.
-- With the diffServSixTupleClfrTable. Other classifier types may be
       defined elsewhere."
    REFERENCE
        "[MODEL] section 4.1"
    ::= { diffServTables 1 }

diffServClassifierEntry OBJECT-TYPE
    SYNTAX       DiffServClassifierEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in first set parameterizing the classifier table describes a single element of Committed Target Rate,
-- second set parametering the classifier."
    INDEX { ifIndex, diffServClassifierIfDirection,
            diffServClassifierTcb, diffServClassifierId }
    ::= { diffServClassifierTable 1 }

DiffServClassifierEntry ::= SEQUENCE  {
    diffServClassifierIfDirection  IfDirection,
    diffServClassifierTcb          Unsigned32,
    diffServClassifierId           Unsigned32,
    diffServClassifierFilter       RowPointer,
    diffServClassifierNext         RowPointer,
    diffServClassifierPrecedence   Unsigned32,
    diffServClassifierStatus       RowStatus Peak Target Rate.
-- With both set's diffServTBMeterInterval being used to
-- reflect the Average Interval as specified by RFC 2859.
--





Baker, Chan, Smith         Expires January June 2001           [Page 22] 52]




Internet Draft        Differentiated Services MIB             July          November 2000


}

diffServClassifierIfDirection OBJECT-TYPE
    SYNTAX  IfDirection
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "Specifies the direction for which this classifier entry applies
       on this interface."
    ::= { diffServClassifierEntry 1 }

diffServClassifierTcb


diffServMeterNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible   read-only
    STATUS       current
    DESCRIPTION
       "Specifies the TCB of which this classifier element is a part.
       Lower numbers indicate an element that belongs to a classifier
       that is part of a TCB that is, at least conceptually, applied to
       traffic before those with higher numbers - this is necessary to
       resolve ambiguity in cases where different TCBs contain filters
       that overlap with each other.

       A manager wanting to create a new TCB should either first search
       this table for existing entries and pick a value for this
       variable that is not currently represented - some form of pseudo-
       random choice
       "This  object  yields  a  value  when  read  that  is likely
       currently  unused for a diffServMeterId instance.  If
       a configuring system attempts to minimise collisions. After successful
       creation of create a conceptual new row using  in
       the chosen  diffServMeterTable using this value, the manager
       should check again that there are no other rows with this opera-
       tion will fail if the value
       that have been created by a different manager that could,
       potentially, interfere with  has,  in  the classifier elements  meantime,
       been  used  to  create  another row that are
       desired." is currently
       valid."
    ::= { diffServClassifierEntry 2 diffServMeter 1 }

diffServClassifierId


diffServMeterTable OBJECT-TYPE
    SYNTAX       Unsigned32       SEQUENCE OF DiffServMeterEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "A classifier ID that
       "This table enumerates the classifier elements. specific meters that a  system
       may use to police, or shape, a stream of traffic. The set
       traffic stream to be metered  is  determined  by  the
       diffserv  functional  datapath element(s) upstream of such identifiers spans
       the whole agent. Managers should obtain
       new values for row creation 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 reading
       diffServClassifierNextFree." diffServMeterSpecific."
           REFERENCE
               "[MODEL] section 5.1"
    ::= { diffServClassifierEntry 3 diffServMeter 2 }

diffServClassifierFilter OBJECT-TYPE
    SYNTAX       RowPointer


Baker, Chan, Smith         Expires January June 2001           [Page 23] 53]




Internet Draft        Differentiated Services MIB             July          November 2000


diffServMeterEntry OBJECT-TYPE
    SYNTAX       DiffServMeterEntry
    MAX-ACCESS   read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "A pointer to a valid
       "An entry in another the meter table that describes the
       applicable classification filter, e.g. an entry in
       diffServSixTupleClfrTable.  If the row pointed to does not exist,
       the classifier is ignored.

       The value zeroDotZero is interpreted to match anything not
       matched by another classifier - only one a single  con-
       formance level of a meter."
    INDEX { diffServMeterId }
    ::= { diffServMeterTable 1 }


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


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

diffServClassifierNext


diffServMeterSucceedNext OBJECT-TYPE
    SYNTAX       RowPointer





Baker, Chan, Smith         Expires June 2001           [Page 54]




Internet Draft        Differentiated Services MIB          November 2000


    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This
       "If the traffic does conform, this selects  the  next
       diffserv   functional   datapath  element  to  handle packets
       matching the filter pattern. For example,
       traffic for this can data path.  This  RowPointer  should
       point to an
       entry instance of one of:
         diffServClfrEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value of zeroDotZero in a meter, action, algorithmic dropper or queue table. this attribute indicates no
       further Diffserv treatment is performed on traffic of
       this datapath.

       If the row pointed to does not exist,  the classifier element  treatment
       is
       ignored."  as  if  this  attribute contains a value of zero-
       DotZero."
    DEFVAL      { zeroDotZero }
    ::= { diffServClassifierEntry 5 diffServMeterEntry 2 }

diffServClassifierPrecedence


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

       On a given interface, there must be a complete classifier in
       place at all times for the first TCB (lowest value of
       diffServClassifierTcb) in the ingress direction. This means that
       there will always be one or more filters that match every
       possible pattern that could be presented in an incoming packet.
       There is no such requirement for subsequent TCBs in does not conform,  this  selects  the ingress
       direction, nor
       next  diffserv  functional datapath element to handle
       traffic for any TCB this data path.  This  RowPointer  should
       point to an instance of one of:
         diffServClfrEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value of zeroDotZero in the egress direction." this attribute indicates no
       further Diffserv treatment is performed on traffic of





Baker, Chan, Smith         Expires January June 2001           [Page 24] 55]




Internet Draft        Differentiated Services MIB             July          November 2000


       this datapath.

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


diffServMeterSpecific OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "This indicates the behaviour of the meter by  point-
       ing  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  diffServTBMeterTable,  which  contains  an
       instance of a single set of Token Bucket parameters."
    ::= { diffServMeterEntry 4 }

diffServClassifierStatus


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

diffServClassifierNextFree


--
-- Token Bucket Meter Table
--
-- Each entry in the Token Bucket Meter Table parameterize
-- a single token bucket.  Multiple token buckets can be
-- used together to parameterize multiple levels of
-- conformance.
--
-- Note that an entry in the Token Bucket Meter Table can
-- be shared, pointed to, by multiple diffServMeterTable





Baker, Chan, Smith         Expires June 2001           [Page 56]




Internet Draft        Differentiated Services MIB          November 2000


-- entries.
--


diffServTBMeterNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This  object  yields  a  value  when  read  that  is currently-unused
       currently  unused  for  a diffServClassifierId diffServTBMeterId instance.
       If a configuring system attempts to create a new  row
       in  the diffServClassifierTable  diffServTBMeterTable  using this value, that
       operation will fail if the value has,  in  the
       meantime,  mean-
       time,  been  used  to  create  another  row  that  is
       currently valid."
    ::= { diffServObjects 1 diffServMeter 3 }

--
-- IP Six-Tuple Classification Table
--
-- Classification based on 6 different fields in the IP
-- header. This is intended to be IP-version-independent.
--

diffServSixTupleClfrTable


diffServTBMeterTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServSixTupleClfrEntry DiffServTBMeterEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "A
       "This table of IP Six-Tuple Classifier filter entries enumerates a single set of  token  bucket
       meter  parameters  that  a system may use to identify IP traffic." police a
       stream of traffic.  Such meters are modelled here  as
       having a single rate and a single burst size."
    REFERENCE
        "[MODEL] section 4.2.2" 5.1"
    ::= { diffServTables 2 diffServMeter 4 }

diffServSixTupleClfrEntry


diffServTBMeterEntry OBJECT-TYPE
    SYNTAX       DiffServSixTupleClfrEntry
    MAX-ACCESS   not-accessible





Baker, Chan, Smith         Expires January June 2001           [Page 25] 57]




Internet Draft        Differentiated Services MIB             July          November 2000


    SYNTAX       DiffServTBMeterEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An IP Six-Tuple Classifier entry that describes a single filter." set of token bucket
       meter parameters."
    INDEX { diffServSixTupleClfrId diffServTBMeterId }
    ::= { diffServSixTupleClfrTable diffServTBMeterTable 1 }

DiffServSixTupleClfrEntry


DiffServTBMeterEntry ::= SEQUENCE  {
    diffServSixTupleClfrId
    diffServTBMeterId              Unsigned32,
    diffServSixTupleClfrDstAddrType  InetAddressType,
    diffServSixTupleClfrDstAddr      InetAddress,
    diffServSixTupleClfrDstAddrMask
    diffServTBMeterType            INTEGER,
    diffServTBMeterRate            Unsigned32,
    diffServSixTupleClfrSrcAddrType  InetAddressType,
    diffServSixTupleClfrSrcAddr      InetAddress,
    diffServSixTupleClfrSrcAddrMask
    diffServTBMeterBurstSize       BurstSize,
    diffServTBMeterInterval        Unsigned32,
    diffServSixTupleClfrDscp         Dscp,
    diffServSixTupleClfrProtocol     INTEGER,
    diffServSixTupleClfrDstL4PortMin SixTupleClfrL4Port,
    diffServSixTupleClfrDstL4PortMax SixTupleClfrL4Port,
    diffServSixTupleClfrSrcL4PortMin SixTupleClfrL4Port,
    diffServSixTupleClfrSrcL4PortMax SixTupleClfrL4Port,
    diffServSixTupleClfrStatus
    diffServTBMeterStatus          RowStatus
}

diffServSixTupleClfrId


diffServTBMeterId OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "A unique identifier for
       "An index that enumerates the filter. Filters may be shared by
       multiple interfaces in  TBMeter  entries.  The
       set  of  such  identifiers  spans  the same system.  whole  agent.
       Managers should obtain new values for row creation in
       this table by reading
       diffServSixTupleClfrNextFree." diffServTBMeterNextFree."
    ::= { diffServSixTupleClfrEntry diffServTBMeterEntry 1 }

diffServSixTupleClfrDstAddrType


diffServTBMeterType OBJECT-TYPE
    SYNTAX         InetAddressType       INTEGER {





Baker, Chan, Smith         Expires June 2001           [Page 58]




Internet Draft        Differentiated Services MIB          November 2000


                     other(1),        -- not listed here
                     tokenBucket(2),  -- Simple Token Bucket
                     avgRate(3),      -- Average Rate
                     srTCMBlind(4),   -- srTCM, Color-blind
                     srTCMAware(5),   -- srTCM, Color-aware
                     trTCMBlind(6),   -- trTCM, Color-blind
                     trTCMAware(7),   -- trTCM, Color-aware
                     tswTCM(8)        -- tswTCM
                 }
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The type of IP destination address used meter using parameters specified by this classifier
       entry."
       TBMeter entry.

       Value of tokenBucket(2)  indicates  the  use  of  Two
       Parameter  Token Bucket Meter as described in [MODEL]
       section 5.2.3.

       Value of avgRate(3) indicates the use of Average Rate
       Meter as described in [MODEL] section 5.2.1.

       Value of srTCMBlind(4)  and  srTCMAware(5)  indicates
       the use of Single Rate Three Color Marker Metering as
       defined by RFC 2697, with `Color  Blind'  and  `Color
       Aware' mode as described by the RFC.

       Value of trTCMBlind(6)  and  trTCMAware(7)  indicates
       the  use  of  Two Rate Three Color Marker Metering as
       defined by RFC 2698, with `Color  Blind'  and  `Color
       Aware' mode as described by the RFC.

       Value of tswTCM(8) indicates the use of Time  Sliding
       Window  Three Color Marker Metering as defined by RFC
       2859."
    REFERENCE
        "[MODEL] section 5"
    ::= { diffServSixTupleClfrEntry diffServTBMeterEntry 2 }

diffServSixTupleClfrDstAddr


diffServTBMeterRate OBJECT-TYPE
    SYNTAX         InetAddress       Unsigned32
    UNITS        "kilobits per second"
    MAX-ACCESS   read-create
    STATUS         current


Baker, Chan, Smith         Expires January June 2001           [Page 26] 59]




Internet Draft        Differentiated Services MIB             July          November 2000


    STATUS       current
    DESCRIPTION
       "The IP address to match against the packet's destination IP
       address."  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 FRC 2698  for  trTCM
       3.  CTR and PTR in RFC 2859 for TSWTCM 4. AverageRate
       used in [MODEL] section 5."
    ::= { diffServSixTupleClfrEntry diffServTBMeterEntry 3 }

diffServSixTupleClfrDstAddrMask


diffServTBMeterBurstSize OBJECT-TYPE
    SYNTAX         Unsigned32       BurstSize
    UNITS          "bits"        "Bytes"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The length maximum number of bytes in a mask for the matching of the destination IP
       address.  Masks are constructed by setting bits single transmission
       burst.  This attribute is used for: 1. CBS and EBS in sequence from
       the most-significant bit downwards
       RFC 2697 for
       diffServSixTupleClfrDstAddrMask bits length. All other bits in
       the mask, up to the number needed to fill the length of the
       address diffServSixTupleClfrDstAddr are cleared to zero.  A zero
       bit srTCM 2. CBS and PBS  in the mask then means that the corresponding bit  FRC  2698  for
       trTCM 3. Burst Size used in the
       address always matches."
    DEFVAL         {0} [MODEL] section 5."
    ::= { diffServSixTupleClfrEntry diffServTBMeterEntry 4 }

diffServSixTupleClfrSrcAddrType


diffServTBMeterInterval OBJECT-TYPE
    SYNTAX         InetAddressType       Unsigned32
    UNITS        "microseconds"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The type of IP source address time interval used by this classifier entry." 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."
    ::= { diffServSixTupleClfrEntry diffServTBMeterEntry 5 }

diffServSixTupleClfrSrcAddr


diffServTBMeterStatus OBJECT-TYPE
    SYNTAX         InetAddress       RowStatus
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The IP address to match against  RowStatus  variable  controls  the source IP address  activation,
       deactivation,  or  deletion  of a meter. Any writable





Baker, Chan, Smith         Expires June 2001           [Page 60]




Internet Draft        Differentiated Services MIB          November 2000


       variable may be modified whether the row is active or
       notInService."
    ::= { diffServTBMeterEntry 6 }


--
-- Actions
--

diffServAction         OBJECT IDENTIFIER ::= { diffServMIBObjects 4 }

--
-- The Action Table allows enumeration of the different
-- types of each
       packet."
    ::= { diffServSixTupleClfrEntry 6 }

diffServSixTupleClfrSrcAddrMask actions to be applied to a traffic flow.
--


diffServActionNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS          "bits"
    MAX-ACCESS     read-create   read-only
    STATUS       current
    DESCRIPTION
       "The length of
       "This  object  yields  a mask  value  when  read  that  is
       currently unused for a diffServActionId instance.  If
       a configuring system attempts to create a new row  in
       the matching of diffServActionTable using this value, that opera-
       tion will fail if the source IP address.
       Masks are constructed by setting bits value  has,  in sequence from  the most-  meantime,
       been  used  to  create  another row that is currently
       valid."
    ::= { diffServAction 1 }


diffServActionTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServActionEntry





Baker, Chan, Smith         Expires January June 2001           [Page 27] 61]




Internet Draft        Differentiated Services MIB             July          November 2000


       significant bit downwards for diffServSixTupleClfrSrcAddrMask
       bits length. All other bits in the mask, up to the number needed
       to fill the length of the address diffServSixTupleClfrSrcAddr are
       cleared to zero.  A zero bit in the mask then means that the
       corresponding bit in the address always matches."
    DEFVAL         {0}
    ::= { diffServSixTupleClfrEntry 7 }

diffServSixTupleClfrDscp OBJECT-TYPE
    SYNTAX         Dscp


    MAX-ACCESS     read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "The value Action Table enumerates actions that the DSCP in the packet must have can be per-
       formed  to match this
       entry. A value  a stream of -1 indicates that traffic. Multiple actions can
       be concatenated.  For example, after marking a specific DSCP value has not
       been defined and thus all DSCP values stream
       of  traffic  exiting  from a meter, a device can then
       perform a count action  of  the  conforming  or  non-
       conforming traffic.

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

diffServSixTupleClfrProtocol


diffServActionEntry OBJECT-TYPE
    SYNTAX         INTEGER (0..255)       DiffServActionEntry
    MAX-ACCESS     read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "The IP protocol to match against the IPv4 protocol number
       "Each entry in the
       packet. A value action table allows description of zero means match all."
    DEFVAL         {0}
       one specific action to be applied to traffic."
    INDEX { diffServActionId }
    ::= { diffServSixTupleClfrEntry 9 diffServActionTable 1 }

diffServSixTupleClfrDstL4PortMin


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





Baker, Chan, Smith         Expires June 2001           [Page 62]




Internet Draft        Differentiated Services MIB          November 2000


    diffServActionStatus            RowStatus
}


diffServActionId OBJECT-TYPE
    SYNTAX         SixTupleClfrL4Port       Unsigned32
    MAX-ACCESS     read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "The minimum value
       "An index that enumerates the layer-4 destination port number in Action entries. The set
       of  such  identifiers spans the packet must have whole agent. Managers
       should obtain new values for  row  creation  in order to match  this classifier entry."
    DEFVAL         {0}
       table by reading diffServActionNextFree."
    ::= { diffServSixTupleClfrEntry 10 diffServActionEntry 1 }

diffServSixTupleClfrDstL4PortMax


diffServActionNext OBJECT-TYPE
    SYNTAX         SixTupleClfrL4Port       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The maximum value that the layer-4 destination port number in
       "This selects the packet must have in order next diffserv  functional  datapath
       element  to match  handle traffic for this classifier entry. data path.  This
       RowPointer should point to an instance of one of:
         diffServClfrEntry
         diffServMeterEntry
         diffServActionEntry
         diffServAlgDropEntry
         diffServQEntry

       A value must be equal of zeroDotZero in this attribute indicates no
       further Diffserv treatment is performed on traffic of
       this datapath.

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


diffServActionSpecific OBJECT-TYPE
    SYNTAX       RowPointer



Baker, Chan, Smith         Expires January June 2001           [Page 28] 63]




Internet Draft         Differentiated Services MIB             July 2000


       for this entry in diffServSixTupleClfrDstL4PortMin."
    DEFVAL         {65535}
    ::= { diffServSixTupleClfrEntry 11 }

diffServSixTupleClfrSrcL4PortMin OBJECT-TYPE
    SYNTAX         SixTupleClfrL4Port        Differentiated Services MIB          November 2000


    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The minimum value that
       "A pointer to an object instance providing additional
       information  for the layer-4 source port number in type of action indicated by this
       action table entry.

       For the
       packet must have in order to match standard actions defined by this classifier entry."
    DEFVAL         {0} 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."
    ::= { diffServSixTupleClfrEntry 12 diffServActionEntry 3 }

diffServSixTupleClfrSrcL4PortMax


diffServActionType OBJECT-TYPE
    SYNTAX         SixTupleClfrL4Port       INTEGER {
                     other(1),       -- types not specified here
                     specific(2),    -- follow the Specific pointer
                     absoluteDrop(3) -- disallow traffic
                 }
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The maximum value that the layer-4 source port number in
       "Indicates the
       packet must have in oder to match this classifier entry.  This
       value type of action. The values specific(2)
       must   be equal  associated  with  additional  information,
       pointed to or greater that by diffServActionSpecific, with the actual
       action type indicated by the object being pointed to.
       The value specified for absoluteDrop(3) has no associated  informa-
       tion  and will have a diffServActionSpecific value of
       zeroDotZero.  The use  of  other(1)  is  outside  the
       scope  of  this entry  definition, although the diffServAc-
       tionSpecific pointer may be used  in dsSixTupleIpSrcL4PortMin."
    DEFVAL         {65535}  this  case,  to
       indicate other information."
    ::= { diffServSixTupleClfrEntry 13 diffServActionEntry 4 }

diffServSixTupleClfrStatus


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

diffServSixTupleClfrNextFree notInService."
    ::= { diffServActionEntry 5 }





Baker, Chan, Smith         Expires June 2001           [Page 64]




Internet Draft        Differentiated Services MIB          November 2000


--
-- DSCP Mark Action Table
--
-- Rows of this table are pointed to by diffServActionSpecific
-- to provide detailed parameters specific to the DSCP
-- Mark action.
--
-- A single entry in this table can be shared, pointed to, by
-- multiple diffServActionTable entries, of same or different
-- datapaths.
--

diffServDscpMarkActNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a value when read that is currently-unused currently unused
       for a diffServSixTupleClfrId diffServDscpMarkActId instance.
       If a configuring system attempts to create a new row
       in the diffServSixTupleClfrTable diffServDscpMarkActTable using this value, that operation
       will fail if the value has, in the meantime, been used
       to create another row that is currently valid."





Baker, Chan, Smith        Expires January 2001         [Page 29]

Internet Draft         Differentiated Services MIB             July 2000


    ::= { diffServObjects 2 }



















































Baker, Chan, Smith        Expires January 2001         [Page 30]

Internet Draft         Differentiated Services MIB             July 2000


--
-- Meters
--
-- This MIB includes definitions for a generic Meter
-- Table as well as specific definitions for Token-
-- Bucket Meters, as one example of possible meters.
--

diffServMeterTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServMeterEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This table enumerates generic meters that a system may use to
       police a stream of traffic.  The traffic stream to be metered is
       determined by the 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 diffServMeterSpecific."
           REFERENCE
               "[MODEL] section 5.1"
    ::= { diffServTables 3 }

diffServMeterEntry OBJECT-TYPE
    SYNTAX       DiffServMeterEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the meter table describing a single meter."
    INDEX { ifIndex, diffServMeterIfDirection,
            diffServMeterId  }
    ::= { diffServMeterTable 1 }

DiffServMeterEntry ::= SEQUENCE  {
    diffServMeterIfDirection       IfDirection,
    diffServMeterId                Unsigned32,
    diffServMeterSucceedNext       RowPointer,
    diffServMeterFailNext          RowPointer,
    diffServMeterSpecific          OBJECT IDENTIFIER,
    diffServMeterStatus            RowStatus
}

diffServMeterIfDirection OBJECT-TYPE
    SYNTAX       IfDirection
    MAX-ACCESS   not-accessible
    STATUS       current





Baker, Chan, Smith        Expires January 2001         [Page 31]

Internet Draft         Differentiated Services MIB             July 2000


    DESCRIPTION
       "Specifies the direction for which this meter entry applies on
       this interface." used
       to create another row that is currently valid."
    ::= { diffServMeterEntry 1 diffServAction 3 }

diffServMeterId


diffServDscpMarkActTable OBJECT-TYPE
    SYNTAX       Unsigned32       SEQUENCE OF DiffServDscpMarkActEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This identifies a meter entry. Managers should obtain new values table enumerates specific DSCPs used for row creation in  mark-
       ing  or  remarking  the DSCP field of IP packets. The
       entries of this table may be referenced by reading diffServMeterNextFree." a diffSer-





Baker, Chan, Smith         Expires June 2001           [Page 65]




Internet Draft        Differentiated Services MIB          November 2000


       vActionSpecific attribute."
    REFERENCE
        "[MODEL] section 6.1"
    ::= { diffServMeterEntry 2 diffServAction 4 }

diffServMeterSucceedNext


diffServDscpMarkActEntry OBJECT-TYPE
    SYNTAX       RowPointer       DiffServDscpMarkActEntry
    MAX-ACCESS   read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "If the traffic does conform to the meter, this indicates the
       next datapath element to handle the traffic e.g. an Action or
       another Meter datapath element.

       The value zeroDotZero
       "An  entry  in this variable indicates no further
       Diffserv treatment is performed on this traffic by  the current
       interface  DSCP  mark  action  table   that
       describes a single DSCP used for this interface direction. If the row pointed to
       does not exist, the meter element is considered inactive."
    DEFVAL marking."
    INDEX { zeroDotZero diffServDscpMarkActId }
    ::= { diffServMeterEntry 3 diffServDscpMarkActTable 1 }

diffServMeterFailNext


DiffServDscpMarkActEntry ::= SEQUENCE  {
    diffServDscpMarkActId            Unsigned32,
    diffServDscpMarkActDscp          Dscp,
    diffServDscpMarkActStatus        RowStatus
}


diffServDscpMarkActId OBJECT-TYPE
    SYNTAX       RowPointer       Unsigned32
    MAX-ACCESS   read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "If the traffic does not conform to the meter, this indicates the
       next datapath element to handle
       "An index that enumerates the traffic e.g. an  Mark  Action or
       Meter datapath element.  entries.
       The value zeroDotZero in this variable indicates no further
       Diffserv treatment is performed on this traffic by  set  of  such identifiers spans the current
       interface whole agent.
       Managers should obtain new values for this interface direction. If the row pointed to
       does not exist, the meter element is considered inactive."
    DEFVAL      { zeroDotZero } creation in
       this table by reading diffServDscpMarkActNextFree."
    ::= { diffServMeterEntry 4 diffServDscpMarkActEntry 1 }

diffServMeterSpecific OBJECT-TYPE

Baker, Chan, Smith         Expires January June 2001           [Page 32] 66]




Internet Draft        Differentiated Services MIB             July          November 2000


diffServDscpMarkActDscp OBJECT-TYPE
    SYNTAX       OBJECT IDENTIFIER       Dscp
    MAX-ACCESS   read-create   read-only
    STATUS       current
    DESCRIPTION
       "This indicates the behaviour
       "The DSCP that this Action uses for marking/remarking
       traffic.  Note that a DSCP value of -1 is not permit-
       ted in this table.  It is  quite  possible  that  the meter by pointing
       only  packets  subject  to a table
       containing detailed parameters.  this  Action  are already
       marked with this DSCP. Note also  that entries  Diffserv  may
       result  in that
       specific table must be managed explicitly.

       One example of packet remarking both on ingress to a valid object net-
       work and on egress from it and it is  quite  possible
       that  ingress  and  egress  would be diffServTBMeterTable,
       whose entries are indexed by  occur  in the same variables as this table,
       for describing an instance of a token-bucket meter."
       router."
    ::= { diffServMeterEntry 5 diffServDscpMarkActEntry 2 }

diffServMeterStatus


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

diffServMeterNextFree


--
-- Count Action Table
--
-- Due to the fact that the MIB structure allows multiple
-- cascading diffServActionEntry be used to describe
-- multiple actions for a datapath, the counter became an
-- optional action type.  In normal implementation, a
-- datapath either have counters or it doesn't, it is not
-- an element the management entity can add or remove.
-- The management entity can choose to read the counter or
-- not.  Hence it is recommended for implementation that
-- have counters to always configure the count action as





Baker, Chan, Smith         Expires June 2001           [Page 67]




Internet Draft        Differentiated Services MIB          November 2000


-- the first of multiple actions, for example before the
-- the absolute drop action.
--


diffServCountActNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a value when read that is currently-unused currently unused
       for a diffServMeterId diffServCountActId instance.
       If a configuring system attempts to create a new row
       in the diffServMeterTable diffServCountActTable using this value, that operation
       will fail if the value has, in the meantime, been used
       to create another row that is currently valid."
    ::= { diffServObjects 3 diffServAction 5 }

--
-- Token-Bucket Meter Table
--

diffServTBMeterTable


diffServCountActTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServTBMeterEntry DiffServCountActEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This table enumerates specific token-bucket meters that a system
       may use to police contains counters  for  all  the  traffic
       passing through an action element."
    REFERENCE
        "[MODEL] section 6.4"
    ::= { diffServAction 6 }


diffServCountActEntry OBJECT-TYPE
    SYNTAX       DiffServCountActEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the count action table describes a stream  sin-
       gle set of traffic.  Such meters are modelled
       here as having a single rate and a burst size. traffic counters."
    INDEX { diffServCountActId }
    ::= { diffServCountActTable 1 }


DiffServCountActEntry ::= SEQUENCE  {
    diffServCountActId           Unsigned32,
    diffServCountActOctets       Counter32,
    diffServCountActHCOctets     Counter64,
    diffServCountActPkts         Counter32,





Baker, Chan, Smith         Expires January June 2001           [Page 33] 68]




Internet Draft        Differentiated Services MIB             July          November 2000


       Multiple meter elements may be logically cascaded using their
       diffServMeterSucceedNext pointers if a multi-rate token bucket is
       needed.  One example of this might be for an AF PHB
       implementation that used two-rate meters.  Such cascading of
       meter elements of specific type of token-bucket indicates
       forwarding behaviour


    diffServCountActHCPkts       Counter64,
    diffServCountActDiscontTime  TimeStamp,
    diffServCountActStatus       RowStatus
}


diffServCountActId OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that is functionally equivalent to a multi-
       rate meter: enumerates the sequential nature Count  Action  entries.
       The  set  of  such identifiers spans the representation is merely
       a notational convenience whole agent.
       Managers should obtain new values for this MIB.

       Entries row creation in
       this table share indexing with a parent
       diffServMeterEntry although they must be managed (e.g.
       created/deleted) by explicit management action, independently reading diffServCountActNextFree."
    ::= { diffServCountActEntry 1 }


diffServCountActOctets OBJECT-TYPE
    SYNTAX       Counter32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of octets at the Action datapath element.
       On  high  speed  devices,  this object implements the
       least significant 32  bits  of  diffServCountActHCOc-
       tets.

       Discontinuities in the associated  value  of diffServMeterSpecific."
    REFERENCE
        "[MODEL] section 5.1.3"  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."
    ::= { diffServTables 4 diffServCountActEntry 2 }

diffServTBMeterEntry


Baker, Chan, Smith         Expires June 2001           [Page 69]




Internet Draft        Differentiated Services MIB          November 2000


diffServCountActHCOctets OBJECT-TYPE
    SYNTAX       DiffServTBMeterEntry       Counter64
    MAX-ACCESS   not-accessible   read-only
    STATUS       current
    DESCRIPTION
       "An entry that describes a single token-bucket meter, indexed by
       "The number of octets at the same variables Action datapath element.
       This object should be used on high speed interfaces.

       Discontinuities in the  value  of  this  counter  can
       occur  at  re-initialization of the management system
       and at other times  as a diffServMeterEntry."
    INDEX { ifIndex, diffServMeterIfDirection,
            diffServMeterId  }
    ::= { diffServTBMeterTable 1 }

DiffServTBMeterEntry  indicated  by  the  value  of
       diffServCountActDiscontTime for this entry."
    ::= SEQUENCE {
    diffServTBMeterRate              Unsigned32,
    diffServTBMeterBurstSize         BurstSize
    diffServTBMeterStatus            RowStatus diffServCountActEntry 3 }

diffServTBMeterRate


diffServCountActPkts OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "kilobits per second"       Counter32
    MAX-ACCESS   read-create   read-only
    STATUS       current
    DESCRIPTION
       "The token-bucket rate, number of packets at the  Action  datapath  ele-
       ment.   On high speed devices, this object implements
       the  least  significant  32  bits  of   diffServCoun-
       tActHCPkts.
       Discontinuities in kilobits per second (kbps)." 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."
    ::= { diffServTBMeterEntry 1 diffServCountActEntry 4 }

diffServTBMeterBurstSize


diffServCountActHCPkts OBJECT-TYPE
    SYNTAX       BurstSize
    UNITS        "Bytes"       Counter64
    MAX-ACCESS   read-create   read-only





Baker, Chan, Smith         Expires January June 2001           [Page 34] 70]




Internet Draft        Differentiated Services MIB             July          November 2000


    STATUS       current
    DESCRIPTION
       "The maximum number number of packets at the  Action  datapath  ele-
       ment.   This  object  should  be  used  on 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 bytes in a single transmission burst.  The
       interval over 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 burst is to be measured can be derived as
       diffServTBMeterBurstSize*8*1000/diffServTBMeterRate." last re-initialization of the
       local management subsystem, then this object contains
       a zero value."
    ::= { diffServTBMeterEntry 2 diffServCountActEntry 6 }

diffServTBMeterStatus


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


Baker, Chan, Smith         Expires January June 2001           [Page 35] 71]




Internet Draft        Differentiated Services MIB             July          November 2000


--
-- Actions
--

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

diffServActionTable

diffServAlgDrop        OBJECT IDENTIFIER ::= { diffServMIBObjects 5 }


diffServAlgDropNextFree OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServActionEntry       Unsigned32
    MAX-ACCESS   not-accessible   read-only
    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
       "This  object  yields  a stream of traffic exiting from  value  when  read  that  is
       currently  unused  for  a meter, diffServAlgDropId instance.
       If a device can then perform configuring system attempts to create a count action of new  row
       in  the conforming or
       non-conforming traffic.

       Specific actions are indicated by diffServActionSpecific which
       points to another object which describes  diffServAlgDropTable  using this value, that
       operation will fail if the action value has,  in further
       detail."  the  mean-
       time,  been  used  to  create  another  row  that  is
       currently valid."
    ::= { diffServAlgDrop 1 }


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

diffServActionEntry


diffServAlgDropEntry OBJECT-TYPE
    SYNTAX       DiffServActionEntry       DiffServAlgDropEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in the action table describing describes  a  process  that  drops  packets
       according  to some algorithm.  Further details of the actions applied
       algorithm type are to
       traffic arriving at its input." be found in diffServAlgDropType
       and  with  more  detail parameter entry pointed to by
       diffServAlgDropSpecific when necessary."
    INDEX { ifIndex, diffServActionIfDirection,
            diffServActionId diffServAlgDropId }
    ::= { diffServActionTable diffServAlgDropTable 1 }

DiffServActionEntry ::= SEQUENCE  {
    diffServActionIfDirection       IfDirection,
    diffServActionId                Unsigned32,
    diffServActionNext              RowPointer,
    diffServActionSpecific          OBJECT IDENTIFIER,
    diffServActionStatus            RowStatus
}

diffServActionIfDirection OBJECT-TYPE





Baker, Chan, Smith         Expires January June 2001           [Page 36] 72]




Internet Draft        Differentiated Services MIB             July          November 2000


    SYNTAX       IfDirection
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "Specifies the direction for which this action entry applies on
       this interface."


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

diffServActionId


diffServAlgDropId OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This identifies the action entry. Managers should obtain new
       values for row creation in this table by reading
       diffServActionNextFree."
    ::= { diffServActionEntry 2 }

diffServActionNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The Next pointer indicates the next datapath element to handle
       "An index that  enumerates  the traffic.  For example, a queue datapath element.  Algorithmic  Dropper
       entries.  The value zeroDotZero in this variable indicates no further
       DiffServ treatment is performed on this flow by the current
       interface for this interface direction. If the row pointed to
       does not exist, set of such identifiers spans the action element is considered inactive."
    DEFVAL      { zeroDotZero }
    ::= { diffServActionEntry 3 }

diffServActionSpecific OBJECT-TYPE
    SYNTAX       OBJECT IDENTIFIER
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "A pointer to an object instance providing additional information whole
       agent. Managers should  obtain  new  values  for the type of action indicated by  row
       creation  in  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, the diffServAbsoluteDropAction OID.  For
       other actions, it may point to an object instance defined in some
       other MIB." reading diffServAlgDrop-
       NextFree."
    ::= { diffServActionEntry 4 diffServAlgDropEntry 1 }


diffServAlgDropType OBJECT-TYPE
    SYNTAX       INTEGER {
                     other(1),
                     tailDrop(2),
                     headDrop(3),
                     randomDrop(4)





Baker, Chan, Smith         Expires January June 2001           [Page 37] 73]




Internet Draft        Differentiated Services MIB             July          November 2000


diffServActionStatus OBJECT-TYPE
    SYNTAX       RowStatus


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

diffServActionNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a algorithm used by this dropper. A  value when read
       of tailDrop(2) or headDrop(3) represents an algorithm
       that is currently-unused
       for a diffServActionId instance.  If a configuring system
       attempts to create a new row completely specified by this MIB.  A value of
       other(1) requires further specification in some other
       MIB module.

       The tailDrop(2) algorithm is  described  as  follows:
       diffServAlgDropQThreshold represents the diffServActionTable using
       this value, that operation depth of the
       queue,  pointed  to  by  diffServAlgDropQMeasure,  at
       which all newly arriving packets will fail be dropped.

       The headDrop(3) algorithm is described as follows: if
       a packet arrives when the value has, in current depth of the
       meantime, been used queue,
       pointed to create another row that by diffServAlgDropQMeasure, is at diffSer-
       vAlgDropQThreshold,  packets currently
       valid."
    ::= { diffServObjects 4 }


-- DSCP Mark Action Table
--
-- Rows at the head of this table
       the queue are pointed to by diffServAction dropped to
-- provide detailed parameters specific make room for the new packet
       to be enqueued at the DSCP
-- Mark action.

diffServDscpMarkActTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServDscpMarkActEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This table enumerates specific DSCPs used for marking tail of the queue.

       The randomDrop(4) algorithm is described as  follows:
       on packet arrival, an algorithm is executed which may
       randomly drop the packet,  or
       remarking  drop  other  packet(s)
       from  the DSCP field of IP packets.  queue  in  its place. The entries specifics of this
       table the
       algorithm may be referenced by  proprietary.  For  this  algorithm,
       diffServAlgDropSpecific  points  to a diffServActionSpecific attribute diffServRandom-
       DropEntry that points describes  the  algorithm.   For  this
       algorithm,  diffServAlgQThreshold is understood to diffServDscpMarkActTable."
    REFERENCE
        "[MODEL] section 6.1" be
       the absolute maximum size of the queue and additional
       parameters are described in diffServRandomDropTable."
    ::= { diffServTables 6 diffServAlgDropEntry 2 }

diffServDscpMarkActEntry OBJECT-TYPE
    SYNTAX       DiffServDscpMarkActEntry
    MAX-ACCESS   not-accessible
    STATUS       current


Baker, Chan, Smith         Expires January June 2001           [Page 38] 74]




Internet Draft        Differentiated Services MIB             July          November 2000


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

       A value of zeroDotZero in this attribute indicates no
       further Diffserv treatment is performed on traffic of
       this datapath.

       If the DSCP mark action table that describes row pointed to does not exist,  the  treatment
       is  as  if  this  attribute contains a single
       DSCP used for marking."
    INDEX { diffServDscpMarkActDscp }
    ::= { diffServDscpMarkActTable 1 }

DiffServDscpMarkActEntry value of zero-
       DotZero."
    ::= SEQUENCE {
    diffServDscpMarkActDscp          Dscp diffServAlgDropEntry 3 }

diffServDscpMarkActDscp


diffServAlgDropQMeasure OBJECT-TYPE
    SYNTAX       Dscp       RowPointer
    MAX-ACCESS   read-only   read-create
    STATUS       current
    DESCRIPTION
       "The DSCP that this Action uses for marking/remarking traffic.
       Note that a DSCP value of -1 is not permitted
       "Points to an entry in this table.  It
       is quite possible that the only packets subject diffServQTable to this Action
       are already marked with this DSCP.  Note also indicate
       the  queue  that Diffserv may
       result in packet remarking both on ingress to  a network and on
       egress from it and it drop algorithm is quite possible that ingress and egress
       would occur in to monitor when
       deciding whether  to  drop  a  packet.   If  the same router."  row
       pointed  to  does  not exist, the algorithmic dropper
       element is considered inactive."
    ::= { diffServDscpMarkActEntry 1 diffServAlgDropEntry 4 }


--
-- Count Action Table
--

diffServCountActTable


diffServAlgDropQThreshold OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServCountActEntry       Unsigned32
    UNITS        "Bytes"
    MAX-ACCESS   not-accessible   read-create





Baker, Chan, Smith         Expires June 2001           [Page 75]




Internet Draft        Differentiated Services MIB          November 2000


    STATUS       current
    DESCRIPTION
       "This table contains counters for all
       "A threshold on the traffic passing through
       an depth in bytes of the queue being
       measured at which a trigger is generated to the drop-
       ping 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 element."
    REFERENCE
        "[MODEL] section 6.5"
       will take place. Other algorithms will need to define
       their own semantics for this threshold."
    ::= { diffServTables 7 diffServAlgDropEntry 5 }

diffServCountActEntry


diffServAlgDropSpecific OBJECT-TYPE
    SYNTAX       DiffServCountActEntry       RowPointer
    MAX-ACCESS   not-accessible   read-create
    STATUS       current
    DESCRIPTION
       "An entry in the count action
       "Points to a table entry that describes provides further detail
       regarding a single set
       of traffic counters. drop algorithm.

       Entries in with diffServAlgDropType  equal  to  other(1)
       may have this point to a table share indexing with





Baker, Chan, Smith        Expires January 2001         [Page 39]

Internet Draft         Differentiated Services MIB             July 2000


       those defined in the base diffServActionTable although they another MIB
       module.

       Entries with  diffServAlgDropType  equal  to  random-
       Drop(4)  must be
       managed (e.g. created/deleted) by explicit management action,
       independently of have this point to an entry in diffSer-
       vRandomDropTable.

       For all other algorithms, this should take the associated  value of diffServActionSpecific."
    INDEX { ifIndex, diffServActionIfDirection,
            diffServActionId }
    ::= { diffServCountActTable 1 }

DiffServCountActEntry
       zeroDotzero."
    ::= SEQUENCE {
    diffServCountActOctets       Counter32,
    diffServCountActHCOctets     Counter64,
    diffServCountActPkts         Counter32,
    diffServCountActHCPkts       Counter64,
    diffServCountActDiscontTime  TimeStamp,
    diffServCountActStatus       RowStatus diffServAlgDropEntry 6 }

diffServCountActOctets


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

       Discontinuities in the  value  of  this  counter  can
       occur  at re-
       initialization  re-initialization of the management system





Baker, Chan, Smith         Expires June 2001           [Page 76]




Internet Draft        Differentiated Services MIB          November 2000


       and at other times  as  indicated  by  the  value  of diffServCountActDiscontTime for
       ifCounterDiscontinuityTime appropriate to this
       entry." inter-
       face."
    ::= { diffServCountActEntry 1 diffServAlgDropEntry 7 }

diffServCountActHCOctets


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

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

diffServCountActPkts


diffServAlgDropPkts OBJECT-TYPE
    SYNTAX       Counter32





Baker, Chan, Smith        Expires January 2001         [Page 40]

Internet Draft         Differentiated Services MIB             July 2000
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "The number of packets at the Action datapath element. that have been dropped by this
       drop  process.   On  high  speed devices, this object
       implements the least significant 32 bits of diffServcountActHCPkts.  diffSer-
       vAlgDropHCPkts.

       Discontinuities in the  value  of  this  counter  can
       occur  at re-
       initialization  re-initialization of the management system





Baker, Chan, Smith         Expires June 2001           [Page 77]




Internet Draft        Differentiated Services MIB          November 2000


       and at other times  as  indicated  by  the  value  of diffServCountActDiscontTime for
       ifCounterDiscontinuityTime appropriate to this
       entry." inter-
       face."
    ::= { diffServCountActEntry 3 diffServAlgDropEntry 9 }

diffServCountActHCPkts


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

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

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
       ifCounterDiscontinuityTime appropriate to this
       object contains a zero value." inter-
       face."
    ::= { diffServCountActEntry 5 diffServAlgDropEntry 10 }

diffServCountActStatus


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."





Baker, Chan, Smith        Expires January 2001         [Page 41]

Internet Draft         Differentiated Services MIB             July 2000


    ::= { diffServCountActEntry 6 }

diffServAbsoluteDropAction OBJECT-IDENTITY
    STATUS       current
    DESCRIPTION
       "This object identifier may be used as the value of a
       diffServActionSpecific pointer in order to indicate that all
       packets following this path are to be dropped unconditionally at
       this point. It is likely, but not required, that this action will
       be preceded by a counter action."
    ::= { diffServObjects 6 diffServAlgDropEntry 11 }


Baker, Chan, Smith         Expires January June 2001           [Page 42] 78]




Internet Draft        Differentiated Services MIB             July          November 2000


--
-- Algorithmic Random Drop Table
--

diffServAlgDropTable


diffServRandomDropNextFree OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServAlgDropEntry       Unsigned32
    MAX-ACCESS   not-accessible   read-only
    STATUS       current
    DESCRIPTION
       "The algorithmic drop table contains entries describing an
       element
       "This  object  yields  a  value  when  read  that drops packets according  is
       currently unused for a diffServRandomDropId instance.
       If a configuring system attempts to some algorithm."
    REFERENCE
        "[MODEL] section 7.1.3"
    ::= { diffServTables 8 }

diffServAlgDropEntry OBJECT-TYPE
    SYNTAX       DiffServAlgDropEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry describes create a process new  row
       in the diffServRandomDropTable using this value, that drops packets according to
       some algorithm.  Further details of
       operation will fail if the algorithm type are to be
       found value has,  in diffServAlgDropType and may be pointed to by
       diffServAlgDropSpecific."
    INDEX { ifIndex, diffServAlgDropIfDirection,
            diffServAlgDropId }
    ::= { diffServAlgDropTable 1 }

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

diffServAlgDropIfDirection OBJECT-TYPE
    SYNTAX       IfDirection
    MAX-ACCESS   not-accessible
    STATUS       current





Baker, Chan, Smith        Expires January 2001         [Page 43]

Internet Draft         Differentiated Services MIB             July 2000


    DESCRIPTION
       "Specifies  the direction for which this algorithmic dropper entry
       applies on this interface."  mean-
       time,  been  used  to  create  another  row  that  is
       currently valid."
    ::= { diffServAlgDropEntry 1 diffServAlgDrop 3 }

diffServAlgDropId


diffServRandomDropTable OBJECT-TYPE
    SYNTAX       Unsigned32       SEQUENCE OF DiffServRandomDropEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This identifies the
       "The random drop action entry. Managers should obtain
       new values for row creation table contains entries describing  a
       process  that drops packets randomly. Entries in this
       table is  intended  to  be  pointed  to  by reading
       diffServAlgDropNextFree."  diffSer-
       vAlgDropSpecific."
    REFERENCE
        "[MODEL] section 7.1.3"
    ::= { diffServAlgDropEntry 2 diffServAlgDrop 4 }

diffServAlgDropType


diffServRandomDropEntry OBJECT-TYPE
    SYNTAX       INTEGER { other(1), tailDrop(2),
                           headDrop(3), randomDrop(4) }       DiffServRandomDropEntry
    MAX-ACCESS   read-create   not-accessible
    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 value of other(1) requires
       further specification in some other MIB module.

       The tailDrop(2) algorithm is described as follows:
       diffServAlgDropQThreshold represents the depth of the queue
       diffServAlgDropQMeasure at which all newly arriving packets will
       be dropped.

       The headDrop(3) algorithm is described as follows: if a packet
       arrives when the current depth of the queue
       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 randomDrop(4) algorithm is described as follows: on packet
       arrival, an algorithm is executed which may randomly drop the
       packet, or drop other packet(s) from the queue in its place. The
       specifics of the algorithm may be proprietary. For this
       algorithm, an associated diffServRandomDropEntry is indicated by
       pointing diffServAlgDropSpecific at the diffServRandomDropTable.
       The relevant
       "An entry in describes  a  process  that table is selected by the common
       indexing of the two tables.  For this algorithm,
       diffServAlgQThreshold is understood  drops  packets
       according to be the absolute maximum
       size of the queue and additional parameters are described in a random algorithm."
    INDEX { diffServRandomDropId }




Baker, Chan, Smith         Expires January June 2001           [Page 44] 79]




Internet Draft        Differentiated Services MIB             July          November 2000


       diffServRandomDropTable."


    ::= { diffServAlgDropEntry 3 diffServRandomDropTable 1 }

diffServAlgDropNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The Next pointer indicates the next datapath element to handle
       the traffic e.g. a queue datapath element.

       The value zeroDotZero in this variable indicates no further
       DiffServ treatment is performed on this flow by the current
       interface for this interface direction. If the row pointed to
       does not exist, the algorithmic dropper element is considered
       inactive."


DiffServRandomDropEntry ::= SEQUENCE  { diffServAlgDropEntry 4
    diffServRandomDropId               Unsigned32,
    diffServRandomDropMinThreshBytes   Unsigned32,
    diffServRandomDropMinThreshPkts    Unsigned32,
    diffServRandomDropMaxThreshBytes   Unsigned32,
    diffServRandomDropMaxThreshPkts    Unsigned32,
    diffServRandomDropInvProbMax       Unsigned32,
    diffServRandomDropInvWeight        Unsigned32,
    diffServRandomDropSamplingRate     Unsigned32,
    diffServRandomDropStatus           RowStatus
}

diffServAlgDropQMeasure


diffServRandomDropId OBJECT-TYPE
    SYNTAX       RowPointer       Unsigned32
    MAX-ACCESS   read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "Points to an entry in the diffServQueueTable to indicate the
       queue
       "An index that a drop algorithm is to monitor when deciding whether
       to drop a packet.  If enumerates the row pointed to does not exist,  Random  Drop  entries.
       The  set  of  such identifiers spans the
       algorithmic dropper element is considered inactive." whole agent.
       Managers should obtain new values for row creation in
       this table by reading diffServRandomDropNextFree."
    ::= { diffServAlgDropEntry 5 diffServRandomDropEntry 1 }

diffServAlgDropQThreshold


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

       For the tailDrop(2) or headDrop(3) algorithms, non-zero probability of being dropped.
       Changes in this represents variable may or may not be  reflected
       in   the depth   reported   value   of the queue diffServAlgDropQMeasure at which the drop
       action will take place. Other algorithms will need to define
       their own semantics for this threshold."  diffServRandomDrop-
       MinThreshPkts."
    ::= { diffServAlgDropEntry 6 diffServRandomDropEntry 2 }

diffServAlgDropSpecific


diffServRandomDropMinThreshPkts OBJECT-TYPE
    SYNTAX       OBJECT IDENTIFIER       Unsigned32
    UNITS        "packets"
    MAX-ACCESS   read-create
    STATUS       current





Baker, Chan, Smith         Expires January June 2001           [Page 45] 80]




Internet Draft        Differentiated Services MIB             July          November 2000


    STATUS       current


    DESCRIPTION
       "Points to a table (not an entry in the table) defined elsewhere
       that provides further detail regarding a drop algorithm.  Entries
       "The average queue depth  in such  packets,  beyond  which
       traffic  has a table are indexed by the same variables as this
       diffServAlgDropEntry but note that those entries must be managed
       independently non-zero probability of those being dropped.
       Changes in this table.

       Entries with diffServAlgDropType equal to other(1) variable may have this
       point to a table defined or may not be  reflected
       in another MIB module. Entries with
       diffServAlgDropType equal to randomDrop(4) must have this point
       to diffServRandomDropTable.

       For all other algorithms, this should take the reported value
       zeroDotzero." of diffServRandomDropMinThresh-
       Bytes."
    ::= { diffServAlgDropEntry 7 diffServRandomDropEntry 3 }

diffServAlgDropOctets


diffServRandomDropMaxThreshBytes OBJECT-TYPE
    SYNTAX       Counter32       Unsigned32
    UNITS        "bytes"
    MAX-ACCESS   read-only   read-create
    STATUS       current
    DESCRIPTION
       "The number of octets that have been dropped by this drop
       process.  On 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 average queue depth beyond which traffic  has  a
       probability indicated by the value of ifCounterDiscontinuityTime appropriate
       to this interface."
    ::= { diffServAlgDropEntry 8 }

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

       Discontinuities in  differs
       from  the value of  physical  queue  limit, which is stored in
       diffServAlgDropQThreshold.  Changes in this counter can occur at re-
       initialization of the management system and at other times as
       indicated by  variable
       may  or may not be reflected in the reported value of ifCounterDiscontinuityTime appropriate
       to this interface."
       diffServRandomDropMaxThreshPkts."
    ::= { diffServAlgDropEntry 9 diffServRandomDropEntry 4 }

diffServAlgDropPkts


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 diffServRandomDropInvProbMax
       of being dropped or marked. Note  that  this  differs





Baker, Chan, Smith         Expires January June 2001           [Page 46] 81]




Internet Draft        Differentiated Services MIB             July          November 2000


       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 }


diffServRandomDropInvProbMax OBJECT-TYPE
    SYNTAX       Counter32       Unsigned32
    MAX-ACCESS   read-only   read-create
    STATUS       current
    DESCRIPTION
       "The number of packets that have been dropped by this worst case random drop
       process.  On high speed devices, this object implements probability, expressed as
       the least
       significant 32 bits  inverse  of diffServAlgDropHCPkts.

       Discontinuities in  the value drop probability.  With special
       case of this counter can occur at re-
       initialization the value zero meaning  zero  probability  of
       drop.

       For example, if every packet may be  dropped  in  the management system and at other times as
       indicated by
       worst   case   (100%),   this   has   the   value  of ifCounterDiscontinuityTime appropriate
       to this interface."
       4,294,967,295."
    ::= { diffServAlgDropEntry 10 diffServRandomDropEntry 6 }

diffServAlgDropHCPkts


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

       Discontinuities past history in affecting the  cal-
       culation  of  the  current queue average.  The moving
       average of the queue depth uses the inverse  of  this
       value  as the factor for the new queue depth, and one
       minus that inverse as the factor for  the  historical
       average.





Baker, Chan, Smith         Expires June 2001           [Page 82]




Internet Draft        Differentiated Services MIB          November 2000


       Implementations may choose to  limit  the  acceptable
       set  of  values to a specified set, such as powers of this counter can occur at re-
       initialization
       2."
    ::= { diffServRandomDropEntry 7 }


diffServRandomDropSamplingRate OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The number of the management system and at other times as
       indicated by per second the queue is  sampled
       for queue average calculation.  A value of ifCounterDiscontinuityTime appropriate
       to this interface." zero means
       the queue is sampled approximately each time a packet
       is enqueued (or dequeued)."
    ::= { diffServAlgDropEntry 11 diffServRandomDropEntry 8 }

diffServAlgDropStatus


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

diffServAlgDropNextFree









Baker, Chan, Smith         Expires June 2001           [Page 83]




Internet Draft        Differentiated Services MIB          November 2000


--
-- Queue Table
--

diffServQueue          OBJECT IDENTIFIER ::= { diffServMIBObjects 6 }

--
-- An entry of diffServQTable represents a FIFO queue diffserv
-- functional datapath element as described in [MODEL] section
-- 7.1.1.
-- Notice the specification of scheduling parameters for a queue
-- as part of the input to a scheduler functional datapath
-- element as described in [MODEL] section 7.1.2.  This allows
-- building of hierarchical queueing/scheduling.
-- A queue therefore is parameterized by:
-- 1. Which scheduler will service this queue, diffServQNext.
-- 2. How the scheduler will service this queue, with respect
--    to all the other queues the same scheduler needs to service,
--    diffServQSchdParam.
--
-- Notice one or more upstream diffserv datapath element may share,
-- point to, a diffServQTable entry as described in [MODEL] section
-- 7.1.1.
--
-- Each entry of the diffServQTable belongs to one and only one
-- datapath.
--


diffServQNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This  object  yields  a  value  when  read  that  is currently-unused
       currently  unused  for  a diffServAlgDropId diffServQId instance.  If a
       configuring system attempts to create a  new  row  in
       the diffServAlgDropTable  diffServQTable  using this value, that operation will fail if the value has, in the





Baker, Chan, Smith        Expires January 2001         [Page 47]

Internet Draft         Differentiated Services MIB             July 2000 value, that operation
       will fail if the value has,  in  the  meantime,  been
       used to create another row that is currently valid."
    ::= { diffServObjects 7 diffServQueue 1 }


diffServRandomDropTable


diffServQTable OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServRandomDropEntry DiffServQEntry
    MAX-ACCESS   not-accessible
    STATUS       current





Baker, Chan, Smith         Expires June 2001           [Page 84]




Internet Draft        Differentiated Services MIB          November 2000


    DESCRIPTION
       "The random drop table augments the algorithmic drop table.  It
       contains entries describing a process that drops packets
       randomly. This table is intended to be pointed to by Queue Table enumerates the
       associated diffServAlgDropSpecific in such cases." individual queues."
    REFERENCE
        "[MODEL] section 7.1.3" 7.1.1"
    ::= { diffServTables 9 diffServQueue 2 }

diffServRandomDropEntry


diffServQEntry OBJECT-TYPE
    SYNTAX       DiffServRandomDropEntry       DiffServQEntry
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An entry in  the  Queue  Table  describes  a process that drops packets according  single
       queue.  With each entry belonging to a
       random algorithm.  Entries in this table share indexing with a
       parent diffServAlgDropEntry although they must be managed (e.g.
       created/deleted) by explicit management action, independently of
       the associated value of diffServAlgDropSpecific." one and only one
       datapath."
    INDEX { ifIndex, diffServAlgDropIfDirection,
            diffServAlgDropId diffServQId }
    ::= { diffServRandomDropTable diffServQTable 1 }

DiffServRandomDropEntry


DiffServQEntry ::= SEQUENCE  {
    diffServRandomDropMinThreshBytes   Unsigned32,
    diffServRandomDropMinThreshPkts    Unsigned32,
    diffServRandomDropMaxThreshBytes   Unsigned32,
    diffServRandomDropMaxThreshPkts    Unsigned32,
    diffServRandomDropInvWeight        Unsigned32,
    diffServRandomDropProbMax
    diffServQId                      Unsigned32,
    diffServRandomDropStatus
    diffServQNext                    RowPointer,
    diffServQSchdParam               RowPointer,
    diffServQStatus                  RowStatus
}

diffServRandomDropMinThreshBytes


diffServQId OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "bytes"
    MAX-ACCESS   read-create   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."





Baker, Chan, Smith         Expires January June 2001           [Page 48] 85]




Internet Draft        Differentiated Services MIB             July          November 2000


    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 diffServQEntry 1 }

diffServRandomDropMinThreshPkts


diffServQNext OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "packets"       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The average queue depth in packets, beyond which
       "This selects the next diffserv  functional  datapath
       element  to  handle traffic has a
       non-zero probability for this data path.  This
       RowPointer must point to an instance of being dropped.  Changes one of:
         diffServSchedulerEntry

       A value of zeroDotZero in this variable
       may or may attribute indicates an
       incomplete  diffServQEntry instance.  An illegal con-
       figuration.

       If the row pointed to does not be reflected in exist,  the reported  treatment
       is  as  if  this  attribute contains a value of
       diffServRandomDropMinThreshBytes." zero-
       DotZero."
    ::= { diffServRandomDropEntry diffServQEntry 2 }

diffServRandomDropMaxThreshBytes


diffServQSchdParam OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "bytes"       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The average queue depth beyond which traffic has a probability
       indicated by diffServRandomDropInvMaxProb of being dropped or
       marked. Note that this differs from
       "This   RowPointer    indicates    the physical queue limit,
       which is stored    entry    in diffServAlgDropQThreshold.  Changes
       diffServSchdParamTable  the  scheduler, pointed to by
       diffServQNext, should use to service this queue.

       A value of zeroDotZero in this
       variable may or may attribute indicates an
       incomplete  diffServQEntry instance.  An illegal con-





Baker, Chan, Smith         Expires June 2001           [Page 86]




Internet Draft        Differentiated Services MIB          November 2000


       figuration.

       If the row pointed to does not be reflected in exist,  the reported  treatment
       is  as  if  this  attribute contains a value of
       diffServRandomDropMaxThreshPkts." zero-
       DotZero."
    ::= { diffServRandomDropEntry diffServQEntry 3 }

diffServRandomDropMaxThreshPkts


diffServQStatus OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "packets"       RowStatus
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The average queue depth beyond which traffic has  RowStatus  variable  controls  the  activation,
       deactivation,  or  deletion  of a probability
       indicated queue. Any writable
       variable may be modified whether the row is active or
       notInService."
    ::= { diffServQEntry 4 }


--
-- Scheduler Table
--

diffServScheduler      OBJECT IDENTIFIER ::= { diffServMIBObjects 7 }

--
-- The Scheduler Table is used for representing packet schedulers:
-- 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 diffServRandomDropInvMaxProb each of its upstream functional datapath elements,
-- most likely queues or schedulers.
-- The coordination and coherency between the servicing parameters
-- 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 scheduler's upstream functional datapath elements must
-- be reflected in maintained for the reported value scheduler to function correctly.
--
-- The diffServSchedulerSchdParam attribute is used for specifying
-- the servicing parameters for output of
       diffServRandomDropMaxThreshBytes."
    ::= { diffServRandomDropEntry 4 } a scheduler when its
-- downstream functional datapath element is another scheduler.
-- This is used for building hierarchical queue/scheduler.
--



Baker, Chan, Smith         Expires January June 2001           [Page 49] 87]




Internet Draft        Differentiated Services MIB             July          November 2000


diffServRandomDropInvWeight


-- More discussion of the scheduler functional datapath element
-- is in [MODEL] section 7.1.2.
--


diffServSchedulerNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-create   read-only
    STATUS       current
    DESCRIPTION
       "The weighting of past history in affecting the calculation of
       the current queue average.  The moving average of the queue depth
       uses the inverse of this
       "This  object  yields  a  value as the factor  when  read  that  is
       currently  unused for the a diffServSchedulerId instance.
       If a configuring system attempts to create a new queue
       depth, and one minus that inverse as  row
       in  the factor for diffServSchedulerTable using this value, that
       operation will fail if the
       historical average.

       Implementations may choose to limit value has,  in  the acceptable set of values  mean-
       time,  been  used  to a specified set, such as powers of 2."  create  another  row  that  is
       currently valid."
    ::= { diffServRandomDropEntry 5 diffServScheduler 1 }


diffServRandomDropProbMax


diffServSchedulerTable OBJECT-TYPE
    SYNTAX       Unsigned32       SEQUENCE OF DiffServSchedulerEntry
    MAX-ACCESS   read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "The worst case random drop probability, expressed in drops per
       thousand packets.

       For example, if every packet may be dropped in the worst case
       (100%), this has the value 1000. Alternatively, if in the worst
       case one percent (1%) of traffic may       current
    DESCRIPTION
       "The Scheduler Table  enumerates  packet  schedulers.
       Multiple scheduling algorithms can be dropped, it has the value
       10." used on a given
       datapath,  with  each  algorithm  described  by   one
       diffServSchedulerEntry."
    REFERENCE
        "[MODEL] section 7.1.2"
    ::= { diffServRandomDropEntry 6 diffServScheduler 2 }

diffServRandomDropStatus


diffServSchedulerEntry OBJECT-TYPE
    SYNTAX       RowStatus       DiffServSchedulerEntry
    MAX-ACCESS   read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "The RowStatus variable controls
       "An entry in the activation, deactivation, or
       deletion Scheduler Table describing a  single
       instance of this entry. Any writable variable may be modified
       whether the row is active or notInService." a scheduling algorithm."
    INDEX { diffServSchedulerId }
    ::= { diffServRandomDropEntry 7 diffServSchedulerTable 1 }


DiffServSchedulerEntry ::= SEQUENCE  {
    diffServSchedulerId                   Unsigned32,





Baker, Chan, Smith         Expires January June 2001           [Page 50] 88]




Internet Draft        Differentiated Services MIB             July          November 2000


--
-- Queue Table
--

diffServQTable


    diffServSchedulerNext                 RowPointer,
    diffServSchedulerMethod               INTEGER,
    diffServSchedulerSchdParam            RowPointer,
    diffServSchedulerStatus               RowStatus
}


diffServSchedulerId OBJECT-TYPE
    SYNTAX       SEQUENCE OF DiffServQEntry       Unsigned32
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "The Queue Table
       "An index that enumerates the individual queues on an
       interface." 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."
    ::= { diffServTables 10 diffServSchedulerEntry 1 }

diffServQEntry


diffServSchedulerNext OBJECT-TYPE
    SYNTAX       DiffServQEntry       RowPointer
    MAX-ACCESS   not-accessible   read-create
    STATUS       current
    DESCRIPTION
       "An entry
       "This selects the next diffserv  functional  datapath
       element  to  handle traffic for this data path.  This
       RowPointer should point to an instance of one of:
         diffServSchedulerEntry
         diffServQEntry  As  indicated  by  [MODEL]  section
       7.1.4.

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


Baker, Chan, Smith         Expires June 2001           [Page 89]




Internet Draft        Differentiated Services MIB          November 2000


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

       If the row pointed to does not exist,  the Queue Table describes  treatment
       is  as  if  this  attribute contains a single queue in one
       direction on an interface."
    INDEX { ifIndex, diffServQIfDirection, diffServQId }
    ::= value of zero-
       DotZero."
    DEFVAL       { diffServQTable 1 zeroDotZero }

DiffServQEntry
    ::= SEQUENCE {
    diffServQIfDirection             IfDirection,
    diffServQId                      Unsigned32,
    diffServQNext                    RowPointer,
    diffServQPriority                Unsigned32,
    diffServQMinRateAbs              Unsigned32,
    diffServQMinRateRel              Unsigned32,
    diffServQMaxRateAbs              Unsigned32,
    diffServQMaxRateRel              Unsigned32,
    diffServQStatus                  RowStatus diffServSchedulerEntry 2 }

diffServQIfDirection


diffServSchedulerMethod OBJECT-TYPE
    SYNTAX  IfDirection       INTEGER {
                     other(1),        -- not listed here
                     priorityq(2),    -- Priority Queueing
                     wrr(3),          -- Weighted Round Robin
                     wfq(4),          -- Weighted Fair Queuing
                     wirr(5),         -- Weighted Interleaved Round Robin
                     bsp(6)           -- Bounded Strict Priority
                 }
    MAX-ACCESS   not-accessible   read-create
    STATUS       current
    DESCRIPTION
       "Specifies the direction for which
       "The scheduling algorithm used by this queue entry applies on Scheduler.

       A value of priorityq(2) is used  to  indicate  strict
       priority queueing: only the diffServSchdParamPriority
       attributes  of  the  queues/schedulers  feeding  this interface."
    ::= { diffServQEntry 1 }

diffServQId OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible
       scheduler  are  used when determining the next packet
       to schedule.

       A value  of  wrr(3)  indicates  weighted  round-robin
       scheduling.   Packets  are scheduled from each of the





Baker, Chan, Smith         Expires January June 2001           [Page 51] 90]




Internet Draft        Differentiated Services MIB             July          November 2000


    STATUS       current
    DESCRIPTION
       "The Queue Id enumerates


       queues/schedulers feeding this scheduler according to
       all   of   the Queue entry. Managers should obtain
       new values for row creation in   parameters   of   their   respective
       diffServSchdParamEntry.

       A value of wfq(4) indicates  weighted  fair  queueing
       scheduling.   Packets  are scheduled from each of the
       queues/schedulers feeding this table by reading
       diffServQNextFree." scheduler according to
       all   of   the   parameters   of   their   respective
       diffServSchdParamEntry.

       A value of  wirr(5)  indicates  weighted  interleaved
       roundrobin    queueing   scheduling.    Packets   are
       scheduled from each of the queues/schedulers  feeding
       this  scheduler  according  to  all the parameters of
       their respective diffServSchdParamEntry.

       A value of bsp(6) indicates bounded  strict  priority
       scheduling.   Packets  are scheduled from each of the
       queues/schedulers feeding this scheduler according to
       all    the    parameters    of    their    respective
       diffServSchdParamEntry."
    REFERENCE
        "[MODEL] section 7.1.2"
    ::= { diffServQEntry 2 diffServSchedulerEntry 3 }

diffServQNext


diffServSchedulerSchdParam OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The Next pointer
       "This   RowPointer    indicates    the next datapath element to handle
       the traffic e.g. a scheduler datapath element.  If    entry    in
       diffServSchdParamTable  the row  higher  level scheduler,
       pointed to does not exist, by diffServSchedulerNext,  should  use  to
       service the queue element is considered
       inactive."
    ::= { diffServQEntry 3 }

diffServQPriority OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The priority output of this queue, to be scheduler.  This attribute
       is only used as a parameter to when there is more  than  one  level  of
       scheduler.   And should have the
       next scheduler element downstream from this one." value of zeroDotZero
       when not used."
    DEFVAL      { zeroDotZero }
    ::= { diffServQEntry diffServSchedulerEntry 4 }

diffServQMinRateAbs


diffServSchedulerStatus OBJECT-TYPE



Baker, Chan, Smith         Expires June 2001           [Page 91]




Internet Draft        Differentiated Services MIB          November 2000


    SYNTAX       Unsigned32
    UNITS        "kilobits per second"       RowStatus
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The minimum absolute rate, in kilobits/sec, that  RowStatus  variable  controls  the  activation,
       deactivation,  or  deletion  of a downstream
       scheduler element should allocate to this queue.  If Any writable
       variable may be modified whether the value is
       zero, then there row is effectively no minimum rate guarantee.  If active or
       notInService."
    ::= { diffServSchedulerEntry 5 }


Baker, Chan, Smith         Expires June 2001           [Page 92]




Internet Draft        Differentiated Services MIB          November 2000


--
-- Scheduling Parameter Table
--
-- The scheduling parameters are separate from the Queue Entries
-- for reusability and for usage by both queues and schedulers,
-- and this follows the separation of datapath elements from
-- parameterization approach used throught out this MIB.
-- Usage of scheduling parameter table entry by schedulers allow
-- building of hierarchical scheduling.
--
-- The diffServSchdParamMaxRateAbs/Rel attributes are used to
-- construct non-work-conserving scheduler for the purpose of
-- traffic shaping.  These attributes limits the value is non-zero, servicing of
-- the scheduler will assure queue/scheduler, in affect, shaping the servicing output of
       this queue to at least this rate.

       Note that this attribute's the
-- queue/scheduler, as described in [MODEL] section 7.2.
--


diffServSchdParamNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This  object  yields  a  value  when  read  that  is coupled
       currently  unused for a diffServSchdParamId instance.
       If a configuring system attempts to create a new  row
       in  the diffServSchdParamTable using this value, that of
       diffServQMinRateRel: changes to one
       operation will affect fail if the value of the
       other. They are linked by has,  in  the following equation:

         diffServQMinRateRel = diffServQMinRateAbs * 10,000,000/ifSpeed

       or, if appropriate:  mean-
       time,  been  used  to  create  another  row  that  is
       currently valid."
    ::= { diffServScheduler 3 }


diffServSchdParamTable OBJECT-TYPE





Baker, Chan, Smith         Expires January June 2001           [Page 52] 93]




Internet Draft        Differentiated Services MIB             July          November 2000


         diffServQMinRateRel = diffServQMinRateAbs * 10 / ifHighSpeed"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB]"
    ::= { diffServQEntry 5 }

diffServQMinRateRel OBJECT-TYPE


    SYNTAX       Unsigned32       SEQUENCE OF DiffServSchdParamEntry
    MAX-ACCESS   read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "The minimum rate that a downstream scheduler element should
       allocate to this queue, relative to the maximum rate of the
       interface as reported by ifSpeed or ifHighSpeed, in units of
       1/10,000 of 1.  If the value is zero, then there is effectively
       no minimum rate guarantee.  If the value is non-zero, the
       scheduler will assure the servicing Scheduling Parameter Table enumerates individual
       sets  of this queue to at least
       this rate.

       Note that this attribute's value is coupled to scheduling parameter that of
       diffServQMinRateAbs: changes to one will affect the value of the
       other. They are linked can be used/reused
       by the following equation:

         diffServQMinRateAbs = ifSpeed * diffServQMinRateRel/10,000,000

       or, if appropriate:

         diffServQMinRateAbs = ifHighSpeed * diffServQMinRateRel / 10"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB]" Queues and Schedulers."
    ::= { diffServQEntry 6 diffServScheduler 4 }

diffServQMaxRateAbs


diffServSchdParamEntry OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "kilobits per second"
    SYNTAX       DiffServSchdParamEntry
    MAX-ACCESS   read-create   not-accessible
    STATUS       current
    DESCRIPTION
       "The maximum rate
       "An entry in kilobits/sec that a downstream scheduler
       element should allocate to this queue. If the value is zero, then
       there is effectively no maximum rate limit and that the scheduler
       should attempt to be work-conserving for this queue.  If the
       value is non-zero, the scheduler will limit the servicing of this
       queue to, at most, this rate in Scheduling Parameter Table describes
       a non-work-conserving manner.

       Note that this attribute's value is coupled to that of
       diffServQMaxRateRel: changes to one will affect the value  single  set  of the
       other. They are linked  scheduling  parameter  for use by
       queues and schedulers.
       Notice multiple inter-mixed of  Queue  and  Scheduler
       entries can use the following equation: same Scheduler Parameter entry."
    INDEX { diffServSchdParamId }
    ::= { diffServSchdParamTable 1 }


DiffServSchdParamEntry ::= SEQUENCE  {
    diffServSchdParamId              Unsigned32,
    diffServSchdParamPriority        Unsigned32,
    diffServSchdParamMinRateAbs      Unsigned32,
    diffServSchdParamMinRateRel      Unsigned32,
    diffServSchdParamMaxRateAbs      Unsigned32,
    diffServSchdParamMaxRateRel      Unsigned32,
    diffServSchdParamStatus          RowStatus
}


Baker, Chan, Smith         Expires January June 2001           [Page 53] 94]




Internet Draft        Differentiated Services MIB             July          November 2000


         diffServQMaxRateRel = diffServQMaxRateAbs * 10,000,000/ifSpeed

       or, if appropriate:

         diffServQMaxRateRel = diffServQMaxRateAbs * 10 / ifHighSpeed"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB]"


diffServSchdParamId OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "An index that  enumerates  the  Scheduler  Parameter
       entries.  The set of such identifiers spans the whole
       agent. Managers should  obtain  new  values  for  row
       creation  in this table by reading diffServSchdParam-
       NextFree."
    ::= { diffServQEntry 7 diffServSchdParamEntry 1 }

diffServQMaxRateRel


diffServSchdParamPriority OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The maximum rate that a downstream scheduler element should
       allocate to priority of this queue, relative to the maximum rate of the
       interface be used as reported by ifSpeed or ifHighSpeed, a  parame-
       ter  to  the  next  scheduler element downstream from
       this one."
    ::= { diffServSchdParamEntry 2 }


diffServSchdParamMinRateAbs OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "kilobits per second"
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The minimum absolute rate, in units of
       1/10,000 of 1. kilobits/sec,  that  a
       downstream  scheduler element should allocate to this
       queue.  If the value is zero, then  there  is effectively  effec-
       tively  no maximum  minimum  rate limit and the scheduler should attempt to be
       work-conserving for this queue. guarantee.  If the value is
       non-zero, the scheduler will limit assure the servicing  of
       this queue to, to at most, least this rate in a non-work-conserving manner. rate.



Baker, Chan, Smith         Expires June 2001           [Page 95]




Internet Draft        Differentiated Services MIB          November 2000


       Note that this attribute's value is coupled  to  that
       of
       diffServQMaxRateAbs:  diffServSchdParamMinRateRel:  changes to one will
       affect the value of the other. They are linked by the
       following equation:

         diffServQMaxRateAbs

         diffServSchdParamMinRateRel = ifSpeed diffServSchdParamMinRateAbs
                                       * diffServQMaxRateRel/10,000,000 10,000,000/ifSpeed

       or, if appropriate:

         diffServQMaxRateAbs = ifHighSpeed * diffServQMaxRateRel / 10"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB]"
    ::= { diffServQEntry 8 }

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 9 }

diffServQNextFree OBJECT-TYPE





Baker, Chan, Smith        Expires January 2001         [Page 54]

Internet Draft         Differentiated Services MIB             July 2000


    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a value when read that is currently-unused
       for a diffServQId instance.  If a configuring system attempts to
       create a new row in the diffServQTable using this value, that
       operation will fail if the value has, in the meantime, been used
       to create another row that is currently valid."
    ::= { diffServObjects 8 }


--
-- Scheduler Table
--
-- The Scheduler Table is used for representing packet schedulers:
-- it provides flexibility for multiple scheduling algorithms, each
-- servicing multiple queues, to be used on the same logical/physical
-- interface.

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 interface, with each
       algorithm described by one diffServSchedulerEntry." if appropriate:

         diffServSchdParamMinRateRel = diffServSchdParamMinRateAbs
                                       * 10 / ifHighSpeed"
    REFERENCE
        "[MODEL] section 7.1.2"
        "ifSpeed, ifHighSpeed from [IFMIB]"
    ::= { diffServTables 11 diffServSchdParamEntry 3 }

diffServSchedulerEntry


diffServSchdParamMinRateRel OBJECT-TYPE
    SYNTAX       DiffServSchedulerEntry       Unsigned32
    MAX-ACCESS   not-accessible   read-create
    STATUS       current
    DESCRIPTION
       "An entry
       "The minimum rate that a downstream scheduler element
       should  allocate  to this queue, relative to the max-
       imum rate of the interface as reported by ifSpeed  or
       ifHighSpeed, in units of 1/10,000 of 1.  If the Scheduler Table describing a single instance value
       is zero, then there is effectively  no  minimum  rate
       guarantee.   If  the value is non-zero, the scheduler
       will assure the servicing of
       a scheduling algorithm."
    INDEX { ifIndex, diffServSchedulerIfDirection,
            diffServSchedulerId } this queue to  at  least
       this rate.

       Note that this attribute's value is coupled  to  that
       of  diffServSchdParamMinRateAbs:  changes to one will
       affect the value of the other. They are linked by the
       following equation:

         diffServSchdParamMinRateAbs = ifSpeed
                      * diffServSchdParamMinRateRel/10,000,000

       or, if appropriate:

         diffServSchdParamMinRateAbs = ifHighSpeed
                      * diffServSchdParamMinRateRel / 10"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB]"
    ::= { diffServSchedulerTable 1 diffServSchdParamEntry 4 }

DiffServSchedulerEntry ::= SEQUENCE  {
    diffServSchedulerIfDirection          IfDirection,
    diffServSchedulerId                   Unsigned32,
    diffServSchedulerMethod               INTEGER,


diffServSchdParamMaxRateAbs OBJECT-TYPE
    SYNTAX       Unsigned32
    UNITS        "kilobits per second"





Baker, Chan, Smith         Expires January June 2001           [Page 55] 96]




Internet Draft        Differentiated Services MIB             July          November 2000


    diffServSchedulerNext                 RowPointer,
    diffServSchedulerStatus               RowStatus
}

diffServSchedulerIfDirection OBJECT-TYPE
    SYNTAX  IfDirection


    MAX-ACCESS   not-accessible   read-create
    STATUS       current
    DESCRIPTION
       "Specifies the direction for which this
       "The maximum rate in kilobits/sec that  a  downstream
       scheduler entry applies
       on  element  should allocate to this interface."
    ::= { diffServSchedulerEntry 1 }

diffServSchedulerId OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   not-accessible
    STATUS       current
    DESCRIPTION
       "This identifies queue. If
       the value is  zero,  then  there  is  effectively  no
       maximum  rate  limit  and  that  the scheduler entry. Managers should obtain new
       values
       attempt to be work-conserving for row creation this queue.  If the
       value  is non-zero, the scheduler will limit the ser-
       vicing of this queue to, at  most,  this  rate  in  a
       non-work-conserving manner.

       Note that this table attribute's value is coupled  to  that
       of  diffServSchdParamMaxRateRel:  changes to one will
       affect the value of the other. They are linked by reading
       diffServSchedulerNextFree." the
       following equation:

         diffServSchdParamMaxRateRel = diffServSchdParamMaxRateAbs
                                       * 10,000,000/ifSpeed

       or, if appropriate:

         diffServSchdParamMaxRateRel = diffServSchdParamMaxRateAbs
                                       * 10 / ifHighSpeed"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB]"
    ::= { diffServSchedulerEntry 2 diffServSchdParamEntry 5 }

diffServSchedulerMethod


diffServSchdParamMaxRateRel OBJECT-TYPE
    SYNTAX       INTEGER {
                     other(1),        -- not listed here
                     priorityq(2),    -- Priority Queueing
                     wrr(3)           -- Weighed Round Robin
                 }       Unsigned32
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "The scheduling algorithm used by this Scheduler.

        A value of priorityq(2) is used to indicate strict priority
       queueing: only the diffServQPriority attributes of the queues
       feeding this maximum rate that a downstream scheduler are used when determining the next packet element
       should  allocate  to schedule.

       A value of wrr(3) indicates weighted round-robin scheduling.
       Packets are scheduled from each of the queues feeding this
       scheduler according queue, relative to all of the parameters of the diffServQueue
       entry."
    REFERENCE
        "[MODEL] section 7.1.2"
    ::= { diffServSchedulerEntry 3 } max-





Baker, Chan, Smith         Expires January June 2001           [Page 56] 97]




Internet Draft        Differentiated Services MIB             July          November 2000


diffServSchedulerNext OBJECT-TYPE
    SYNTAX       RowPointer
    MAX-ACCESS   read-create
    STATUS       current
    DESCRIPTION
       "Selects


       imum rate of the next data path component, which can be another
       scheduler interface as reported by ifSpeed  or other TC elements. One usage of multiple scheduler
       elements
       ifHighSpeed, in series units of 1/10,000 of 1.  If the value
       is zero, then there is effectively  no  maximum  rate
       limit  and  the  scheduler should attempt to be work-
       conserving for Class Base Queueing (CBQ).

       The value zeroDotZero in this variable indicates no further
       DiffServ treatment queue.  If the value is performed on this flow by non-zero,
       the current
       interface for  scheduler will limit the servicing of this queue
       to, at  most,  this  rate  in  a  non-work-conserving
       manner.

       Note that this interface direction.  For example, for an
       inbound interface the attribute's value zeroDotZero indicates is coupled  to  that the packet
       flow has now completed inbound DiffServ treatment and should be
       forwarded on
       of  diffServSchdParamMaxRateAbs:  changes to one will
       affect the appropriate outbound interface.  If value of the row
       pointed to does not exist, other. They are linked by the scheduler element is considered
       inactive."
    DEFVAL       { zeroDotZero }
       following equation:

         diffServSchdParamMaxRateAbs = ifSpeed
                        * diffServSchdParamMaxRateRel/10,000,000

       or, if appropriate:

         diffServSchdParamMaxRateAbs = ifHighSpeed
                        * diffServSchdParamMaxRateRel / 10"
    REFERENCE
        "ifSpeed, ifHighSpeed from [IFMIB]"
    ::= { diffServSchedulerEntry 4 diffServSchdParamEntry 6 }

diffServSchedulerStatus


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

diffServSchedulerNextFree OBJECT-TYPE
    SYNTAX       Unsigned32
    MAX-ACCESS   read-only
    STATUS       current
    DESCRIPTION
       "This object yields a value when read that is currently-unused
       for a diffServSchedulerId instance.  If a configuring system
       attempts to create a new row in the diffServSchedulerTable using
       this value, that operation will fail if the value has, in the
       meantime, been used to create another row that is currently
       valid."
    ::= { diffServObjects 9 diffServSchdParamEntry 7 }





Baker, Chan, Smith         Expires January June 2001           [Page 57] 98]




Internet Draft        Differentiated Services MIB             July          November 2000


--
-- 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 mon-
       itoring or for configuration."
    MODULE -- This Module
    MANDATORY-GROUPS {
        diffServMIBClassifierGroup,
        diffServMIBDataPathGroup,
        diffServMIBClfrGroup,
        diffServMIBClfrElementGroup,
        diffServMIBSixTupleClfrGroup,
        diffServMIBActionGroup,
        diffServMIBAlgDropGroup,
        diffServMIBQueueGroup, diffServMIBSchedulerGroup
        diffServMIBQGroup, diffServMIBSchedulerGroup,
        diffServMIBSchdParamGroup }


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





Baker, Chan, Smith         Expires June 2001           [Page 99]




Internet Draft        Differentiated Services MIB          November 2000


-- for a particular interface, then ifCounterDiscontinuityGroup from
-- [IFMIB]  must also be implemented for that interface.


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





Baker, Chan, Smith        Expires January 2001         [Page 58]

Internet Draft         Differentiated Services MIB             July 2000
       "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





Baker, Chan, Smith         Expires June 2001          [Page 100]




Internet Draft        Differentiated Services MIB          November 2000


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


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


    GROUP diffServMIBDscpMarkActionGroup 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 crea-
       tion  of  rows  in any of the writable tables of this
       MIB."


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


    OBJECT diffServClassifierNext diffServClfrElementOrder
    MIN-ACCESS read-only



Baker, Chan, Smith         Expires June 2001          [Page 101]




Internet Draft        Differentiated Services MIB          November 2000


    DESCRIPTION
       "Write access is not required."


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


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


    OBJECT diffServClfrElementStatus
    MIN-ACCESS read-only
    DESCRIPTION





Baker, Chan, Smith        Expires January 2001         [Page 59]

Internet Draft         Differentiated Services MIB             July 2000
       "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 diffServSixTupleClfrDstAddrMask
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."


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


    OBJECT diffServSixTupleClfrSrcAddr diffServSixTupleClfrSrcAddr





Baker, Chan, Smith         Expires June 2001          [Page 102]




Internet Draft        Differentiated Services MIB          November 2000


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


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


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


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


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


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


Baker, Chan, Smith         Expires January June 2001          [Page 60] 103]




Internet Draft        Differentiated Services MIB             July          November 2000


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


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


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


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


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


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


Baker, Chan, Smith         Expires June 2001          [Page 104]




Internet Draft        Differentiated Services MIB          November 2000


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


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


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


    OBJECT diffServTBMeterBurstSize
    MIN-ACCESS read-only





Baker, Chan, Smith        Expires January 2001         [Page 61]

Internet Draft         Differentiated Services MIB             July 2000
    DESCRIPTION
       "Write access is not required."


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


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


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


Baker, Chan, Smith         Expires June 2001          [Page 105]




Internet Draft        Differentiated Services MIB          November 2000


    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."


Baker, Chan, Smith         Expires January June 2001          [Page 62] 106]




Internet Draft        Differentiated Services MIB             July          November 2000


    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 diffServRandomDropMaxThreshPkts diffServRandomDropMinThreshPkts
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."


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


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


Baker, Chan, Smith         Expires June 2001          [Page 107]




Internet Draft        Differentiated Services MIB          November 2000


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


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


    OBJECT diffServRandomDropProbMax 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 diffServQSchdParam
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."


Baker, Chan, Smith         Expires January June 2001          [Page 63] 108]




Internet Draft        Differentiated Services MIB             July          November 2000


    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 diffServQPriority diffServSchedulerMethod
    MIN-ACCESS read-only
    DESCRIPTION
       "Write access is not required."


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


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


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


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


Baker, Chan, Smith         Expires June 2001          [Page 109]




Internet Draft        Differentiated Services MIB          November 2000


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


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


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


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





Baker, Chan, Smith        Expires January 2001         [Page 64]

Internet Draft         Differentiated Services MIB             July 2000


    ::= { diffServMIBCompliances 1 }


Baker, Chan, Smith         Expires January June 2001          [Page 65] 110]




Internet Draft        Differentiated Services MIB             July          November 2000


diffServMIBClassifierGroup


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


diffServMIBClfrGroup OBJECT-GROUP
    OBJECTS {
        diffServClassifierFilter, diffServClassifierNext,
        diffServClassifierPrecedence, diffServClassifierStatus
        diffServClfrStatus
    }
    STATUS current
    DESCRIPTION
       "The Classifier Group defines the  MIB  Objects  that
       describe a generic classifier."
    ::= { diffServMIBGroups 2 }


diffServMIBClfrElementGroup OBJECT-GROUP
    OBJECTS {
        diffServClfrElementOrder, diffServClfrElementNext,
        diffServClfrElementSpecific, diffServClfrElementStatus
    }
    STATUS current
    DESCRIPTION
       "The Classifier Element Group defines the MIB Objects
       that  describe the classifier element." elements that make up a
       generic classifier."
    ::= { diffServMIBGroups 1 3 }


Baker, Chan, Smith         Expires June 2001          [Page 111]




Internet Draft        Differentiated Services MIB          November 2000


diffServMIBSixTupleClfrGroup OBJECT-GROUP
    OBJECTS {
        diffServSixTupleClfrDstAddrType, diffServSixTupleClfrDstAddr,
        diffServSixTupleClfrDstAddrMask, diffServSixTupleClfrDstAddrType,
        diffServSixTupleClfrSrcAddrType, diffServSixTupleClfrSrcAddr,
        diffServSixTupleClfrSrcAddrMask,
        diffServSixTupleClfrDscp, diffServSixTupleClfrProtocol,
        diffServSixTupleClfrDstL4PortMin,
        diffServSixTupleClfrDstL4PortMax,
        diffServSixTupleClfrSrcL4PortMin,
        diffServSixTupleClfrSrcL4PortMax,
        diffServSixTupleClfrStatus
    }
    STATUS current
    DESCRIPTION
       "The  Six-tuple  Classifier  Group  defines  the  MIB
       Objects that describe a classifier element for matching match-
       ing on 6 fields of an  IP  and  upper-layer  protocol
       header."
    ::= { diffServMIBGroups 2 4 }


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

diffServMIBTokenBucketMeterGroup OBJECT-GROUP
    OBJECTS {
        diffServTBMeterRate, diffServTBMeterBurstSize
        diffServTBMeterStatus 5 }
    STATUS current
    DESCRIPTION


Baker, Chan, Smith         Expires January June 2001          [Page 66] 112]




Internet Draft        Differentiated Services MIB             July          November 2000


diffServMIBTBMeterGroup OBJECT-GROUP
    OBJECTS {
        diffServTBMeterType,
        diffServTBMeterRate, diffServTBMeterBurstSize,
        diffServTBMeterInterval, diffServTBMeterStatus
    }
    STATUS current
    DESCRIPTION
       "The Token-Bucket Meter  Group  defines  the  objects
       used in describing a single-rate token bucket meter element."
    ::= { diffServMIBGroups 4 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 5 7 }

diffServMIBDscpMarkActionGroup


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


diffServMIBCounterGroup OBJECT-GROUP


Baker, Chan, Smith         Expires June 2001          [Page 113]




Internet Draft        Differentiated Services MIB          November 2000


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


diffServMIBHCCounterGroup OBJECT-GROUP
    OBJECTS {
        diffServCountActOctets, diffServCountActHCOctets,
        diffServCountActPkts,
        diffServCountActDiscontTime,
        diffServCountActStatus,
        diffServAlgDropOctets, diffServAlgDropHCOctets,
        diffServAlgDropPkts
    }
    STATUS current





Baker, Chan, Smith        Expires January 2001         [Page 67]

Internet Draft         Differentiated Services MIB             July 2000
    DESCRIPTION
       "A  collection  of  objects   providing   information
       specific   to non-   high  speed (non-high  (high  speed  interfaces
       transmit  and  receive   at   speeds   greater   than
       20,000,000  but  less  than  or equal equals to 20,000,000 650,000,000
       bits/second) packet-
       oriented packet-oriented network interfaces."
    ::= { diffServMIBGroups 8 10 }


diffServMIBVHCCounterGroup OBJECT-GROUP
    OBJECTS {
        diffServCountActOctets, diffServCountActHCOctets,
        diffServCountActPkts, diffServCountActHCPkts,
        diffServCountActDiscontTime,
        diffServCountActStatus,
        diffServAlgDropOctets, diffServAlgDropHCOctets,
        diffServAlgDropPkts, diffServAlgDropHCPkts
    }
    STATUS current





Baker, Chan, Smith         Expires June 2001          [Page 114]




Internet Draft        Differentiated Services MIB          November 2000


    DESCRIPTION
       "A  collection  of  objects   providing   information
       specific  to non-
       high  very-high speed (non-high (very-high speed interfaces inter-
       faces transmit and receive  at  speeds less  greater  than or equal to 20,000,000
       650,000,000   bits/second) packet-
       oriented   packet-oriented  network
       interfaces."
    ::= { diffServMIBGroups 9 11 }


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


diffServMIBRandomDropGroup OBJECT-GROUP
    OBJECTS {
        diffServRandomDropMinThreshBytes,
        diffServRandomDropMinThreshPkts,
        diffServRandomDropMaxThreshBytes,
        diffServRandomDropMaxThreshPkts,
        diffServRandomDropInvProbMax,
        diffServRandomDropInvWeight, diffServRandomDropProbMax
        diffServRandomDropSamplingRate,
        diffServRandomDropStatus
    }





Baker, Chan, Smith         Expires June 2001          [Page 115]




Internet Draft        Differentiated Services MIB          November 2000


    STATUS current
    DESCRIPTION
       "The Random Drop Group augments the Algorithmic Drop Group for





Baker, Chan, Smith        Expires January 2001         [Page 68]

Internet Draft         Differentiated Services MIB             July 2000
       random dropper operation and configuration."
    ::= { diffServMIBGroups 11 13 }

diffServMIBQueueGroup


diffServMIBQGroup OBJECT-GROUP
    OBJECTS {
        diffServQPriority,
        diffServQNext, diffServQMinRateAbs,
        diffServQMinRateRel, diffServQMaxRateAbs,
        diffServQMaxRateRel, diffServQSchdParam,
        diffServQStatus
    }
    STATUS current
    DESCRIPTION
       "The Queue Group contains the objects  that  describe
       an interface's queues."
    ::= { diffServMIBGroups 12 14 }


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


diffServMIBSchdParamGroup OBJECT-GROUP
    OBJECTS {
        diffServSchdParamPriority,





Baker, Chan, Smith         Expires June 2001          [Page 116]




Internet Draft        Differentiated Services MIB          November 2000


        diffServSchdParamMinRateAbs, diffServSchdParamMinRateRel,
        diffServSchdParamMaxRateAbs, diffServSchdParamMaxRateRel,
        diffServSchdParamStatus
    }
    STATUS current
    DESCRIPTION
       "The Scheduler Parameter Group contains  the  objects
       that describe packet schedulers' parameters on inter-
       faces."
    ::= { diffServMIBGroups 16 }


diffServMIBStaticGroup OBJECT-GROUP
    OBJECTS {
        diffServClassifierNextFree,
        diffServClfrNextFree, diffServClfrElementNextFree,
        diffServSixTupleClfrNextFree,
        diffServMeterNextFree, diffServTBMeterNextFree,
        diffServActionNextFree, diffServDscpMarkActNextFree,
        diffServCountActNextFree,
        diffServAlgDropNextFree, diffServRandomDropNextFree,
        diffServQNextFree, diffServSchedulerNextFree diffServSchedulerNextFree,
        diffServSchdParamNextFree
    }
    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  when-
       ever  row creation operations on such tables are supported." sup-
       ported."
    ::= { diffServMIBGroups 14 17 }


END









Baker, Chan, Smith         Expires January June 2001          [Page 69] 117]




Internet Draft        Differentiated Services MIB             July          November 2000


7.


9.  Acknowledgments

This MIB builds on all the work that has gone into the Informal
Management Model for Diffserv routers. routers, DiffServ PIB, and DiffServ 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, Jeremy Greene, Dan Grossman, Roch Guerin, Scott
Hahn, Keith McCloghrie, Bob Moore, Kathleen Nichols, Ping Pan, Nabil Seddigh and
Seddigh, Bert Wijnen.


8. Wijnen, Victor Firoiu, John Seligson, Michael Fine, Walter
Weiss, Joel Halpern, and Harrie Hazewinkel.



10.  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 management objects defined in this MIB that have a
MAX-ACCESS clause of read-write and/or read-create. Such objects may be
considered 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





Baker, Chan, Smith         Expires June 2001          [Page 118]




Internet Draft        Differentiated Services MIB          November 2000


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.






Baker, Chan, Smith        Expires January 2001         [Page 70]

Internet Draft         Differentiated Services MIB             July 2000

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.


9.



11.  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
     16, Performance Systems International, Hughes LAN Systems, May 1990

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

[4]  M. Rose, "A Convention for Defining Traps for use with the SNMP",
     RFC 1215, Performance Systems International, March 1991

[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
     Network Services, April 1999

[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
     Virtual Holdings, International Network Services, April 1999





Baker, Chan, Smith         Expires June 2001          [Page 119]




Internet Draft        Differentiated Services MIB          November 2000


[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,
     First Virtual Holdings, International Network Services, April 1999

[8]  Case, J., Fedor, M., Schoffstall, M., and J. Davin, "Simple Network
     Management Protocol", RFC 1157, STD 15, SNMP Research, Performance





Baker, Chan, Smith        Expires January 2001         [Page 71]

Internet Draft         Differentiated Services MIB             July 2000
     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,
     Inc., BMC Software, Inc., IBM T. J. Watson Research, April 1999

[12] Blumenthal, U., and B. Wijnen, "User-based Security Model (USM) for
     version 3 of the Simple Network Management Protocol (SNMPv3)", RFC
     2574, IBM T. J. Watson Research, April 1999

[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
     Systems, April 1999

[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.,
     Cisco Systems, Inc., April 1999

[16] Case, J., Mundy, R., Partain, D., and B. Stewart, "Introduction to
     Version 3 of the Internet-standard Network Management Framework",





Baker, Chan, Smith         Expires June 2001          [Page 120]




Internet Draft        Differentiated Services MIB          November 2000


     RFC 2570, SNMP Research, Inc., TIS Labs at Network Associates,
     Inc., Ericsson, Cisco Systems, April 1999

[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





Baker, Chan, Smith        Expires January 2001         [Page 72]

Internet Draft         Differentiated Services MIB             July 2000

[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
     <draft-ietf-diffserv-pib-00.txt>, March 2000

[DSTERMS]
     D. Grossman, "New Terminology for Diffserv", Internet Draft <draft-
     ietf-diffserv-new-terms-02.txt>,
     <draft-ietf-diffserv-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.,





Baker, Chan, Smith         Expires June 2001          [Page 121]




Internet Draft        Differentiated Services MIB          November 2000


     "Textual Conventions for Internet Network Addresses.", RFC 2851,
     June 2000.

[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 Routers", Internet Draft <draft-ietf-diffserv-
     model-04.txt>, July 2000.

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





Baker, Chan, Smith        Expires January 2001         [Page 73]

Internet Draft         Differentiated Services MIB             July 2000
     reichmeyer-polterm-terminology-00.txt>, March 2000

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

[RED93]
     "Random Early Detection", 1993.



10.



12.  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
     ah_smith@pacbell.net


Baker, Chan, Smith         Expires June 2001          [Page 122]




Internet Draft        Differentiated Services MIB          November 2000


Table of Contents

1 The SNMP Management Framework ...................................    2
2 Introduction ....................................................    3    4
2.1 Relationship to the Diffserv Informal Management Model ........    3    4
2.2 Relationship to other MIBs and Policy Management ..............    3    5
2.3 MIB Overview ..................................................    4    5
3 Structure of this MIB ...........................................    5    6
3.1 DiffServ Data Paths ...........................................    7
3.1.1 Data Path Table .............................................    7
3.2 Classifiers ...................................................    5
3.1.1    8
3.2.1 Classifier Table ............................................    5
3.1.2    9
3.2.2 Classifier Element Table ....................................    9
3.2.3 Filter Table - IP Six-Tuple Classifier Table ...............................    6
3.2 ................    9
3.3 Meters ........................................................    6
3.2.1    9
3.3.1 Meter Table .................................................    6
3.2.2   10
3.3.2 Token-Bucket Meter Table ....................................    7
3.3   10
3.4 Actions .......................................................    7
3.3.1   10
3.4.1 DSCP Mark Action Table ......................................    7
3.3.2   11
3.4.2 Count Action Table ..........................................    8





Baker, Chan, Smith        Expires January 2001         [Page 74]

Internet Draft         Differentiated Services MIB             July 2000


3.3.3   11
3.4.3 Absolute Drop Action ........................................    8
3.4   11
3.5 Queueing Elements .............................................    8
3.4.1   11
3.5.1 Algorithmic Dropper Table ...................................    8
3.4.2   11
3.5.2 Random Dropper Table ........................................    9
3.4.3   13
3.5.3 Queues and Schedulers .......................................   11
3.4.4   14
3.5.4 Example of Algorithmic Droppers, Queues and Schedulers ......   12   16
4 MIB Usage Example ...............................................   16
4.1 Data Path Example .............................................   17
4.2 Data Path and Classifier Example Discussion ...................   17
4.3 Meter and Action Example Discussion ...........................   20
4.4 Queue and Scheduler Example Discussion ........................   21
5 Conventions used in this MIB ....................................   13
4.1   21
5.1 The use of RowPointer .........................................   13
4.2   21
5.2 Conceptual row creation and deletion ..........................   14
5   22
6 Editorial information ...........................................   15
5.1   23
6.1 Open Issues resolved in previous drafts .......................   15
5.2   23
6.2 Open Issues resolved in this draft ............................   17
5.3   25
6.3 Still Open Issues .............................................   18
6   26
7 MIB Outline .....................................................   27
8 MIB Definition ..................................................   19
7   33
9 Acknowledgments .................................................   70
8  118
10 Security Considerations .........................................   70
9 ........................................  118
11 References ......................................................   71
10 .....................................................  119
12 Authors' Addresses .............................................   74  122






Baker, Chan, Smith         Expires January June 2001          [Page 75] 123]




Internet Draft        Differentiated Services MIB             July          November 2000


11.


13.  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 implmentation 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.





















Baker, Chan, Smith         Expires January June 2001          [Page 76] 124]

----