view Side-By-Side changes
Internet Engineering Task Force F. Baker Diffserv Working Group Cisco Systems INTERNET-DRAFT K. Chan ExpiresSeptemberDecember 2001 Nortel Networksdraft-ietf-diffserv-mib-09.txtdraft-ietf-diffserv-mib-10.txt A. Smith Allegro NetworksMarchJune 2001 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 asInternet-Drafts.Internet- Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet Drafts as reference material or to cite them other than as "work in progress." The list of current Internet-Drafts can be accessed at http://www.ietf.org/ietf/1id-abstracts.txt. The list of Internet-Draft Shadow Directories can be accessed at http://www.ietf.org/shadow.html. This document is a product of the IETF's Differentiated Services Working Group. Comments should be addressed to WG's mailing list atdiffserv@ietf.org.Differentiated Services@ietf.org. The charter for Differentiated Services may be found athttp://www.ietf.org/html.charters/diffserv-charter.htmlhttp://www.ietf.org/html.charters/Differentiated Services-charter.html Copyright (C) The Internet Society (2000). All Rights Reserved. Distribution of this memo is unlimited. Abstract This memo describesaan SMIv2 MIB for a device implementing the Differentiated Services Architecture [DSARCH], described in detail by the Informal Management Model forDiffservDifferentiated Services Routers [MODEL]. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page 1] Internet Draft Differentiated Services MIBMarchMay 2001 1. The SNMP Management Framework The SNMP Management Framework presently consists of five major components: o An overall architecture, described in RFC 2571 [1]. o Mechanisms for describing and naming objects and events for the purpose of management. The first version of this Structure of Management Information (SMI) is called SMIv1 and described in RFC 1155 [2], RFC 1212 [3] and RFC 1215 [4]. The second version, called SMIv2, is described in RFC 2578 [5], RFC 2579 [6] and RFC 2580 [7]. o Message protocols for transferring management information. The first version of the SNMP message protocol is called SNMPv1 and described in RFC 1157 [8]. A second version of the SNMP message protocol, which is not an Internet standards track protocol, is called SNMPv2c and described in RFC 1901 [9] and RFC 1906 [10]. The third version of the message protocol is called SNMPv3 and described in RFC 1906 [10], RFC 2572 [11] and RFC 2574 [12]. o Protocol operations for accessing management information. The first set of protocol operations and associated PDU formats is described in RFC 1157 [8]. A second set of protocol operations and associated PDU formats is described in RFC 1905 [13]. o A set of fundamental applications described in RFC 2573 [14] and the view-based access control mechanism described in RFC 2575 [15]. A more detailed introduction to the current SNMP Management Framework can be found in RFC 2570 [16]. Managed objects are accessed via a virtual information store, termed the Management Information Base or MIB. Objects in the MIB are defined using the mechanisms defined in the SMI. This memo specifies a MIB module that is compliant to the SMIv2. A MIB conforming to the SMIv1 can be produced through the appropriate translations. The resulting translated MIB must be semantically equivalent, except where objects or events are omitted because no translation is possible (use of Counter64). Some machine-readable information in SMIv2 will be converted into textual descriptions in SMIv1 during the translation process. However, this loss of machine readable information is not considered to change the semantics of the MIB. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page 2] Internet Draft Differentiated Services MIBMarchMay 2001 2.IntroductionRelationship to other working group documents The working group and related working groups developed other documents, notably the Informal Management Model and the policy configuration paradigm of SNMPCONF. The relationship between the MIB and those documents is clarified here. 2.1. Relationship to the Informal Management Model forDiffservDifferentiated Services Router This MIB isdesigned accordingsimilar in design to[MODEL].[MODEL], although it can be used to build functional data paths that the model would not well describe. The model conceptually describesthe way thatingress and egress interfaces of an'n'-port router are modeled.n-port router, which may find some interfaces at a network edge and others facing into the network core. It describes the configuration and management of aDiffservDifferentiated Services interface in terms of one or more Traffic Conditioning Block (TCB), each containing, arranged in the specified order, by definition, zero or more classifiers, meters, actions, algorithmic droppers, queues and schedulers. Traffic may beclassified;classified, and classified traffic may bemetered; eachmetered. 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.WhenAt times, the treatment for a given packet must have any of those elementsrepeated in a way that breaks the permitted sequence {classifier, meter, action, algorithmic dropper, queue, scheduler},repeated. [MODEL] models thismust be modeledby cascading multipleTCBs.TCBs, while this MIB describes the policy by directly linking the functional data path elements. The MIB represents this cascade by following the "Next" attributes of the various elements. They indicate what the next step inDiffservDifferentiated Services processing will be, whether it be a classifier, meter, action, algorithmic dropper, queue, scheduler or a decision to now forward a packet. TheMIB models the individual elements that make up the TCBs. Thehigher level concept of a TCB is not required in the parameterization or in the linking together of the individual elements, hence it is not used in the MIB itself and is only mentioned in the text for relating the MIB with the [MODEL].The actual distinguishing of which TCB a specific element is a part of is not needed for the instrumentation of a device to supportRather, thefunctionality of Diffserv, but it is useful for conceptual reasons. By not using the TCB concept, thisMIBallows any grouping of elements to construct TCBs using the rules defined by [MODEL]: that document should be consulted formodels theallowed combinations ofindividual elements that make upa TCB.the TCBs. Thiswill minimize changes to thisMIBif rules in [MODEL] changes. Theuses the notion of a Data Pathis used in this MIBto indicate theDiffservDifferentiated Services processing a packet may experience.ThisThe Data Path a packet will initially follow isdistinguished based on the Interface and the Directionan attribute of theflow the packet is part of.interface in question. The Data Path Start Table provides a starting point for each direction (ingress or egress) on each interface. A Data Path Table Entry indicates the first of possibly multiple elements that will applyDiffserv treatment to the packet.Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page 3] Internet Draft Differentiated Services MIBMarchMay 2001 Differentiated Services treatment to the packet. 2.2. Relationship to other MIBs and Policy Management This MIB provides for direct reporting and manipulation ofthe mostdetailed functionalelements described by [MODEL].elements. These elementsare designed with their parameterization tables separated from their data path linkage tables, allowingconsist of a structural element and one or more parameter-bearing elements. While this can be cumbersome, it allows the reuse ofeach table as much as possible. Theparameters. For example, a service provider may offer three varieties of contracts, and configure three parameter elements. Each such data pathlinkage in this MIB is coupled with an interface throughon theusesystem may then refer to these sets of parameters. The diffServDataPathTable couples each direction on each interface with thediffServDataPathTable.specified data path linkage. The concept of "interface" is as defined by InterfaceIndex/ifIndex of the IETF Interfaces MIB [IFMIB]. Other MIBs and data structure definitions for policy management mechanisms other than SNMP/SMIv2 are likely to exist in the future for the purposes of abstracting the model in other ways. In particular, abstractions in the direction of less detailed definitions ofDiffservDifferentiated Services functionality are likely e.g. some form of "Per-Hop Behavior"-based definition involving a template of detailed object values which is applied to specific instances of objects in this MIB semi-automatically. Another possible direction of abstraction is one using a concept of "roles" (often, but not always, applied to interfaces). In this case, it may be possible to re-use the object definitions in this MIB, especially the parameterization tables. The Data Path table will help in the reuse of the data path linkage tables by having the interface specific information centralized, allowing easier mechanical replacement of ifIndex by some sort of "roleIndex".WorkThis work isongoing in this area. 2.3.ongoing. 3. MIB OverviewThis MIB is structured based on the needThe Differentiated Services Architecture does not specify how an implementation should be assembled. The [MODEL] describes a general approach todescribe the sequential Diffserv treatments being appliedimplementation design, or to user interface design. Its components could, however, be assembled in apacket, and the parameterization of these treatments. These two requirements are kept separate throughoutdifferent way. Traffic conforming to a meter might be run through a second meter, for example, or reclassified. This MIB models thedesign of this MIB, and are fulfilled using separate tables andsame functional datadefinitions. In this MIB, we modelpath elements, allowing theingress and egress portions of a Diffservnetworkdevice 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 accordingmanager tosome set of rules o Determine whetherassemble them in any fashion that meets thepacket'srelevant policy. These datastream is conforming or not conforming to its permitted ratespath elements include Classifiers, Meters, Actions Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page 4] Internet Draft Differentiated Services MIBMarchMay 2001o Perform a setofresulting actions, possibly including countingvarious sorts, Queues, and Schedulers. In many of these tables, a distinction is drawn between thetraffic, applicationstructure ofan appropriate dropthe policy (do this, then do that) andmarking ofthetraffic withparameters applied to specific policy elements. This is to facilitate configuration, if the MIB is used for that. The concept is that aDifferentiated Services Code Point (DSCP)set of parameters, such as the values that describe a specific token bucket, might be configured once and applied to many interfaces. The RowPointer Textual Convention is therefore used in two ways in this MIB. It is defined for the purpose of connecting an object to an entry dynamically; the RowPointer object identifies the first object in[DSFIELD]. o Enqueuethetraffic for outputtarget Entry, and in so doing points to theappropriate queue, whose scheduler may shapeentire entry. In this MIB, it is used as a connector between successive functional data path elements, and as the link between the policy structure and the parameters that are used. When used as a connector, it says what happens "next"; what happens to classified traffic, to traffic conforming orsimply forwardnot conforming to a meter, and so on. When used to indicate the parameters applied in a policy, itwith some minimum rate or maximum latency.says "specifically" what is meant; the structure points to the parameters of its policy. TheMIB therefore containsuse of RowPointers as connectors allows for thefollowing elements: Data Path Table This issimple extension of thestartingMIB. The RowPointers, whether "next" or "specific", may point to Entries defined in other MIB modules. For example, the only type ofDiffserv data paths within a single Diffserv device. Data pathsmeter definedbyin thistable are interface and interface direction specific. Classifier and Filter Tables A general extensible framework and one example ofMIB is afilter table (an IP Six-Tuple Multi-Field Classification Table). Meter Tables A general extensible framework and one exampletoken bucket meter; if another type of meter is required, aparameterization 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 examplesproprietary MIB or another standard MIB could be defined describing that type ofparameterization tables for Absolute Drop, Mark and Count actions. The "multiplexer"meter, and"null" actions described in [MODEL] are accomplished implicitly by means ofdiffServMeterSpecific could point to it. Similarly, if a new action is required, theRowPointer structures"next" pointer of theother elements. Queue, Schedulerprevious functional datapath element could point to an Entry defined in a proprietary MIB or one defined in another standard. 3.1. Processing Path An interface has an ingress andAlgorithmic Dropper Tables A general extensible framework for parameterizing queuingan egress direction, andscheduler systems. The queue measurement dependent algorithmic droppers are also described here. 3. Structure of this MIB This MIB is structured with separate tables for purpose of Diffserv data path descriptionwill generally have a different policy in each direction. As traffic enters an edge interface, it may be classified, metered, counted, andDiffserv treatment parameterization of the Diffserv device. The data path description and/ormarked. Traffic leaving thetreatment parameterization tables can eachsame interface might bereused independently, allowingremarked according to theflexibilitycontract with the next network, queued tomaintain a common data construct for Diffserv device configurationmanage the bandwidth, and so on. As [MODEL] points out, the functional datapath elements used on ingress andprovisioning, independentegress are of theconfiguration method used. The definitionssame type, but may be structured inthis MIB are intendedvery different ways tobe reusable by other futureimplement the relevant policies. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page 5] Internet Draft Differentiated Services MIBMarchMay 2001standards.3.1.1. diffServDataPathTable - Thetreatment 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 that rely on packet classification. 3.1. DiffservDataPaths This part ofPath Table Therefore, when traffic arrives at an ingress or egress interface, theMIB provides instrumentation for connectingfirst step in applying theDiffserv Functional Data path Elements withinpolicy is determining what policy applies. This MIB does that by providing asingle Diffserv device. Please refertable of pointers to the[MODEL] for discussions on the valid sequencing and grouping of Diffserv Functional Datafirst functional data pathElements. Given some basic information, e.g. ifIndex andelement, indexed by interfacedirection,and direction on that interface. The content of thefirst Diffserv Functional Data path Element applieddiffServDataPathEntry is a single RowPointer, which points to that functional data path element. When diffServDataPathStart in agiven packetdirection ona givenan interface isdetermined. Subsequent Diffserv Functional Elements are provided byundefined or is set to zeroDotZero, the"Next" pointer attribute of each entry of data path tables. Description of how this "Next" pointerimplication isused in each tablethat there isprovided in their respective DESCRIPTION clause. 3.1.1. Data Path Table Entries in the Data Path Table provide the Diffserv treatment starting points for all packets of Diffserv interfaces on this device. Not all interfaces on this device needno specific policy tobe Diffserv interfaces, hence not all entries inapply; theifTable needmanufacturer's default is used. 3.2. Classifier Classifiers are used tohave corresponding entries indifferentiate among types of traffic. In theData Path Table. Each entry in this table is indexedDifferentiated Services architecture, one usually discusses a behavior aggregate identified byifIndex andthedirectionapplication ofthe packet flow. There should be at most two entries for each interface,onefor ingressor more Differentiated Services Code Points (DSCPs). However, especially at network edges (which include hosts andone for egress. Each entry provides thefirstDiffserv Functional Data path Element each packet athop routers serving hosts), traffic may arrive unmarked or the marks may not be trusted. In these cases, one applies aspecific interface travelingMulti-Field Classifier, which may select an aggregate as coarse as "all traffic", as fine as a specificrelative direction should experience. NOTE: this table is interface specific, with the usemicroflow identified by IP Addresses, IP Protocol, and TCP/UDP ports, or variety ofifIndex. Entries may be created with zeroDotZero in the diffServDataPathStart attribute to indicate that there are no further diffserv elementsslice inthat data path. For example, a classifier that should never match anything but is present to debugbetween. Classifiers can be simple ordetect traffic might use this, althoughcomplex. In a core interface, onecould argue that it should transitwould expect toa dropper. The non-existence of any Diffserv treatment on an interface/direction is indicated implicitly by having no corresponding entryfind simple behavior aggregate classification to be used. However, inthis table. This means allowing normal IP device processing when zeroDotZeroan edge interface, one might first ask what application isused inbeing used, meter thediffServDataPathStart attribute, or whenarriving traffic, and then apply various policies to theentry does not exist. Normal IP device processing will dependnon-conforming traffic depending on thedevice, for example, this can be forwardingAutonomous System number advertising thepacket. 3.2. Classifiers The classifier, classifier element, and filter tables determine howdestination address. To accomplish such a thing, trafficis sorted out. They identify separable classes of traffic, by reference to an appropriate filter,must be classified, metered, and then reclassified. To this end, the MIB defines separate classifiers, which mayselect anything from an Baker, Chan, Smith Expires September 2001 [Page 6] Internet Draft Differentiated Services MIB March 2001 individual micro-flow to aggregates identified by DSCP.be applied at any point in processing, and may have different content as needed. The MIB also allows for ambiguous classificationis usedin a structured fashion. In the end, traffic classification must be unambiguous; we must know for certain what policy tosend these separate streamsapply toappropriate Meter, Action, Algorithmic Dropper, Queue,any given packet. However, writing an unambiguous specification is often tedious, while writing a specification in steps that permits andScheduler elements. For example, sub-classesexcludes various kinds of traffic may besent to different meter stages: e.g.simpler and more intuitive. In such a case, the classification "steps" are enumerated; all classification elements of one precedence are applied as if inan implementationparallel, and then all classification elements of theAssured Forwarding (AF) PHB [AF-PHB], AF11 traffic might be sent tonext precedence. Baker, Chan, Smith Expires December 2001 [Page 6] Internet Draft Differentiated Services MIB May 2001 This MIB defines a single classifier parameter entry, thefirst meter, AF12 traffic mightSix-Tuple Classifier. A degenerate case of this multi-field classifier is a Behavior Aggregate classifier. Other classifiers may besentdefined in other MIB modules, tothe second and AF13select trafficsentfrom a given layer two neighbor or a given interface, traffic whose addresses belong tothe second meter stage's out-of-profile action.a given BGP Community or Autonomous System, and so on. 3.2.1. diffServClfrElementTable - TheconceptClassifier Element Table A classifier consists of classifier elements. A classifier element identifies a specific set of traffic that forms part of a behavior aggregate; other classifieriselements within the sameas describedclassifier may identify other traffic that also falls into the behavior aggregate. For example, in[MODEL]. The structure ofidentifying AF traffic for the aggregate AF1, one might implement separate classifier elements for AF11, AF12, andclassifier element tables, isAF13 within the sameas theclassifierdescribed in [MODEL]. Within each classifier, it must not be important in which orderand pointing to thefilters are applied. This issame subsequent meter. Generally, one would expect Data Path Entry tofacilitate optimized implementations such as index trees. Precedencepoint to a classifier (which isused onlytoresolve ambiguity, as described in [MODEL]. Filter with higher values of precedence are compared first;say, theorder of tests for entriesfirst ofthe same precedence is unimportant. A data path may consista set ofmore thanoneclassifier. There may be overlap of filter specification between filters of different classifiers. The firstor more classifier elements), although it may point to something else when appropriate. Reclassification in a functional data path is achieved by pointing to another Classifier Entry when appropriate. A classifier elementencountered, as determinedis a structural element, indexed by classifier ID and element ID. It has a precedence value, allowing for structured ambiguity as described above, a "specific" pointer that identifies what rule is to be applied, and a "next" pointer directing traffic matching thesequencing of diffservclassifier to the next functional data pathelements, will be used first. An important form of classificationelement. If the "next" pointer is"everything else":zeroDotZero, thefinal stage ofindication is that there is no further differentiated services processing for this behavior aggregate. If theclassifier i.e."specific" pointer is zeroDotZero, however, theone withdevice is misconfigured. In such a case, thelowest order, mustclassifier element should be"complete" sinceoperationally treated as if it were not present. When theresult of an incomplete classifierMIB is used for configuration, diffServClfrNextFree always contains a legal value for diffServClfrId that is notnecessarily deterministic - see [MODEL] section 4.1.2.currently used in the system's configuration. Thedefinition ofNetwork Management Application reads theactual filter to be used byvariable and uses theclassifier is referenced viavalue read in aRowPointer: this enablescreate-and-go or a create- and-wait SET. When theuse of any sort of filter table that one might wish to design, standard or proprietary. The filter tableSET is performed, the agent must determine whether the value is indeed still unused; two network managers maybe, but does not needattempt tobe, defined in this MIB module. Classifiers, used in various ingress and egress interfaces, are organized by the classifier table. Each classifier will isolatecreate anumber of classes of traffic, identified by various kinds of filters. To enumerate this, we defineconfiguration entry simultaneously and use theclassifier table,same value. If it is currently unused, theclassifier element table,SET succeeds and thefilter table. A data path entry points to a classifier entry. A classifier entry identifies a list of classifier elements. A classifier element effectively includesagent changes thefilter entry, and points to a "next" classifier entry or other data path functional element. There are potentially many types of filters, only onevalue ofwhichdiffServClfrNextFree according to an agent-specific algorithm. If the value isspecifiedinthis MIB Module.use, however, the SET fails. The network manager must re-read diffServClfrNextFree to obtain a useful value. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page 7] Internet Draft Differentiated Services MIBMarchMay 20013.2.1. Classifier Table The classifier table, therefore, identifiesLikewise, when theclassifiersMIB is used for configuration, diffServClfrElementNextFree always contains a legal value for diffServClfrElementClfrId thatareis not currently used invarious interfaces. It organizes the list of classifier elements that identify the various classes. 3.2.2. Classifier Element Table Classifier elements point tothefilters which identify various classes of traffic.system's configuration. Theseparation betweenNetwork Management Application reads the"classifier element"variable and uses the"filter" allows us to use many different kinds of filters withvalue read in a create-and-go or a create-and-wait SET. When thesame essential semantics of "an identified set of traffic". The traffic matchingSET is performed, thefilter corresponding to a classifier elementagent must determine whether the value isgivenindeed still unused; two network managers may attempt to create a configuration entry simultaneously and use the"next" data path functional element identifiedsame value. If it is currently unused, the SET succeeds and the agent changes the value of diffServClfrElementNextFree according to an agent-specific algorithm. If the value is in use, however, theclassifier element. 3.2.3. Filter TableSET fails. The network manager must re-read diffServClfrElementNextFree to obtain a useful value. 3.2.2. diffServSixTupleClfrTable -IPThe Six-Tuple Classifier Table This MIBincludes one Filter Table,defines adefinitionsingle parameter type foranclassification, the Six- Tuple Classifier. As a parameter, a filter may be specified once and applied to many interfaces, using diffServClfrElementSpecific. This classifier matches: o IPSix-Tuple Classifier, used forsource address prefix, including host, CIDR Prefix, and "any source address" o IPtraffic classification. Entries in this filter tabledestination address prefix, including host, CIDR Prefix, and "any destination address" o IP protocol or "any" o TCP/UDP/SCTP source port range, including "any" o TCP/UDP/SCTP destination port range, including "any" o Differentiated Services Code Point In that ranges or "any" arereferenced from the RowPointer diffServClfrElementSpecific attributes of classifier element table entries. For example,defined in each case, clearly a wide variety of filters can be constructed. The Differentiated Services Behavior Aggregate(BA) Classifier, acting only on DSCPs,filter is asimple formspecial case ofthe IP Six-Tuple Classifier. It is represented by having the diffServSixTupleClfrDscp attribute set to the desired DSCP and all other classification attributes set to match-all, their default settings. Each entrythis filter. Other MIB modules may define similar filters in theIP Six-Tuple Classifier Table definessame way. For example, asingle filter. The textual convention of InetAddress [INETADDR] is usedfilter forboth IPv4Ethernet information might define source andIPv6 addressing. The usedestination MAC addresses ofIP Six-Tuple Classifiers is discussed in [DSARCH]"any", Ethernet Packet Type, IEEE 802.2 SAPs, andabstract examples of how they might be configured are provided in [MODEL]. 3.3. 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 to some set of thresholds and produces some number (two or more) of potential results.IEEE 802.1 priorities. Agiven packet is said to "conform"filter related to policy routing might be structured like themeter if, at the time thatdiffServSixTupleClfrTable, but containing thepacket is being looked at,BGP Communities of thestream appears to be withinsource and destination prefix rather than themeter's profile. MIB syntax makes it easiest to defineprefix itself, meaning "any prefix in thisascommunity". For such asequence of one or more cascaded pass/fail tests, modeled here as if-then-else constructs. It is importantfilter, a table similar tounderstand that this way of modeling does not imply anything about the implementation beingdiffServSixTupleClfrTable is constructed, and Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page 8] Internet Draft Differentiated Services MIBMarchMay 2001"sequential": multi-rate/multi-profile meters e.g. those designeddiffServClfrElementSpecific configured tosupport [SRTCM], [TRTCM], or [TSWTCM] can still be modeled this way even if they, of necessity, share information between the stages: the stages are introduced merely as a notational convenience in orderpoint tosimplifyit. When the MIBstructure. 3.3.1. Meter Table The generic meter tableis usedasfor configuration, diffServSixTupleClfrNextFree always contains abaselegal value forall more specific forms of meter.diffServSixTupleClfrId that is not currently used in the system's configuration. Thedefinition of parameters specific toNetwork Management Application reads thetype of meter used is referenced viavariable and uses the value read in apointer tocreate- and-go or atable containing those specifics. This enablescreate-and-wait SET. When theuse of any sort of specific meter table that one might wish to design, standard or proprietary. The specific meter tableSET is performed, the agent must determine whether the value is indeed still unused; two network managers maybe, but does not needattempt tobe, defined in this MIB module. 3.3.2. Token-Bucket Meter Table This is included as an example ofcreate acommon typeconfiguration entry simultaneously and use the same value. If it is currently unused, the SET succeeds and the agent changes the value ofmeter. EntriesdiffServSixTupleClfrNextFree according to an agent-specific algorithm. If the value is inthis table are referenced fromuse, however, theRowPointer diffServMeterSpecific attributes of meter table entries.SET fails. Theparameters are represented bynetwork manager must re-read diffServSixTupleClfrNextFree to obtain arate diffServTBMeterRate,useful value. 3.3. Metering Traffic As discussed in [MODEL], aburst size diffServTBMeterBurstSize,"meter" andan interval diffServTBMeterInterval. How these parametersa "shaper" areused dependsfunctions that operate onthe typeopposing ends ofmeter being parameterized, this is provided by the diffServTBMeterType attribute. Additional meter parameterization tables can be defineda link. A shaper schedules traffic for transmission at specific times inother MIBs when necessary. 3.4. Actions Actions include "no action", "markorder to approximate a particular line speed or combination of line speeds. In its simplest form, if the trafficwithstream contains constant sized packet, it might transmit one packet per unit time to build the equivalent of aDSCP", "dropCBR circuit. However, various factors intervene to make thetraffic" or "count it". Other tasks such as "shapeapproximation inexact; multiple classes of traffic may occasionally schedule their traffic and thetraffic" or "drop based on some algorithm" are handled elsewhere as queuing mechanisms, rather than actions, consistent with [MODEL]. The "multiplexer", "replicator"same time, the variable length nature of IP traffic may introduce variation, and"null" actions describedfactors in[MODEL] are accomplished implicitly by means oftheRowPointer structureslink or physical layer may change traffic timing. A "meter" integrates the arrival rate of traffic and determines whether theother elements. This MIB usesshaper at theAction Table diffServActionTable to organize one Action's relationship withfar end was correctly applied, or whether theelement(s) before and after it. It allows Actionsbehavior of the application in question is naturally close enough tobe cascadedsuch behavior toenable multiple Actionsbeapplied to a single traffic stream by using each entry's diffServActionNext attribute. The diffServActionNext attributeacceptable under a given contract. A common type of meter is a Token Bucket meter, such as [SRTCM] or [TRTCM]. This type of meter assumes thelast action entry inuse of a shaper at a previous node; applications which send at a constant rate when sending may conform if thechain points totoken bucket is properly specified. It specifies thenext element inacceptable arrival rate and quantifies theTCB, if any, e.g. a Queuing element. It may also point atacceptable variability, often by specifying anext TCB. Theburst size or an interval; since rate = quantity/time, specifying any two of those parametersneeded for each Action element will depend onimplies thetype of Action to be taken. Hence there are specific Action Tablesthird, and a large interval provides forall the different Action types. This flexibility allows additional Actionsa forgiving system. Multiple rates may bespecifiedspecified, as infuture revisionsAF, such that a subset ofthis MIB, or in other MIBsthe traffic (up to one rate) is accepted with one set of guarantees, andalsotraffic in excess of that but below another rate has a different set of guarantees. Other types of meters exist as well. One use of a meter is when a service provider sells at most a certain Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page 9] Internet Draft Differentiated Services MIBMarchMay 2001allows for the use of proprietary Actions without impact on those defined here. 3.4.1. DSCP Mark Action Table This Action is appliedbit rate totraffic in orderone of its customers, and wants tomark it with a Diffserv Codepoint (DSCP) value, specified indrop thediffServDscpMarkActTable. Other marking actions might be specified elsewhere - these are outsideexcess. In such a case, thescopefractal nature ofthis MIB. 3.4.2. Count Action Table Count Actions are used to count thenormal Internet trafficpassing along a particular path through the model. If specified, they are likely tomust beplaced first, before other types of Action. For example,reflected in large burst intervals, as TCP frequently sends packet pairs or larger bursts, and responds poorly whenbothmore than one packet in aCount and an Absolute Dropper Action are specified, the Count Action needs to count the traffic stream before any traffic getsround trip interval is dropped.Note that there are counters contained directly in Algorithmic Dropper elements to indicateApplications like FTP contain theamount of traffic droppedeffect bythose elements. Since count actions are defined insimply staying below the target bit rate; thisway, they are inherently optional. However,type of configuration very adversely affects transaction applications like HTTP, however. Another use of a meter is in themanagement information necessaryAF specification, in which excess traffic is marked with a related DSCP and subjected todemonstrate SLA compliance or non-complianceslightly more active queue depth management. The application is notavailable from any other source. Therefore, practically, count actions may be expectedsharply limited tobe included in each set of actions thatanetwork manager configures. Counters are arrangedcontracted rate in such asingle tablecase, butwith separate conformance statementscan be readily contained should its traffic create a burden. 3.3.1. diffServMeterTable - The Meter Table The Meter Table is a structural table, specifying a specific functional data path element. Its entry consists essentially of three RowPointers - a "succeed" pointer, forlow-speed and high-speed interfaces, consistent with [IFMIB]. 3.4.3. Absolute Drop Action This action just silently discards alltrafficpresentedconforming toit, without counting it. This action has no additional parametersthe meter, a "fail" pointer, for traffic not conforming, andsoa "specific" pointer, to identify the parameters in question. This structure isrepresented only within diffServActionType without its specific table. 3.5. Queuing Elements These include Algorithmic Droppers, Queues and Schedulers which are all inter-related in their use of queuing techniques. 3.5.1. Algorithmic Dropper Table Algorithmic Droppers are represented in this MIB by entries in an Algorithmic Dropper Table. An Algorithmic Dropper is assumeda bow tooperate indiscriminately on all packets that are presented at its input, all traffic separation shouldSNMP's limitations; it would bedone by classifiers and meters preceding Baker, Chan, Smith Expires September 2001 [Page 10] Internet Draft Differentiated Services MIB March 2001 it. Algorithmic Droppersbetter to have aclose relationshipstructure with N rates and N+1 "next" pointers, withqueuing, each Algorithmic Dropper Table entry containsadiffServAlgDropQMeasure attribute, indicating which queue's state affects the calculation ofsingle algorithm specified. In this case, multiple meter entries connected by theAlgorithmic Dropper. Each entry also contains a diffServAlgDropNext attribute which indicates"fail" link are understood towhich queue the Algorithmic Dropper sinks its traffic. Algorithmic Droppers may alsocontaina pointer to specific detail of the drop algorithm, diffServAlgDropSpecific. This MIB definesthedetailparameters forthree drop algorithms: Tail Drop, Head Dropa specified algorithm, andRandom Drop; other algorithmstraffic conforming to a given rate follows their "succeed" paths. Within this MIB, only Token Bucket parameters areoutside the scopespecified; other varieties ofthismeters may be designed in other MIBmodule butmodules. When thegeneral frameworkMIB isintended to allowused fortheir inclusion via other MIB modules. One generally-applicable parameter ofconfiguration, diffServMeterNextFree always contains adropperlegal value for diffServMeterId that is not currently used in thespecification of a queue-depth threshold at which some drop action is to start. This is representedsystem's configuration. The Network Management Application reads the variable and uses the value read inthis MIB, asabase attribute, diffServAlgDropQThreshold, ofcreate-and-go or a create- and-wait SET. When theAlgorithmic Dropper entry. The attribute, diffServAlgDropQMeasure, specifies which queue's depth diffServAlgDropQThresholdSET isto compare against. o A Tail Dropper requires the specification of a maximum queue depth threshold: whenperformed, thequeue pointed at by diffServAlgDropQMeasure reaches that depth threshold, diffServAlgDropQThresh, any new traffic arriving atagent must determine whether thedroppervalue isdiscarded. This algorithm uses only parameters that are part of the diffServAlgDropEntry. o A Head Dropper requires the specification ofindeed still unused; two network managers may attempt to create amaximum queue depth threshold: whenconfiguration entry simultaneously and use thequeue pointed at by diffServAlgDropQMeasure reaches that depth threshold, diffServAlgDropQThresh, trafficsame value. If it is currentlyatunused, thehead ofSET succeeds and thequeue is discarded. This algorithm uses only parameters that are part ofagent changes thediffServAlgDropEntry. o Random Droppers are recommended as a wayvalue of diffServMeterNextFree according tocontrol congestion, in [QUEUEMGMT] and called foran agent- specific algorithm. If the value is in use, however, 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 attemptsSET fails. The network manager must re-read diffServMeterNextFree toofferobtain a useful value. 3.3.2. diffServTBParamTable - The Token Bucket Parameters Table The Token Bucket Parameters Table is aminimalset ofcontrols for any random dropper, but expects that vendors will augment the table with additional controls and status in accordance with their implementation. This algorithm requires additionalparameterson top of those in diffServAlgDropEntry: these are discussed below.that define a Token Bucket Meter. As a parameter, a token bucket may be specified Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page11]10] Internet Draft Differentiated Services MIBMarchMay 20013.5.2. Random Dropper Table One exampleonce and applied to many interfaces, using diffServMeterSpecific. Specifically, several modes ofa random dropper is a RED-like dropper. An example[SRTCM] and [TRTCM] are addressed. Other varieties ofthe representation chosenmeters may be specified inthisother MIBfor this element is shown in Figure 1. Random droppers often have their drop probability function described asmodules. In general, if aplot of drop probability (P) against averaged queue length (Q). (Qmin,Pmin) then definesToken Bucket has N rates, it has N+1 potential outcomes - thestarttraffic stream is slower than and therefore conforms to all of thecharacteristic plot. Normally Pmin=0, meaning with average queue length below Qmin, there will be no drops. (Qmax,Pmax) defines a "knee" onrates, it fails theplot, after which pointfirst few but is slower than and therefore conforms to thedrop probability becomehigher rates, or it fails all of them. As such, multi-rate meters should specify those rates in montonically increasing order, passing through the diffServMeterFailNext from moreprogressive (greater slope). (Qclip,1) definescommitted to more excess rates, and finally falling through diffServMeterFailNext to thequeue length atset of actions that apply to traffic whichall packets will be dropped. Notice thisconforms to none of the specified rates. DiffServTBParamType in the first entry indicates the algorithm being used. At each rate, diffServTBParamRate isdifferentderivable fromTail Drop because this uses an averaged queue length. Although it is possible for Qclip = Qmax. IndiffServTBParamBurstSize and diffServTBParamInterval; a superior implementation will allow theMIB module, diffServRandomDropMinThreshBytesconfiguration of any two of diffServTBParamRate, diffServTBParamBurstSize, anddiffServRandomDropMinThreshPkts represent Qmin. diffServRandomDropMaxThreshBytesdiffServTBParamInterval, anddiffServRandomDropMaxThreshPkts represent Qmax. diffServAlgDropQThreshold represents Qclip. diffServRandomDropInvProbMax represents Pmax (inverse). This MIB does not represent Pmin (assumed to be zero unless otherwise represented). In addition, since message memory is finite, queues generally have some upper bound above which theyrespond "badValue" if all three areincapable of storing additional traffic. Normally this number is equal to Qclip,specifiedby diffServeAlgDropQThreshold. Each random dropper specificationbut are not mathematically related. When the MIB isassociated withused for configuration, diffServTBParamNextFree always contains aqueue. This allows multiple drop processes (of samelegal value for diffServTBParamId that is not currently used in the system's configuration. The Network Management Application reads the variable and uses the value read in a create- and-go ordifferent types)a create- and-wait SET. When the SET is performed, the agent must determine whether the value is indeed still unused; two network managers may attempt tobe associated withcreate a configuration entry simultaneously and use the samequeue, as differentvalue. If it is currently unused, the SET succeeds and the agent changes the value of diffServTBParamNextFree according to an agent- specific algorithm. If the value is in use, however, the SET fails. The network manager must re-read diffServTBParamNextFree to obtain a useful value. 3.4. Actions applied to packets "Actions" are the things a differentiated services interface PHBimplementationsmayrequire. This also allowsdo to a packet in transit. At minimum, such a policy might calculate statistics on traffic in various configured classes, mark it with a DSCP, drop it, or enqueue it before passing it on forsequencesother processing. Actions are composed ofmultiple droppers if AlgDrop Queue +-----------------+ +-------+ --->| Next ---------+--+------------------->| Next -+--> ... | QMeasure -------+--+ | ... | | QThreshold | RandomDrop +-------+ | Type=randomDrop | +----------------+ | Specific -------+---->| MinThreshBytes | +-----------------+ | MaxThreshBytes | | InvProbMax | | InvWeight | | SamplingRate | +----------------+ Figure 1: Example Usea structural element, the diffServActionTable, and various component action entries that may be applied. In the case of theRandomDropTable for Random DroppersAlgorithmic Dropper, an additional parameter table may be specified to control Active Queue Management, as defined in [RED93] and other AQM specifications. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page12]11] Internet Draft Differentiated Services MIBMarchMay 2001necessary.3.4.1. diffServActionTable - ThecalculationAction Table The action table identifies sequences of actions to be applied to asmoothed queue length may also have an important bearing on the behavior of the dropper: parameters may includepacket. Successive actions are chained through diffServActionNext, ultimately terminating in zeroDotZero (indicating that thesampling intervalpolicy is complete), a pointer to a queue, orrate, anda pointer to some other functional data path element. When theweight of each sample.MIB is used for configuration, diffServActionNextFree always contains a legal value for diffServActionId that is not currently used in the system's configuration. Theperformance may be very sensitive toNetwork Management Application reads thevalues of these parametersvariable and uses the value read in awide range of possible values may be required due to a wide range of link speeds. Most algorithms includecreate- and-go or asample weight, represented here by diffServRandomDropInvWeight. The availability of diffServRandomDropSamplingRate as readablecreate- and-wait SET. When the SET isimportant,performed, theinformation provided by Sampling Rateagent must determine whether the value isessentialindeed still unused; two network managers may attempt tothecreate a configurationof diffServRandomDropInvWeight. Having Sampling Rate be configurableentry simultaneously and use the same value. If it isalso helpful, as line speed increases,currently unused, theabilitySET succeeds and the agent changes the value of diffServActionNextFree according tohave queue sampling be less frequent than packet arrival is needed. Note however that therean agent- specific algorithm. If the value isongoing research on this topic, see e.g. [ACTQMGMT] and [AQMROUTER]. Additional parameters may be addedinan enterprise MIB module, e.g. by using AUGMENTS on this table, to handle aspects of random drop algorithms that are not standardized here. NOTE: Deterministic Droppers can be viewed as a special case of Random Droppers withuse, however, thedrop probability restrictedSET fails. The network manager must re-read diffServActionNextFree to0 and 1. Hence Deterministic Droppers might be described byobtain aRandom Dropper with Pmin = 0, Pmax = 1, Qmin = Qmax = Qclip, the averaged queue length at which dropping occurs. 3.5.3. Queues and Schedulersuseful value. 3.4.2. diffServCountActTable - TheQueueCount Action Tablemodels simple FIFO queues, as describedThe count action accumulates statistics pertaining to traffic passing through a given path through the policy. It is intended to be useful for usage-based billing, for statistical studies, or for analysis of the behavior of a policy in[MODEL] section 7.1.1.a given network. TheScheduler Table allows flexibilityobjects inconstructing both simple and somewhat more complex queuing hierarchies from those queues. Of course, since TCBs can be cascaded multiple times on an interface, even more complex hierarchies can be constructed that way also. Queue Table entriesthe Count Action arepointed at byvarious counters and a discontinuity time. The counters display the"next" attributesnumber of packets and bytes encountered on theupstream elements e.g. diffServMeterSucceedNext. Note that multiple upstream elements may direct their traffic to the same Queue Table entry. For example,path since theAssured Forwarding PHB suggests that all traffic marked AF11, AF12 or AF13 be placed indiscontinuity time. They share the samequeue, after metering, without reordering. This would be represented by having the diffServMeterSucceedNextdiscontinuity time. The designers ofeach upstream meter point atthis MIB expect that every path through a policy should have a corresponding counter. In early versions, it was impossible to configure an action without implementing a counter, although thesame entrycurrent design makes them in effect theQueue Table. NOTE: Queue Tablenetwork manager's option, as a result of making actions consistent in structure andScheduler Table entries are for data path description, they both uses Scheduler Parameterization Table entries for Baker,extensible. The assurance of proper debug and accounting is therefore left with the policy designer. When the MIB is used for configuration, diffServCountActNextFree always contains a legal value for diffServCountActId that is not currently used in the system's configuration. The Network Management Application reads the variable and uses the value read in a create- and-go or a create- and-wait SET. When the SET is performed, the agent must determine whether the value is indeed still unused; two network managers may attempt to create a configuration entry simultaneously and use the same value. If it is currently unused, the SET succeeds and the agent Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page13]12] Internet Draft Differentiated Services MIBMarchMay 2001diffserv treatment parameterization. Queue Table entries specifychanges thescheduler it wants service from by usevalue ofits Next pointer. Each Scheduler Table entry representsdiffServCountActNextFree according to an agent- specific algorithm. If thealgorithmvalue is inuse for servicinguse, however, theone or more queues that feed it.SET fails. The[MODEL] section 7.1.2 describesnetwork manager must re-read diffServCountActNextFree to obtain ascheduler with multiple inputs: thisuseful value. 3.4.3. diffServDscpMarkActTable - The Mark Action Table The Mark Action table isrepresentedan unusual table, both in SNMP and inthe MIB by having the scheduling parameters be associated with each input. Inthisway, sets of Queues canMIB. I might begrouped togetherviewed not so much asinputsan array of single-object entries as an array of OBJECT-IDENTIFIER conventions, as the OID for a diffServDscpMarkActDscp instance conveys all of the necessary information: packets are to be marked with thesame Scheduler. This table servesrequisite DSCP. As such, contrary torepresentcommon practice, theexample scheduler described inindex for the[MODEL]. More complex queuingtable is read- only, andscheduling structures are possible usingis both thetables defined in this MIB. When necessary, more complex constructs may be created outside of this MIB. Scheduler Parameter Table entries are used to parameterize each input that feeds into a scheduler. The inputs can be a mixture of Queue TableEntry's index andScheduler Table entries. Scheduler Parameterits only value. 3.4.4. diffServAlgDropTable - The Algorithmic Drop Tableentries can be used/reused by one or more Queue and/or SchedulerThe Algorithmic Drop Tableentries. For representingidentifies aStrict Priority scheduler, each scheduler inputdropping algorithm, drops packets, and counts the drops. Classified as an action, it isassignedin effect apriority with respectmethod which applies a packet toalla queue, and may modify either. When theother inputs feedingalgorithm is "always drop", this is simple; when thesame scheduler, with default valuesalgorithm calls for head-drop, tail-drop, or a variety of Active Queue Management, theother parameters. Higher- priority traffic thatqueue is inspected, and in the case of Active Queue Management, additional parameters are required. What may notbeing delayed for shaping willbeserviced before a lower-priority input. For Weighted Queuing methods e.g. WFQ, WRR,clear from the"weight" of a given scheduler inputname isrepresented withthat an Algorithmic Drop action often does not drop traffic. Algorithms other than "always drop" normally drop aMinimum Service Rate leaky-bucket profile which provides guaranteed minimum bandwidth tofew percent of packets at most. The action inspects the diffServQEntry thatinput, if required. ThisdiffSeervAlgQMeasure points to in to determine whether the packet should be dropped. When the MIB isrepresented byused for configuration, diffServAlgDropNextFree always contains arate diffServAssuredRateAbs; the classical weightlegal value for diffServAlgDropId that is not currently used in theratio between that ratesystem's configuration. The Network Management Application reads the variable and uses theinterface speed,value read in a create- and-go orperhaps the ratio between that rate anda create- and-wait SET. When thesum ofSET is performed, theconfigured rates for classes. The rate may, alternatively, be represented by a relative value, as a fraction ofagent must determine whether theinterface's current line rate, diffServAssuredRateRelvalue is indeed still unused; two network managers may attempt toassist in cases where line rates are variable or wherecreate ahigher-level policy might be expressed in terms of fractions of network resources. The two rate parameters are inter-relatedconfiguration entry simultaneously andchanges in one may be reflected inuse theother. For weighted scheduling methods, one can say loosely, that WRR focuses on meeting bandwidth sharing, without concern for relative delay amongstsame value. If it is currently unused, thequeues; where WFQ control both queue service order and amount of traffic serviced, providing meeting bandwidth sharingSET succeeds andrelative delay ordering amongstthequeues. A queue or scheduled setagent changes the value ofqueues (which isdiffServAlgDropNextFree according to aninputagent- specific algorithm. If the value is in use, however, the SET fails. The network manager must re-read diffServAlgDropNextFree to obtain ascheduler) may also be capable of acting as a non-work-conserving [MODEL] trafficuseful value. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page14]13] Internet Draft Differentiated Services MIBMarchMay 2001shaper: this3.4.5. diffServRandomDropTable - The Random Drop Parameters Table The Random Drop Table isdone by defining a Maximum Service Rate leaky-bucket profile in order to limitan extension of thescheduler bandwidth available to that input. ThisAlgorithmic Drop Table intended for use on queues whose depth isrepresentedactively managed. Active Queue Management algorithms are typified bya rate diffServShapingRateAbs;[RED93], but theclassical weight isparameters they use vary. It was deemed for theratio betweenpurposes of this MIB thatrate and the interface speed, or perhapstheratio between that rate and the sum of the configured rates for classes. Theproper values to represent include: o Target case mean queue depth, expressed in bytes or packets o Worst case mean queue depth, expressed in bytes or packets o Maximum drop ratemay, alternatively, be represented by a relative value,expressed as drops per thousand o Coefficient of an exponentially weighted moving average, expressed as the numerator of a fraction whose denominator is 65536. o Sampling rate An example of theinterface's current line rate, diffServShapingRateRel. There was discussionrepresentation chosen inthe working group about alternative modeling approaches, such as defining a shaping action or a shaping element. We did not takethisapproach because shapingMIB for this element is shown infact something a scheduler does to its inputs, (which we modelFigure 1. Random droppers often have their drop probability function described as a plot of drop probability (P) against averaged queue length (Q). (Qmin,Pmin) then defines the start of the characteristic plot. Normally Pmin=0, meaning with average queue length below Qmin, there will be no drops. (Qmax,Pmax) defines amaximum rate or a scheduler whose output has a maximum rate) and we felt it was simpler and"knee" on the plot, after which point the drop probability become moreelegant to simply describe it in that context. Other types of priority and weighted scheduling methods can be defined using existing parameters in diffServAssuredRateEntry. NOTE: diffServSchedulerMethod uses OBJECT IDENTIFIER syntax, withprogressive (greater slope). (Qclip,1) defines thedifferent types of scheduling methods defined as OBJECT-IDENTITY. Future scheduling methods mayqueue length at which all packets will bedefined in other MIBs. This requiresdropped. Notice this is different from Tail Drop because this uses anOBJECT-IDENTITY definition, a description of how the existing objects are reused, if they are, and any new objects they require. NOTE: hierarchical schedulers can be parameterized using this MIB by having Scheduler Table entries feeds into Scheduler Table entry. 4. MIB Usage Example This section provides some examples on how the different table entries of this MIB may be used together for a Diffserv Device, with the usage of each individual attribute be defined within the MIB module itself. For the figures, all the MIB table entry and attribute names assumes 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. "0.0" is being used to mean zeroDotZero. And for Scheduler Method "= X" means "using the OID of diffServSchedulerX". 4.1. Model's Example As an example, when this MIB's structures are used for the hypothetical configuration in [MODEL] section 8.1, the result is shown in Figure 2, 3, and 4. The parameterization table entries' values are not specified in detail here, they can be obtained from [MODEL] section 8.1. Baker, Chan, Smith Expires September 2001 [Page 15] Internet Draft Differentiated Services MIB March 2001 +---------------------+ +------------------------> Q_EF |DataPath | | | ifIndex=1 | | +--------------+ | IfDirection=Ingress | +------+ | +--->|Action | | Start --------------+--->|Clfr | | | | Id=EF2 | +---------------------+ | Id=1 | | | | Next=0.0 | +------+ | | | Specific=0.0 | | | | Type=AbsDrop | | | +--------------+ | | | +-------------------+ | | +------------+ +--------------+ | +-----------+ | |ClfrElement | +-->|Meter | | +->|Action | | | Id=EF | | | Id=EF | | | | Id=EF1 | | | ClfrId=1 | |averaged queue AlgDrop Queue +-----------------+ +-------+ --->| Next ---------+--+------------------->| Next -+--> ... |SucceedNext -+-+QMeasure -------+--+ | ... |Next -----+----+|Order=NAQThreshold | RandomDrop +-------+ | Type=randomDrop |FailNext ----+----++----------------+ | Specific-+--+-------+---->| MinThreshBytes |Next ------+--++-----------------+ |Specific -+MaxThreshBytes | |Type=SpcfProbMax | | Weight |Specific --+-+ +-----------+--+ +-----------+|+------------+ | | | | | +-------+ | | | | +--------+ | +---------+ | +--------------+ +-->|FilterEF| +-->|TBMeterEF| +->|CountActEFDrop| +--------+ +---------+ +--------------+ +------------+ +----------+ +--------------+ |ClfrElement | +-->|Action | +-->|AlgDrop | | Id=AF11 | | | Id=AF11 | | | Id=AF11 | | ClfrId=1 | | | Next ----+--+ | Type=tailDrop| | Order=NA | | | Specific +-+ | Next --------+--+-> Q_AF1 | Next ------+--+ | Type=Spcf| | | QMeasure ----+--+ | Specific --+-+ +----------+ | | QThreshold | +------------+ | | | Specific=0.0 | | | +--------------+ | | | +----------+SamplingRate |+------------+ +->|FilterAF11| +->|CountActAF11| +----------+ +------------+ Figure 2: Example from Model Section 8.1 part 1+----------------+ Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page16]14] Internet Draft Differentiated Services MIBMarch 2001 +------------+ +--------------+ +-------------+ |ClfrElement | +-->|Meter | +-->|Action | | Id=AF21 | | | Id=AF21 | | | Id=AF21S | | ClfrId=1 | | | SucceedNext -+--+ | Next -------+----> Q_AF2 | Order=NA | | | FailNext + | | Specific -+ | | Next ------+--+ | Specific --+ | | Type=Spcf | | | Specific --+-+ +----------+-+-+ +-----------+-+ +------------+ | | | | | | | +---+ | | | | | +----------+ | | +-----------+ | +-------------+ +->|FilterAF21| | +->|TBMeterAF21| +->|CountActAF21S| +----------+ | +-----------+ +-------------+ | +--------------------+ | | +-----------+ +-----------+ +-->|Action | +-->|Action | | Id=AF21F1 | | | Id=AF21F2 | | Next -----+--+ | Next -----+------> Q_AF2 | Specific -+-+ | Specific -+-+ | Type=Spcf | | | Type=Spcf | | +-----------+ | +-----------+ | | | | +-------------+ | +---------------+ +->|CountActAF21F| +->|DscpMarkActAF22| +-------------+ +---------------+ +------------+ |ClfrElement | +-----------------------------------------> Q_BE | Id=WildCard| | | ClfrId=1 | | | Order=NA | | | Next ------+--+ +--------------+ | Specific --+------>|FilterMatchAll| +------------+ +--------------+ Figure 3: Example from Model Section 8.1 part 2 Baker, Chan, Smith Expires SeptemberMay 2001[Page 17] Internet Draft Differentiated Serviceslength, although it is possible for Qclip to equal Qmax. In the MIBMarch 2001 +-------------+ Q_EF--->|Q | | Id=EF +--+--------------------------+ | Next ----+ | +-----------+ | | SchdParam --+-->|SchdParamEF| | +-------------+ +-----------+ | | +-------------+ | +----------------+ Q_AF1-->|Q | +->|Scheduler | | Id=AF1 +--+--------------------------+ | Id=Diffserv | | Next ----+ | +------------+ | | Next=0.0 | | SchdParam --+-->|SchdParamAF1| | | Method=Priority| +-------------+ +------------+ | | SchdParam=0.0 | | +----------------+ +-------------+ | Q_AF2-->|Q | | | Id=AF2 +--+--------------------------+ | Next ----+ | +------------+ | | SchdParam --+-->|SchdParamAF2| | +-------------+ +------------+ | | +-------------+ | Q_BE--->|Q | | | Id=BE +--+--------------------------+ | Next ----+ | +-----------+ | SchdParam --+-->|SchdParamBE| +-------------+ +-----------+ Figure 4: Example from Model Section 8.1 part 3 4.2. Additional Data Path Example 4.2.1. Data Pathmodule, DiffServRandomDropMinThreshBytes andClassifier Example Discussion The example in Figure 5 shows a single diffServDataPathTable entry feeding into a single Classifier entry, with three Classifier ElementDiffServRandomDropMinThreshPkts represent Qmin. DiffServRandomDropMaxThreshBytes andFilter Table entry pairs belongingDiffServRandomDropMaxThreshPkts represent Qmax. DiffServAlgDropQThreshold represents Qclip. DiffServRandomDropInvProbMax represents Pmax (inverse). This MIB does not represent Pmin (assumed to be zero unless otherwise represented). In addition, since message memory is finite, queues generally have some upper bound above which they are incapable of storing additional traffic. Normally thisClassifier 1. Notice the three Filters used here must completely classify all the traffic presentednumber is equal to Qclip, specified by diffServAlgDropQThreshold. Each random dropper specification is associated with a queue. This allows multiple drop processes (of same or different types) tothis data path. Another level of classification canbedefined that followsassociated with theAction functional DataPath elements in Figure 5.same queue, as different PHB implementations may require. Thismulti-level classification allowalso allows for sequences of multiple droppers if necessary. The calculation of a smoothed queue length may also have an important bearing on theconstructionbehavior oftraffic separationsthe dropper: parameters may include the sampling interval or rate, andspecific actions atthe weight of eachlevel, like: if (dept1) then take dept1-action { if (appl1) then take dept1-appl1-action. Baker, Chan, Smith Expires September 2001 [Page 18] Internet Draft Differentiated Services MIB March 2001 +---------------------+ |DataPath | | ifIndex=1 | | IfDirection=Ingress | +------+ | Start --------------+--->|Clfr | +---------------------+ | Id=1 | +------+ +------------+ +--------------+ +-----------+ |ClfrElement | +-->|Meter | +-->|Action | | Id=101 | | | Id=101 | | | Id=101 | | ClfrId=1 | | | SucceedNext -+--+ | Next -----+---->... | Order=NA | | | FailNext ----+->... | Specific -+-+ | Next ------+--+ | Specific -+ | | Type=Spcf | | | Specific --+-+ +-----------+--+ +-----------+ | +------------+ | | +-------+ | +-------+ | +--------+ | +---------+ +-->|Filter1| +-->|TBMeter1| +-->|CountAct1| +-------+ +--------+ +---------+ +------------+ +--------------+ +-----------+ |ClfrElement | +-->|Meter | +-->|Action | | Id=102 | | | Id=102 | | | Id=102 | | ClfrId=1 | | | SucceedNext -+--+ | Next -----+---->... | Order=NA | | | FailNext ----+->... | Specific -+-+ | Next ------+--+ | Specific -+ | | Type=Spcf | | | Specific --+-+ +-----------+--+ +-----------+ | +------------+ | | +-------+ | +-------+ | +--------+ | +---------+ +-->|Filter2| +-->|TBMeter2| +-->|CountAct2| +-------+ +--------+ +---------+ +------------+ +--------------+ +-----------+ |ClfrElement | +-->|Meter | +-->|Action | | Id=103 | | | Id=103 | | | Id=103 | | ClfrId=1 | | | SucceedNext -+--+ | Next -----+---->... | Order=NA | | | FailNext ----+->... | Specific -+-+ | Next ------+--+ | Specific -+ | | Type=Spcf | | | Specific --+-+ +-----------+--+ +-----------+ | +------------+ | | +-------+ | +-------+ | +--------+ | +---------+ +-->|Filter3| +-->|TBMeter3| +-->|CountAct3| +-------+ +--------+ +---------+ Figure 5:sample. The performance may be very sensitive to the values of these parameters and a wide range of possible values may be required due to a wide range of link speeds. Most algorithms include a sample weight, represented here by DiffServRandomDropInvWeight. The availability of DiffServRandomDropSamplingRate as readable is important, the information provided by Sampling Rate is essential to the configuration of DiffServRandomDropInvWeight. Having Sampling Rate be configurable is also helpful, as line speed increases, the ability to have queue sampling be less frequent than packet arrival is needed. Note, however, that there is ongoing research on this topic, see e.g. [ACTQMGMT] and [AQMROUTER]. AdditionalData Path Example Part 1 Baker, Chan, Smith Expires September 2001 [Page 19] Internet Draft Differentiated Servicesparameters may be added in an enterprise MIBMarch 2001 +-------------+ +-----------------+ ---->|Q | +->|Scheduler | | Id=EF | | | Id=Diffserv | | Next -------+-----------------------+ | Next=0.0 | | SchdParam -+| | | Method=Priority | +------------++ | | SchdParam=0.0 | | | +-----------------+ +------------+ | |module, e.g. by using AUGMENTS on this table, to handle aspects of random drop algorithms that are not standardized here. When the MIB is used for configuration, diffServRandomDropNextFree always contains a legal value for diffServRandomDropId that is not currently used in the system's configuration. The Network Management Application reads the variable and uses the value read in a create- and-go or a create-and-wait SET. When the SET is performed, the agent must determine whether the value is indeed still unused; two network managers may attempt to create a configuration entry simultaneously and use the same value. If it is currently unused, the SET succeeds and the agent changes the value of diffServRandomDropNextFree according to an Baker, Chan, Smith Expires December 2001 [Page 15] Internet Draft Differentiated Services MIB May 2001 agent-specific algorithm. If the value is in use, however, the SET fails. The network manager must re-read diffServRandomDropNextFree to obtain a useful value. 3.5. Queuing and Scheduling of Packets These include Queues and Schedulers, which are inter-related in their use of queuing techniques. By doing so, it is possible to build multi- level schedulers, such as those which treat a set of queues as having priority among them, and at a specific priority find a secondary WFQ scheduler with some number of queues. 3.5.1. diffServQTable - The Class or Queue Table The Queue Table models simple FIFO queues. The Scheduler Table allows flexibility in constructing both simple and somewhat more complex queuing hierarchies from those queues. Queue Table entries are pointed at by the "next" attributes of the upstream elements, such as DiffServMeterSucceedNext or diffServActionNext. Note that multiple upstream elements may direct their traffic to the same Queue Table entry. For example, the Assured Forwarding PHB suggests that all traffic marked AF11, AF12 or AF13 be placed in the same queue, after metering, without reordering. To accomplish that, the upstream diffServAlgDropNext pointers each point to the same diffServQEntry. A common requirement of a queue is that its traffic enjoy a certain minimum or maximum rate, or that it be given a certain priority. Functionally, the selection of such is a function of a scheduler, as in Section .sh 4 "The parameter is associated with the queue, however, using the Assured or Shaping Rate Parameters Table. When the MIB is used for configuration, diffServQNextFree always contains a legal value for diffServQId that is not currently used in the system's configuration. The Network Management Application reads the variable and uses the value read in a create-and-go or a create- and- wait SET. When the SET is performed, the agent must determine whether the value is indeed still unused; two network managers may attempt to create a configuration entry simultaneously and use the same value. If it is currently unused, the SET succeeds and the agent changes the value of diffServQNextFree according to an agent- specific algorithm. If the value is in use, however, the SET fails. The network manager must re- read diffServQNextFree to obtain a useful value. Baker, Chan, Smith Expires December 2001 [Page 16] Internet Draft Differentiated Services MIB May 2001 3.5.2. diffServSchedulerTable - The Scheduler Table The scheduler, and therefore the Scheduler Table, accepts inputs from either queues or a preceding scheduler. The Scheduler Table allows flexibility in constructing both simple and somewhat more complex queuing hierarchies from those queues. When the MIB is used for configuration, diffServSchedulerNextFree always contains a legal value for diffServSchedulerId that is not currently used in the system's configuration. The Network Management Application reads the variable and uses the value read in a create- and-go or a create-and-wait SET. When the SET is performed, the agent must determine whether the value is indeed still unused; two network managers may attempt to create a configuration entry simultaneously and use the same value. If it is currently unused, the SET succeeds and the agent changes the value of diffServSchedulerNextFree according to an agent- specific algorithm. If the value is in use, however, the SET fails. The network manager must re-read diffServSchedulerNextFree to obtain a useful value. 3.5.3. diffServAssuredRateTable - The Assured Rate Table When the output rate of a queue or scheduler must be given a minimum rate or a priority, this is done using the diffServAssuredRateTable. Rates may be expressed as absolute rates, or as a fraction of ifSpeed, and imply the use of a rate-based scheduler such as WFQ or WRR. The use of a priority implies the use of a Priority Scheduler. Only one of the Absolute or Relative rate need be set; the other takes the relevant value as a result. Excess capacity is distributed proportionally among the inputs to a scheduler. The effect of combining priority and rate is to make the rates be in fact fractions of ifSpeed less the actual amount of traffic passing, although the fraction is calculated against the ifSpeed value. When the MIB is used for configuration, diffServAssuredRateNextFree always contains a legal value for diffServAssuredRateId that is not currently used in the system's configuration. The Network Management Application reads the variable and uses the value read in a create- and-go or a create-and-wait SET. When the SET is performed, the agent must determine whether the value is indeed still unused; two network managers may attempt to create a configuration entry simultaneously and use the same value. If it is currently unused, the SET succeeds and the agent changes the value of diffServAssuredRateNextFree according to an agent-specific algorithm. If the value is in use, however, the SET fails. The network manager must re-read diffServAssuredRateNextFree to Baker, Chan, Smith Expires December 2001 [Page 17] Internet Draft Differentiated Services MIB May 2001 obtain a useful value. 3.5.4. diffServShapingRateTable - The Shaping Rate Table When the output rate of a queue or scheduler must be limited to at most a specified maximum rate, this is done using the diffServShapingRateTable. Rates may be expressed as absolute rates, or as a fraction of ifSpeed. Only one of the Absolute or Relative rate need be set; the other takes the relevant value as a result. The definition of a multirate shaper requires multiple diffServShapingRateEntries. In this case, an algorithm such as SHAPING is used. In that algorithm, more than one rate is specified, and at any given time traffic is shaped to the lowest specified rate which exceeds the arrival rate of traffic. When the MIB is used for configuration, diffServShapingRateNextFree always contains a legal value for diffServShapingRateId that is not currently used in the system's configuration. The Network Management Application reads the variable and uses the value read in a create- and-go or a create-and-wait SET. When the SET is performed, the agent must determine whether the value is indeed still unused; two network managers may attempt to create a configuration entry simultaneously and use the same value. If it is currently unused, the SET succeeds and the agent changes the value of diffServShapingRateNextFree according to an agent-specific algorithm. If the value is in use, however, the SET fails. The network manager must re-read diffServShapingRateNextFree to obtain a useful value. 3.5.5. Using queues and schedulers together For representing a Strict Priority scheduler, each scheduler input is assigned a priority with respect to all the other inputs feeding the same scheduler, with default values for the other parameters. Higher- priority traffic that is not being delayed for shaping will be serviced before a lower-priority input. An example is found in Figure 2. For Weighted Queuing methods, such as WFQ or WRR, the "weight" of a given scheduler input is represented with a Minimum Service Rate leaky- bucket profile which provides guaranteed minimum bandwidth to that input, if required. This is represented by a rate DiffServAssuredRateAbs; the classical weight is the ratio between that rate and the interface speed, or perhaps the ratio between that rate and the sum of the configured rates for classes. The rate may be represented by a relative value, as a fraction of the interface's Baker, Chan, Smith Expires December 2001 [Page 18] Internet Draft Differentiated Services MIB May 2001 +-----+ +-------+ | P S | | Queue +------------>+ r c | +-------+-+--------+ | i h | |Priority| | o e | +--------+ | r d +-----------> +-------+ | i u | | Queue +------------>+ t l | +-------+-+--------+ | y e | |Priority| | r | +--------+ +-----+ current line rate. DiffServAssuredRateRel to assist in cases where line rates are variable or where a higher-level policy might be expressed in terms of fractions of network resources. The two rate parameters are inter-related and changes in one may be reflected in the other. An example is found in figure 4. For weighted scheduling methods, one can say loosely, that WRR focuses on meeting bandwidth sharing, without concern for relative delay amongst the queues; where WFQ control both queue service order and amount of traffic serviced, providing meeting bandwidth sharing and relative delay ordering amongst the queues. A queue or scheduled set of queues (which is an input to a scheduler) may also be capable of acting as a non-work-conserving [MODEL] traffic shaper: this is done by defining a Maximum Service Rate leaky-bucket +-----+ +-------+ | W S | | Queue +------------>+ R c | +-------+-+--------+ | R h | | Rate | | e | +--------+ | o d +-----------> +-------+ | r u | | Queue +------------>+ l | +-------+-+--------+ | W e | | Rate | | F r | +--------+ | Q | +-----+ Baker, Chan, Smith Expires December 2001 [Page 19] Internet Draft Differentiated Services MIB May 2001 profile in order to limit the scheduler bandwidth available to that input. This is represented by a rate, in DiffServShapingRateAbs; the classical weight is the ratio between that rate and the interface speed, or perhaps the ratio between that rate and the sum of the configured rates for classes. The rate may be represented by a relative value, as a fraction of the interface's current line rate, DiffServShapingRateRel. There was discussion in the working group about alternative modeling approaches, such as defining a shaping action or a shaping element. This MIB does not take this approach because shaping is in fact something a scheduler does to its inputs, (which we model as a queue with a maximum rate or a scheduler whose output has a maximum rate) and the authors felt it was simpler and more elegant to simply describe it in that context. The same may be done on a queue, if a given class is to be shaped to a maximum rate without shaping other classes, as in Figure 5. Other types of priority and weighted scheduling methods can be defined using existing parameters in DiffServAssuredRateEntry. NOTE: DiffServSchedulerMethod uses OBJECT IDENTIFIER syntax, with the different types of scheduling methods defined as OBJECT-IDENTITY. Future scheduling methods may be defined in other MIBs. This requires an OBJECT-IDENTITY definition, a description of how the existing objects are reused, if they are, and any new objects they require. Queue Table entries are pointed at by the "next" attributes of the upstream elements, such as DiffServMeterSucceedNext or diffServActionNext. Note that multiple upstream elements may direct their traffic to the same Queue Table entry. For example, the Assured Forwarding PHB suggests that all traffic marked AF11, AF12 or AF13 be +---+ +-------+ | S | | Queue +------------>+ c | +-------+-+--------+ | h | | | | e +-----------> +--------+ | d +-+-------+ | u | |Maximum| +-------+ | l | | Rate | | Queue +------------>+ e | +-------+ +-------+-+--------+ | r | | | |---+ +--------+ Baker, Chan, Smith Expires December 2001 [Page 20] Internet Draft Differentiated Services MIB May 2001 +---+ +-------+ | S | | Queue +------------>+ c | +-------+-+--------+ | h | |Min Rate| | e +-----------> +--------+ | d | | u | +-------+ | l | | Queue +------------>+ e | +-------+-+--------+ | r | |Min Rate| |+-----------+|+->|SchdParamEF|+--------+ | | |Max Rate| | |+-----------+ +---------------------++--------+ +---+ placed in the same queue, after metering, without reordering. To accomplish that, the upstream diffServAlgDropNext pointers each point to the same diffServQEntry. A common requirement of a queue is that its traffic enjoy a certain minimum or maximum rate, or that it be given a certain priority. Functionally, the selection of such is a function of a scheduler, as in Section .sh 4 "The parameter is associated with the queue, however, using the Assured or Shaping Rate Parameters Table. To implement an EF and two AF classes, one must use a combination of priority and WRR/WFQ scheduling. This requires us to cascade two schedulers. If we were to additionally shape the output of the system to a rate lower than the interface rate, we must place an upper bound rate on the output of the priority scheduler. See figure 4. 3.6. Example configuration for AF and EF For the sake of argument, let us build an example with one EF class and four AF classes using the constructs in this MIB. 3.6.1. AF and EF Ingress Interface Configuration The ingress edge interface identifies traffic into classes, meters it, and ensures that any excess is appropriately dealth with according to the PHB. For AF, this means marking excess; for EF, it means dropping excess or shaping it to a maximum rate. Baker, Chan, Smith Expires December 2001 [Page 21] Internet Draft Differentiated Services MIB May 2001 +-----+ +-------+ |+----------------+ +-------------+P S |--->|AlgDrop|+->|QQueue +---------------------------------->+ r c | +-------+----------------------+--------+ | i h |Id=AF11|Priority| | o e +-----------> +--------+ | r d +-+-------+ +------+ |Id=AF1i u |+-------------+|Maximum| +-------+ | W S +------------->+ t l |Type=randomDrop|| Rate |Next -------+--->|Scheduler| Queue +------------>+ R c +-+--------+ | y e |Next ----------+-+--++-------+ +-------+-+--------+ |SchdParam -+|R h |Id=AF|Priority| | r | |Min Rate| |QMeasure ------+-+e |+------------+++--------+ +-----+ +--------+ |Next -------+--+o d |QThreshold+-------+ | r u | | Queue +------------>+ l |Method=WFQ+-------+-+--------+ | W e |Specific -+|Min Rate| | F r |+------------++--------+ |SchdParam --+--+ +-----------+----+Q | +------+ Baker, Chan, Smith Expires December 2001 [Page 22] Internet Draft Differentiated Services MIB May 2001 +-----------------------+ |+-------------+diffServDataPathStart | +-----------+-----------+ | +----------+ | +--+--+ +-----+ +-----+ +-----+ +-----+ | AF1 +-----+ AF2 +-----+ AF3 +-----+ AF4 +-----+ EF |+------------++--+--+ +--+--+ +--+--+ +--+--+ +--+--+ |+-----------+|+->|SchdParamAF1| +----------------+|+--------------+|+------------+|+->|RandomDropAF11|+--+--+ +--+--+ +--+--+ +--+--+ +--+--+ |TRTCM| |TRTCM| |TRTCM| |TRTCM| |srTCM| |Meter| |Meter| |Meter| |Meter| |Meter| |-+++-| |-+++-| |-+++-| |-+++-| +-+-+-+ ||| ||| ||| ||| | | +-+||---+ +-+||---+ +-+||---+ +-+||---+ +-+-|---+ |+-+|----+ |+-+|----+ |+-+|----+ |+-+|----+ |+--+----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||Actions| +||Actions| +||Actions| +||Actions| +||Actions| +|Below | +|Below | +|Below | +|Below | +|Below | +-+-----+ +-+-----+ +-+-----+ +-+-----+ +-+-----+ | ||| ||| ||| ||| | VVV VVV VVV VVV V Accepted traffic is sent to IP forwarding 3.6.1.1. Classification In The Example A packet arriving at an ingress interface picks up its "program" from the diffServDataPathTable. This points to a classifier, which will select traffic according to some specification for each traffic class. An example of a classifier for an AFm class would be a succession of three classifier elements, each pointing to a Six-tuple classification parameter block identifying one of the AFmn DSCPs. Alternatively, the six-tuples might contain selectors for HTTP traffic or some other application. An example of a classifier for EF traffic might be either a classifier element pointing to a six-tuple parameter specifying the EF code point, or a collection of classifiers with parameter blocks specifying individual telephone calls, or a variety of other approaches. Each classifier hands its traffic off to appropriate functional data path elements. Baker, Chan, Smith Expires December 2001 [Page 23] Internet Draft Differentiated Services MIB May 2001 3.6.1.2. AF Implementation On an Ingress Edge Interface Each Afm class applies a Two Rate Three Color Meter, dividing traffic into three groups. These groups of traffic conform to both specified rates, only the higher one, or none. The intent, on the ingress interface at the edge of the network, is to measure and appropriately mark traffic. 3.6.1.2.1. AF Metering On an Ingress Edge Interface Each Afm class applies a Two Rate Three Color Meter, dividing traffic into three groups. If two rates R and S, with R < S, are specified and traffic arrives at rate T, traffic comprising up to R bits per second is considered to conform to the "confirmed" rate, R. If R < T, traffic comprising up to S-R bits per second is considered to conform to the "excess" rate, S. Any further excess is non- conformant. To configure this, we apply two Meter Entries, one for the conforming rate and one for the excess rate. The rate parameters are stored in associated Token Bucket Parameter Entries. The "FailNext" pointer of the lower rate Meter Entry points to the other Meter Entry; both "SucceedNext" pointers and the "FailNext" pointer of the higher Meter Entry point to lists of actions. In the color-blind mode, all three classifier "next" entries point to the lower rate meter entry. In the color-aware mode, the AFm1 classifier points to the lower rate entry, the AFm2 classifier points to the higher rate entry (as it is only compared against that rate), and the AFm3 classifier points directly to the actions taken when both rates fail. 3.6.1.2.2. AF Actions On an Ingress Edge Interface For network planning and perhaps for billing purposes, arriving traffic is normally counted. Therefore, a "count" action, consisting of an action table entry pointing to a count table entry, is configured. Also, traffic is marked with the appropriate DSCP. The first R bits per second are marked AFm1, the next S-R bits per second are marked AFm2, and the rest is marked AFm3. It may be that traffic is arriving marked with the same DSCP, but in general, the additional complexity of deciding that it is being remarked to the same value is not useful. Therefore, a "mark" action, consisting of an action table entry pointing to a mark table entry, is configured. At this point, the usual case is that traffic is now forwarded in the usual manner. To indicate this, we set the "SucceedNext" pointer of the Baker, Chan, Smith Expires December 2001 [Page 24] Internet Draft Differentiated Services MIB May 2001 Mark Action is left at zeroDotZero. 3.6.1.3. EF Implementation On an Ingress Edge Interface The EF class applies a Single Rate Two Color Meter, dividing traffic into "conforming" and "excess" groups. The intent, on the ingress interface at the edge of the network, is to measure and appropriately mark conforming traffic and drop the excess. 3.6.1.3.1. EF Metering On an Ingress Edge Interface A single rate two color (SRTCM) meter requires one token bucket. It is therefore configured using a single meter entry with a corresponding Token Bucket Parameter Entry. Arriving traffic either "succeeds" or "fails". 3.6.1.3.2. EF Actions On an Ingress Edge Interface For network planning and perhaps for billing purposes, arriving traffic that conforms to the meter is normally counted. Therefore, a "count" action, consisting of an action table entry pointing to a count table entry, is configured. Also, traffic is (re)marked with the EF DSCP. Therefore, a "mark" action, consisting of an action table entry pointing to a mark table entry, is configured. At this point, the successful traffic is now forwarded in the usual manner. To indicate this, we set the "SucceedNext" pointer of the Mark Action is left at zeroDotZero. Traffic that exceeded the arrival policy, however, is to be dropped. We can use a count action on this traffic if the several counters are interesting. However, since the drop counter in the Algorithmic Drop Entry will count packets dropped, this is not clearly necessary. We configure an Alorithmic Drop Entry of the type "alwaysDrop," with no successor. 3.7. AF and EF Egress Edge Interface Configuration 3.7.1. Classification On an Egress Edge Interface A packet arriving at an egress interface may have been classified on an ingress interface, and the egress interface may have access to that Baker, Chan, Smith Expires December 2001 [Page 25] Internet Draft Differentiated Services MIB May 2001 +-----------------------+ | diffServDataPathStart |+-----------+ +--------------++-----------+-----------+ |+->|SchdParamAF|+----------+ |+-----------+ +----------------++--+--+ +-----+ +-----+ +-----+ +-----+ | AF1 +-----+ AF2 +-----+ AF3 +-----+ AF4 +-----+ EF |--->|AlgDrop|-+++-| |-+++-| |-+++-| |-+++-| +-+-+-+ ||| ||| ||| ||| | | |-+++-| |-+++-| |-+++-| |-+++-| +-+-+-+ |TRTCM| |TRTCM| |TRTCM| |TRTCM| |srTCM| |Meter| |Meter| |Meter| |Meter| |Meter| |-+++-| |-+++-| |-+++-| |-+++-| +-+-+-+ ||| ||| ||| ||| | | +-+||---+ +-+||---+ +-+||---+ +-+||---+ +-+-|---+ |+-+|----+ |+-+|----+ |+-+|----+ |+-+|----+ |+--+----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||Actions| +||Actions| +||Actions| +||Actions| +||Actions| +|Below | +|Below | +|Below | +|Below | +|Below | +-+-----+ +-+-----+ +-+-----+ +-+-----+ +-+-----+ | ||| ||| ||| ||| | +-+++--+ +-+++--+ +-+++--+ +-+++--+ +--+---+ | Queue| | Queue| | Queue| | Queue| | Queue| +--+---+ +--+---+ +--+---+ +--+---+ +--+---+ | | |Id=AF12| | +--+-----------+-----------+-----------+---+ |Type=randomDrop|| WFQ/WRR Scheduler |Next ----------+-+--+|QMeasure ------+-++--------------------------------------+---+ |QThreshold| |Specific -++-----+-----------+----+ |+-----------+----+Priority Scheduler |+-----------++----------+-----------+ |+--------------+ +->|RandomDropAF12| +--------------+ Figure 6: Additional Data Path Example Part 2 if (appl2) then take dept1-appl2-action. if (appl3) then take dept1-appl3-action.V information. If it is relevant, there is no reason not to use that information. If it is not available, however, there may be a need to (re)classify on the egress interface. In any event, it picks up its "program" from the diffServDataPathTable. This points to a classifier, which will select traffic according to some specification for each traffic class. An example of a classifier for an AFm class would be a succession of Baker, Chan, Smith Expires December 2001 [Page 26] Internet Draft Differentiated Services MIB May 2001 three classifier elements, each pointing to a Six-tuple classification parameter block identifying one of the AFmn DSCPs. Alternatively, the six-tuples might contain selectors for HTTP traffic or some other application. An example of a classifier for EF traffic might be either a classifier element pointing to a six-tuple parameter specifying the EF code point, or a collection of classifiers with parameter blocks specifying individual telephone calls, or a variety of other approaches. Each classifier hands its traffic off to appropriate functional data path elements. 3.7.2. AF Implementation On an Egress Edge Interface Each Afm class applies a Two Rate Three Color Meter, dividing traffic into three groups. These groups of traffic conform to both specified rates, only the higher one, or none. The intent, on the ingress interface at the edge of the network, is to measure and appropriately mark traffic. 3.7.2.1. AF Metering On an Egress Edge Interface Each Afm class applies a Two Rate Three Color Meter, dividing traffic into three groups. If two rates R and S, with R < S, are specified and traffic arrives at rate T, traffic comprising up to R bits per second is considered to conform to the "confirmed" rate, R. If R < T, traffic comprising up to S-R bits per second is considered to conform to the "excess" rate, S. Any further excess is non- conformant. To configure this, we apply two Meter Entries, one for the conforming rate and one for the excess rate. The rate parameters are stored in associated Token Bucket Parameter Entries. The "FailNext" pointer of the lower rate Meter Entry points to the other Meter Entry; both "SucceedNext" pointers and the "FailNext" pointer of the higher Meter Entry point to lists of actions. In the color-blind mode, all three classifier "next" entries point to the lower rate meter entry. In the color-aware mode, the AFm1 classifier points to the lower rate entry, the AFm2 classifier points to the higher rate entry (as it is only compared against that rate), and the AFm3 classifier points directly to the actions taken when both rates fail. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page20]27] Internet Draft Differentiated Services MIBMarchMay 2001} if (dept2) then take dept2-action { if (appl1) then take dept2-appl1-action. if (appl2) then take dept2-appl2-action. if (appl3) then take dept2-appl3-action. } if (dept3) then take dept3-action { if (appl1) then take dept3-appl1-action. if (appl2) then take dept3-appl2-action. if (appl3) then take dept3-appl3-action. } Minimally, the filters for appl1, appl2, appl3 may be reused for the above setup. 4.2.2. Meter3.7.2.2. AF Actions On an Egress Edge Interface For network planning andAction Example Discussion A simple Meter that can be parameterized byperhaps for billing purposes, departing traffic is normally counted. Therefore, asingle TBMeter"count" action, consisting of an action table entryis shown here. For Metering types that require multiple TBMeter entries for parameterization,pointing to a count table entry, is configured. Also, traffic may be marked with an appropriate DSCP. The first R bits per secondlevel Meterare marked AFm1, the next S-R bits per second are marked AFm2, andTBMeter table entriesthe rest is marked AFm3. It may beused. For example, for [TRTCM],that traffic is arriving marked with thefirst level TBMeter entry used for Peak Information Token Bucket,same DSCP, but in general, thefirst level SucceedNext pointsadditional complexity of deciding that it is being remarked to thesecond level Metersame value is not useful. Therefore, a "mark" action, consisting of an action table entry pointing to a mark table entry, is configured. At this point, the usual case is that traffic is now queued for transmission. The queue uses Active Queue Management, using an algorithm such as RED. Therefore, an Algorithmic Dropper is configured for each AFmn traffic stream, withsecond level TBMeter entry useda slightly lower min- threshold (and possibly lower max-threshold) forCommitted Information Token Bucket. NoticetheCountAct Action is shown in Figure 5. Thisexcess traffic than for the committed traffic. 3.7.2.3. AF Rate-based Queuing On an Egress Edge Interface The queue expected by AF ispurposely done to indicate that every DataPath shouldnormally a work-conserving queue. It usually has a specified minimum rate, and may haveat least one CountAct Action. Other actions can be pointed to bya maximum rate below theNext pointerbandwidth of theCountAct action, like DscpMarkAct action. 4.2.3. Queue and Scheduler Example Discussion Exampleinterface. In concept, it will use as much bandwidth as is available to it, but assure the lower bound. Common ways to implement this include various forms of Weighted Fair Queuing (WFQ) or Weighted Round Robin (WRR). Integrated over a longer interval, these give each class a predictable throughput rate. They differ inFigure 6 shows three classified inputthat over short intervals they will order traffic differently. In general, traffic classes that keep traffic in queue will tend to absorb latency from queues with lower mean occupancy, in exchange for which they make use of any available capacity. 3.7.3. EF Implementation On an Egress Edge Interface The EF class applies a Single Rate Two Color Meter, dividing trafficstreams, EF, AF11, and AF12, feedingintotheir respective queue"conforming" andalgorithmic droppers. After their respective dropping process,"excess" groups. The intent, on theAF traffic streams feed intoegress interface at thesame queue, QAF1X. A Scheduler, AF, is shown in Figure 6, asedge of thesink for AF1X queue traffic, servicing AF1X queue with scheduling parameters indicated by SchdParamAF1X. This schedulernetwork, isusedtoservicemeasure and appropriately mark conforming trafficfrom AF1X, AF2X, AF3X queues using weighted fair queuing method. The AF2XandAF3X queues are not shown in Figure 6, they can be very much like AF1X queue setup.drop the excess. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page21]28] Internet Draft Differentiated Services MIBMarchMay 2001Another traffic stream, EF, is handled by the EF queue. Scheduler Diffserv services output of3.7.3.1. EFqueueMetering On an Egress Edge Interface A single rate two color (SRTCM) meter requires one token bucket. It is therefore configured usingSchdParamEF,a single meter entry with a corresponding Token Bucket Parameter Entry. Arriving traffic either "succeeds" or "fails". 3.7.3.2. EF Actions On an Egress Edge Interface For network planning andoutputperhaps for billing purposes, departing traffic that conforms to the meter is normally counted. Therefore, a "count" action, consisting ofAF scheduler using SchdParamAF,an action table entry pointing to a count table entry, is configured. Also, traffic is (re)marked withPriority Queue scheduling method. Notice allthediffservEF DSCP. Therefore, a "mark" action, consisting of an action table entry pointing to a mark table entry, is configured. At this point, the successful trafficmay go out onis now queued for transmission, using alinkpriority queue or perhaps a rate-based queue with significant over-provision. Since the amount of trafficshaping. The traffic shapingpresent is known, one might not drop from this queue at all. Traffic that exceeded the policy, however, is dropped. We canbe parameterize usinguse a count action on this traffic if theShaping Schedulerseveral counters are interesting. However, since the drop counter inFigure 6. For shaping,thediffServShapingRate attributes should be used. The Shaping SchedulerAlgorithmic Drop Entry will count packets dropped, this isindicated as the last diffserv functional elementnot clearly necessary. We configure an Alorithmic Drop Entry ofthis data path by using its Next pointerthe type "alwaysDrop," withvalue of zeroDotZero. 5.no successor. 3.7.3.3. EF Priority Queuing On an Egress Edge Interface The normal implementation is a priority queue, to minimize induced jitter. By this, we mean that a separate queue is used for each EF class, with a strict ordering. 4. Conventions used in this MIB5.1.4.1. The use of RowPointer to indicate data path linkage RowPointer is a textual convention used to identify a conceptual row in an SNMP Table by pointing to one of its objects. One of theways itways it this MIB uses it is to indicate succession, pointing to data path linkage table entries. Baker, Chan, Smith Expires December 2001 [Page 29] Internet Draft Differentiated Services MIB May 2001 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 representing that thing. In the DiffServMeterTable, for example, the DiffServMeterFailNext RowPointer might take you to another meter, while the DiffServMeterSucceedNext RowPointer would take you to an action. Since a RowPointer is not tied to any specific object except by the value it contains, it is possible and acceptable to use RowPointers to merge data paths. An obvious example of such a use is in the classifier: traffic matching the DSCPs AF11, AF12, and AF13 might be presented to the same meter in order to perform the processing described in the Assured Forwarding PHB. Another use would be to merge data paths from several interfaces; if they represent a single service contract, having them share a common set of counters and common policy may be a desireable configuration. Note well, however, that suchconfigurations may have related implementation issues - if Differentiated Services processing for the interfaces isusedimplemented inthis MIB ismultiple forwarding engines, the engines will need toindicate succession, pointingcommunicate if they are todata path linkage table entries. For succession, it answers the question "what happens next?". Rather than presumeimplement such a feature. An implementation thatthe next table must be as specified in the conceptual model [MODEL] and providing its index, the RowPointer takes youfails to provide this capability is not considered to have failed the intention of this MIBrow representing that thing. In the diffServMeterTable, for example, the diffServMeterFailNext RowPointer might take you to another meter, whileor of thediffServMeterSucceedNext RowPointer would take you to[MODEL]; anaction.implementation that does provide it is not considered superior from a standards perspective. NOTE -- the RowPointer construct is used tobuildconnect theTCBs described in [MODEL]: this MIBfunctional data paths. The [MODEL] describes these as TCBs, as an aid to understanding. This MIB, however, does not model TCBsdirectly - itdirectly. It operates at a lower level of abstraction using only individual elements, connected in succession by RowPointers. Therefore, the concept of TCBs enclosing individualfunctional DataPathFunctional Data Path elements is not directly applicable to this MIB, althoughsuch a concept may be employed bymanagement tools that use thisMIB.MIB may employ such a concept. It is possible that a path through a device following a set of RowPointers is indeterminate i.e. it ends in a dangling RowPointer. Guidance is provided in the MIB module's DESCRIPTION-clause for each of the linkage attribute. In general, for both zeroDotZero and dangling RowPointer, it is assumed the data path ends and the traffic should be given to the next logical part of the device, usually a forwarding process or a transmission engine, or the proverbial bit-bucket. Any variation from this usage is indicated by the attribute affected.Baker, Chan, Smith Expires September 2001 [Page 22] Internet Draft Differentiated Services MIB March 2001 5.2.4.2. The use of RowPointer to indicate parameters RowPointer is also used in this MIB to indicate parameterization, for pointing to parameterization table entries. Baker, Chan, Smith Expires December 2001 [Page 30] Internet Draft Differentiated Services MIB May 2001 For indirection (as in thediffServClfrElementTable),DiffServClfrElementTable), the idea is to allow other MIBs, including proprietary ones, to define new and arcane filters - MAC headers, IPv4 and IPv6 headers, BGP Communities and all sorts of other things - whilst still utilizing the structures of this MIB. This is a form of class inheritance (in "object oriented" language): it allows base object definitions ("classes") to be extended in proprietary or standard ways, in the future, by other documents. RowPointer also clearly indicates the identified conceptual row's content does not change, hence they can be simultaneously used, pointed to, by more than one data path linkage table entries. The identification of RowPointer allows higher level policy mechanisms to take advantage of this characteristic.5.3.4.3. Conceptual row creation and deletion A number of conceptual tables defined in this MIB use as an index an arbitrary integer value, unique across the scope of the agent. In order to help with multi-manager row-creation problems, a mechanism must be provided to allow a manager to obtain unique values for such an index and to ensure that, when used, the manager knows whether it got what it wanted or not. Typically, such a table has an associated NextFree variable e.g.diffServClfrNextFreeDiffServClfrNextFree which provides a suitable value for the index of the next row to be created e.g.diffServClfrId. A special value, 0,DiffServClfrElementClfrId. The value zero is used to indicate that the agent can configure no moreentries can be configured by the agent.entries. The table also has a columnar Status attribute with RowStatus syntax [6].IfGenerally, if a manager attempts to create aconceptual row in the table (by a SET operation that contains a varbind setting the Status to a value ofrow, using either createAndGo orcreateAndWait) and if the agent has sufficient resources and has no other conceptual row with the same indices,createAndWait, the agent will create the row and return success. If the agent has insufficient resources or such a rowisalreadyexistentexists, 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'srow-creationrow- creation attempt. The use of RowStatus is covered in more detail in [6].Baker, Chan, Smith Expires September 2001 [Page 23] Internet Draft Differentiated Services MIB March 2001 6.5. Extending this MIB With the structures of this MIB divided into data path linkage tables and parameterization tables, and with the use of RowPointer, new data path linkage and parameterization tables can be defined in other MIB modules, and used with tables defined in this MIB. This MIB does not Baker, Chan, Smith Expires December 2001 [Page 31] Internet Draft Differentiated Services MIB May 2001 limit on the type of entries its RowPointer attributes can point to, hence new functional data path elements can be defined in other MIBs and integrated with functional data path elements of this MIB. For example, new Action functional data path element can be defined for Traffic Engineering and be integrated withDiffservDifferentiated Services functional data path elements, possibly used within the same data path sharing the same classifiers and meters. It is more likely that new parameterization tables will be created in other MIBs as new methods or proprietary methods get deployed for existingdiffservDifferentiated Services functional data path elements. For example, different kinds of filters can be defined by using new filter parameterization tables. New scheduling methods can be deployed by defining new scheduling method OIDs and new scheduling parameter tables. Notice both new data path linkage tables and parameterization tables can be added without needing to change this MIB document or affect existing tables and their usage. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page24]32] Internet Draft Differentiated Services MIBMarchMay 20017.6. MIB Definition DIFFSERV-DSCP-TC DEFINITIONS ::= BEGIN IMPORTS Integer32, MODULE-IDENTITY, mib-2 FROM SNMPv2-SMI TEXTUAL-CONVENTION FROM SNMPv2-TC; diffServDSCPTC MODULE-IDENTITY LAST-UPDATED"200101080000Z""0101080000Z" ORGANIZATION "IETFDiffservDifferentiated Services WG" CONTACT-INFO " Fred Baker Cisco Systems 519 Lado Drive Santa Barbara, CA 93111, USA E-mail: fred@cisco.com Kwok Ho Chan Nortel Networks 600 Technology Park Drive Billerica, MA 01821, USA E-mail: khchan@nortelnetworks.com Andrew Smith Allegro Networks 6399 San Ignacio Ave San Jose, CA 95119, USA E-mail:andrew@allegronetworks.com"andrew@allegronetworks.com Differentiated Services Working Group: diffserv@ietf.org" DESCRIPTION "The Textual Conventions defined in this module should be used wheneverthe Diffserva Differentiated Services Code Point is used in a MIB." REVISION"200101080000Z""0106030000Z" DESCRIPTION "Initial version, published as RFC xxxx." ::= { mib-2 12344 } -- to be assigned by IANA Dscp ::= TEXTUAL-CONVENTION DISPLAY-HINT "d" STATUS current DESCRIPTION"The IP header Diffserv Code-Point that may be used for discriminating or marking a traffic stream." REFERENCEBaker, Chan, Smith ExpiresSeptemberDecember 2001 [Page25]33] Internet Draft Differentiated Services MIBMarchMay 2001 "A Differentiated Services Code-Point that may be used for marking a traffic stream." REFERENCE "RFC 2474, RFC 2780" SYNTAX Integer32 (0..63) DscpOrAny ::= TEXTUAL-CONVENTION DISPLAY-HINT "d" STATUS current DESCRIPTION "The IP headerDiffservDifferentiated Services Code-Point that may be used for discriminatingor marking aamong trafficstream.streams. The value -1 is used to indicate a wild card i.e. any value." REFERENCE "RFC 2474, RFC 2780" SYNTAX Integer32 (-1 | 0..63) END Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page26]34] Internet Draft Differentiated Services MIBMarchMay 2001 DIFFSERV-MIB DEFINITIONS ::= BEGIN IMPORTS Unsigned32, Counter32, Counter64, MODULE-IDENTITY, OBJECT-TYPE, OBJECT-IDENTITY, zeroDotZero, mib-2 FROM SNMPv2-SMI TEXTUAL-CONVENTION, RowStatus, RowPointer, TimeStamp FROM SNMPv2-TC MODULE-COMPLIANCE, OBJECT-GROUP FROM SNMPv2-CONF ifIndex FROM IF-MIB InetAddressType, InetAddress, InetAddressPrefixLength, InetPortNumber FROM INET-ADDRESS-MIB BurstSize FROM INTEGRATED-SERVICES-MIB Dscp, DscpOrAny FROM DIFFSERV-DSCP-TC; diffServMib MODULE-IDENTITY LAST-UPDATED"200102210000Z""0102210000Z" ORGANIZATION "IETFDiffservDifferentiated Services WG" CONTACT-INFO " Fred Baker Cisco Systems 519 Lado Drive Santa Barbara, CA 93111, USA E-mail: fred@cisco.com Kwok Ho Chan Nortel Networks 600 Technology Park Drive Billerica, MA 01821, USA E-mail: khchan@nortelnetworks.com Andrew Smith Allegro Networks 6399 San Ignacio Ave San Jose, CA 95119, USA E-mail:andrew@allegronetworks.com"andrew@allegronetworks.com Differentiated Services Working Group: diffserv@ietf.org" DESCRIPTION "This MIB defines the objects necessary to manage a device thatuses the Differentiated Services Architecture described in RFC 2475 and the Informal Management Model for Diffserv Routers in draft-ietf-diffserv-model-06.txt."Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page27]35] Internet Draft Differentiated Services MIBMarchMay 2001 uses the Differentiated Services Architecture described in RFC 2475. The Conceptual Model of a Differentiated Services Router provides supporting information on how such a router is modeled." REVISION"200103020000Z""0106030000Z" DESCRIPTION "Initial version, published as RFC xxxx." ::= { mib-2123451 }-- anybody who uses this unassigned -- number deserves the wrath of IANAdiffServMIBObjects OBJECT IDENTIFIER ::= { diffServMib 1 } diffServMIBConformance OBJECT IDENTIFIER ::= { diffServMib 2 } -- These textual conventions have no effect on either the syntax --noror the semantics of any managed object. Objects defined--using -- this convention are always encoded by means of the--rules that -- define their primitive type. IfDirection ::= TEXTUAL-CONVENTION STATUS current DESCRIPTION"Specifies"IfDirection specifies a direction of data travel on an interface. 'inbound' traffic is operated on during reception from the interface, while 'outbound' traffic is operated on prior to transmission on the interface." SYNTAX INTEGER { inbound(1), -- ingress interface outbound(2) -- egress interface } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page28]36] Internet Draft Differentiated Services MIBMarchMay 2001 -- -- Data Path -- diffServDataPath OBJECT IDENTIFIER ::= { diffServMIBObjects 1 } -- -- Data Path Table -- -- The Data Path Table enumerates the Differentiated Services -- Functional Data Paths within this device. Each entry in thistable-- table is indexed by ifIndex and ifDirection. Each entry provides -- the firstdiffserv functional data path elementDifferentiated Services Functional Data Path Element to -- process data-- flow for eachflowing along specific data path. This table should -- have at most--two entries for eachDiffServ capableinterface capable of Differentiated -- Services processing on thisdevice; --device: ingress and egress. -- Note that Differentiated Services Functional Data Path Elements --Notice all diffserv functional data path elementslinked together--using theirindividual next pointers and anchored by an entry -- of the diffServDataPathTable must belong to the same data path. -- The use of next pointer to point to diffserv functional data pathindividual next pointers and anchored --elementby an entry of the diffServDataPathTable constitute adifferentfunctional datapath is not allowed.-- path. -- diffServDataPathTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServDataPathEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "The data path tabledefinescontains RowPointers indicating thedata paths in this device. Each data path is defined bystart of theinterface and traffic direction. The first diffservfunctional data pathelement to handle trafficfor each interface and traffic direction in this device. These may merge, or be separated into parallel datapath is definedpaths bya RowPointer, diffServDataPathStart, in the entries of this table."meters or classifiers." ::= { diffServDataPath 1 } diffServDataPathEntry OBJECT-TYPE SYNTAX DiffServDataPathEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry in the data path tabledescribesindicates the start of a singlediffserv data pathDifferentiated Services Functional Data Path in this device." INDEX { ifIndex, diffServDataPathIfDirection } ::= { diffServDataPathTable 1 } DiffServDataPathEntry ::= SEQUENCE { diffServDataPathIfDirection IfDirection, diffServDataPathStart RowPointer, Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page29]37] Internet Draft Differentiated Services MIBMarchMay 2001diffServDataPathIfDirection IfDirection, diffServDataPathStart RowPointer,diffServDataPathStatus RowStatus } diffServDataPathIfDirection OBJECT-TYPE SYNTAX IfDirection MAX-ACCESS not-accessible STATUS current DESCRIPTION"Specifies"IfDirection specifies whether thedirection for which this datareception or transmission pathentry applies onfor thisinterface."interface is in view." ::= { diffServDataPathEntry 1 } diffServDataPathStart OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "This selects the firstdiffserv functional data pathDifferentiated Services Functional Data Path element to handle traffic for this data path. This RowPointer should point to an instance of one of:diffServClfrEntrydiffServClfrElementEntry diffServMeterEntry diffServActionEntry diffServAlgDropEntry diffServQEntry A value of zeroDotZero in this attribute indicates that nofurther DiffservDifferentiated Services treatment is performed on traffic of this data path.The use of zeroDotZero is the normal usage forA pointer with thelastvalue zeroDotZero normally terminates a functional datapath element of the current datapath. If the row pointed to does not exist, the treatment is as if this attribute contains a value of zeroDotZero." ::= { diffServDataPathEntry 2 } diffServDataPathStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a row/entry. Any writable variable may be modified whether the row is active or notInService." ::= { diffServDataPathEntry 3 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page30]38] Internet Draft Differentiated Services MIBMarchMay 2001 -- -- Classifiers -- diffServClassifier OBJECT IDENTIFIER ::= { diffServMIBObjects 2 } -- -- Classifier Table ------The Classifier Table allows multiple classifier elements, of sameor--or different--types, to be used together.--A classifier must completelyclassify--classify all packets presented toit, -- thisit. This means that all traffichandled by--presented to a classifier must match--at least one classifier elementwithin--within the classifier,--with the classifier element parametersspecified--specified by a filter. ---- If--If there is ambiguity between classifier elements of different-- classifier, the precedence is indicated by the--classifier, classifier linkage orderthe classifiers -- are linked, theindicates their precedence; --the first classifier in the link is applied to the--traffic first. -- --Entries in the classifier element table serves as the anchor for --each classification pattern, defined in filter table entries. --Each classifier element table entry also specifies the subsequent --downstream Differentiated Services Functional Data Path 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 composed of one or more classifier elements. diffServClfrNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServClfrId instance. If a configuring system attempts to create a new row in the diffServClfrTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServClassifier 1 } diffServClfrTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServClfrEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "This table enumerates all the diffserv classifier functional Baker, Chan, Smith Expires December 2001 [Page 39] Internet Draft Differentiated Services MIB May 2001 data path elements of this device. The actual classification definitions are defined in diffServClfrElementTable entries belonging to each classifier." REFERENCE "[MODEL] section 4.1" ::= { diffServClassifier 2 }Baker, Chan, Smith Expires September 2001 [Page 31] Internet Draft Differentiated Services MIB March 2001diffServClfrEntry OBJECT-TYPE SYNTAX DiffServClfrEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry in the classifier table describes a single classifier. All classifier elements belonging to the same classifier uses the classifier's diffServClfrId in their diffServClfrElementClfrId attribute." INDEX { diffServClfrId } ::= { diffServClfrTable 1 } DiffServClfrEntry ::= SEQUENCE { diffServClfrId Unsigned32, diffServClfrDataPathStart RowPointer, diffServClfrStatus RowStatus } diffServClfrId OBJECT-TYPE SYNTAX Unsigned32 MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the classifier entries. The set of such identifiers spans the whole agent. Managers should obtain new values for row creation in this table by reading diffServClfrNextFree." ::= { diffServClfrEntry 1 }diffServClfrStatusdiffServClfrDataPathStart OBJECT-TYPE SYNTAXRowStatusRowPointer MAX-ACCESS read-create STATUS current DESCRIPTION"The RowStatus variable controls"This selects theactivation, deactivation, or deletionfirst Differentiated Services Functional Data Path element to handle traffic for this classifier. This RowPointer should point to an instance of aclassifier. Any writable variable may be modified whether the rowdiffServClfrElementEntry. It isactive or notInService." ::= { diffServClfrEntry 2 } -- -- Classifier Element Table -- -- Entriesprimarily useful in indicating the first classifier elementtable serves as --in a classifier other than theanchorone pointed to by diffServClfrDataPathStart, although it may be used Baker, Chan, Smith Expires December 2001 [Page 40] Internet Draft Differentiated Services MIB May 2001 foreach classification pattern, defined --those classifiers as well. A value of zeroDotZero infilter table entries. Each classifier element -- table entry also specifiesthis attribute indicates that no Differentiated Services treatment is performed on traffic of this data path. A pointer with thesubsequent downstream -- diffservvalue zeroDotZero normally terminates a functional datapath element whenpath. If the row pointed to does not exist, the treatment is as if this attribute contains a value of zeroDotZero." ::= { diffServClfrEntry 2 } diffServClfrStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a classifier. Any writable variable may be modified whether the-- classification patternrow issatisfied.active or notInService." ::= { diffServClfrEntry 3 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page32]41] Internet Draft Differentiated Services MIBMarchMay 2001 --Each entry in the classifier element table describes -- one branch of the fan-out characteristic of a classifier -- indicated in [MODEL] section 4.1. A classifier is made up -- of one or more classifier elements.Classifier Element Table -- diffServClfrElementNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServClfrElementId instance. If a configuring system attempts to create a new row in the diffServClfrElementTable using this value,that opera- tion will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServClassifier 3 } diffServClfrElementTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServClfrElementEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "The classifier element table enumerates the relationship between classification patterns and subsequent downstreamdiffserv functional data pathDifferentiated Services Functional Data Path elements.Classification parameters are defined by entries of filter tables pointeddiffServClfrElementSpecific points toby diffServClfrElementSpecific. There can bea filter that specifies the classification parameters. A classifier may use filter tables of differenttypes, and they can be inter-mixed and used within a classifier. Antypes together. One example of a filter table defined in this MIB is diffServSixTupleClfrTable, for IP Multi-Field Classifiers (MFCs). Such an entry might identify anything from a single micro-flow (an identifiable sub-session packet stream directed from one sending transport to the receiving transport or transports), or aggregates of those such as the traffic from a host, traffic for an application, or traffic between two hosts using an application and a given DSCP. The standard Behavior Aggregate used in the Differentiated Services Architecture is encoded as a degenerate case of such an aggregate - the traffic using a particular DSCP value. Filter tables for other filter types may be defined elsewhere." REFERENCE "[MODEL] section 4.1" ::= { diffServClassifier 4 } diffServClfrElementEntry OBJECT-TYPE SYNTAX DiffServClfrElementEntry MAX-ACCESS not-accessible STATUS current Baker, Chan, Smith Expires December 2001 [Page 42] Internet Draft Differentiated Services MIB May 2001 DESCRIPTION "An entry in the classifier element table describes a single element of the classifier." INDEX { diffServClfrElementClfrId,diffServClfrElementId } ::= { diffServClfrElementTable 1 } Baker, Chan, Smith Expires September 2001 [Page 33] Internet Draft Differentiated Services MIB March 2001diffServClfrElementId } ::= { diffServClfrElementTable 1 } DiffServClfrElementEntry ::= SEQUENCE {diffServClfrElementId Unsigned32,diffServClfrElementClfrIdUnsigned32,INTEGER, diffServClfrElementId INTEGER, diffServClfrElementPrecedence Unsigned32, diffServClfrElementNext RowPointer, diffServClfrElementSpecific RowPointer, diffServClfrElementStatus RowStatus }diffServClfrElementIddiffServClfrElementClfrId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates theClassifier Elementclassifier entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by readingdiffServClfrElementNextFree."diffServClfrNextFree. A classifier Id identifies which classifier this classifier element is a part of." ::= { diffServClfrElementEntry 1 }diffServClfrElementClfrIddiffServClfrElementId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION"A classifier Id identifies which classifier this classifier element is a part of. This needs to be"An index that enumerates thevalueClassifier Element entries. The set ofdiffServClfrId attributesuch identifiers spans the whole agent. Managers obtain new values foran existingrow creation indiffServClfrTable."this table by reading diffServClfrElementNextFree." ::= { diffServClfrElementEntry 2 } diffServClfrElementPrecedence OBJECT-TYPE SYNTAX Unsigned32 MAX-ACCESS read-create STATUS current DESCRIPTION "The relative order in which classifier elements are applied: higher numbers represent classifier element with higher precedence. Classifier elements with the same order must be Baker, Chan, Smith Expires December 2001 [Page 43] Internet Draft Differentiated Services MIB May 2001 unambiguous i.e. they must define non-overlapping patterns, and are considered to be applied simultaneously to the traffic stream.Clas- sifierClassifier elements with different order may overlap in their filters: the classifier element with the highest order that matches is taken. On a given interface, there must be a completeclas- sifierclassifier in place at all times in the ingress direction. This meansBaker, Chan, Smith Expires September 2001 [Page 34] Internet Draft Differentiated Services MIB March 2001 that there will always beone or more filtersthatmust matcheveryany possiblepat- tern that could be presented in an incoming packet.pattern. There is no such requirement in the egress direction." DEFVAL { 0 } ::= { diffServClfrElementEntry 3 } diffServClfrElementNext OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "This attribute provides one branch of the fan-out functionality of a classifier described in [MODEL] section 4.1. This selects the nextdiffserv functional data pathDifferentiated Services Functional Data Path element to handle traffic for this data path. This RowPointer should point to an instance of one of:diffServClfrEntrydiffServClfrElementEntry diffServMeterEntry diffServActionEntry diffServAlgDropEntry diffServQEntry A value of zeroDotZero in this attribute indicates no furtherDiffservDifferentiated Services treatment is performed on traffic of this data path. The use of zeroDotZero is the normal usage for the last functional data path element of the current data path. If the row pointed to does not exist, the treatment is as if this attribute contains a value of zeroDotZero." ::= { diffServClfrElementEntry 4 } diffServClfrElementSpecific OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "A pointer to a valid entry in another table, filter table, that describes the applicable classification parameters, e.g. an entry Baker, Chan, Smith Expires December 2001 [Page 44] Internet Draft Differentiated Services MIB May 2001 in diffServSixTupleClfrTable. If the row pointed to does not exist, the classifier element is ignored. The value zeroDotZero is interpreted to match anything not matched by another classifier element - only one such entry may exist for each classifier."Baker, Chan, Smith Expires September 2001 [Page 35] Internet Draft Differentiated Services MIB March 2001DEFVAL { zeroDotZero } ::= { diffServClfrElementEntry 5 } diffServClfrElementStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a classifier element. Any writ- able variable may be modified whether the row is active or notInService." ::= { diffServClfrElementEntry 6 } -- -- IP Six-Tuple Classification Table ---- Classification--Classification based on6six different fields in the IP--header.This is intended to be IP-version-independent. -- Filters, entries in this table,--Functional Data Paths maybe shared, pointed to, --share definitions bymultiple diffServClfrElementEntry, of same or different -- data paths inusing the samesystem.entry. -- diffServSixTupleClfrNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServSixTupleClfrId instance. If a configuring system attempts to create a new row in the diffServSixTupleClfrTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServClassifier 5 } diffServSixTupleClfrTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServSixTupleClfrEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "A table of IP Six-Tuple Classifier filter entries that a system may use to identify IP traffic." REFERENCE"[MODEL] section 4.2.2" ::= { diffServClassifier 6 }Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page36]45] Internet Draft Differentiated Services MIBMarchMay 2001 "[MODEL] section 4.2.2" ::= { diffServClassifier 6 } diffServSixTupleClfrEntry OBJECT-TYPE SYNTAX DiffServSixTupleClfrEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An IP Six-Tuple Classifier entry describes a single filter." INDEX { diffServSixTupleClfrId } ::= { diffServSixTupleClfrTable 1 } DiffServSixTupleClfrEntry ::= SEQUENCE { diffServSixTupleClfrIdUnsigned32,INTEGER, diffServSixTupleClfrDstAddrType InetAddressType,diffServSixTupleClfrDstPrefixLength InetAddressPrefixLength,diffServSixTupleClfrDstAddr InetAddress, diffServSixTupleClfrDstPrefixLength InetAddressPrefixLength, diffServSixTupleClfrSrcAddrType InetAddressType,diffServSixTupleClfrSrcPrefixLength InetAddressPrefixLength,diffServSixTupleClfrSrcAddr InetAddress, diffServSixTupleClfrSrcPrefixLength InetAddressPrefixLength, diffServSixTupleClfrDscp DscpOrAny, diffServSixTupleClfrProtocol Unsigned32, diffServSixTupleClfrDstL4PortMin InetPortNumber, diffServSixTupleClfrDstL4PortMax InetPortNumber, diffServSixTupleClfrSrcL4PortMin InetPortNumber, diffServSixTupleClfrSrcL4PortMax InetPortNumber, diffServSixTupleClfrStatus RowStatus } diffServSixTupleClfrId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Six Tuple Classifier filter entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServSixTupleClfrNextFree." ::= { diffServSixTupleClfrEntry 1 } diffServSixTupleClfrDstAddrType OBJECT-TYPE SYNTAX InetAddressType MAX-ACCESS read-create STATUS current DESCRIPTION "The type of IP destination address used by this classifierentry." ::= { diffServSixTupleClfrEntry 2 } diffServSixTupleClfrDstPrefixLength OBJECT-TYPEBaker, Chan, Smith ExpiresSeptemberDecember 2001 [Page37]46] Internet Draft Differentiated Services MIBMarchMay 2001 entry." ::= { diffServSixTupleClfrEntry 2 } diffServSixTupleClfrDstAddr OBJECT-TYPE SYNTAX InetAddress MAX-ACCESS read-create STATUS current DESCRIPTION "The IP address to match against the packet's destination IP address. diffServSixTupleClfrDstPrefixLength indicates the number of bits that are relevant." ::= { diffServSixTupleClfrEntry 3 } diffServSixTupleClfrDstPrefixLength OBJECT-TYPE SYNTAX InetAddressPrefixLength UNITS "bits" MAX-ACCESS read-create STATUS current DESCRIPTION "The length of the CIDR Prefix carried in diffServSixTupleClfrDstAddr. In IPv4 addresses, a length of 0 indicates a match of any address; a length of 32 indicates a match of a single host address, and a length between 0 and 32 indicates the use of a CIDR Prefix. IPv6 is similar, except that prefix lengths range from 0..128." DEFVAL { 0 } ::= { diffServSixTupleClfrEntry34 } diffServSixTupleClfrSrcAddrType OBJECT-TYPE SYNTAX InetAddressType MAX-ACCESS read-create STATUS current DESCRIPTION "The type of IP source address used by this classifier entry." ::= { diffServSixTupleClfrEntry45 }diffServSixTupleClfrDstAddrdiffServSixTupleClfrSrcAddr OBJECT-TYPE SYNTAX InetAddress MAX-ACCESS read-create STATUS current DESCRIPTION "The IP address to match against the packet'sdestinationsource IP address.diffServSixTupleClfrDstPrefixLengthdiffServSixTupleClfrSrcPrefixLength indicates the number of bits that are relevant." ::= { diffServSixTupleClfrEntry56 } diffServSixTupleClfrSrcPrefixLength OBJECT-TYPE Baker, Chan, Smith Expires December 2001 [Page 47] Internet Draft Differentiated Services MIB May 2001 SYNTAX InetAddressPrefixLength UNITS "bits" MAX-ACCESS read-create STATUS current DESCRIPTION "The length of the CIDR Prefix carried in diffServSixTupleClfrSrcAddr. In IPv4 addresses, a length of 0 indicates a match of any address; a length of 32 indicates a match of a single host address, and a length between 0 and 32 indicates the use of a CIDR Prefix. IPv6 is similar, except that prefix lengths range from 0..128." DEFVAL { 0 } ::= { diffServSixTupleClfrEntry6 } Baker, Chan, Smith Expires September 2001 [Page 38] Internet Draft Differentiated Services MIB March 2001 diffServSixTupleClfrSrcAddr OBJECT-TYPE SYNTAX InetAddress MAX-ACCESS read-create STATUS current DESCRIPTION "The IP address to match against the packet's source IP address. diffServSixTupleClfrSrcPrefixLength indicates the number of bits that are relevant." ::= { diffServSixTupleClfrEntry7 } diffServSixTupleClfrDscp OBJECT-TYPE SYNTAX DscpOrAny MAX-ACCESS read-create STATUS current DESCRIPTION "The value that the DSCP in the packet must have to match this entry. A value of -1 indicates that a specific DSCP value has not been defined and thus all DSCP values are considered a match." DEFVAL { -1 } ::= { diffServSixTupleClfrEntry 8 } diffServSixTupleClfrProtocol OBJECT-TYPE SYNTAX Unsigned32 (0..255) MAX-ACCESS read-create STATUS current DESCRIPTION "The IP protocol to match against the IPv4 protocol number or the IPv6Next-HeaderNext- Header number in the packet. A value of 255 means match all. Note the protocol number of 255 is reserved by IANA, and Next-Header number of 0 is used in IPv6." DEFVAL { 255 } ::= { diffServSixTupleClfrEntry 9 } diffServSixTupleClfrDstL4PortMin OBJECT-TYPE SYNTAX InetPortNumber MAX-ACCESS read-create STATUS current DESCRIPTION "The minimum value that the layer-4 destination port number in the packet must have in order to match this classifier entry." DEFVAL { 0 } ::= { diffServSixTupleClfrEntry 10 }diffServSixTupleClfrDstL4PortMax OBJECT-TYPE SYNTAX InetPortNumber MAX-ACCESS read-create STATUS currentBaker, Chan, Smith ExpiresSeptemberDecember 2001 [Page39]48] Internet Draft Differentiated Services MIBMarchMay 2001 diffServSixTupleClfrDstL4PortMax OBJECT-TYPE SYNTAX InetPortNumber MAX-ACCESS read-create STATUS current DESCRIPTION "The maximum value that the layer-4 destination port number in the packet must have in order to match this classifier entry. This value must be equal to or greater than the value specified for this entry in diffServSixTupleClfrDstL4PortMin." DEFVAL { 65535 } ::= { diffServSixTupleClfrEntry 11 } diffServSixTupleClfrSrcL4PortMin OBJECT-TYPE SYNTAX InetPortNumber MAX-ACCESS read-create STATUS current DESCRIPTION "The minimum value that the layer-4 source port number in the packet must have in order to match this classifier entry." DEFVAL { 0 } ::= { diffServSixTupleClfrEntry 12 } diffServSixTupleClfrSrcL4PortMax OBJECT-TYPE SYNTAX InetPortNumber MAX-ACCESS read-create STATUS current DESCRIPTION "The maximum value that the layer-4 source port number in the packet must have in oder to match this classifier entry. This value must be equal to or greater than the value specified for this entry in diffServSixTupleClfrSrcL4PortMin." DEFVAL { 65535 } ::= { diffServSixTupleClfrEntry 13 } diffServSixTupleClfrStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a classifier. Any writable variable may be modified whether the row is active or notInService." ::= { diffServSixTupleClfrEntry 14 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page40]49] Internet Draft Differentiated Services MIBMarchMay 2001 -- -- Meters -- diffServMeter OBJECT IDENTIFIER ::= { diffServMIBObjects 3 } -- -- This MIB supports a variety of Meters. It includes a--specific -- definition forMeters whose parameter set can -- be modeled usingToken Bucketparameters.Meter, which are but one type of -- specification. Other metering parameter sets can be definedand used -- when necessary.in other MIBs. -- -- Multiple meter elements may be logically cascaded using--their -- diffServMeterSucceedNext and diffServMeterFailNext--pointers ifrequired.-- required. One example of this might be for an AF PHB implementation -- that uses multiple level conformance meters. -- -- Cascading of individual meter elements in the MIB is--intended to be -- functionally equivalent to multiple level--conformance determination -- of a packet. The sequential--nature of the representation is merely -- a notational--convenience for this MIB. -- --For example: -- Conforming to RFC 2697,srTCM meters (RFC 2697) can beparameterizedspecified using-- two sets ofa single diffServMeterEntry -- and diffServTBParamEntry.-- With the first set parameterizingIt specifies the Committed Burst Size --token-bucket, second set parameterizing the Excess Burst Size --token-bucket.With both set'sdiffServTBParamRateparameters -- being used to reflectreflects the Committed InformationRate value.Rate. -- --Conforming to RFC 2698,trTCM meters (RFC 2698) can beparameterizedspecified using--a twosets of diffServMeterEntry and diffServTBParamEntry.diffServMeterEntries --Withand diffServTBParamEntries. It specifies thefirst set parameterizingCommitted Burst Size in thePeak Information Rate-- first token-bucket, andPeakthe Excess Burst Sizetoken-bucket, second set parameterizingin the second. -- diffServTBParamRate in the first token bucket reflects the CommittedInformation Rate and Committed Burst Size--token-bucket.Information Rate. -- --Conforming to RFC 2859,tswTCM meters (RFC 2859) can beparameterizedspecified using--a twosets of diffServMeterEntry and diffServTBParamEntry.diffServMeterEntries --With the first set parameterizingand diffServTBParamEntries. It specifies the Committed TargetRate,Rate in the --second set parameteringfirst token-bucket, and thePeakExcess TargetRate.Rate in the second. --With both set'sdiffServTBParamIntervalbeing used to -- reflectin each token bucket reflects the AverageInterval as specified by RFC 2859. -- Baker, Chan, Smith Expires September 2001 [Page 41] Internet Draft Differentiated Services MIB March 2001Interval. diffServMeterNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServMeterId instance. If a configuring system attempts to create a new row in the diffServMeterTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServMeter 1 } Baker, Chan, Smith Expires December 2001 [Page 50] Internet Draft Differentiated Services MIB May 2001 diffServMeterTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServMeterEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "This table enumerates specific meters that a system may use to police, or shape, a stream of traffic. The traffic stream to be metered is determined by thediffserv functional data pathDifferentiated Services Functional Data Path element(s) upstream of the meter i.e. by the object(s) that point to each entry in this table. This may include all traffic on an interface. Specific meter details are to be found in table entry referenced by diffServMeterSpecific." REFERENCE "[MODEL] section 5.1" ::= { diffServMeter 2 } diffServMeterEntry OBJECT-TYPE SYNTAX DiffServMeterEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry in the meter table describes a single conformance level of a meter." INDEX { diffServMeterId } ::= { diffServMeterTable 1 } DiffServMeterEntry ::= SEQUENCE { diffServMeterIdUnsigned32,INTEGER, diffServMeterSucceedNext RowPointer, diffServMeterFailNext RowPointer, diffServMeterSpecific RowPointer, diffServMeterStatus RowStatus }Baker, Chan, Smith Expires September 2001 [Page 42] Internet Draft Differentiated Services MIB March 2001diffServMeterId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Meter entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServMeterNextFree." ::= { diffServMeterEntry 1 } diffServMeterSucceedNext OBJECT-TYPE Baker, Chan, Smith Expires December 2001 [Page 51] Internet Draft Differentiated Services MIB May 2001 SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "If the traffic does conform, this selects the nextdiffserv functional data pathDifferentiated Services Functional Data Path element to handle traffic for this data path. This RowPointer should point to an instance of one of:diffServClfrEntrydiffServClfrElementEntry diffServMeterEntry diffServActionEntry diffServAlgDropEntry diffServQEntry A value of zeroDotZero in this attribute indicates that no furtherDiffservDifferentiated Services treatment is performed on traffic of this data path. The use of zeroDotZero is the normal usage for the last functional data path element of the current data path. If the row pointed to does not exist, the treatment is as if this attribute contains a value of zeroDotZero." DEFVAL { zeroDotZero } ::= { diffServMeterEntry 2 } diffServMeterFailNext OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "If the traffic does not conform, this selects the nextdiffserv functional data pathDifferentiated Services Functional Data Path element to handle traffic for this data path. This RowPointer should point to an instance of one of:diffServClfrEntrydiffServClfrElementEntry diffServMeterEntry diffServActionEntry diffServAlgDropEntryBaker, Chan, Smith Expires September 2001 [Page 43] Internet Draft Differentiated Services MIB March 2001diffServQEntry A value of zeroDotZero in this attribute indicates no furtherDiffservDifferentiated Services treatment is performed on traffic of this data path. The use of zeroDotZero is the normal usage for the last functional data path element of the current data path. If the row pointed to does not exist, the treatment is as if this attribute contains a value of zeroDotZero." DEFVAL { zeroDotZero } Baker, Chan, Smith Expires December 2001 [Page 52] Internet Draft Differentiated Services MIB May 2001 ::= { diffServMeterEntry 3 } diffServMeterSpecific OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "This indicates the behavior of the meter by pointing to an entry containing detailed parameters. Note that entries in that specific table must be managed explicitly. For example, diffServMeterSpecific may point to an entry in diffServTBParamTable, which contains an instance of a single set of Token Bucket parameters." ::= { diffServMeterEntry 4 } diffServMeterStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a meter. Any writable variable may be modified whether the row is active or notInService." ::= { diffServMeterEntry 5 } -- -- Token Bucket Parameter Table -- diffServTBParam OBJECT IDENTIFIER ::= { diffServMIBObjects 4 } -- Each entry in the Token Bucket Parameter Table parameterize--a single -- token bucket. Multiple token buckets can be--used together to -- parameterize multiple levels of--conformance. --Baker, Chan, Smith Expires September 2001 [Page 44] Internet Draft Differentiated Services MIB March 2001 -- Entries of this table are used for both policing, as token -- bucket parameters, and shaping, as leaky bucket parameters. ---- Note that an entry in the Token Bucket Parameter Table can--beshared, pointed to,shared -- by multiple diffServMeterTable--and diffServSchedulerTable entries. -- diffServTBParamNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServTBParamId instance. If a configuring system Baker, Chan, Smith Expires December 2001 [Page 53] Internet Draft Differentiated Services MIB May 2001 attempts to create a new row in the diffServTBParamTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServTBParam 1 } diffServTBParamTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServTBParamEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "This table enumerates a single set of token bucket meter parameters that a system may use to police or shape a stream of traffic. Such meters are modeled here as having a single rate and a single burst size. Multiple entries are used when multiple rates/burst sizes are needed." REFERENCE "[MODEL] section 5.1" ::= { diffServTBParam 2 } diffServTBParamEntry OBJECT-TYPE SYNTAX DiffServTBParamEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry that describes a single set of token bucket parameters." INDEX { diffServTBParamId } ::= { diffServTBParamTable 1 } DiffServTBParamEntry ::= SEQUENCE { diffServTBParamIdUnsigned32, Baker, Chan, Smith Expires September 2001 [Page 45] Internet Draft Differentiated Services MIB March 2001INTEGER, diffServTBParamType OBJECT IDENTIFIER, diffServTBParamRate Unsigned32, diffServTBParamBurstSize BurstSize, diffServTBParamInterval Unsigned32, diffServTBParamStatus RowStatus } diffServTBParamId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates theTBParamToken Bucket Parameter entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServTBParamNextFree." Baker, Chan, Smith Expires December 2001 [Page 54] Internet Draft Differentiated Services MIB May 2001 ::= { diffServTBParamEntry 1 } diffServTBParamType OBJECT-TYPE SYNTAX OBJECT IDENTIFIER MAX-ACCESS read-create STATUS current DESCRIPTION "The Metering/Shaping algorithm associated with theToken/LeakyToken Bucket parameters.{ 0 0 }zeroDotZero indicates this is unknown. Standard values for generic algorithms: diffServTBParamSimpleTokenBucket, diffServTBParamAvgRate, diffServTBParamSrTCMBlind, diffServTBParamSrTCMAware, diffServTBParamTrTCMBlind, diffServTBParamTrTCMAware, and diffServTBParamTswTCM are specified in this MIB asOBJECT-IDENTITYS;OBJECT- IDENTITYS; additional values may be further specified in other MIBs." REFERENCE "[MODEL] section 5" ::= { diffServTBParamEntry 2 } diffServTBParamRate OBJECT-TYPE SYNTAX Unsigned32 UNITS "kilobits per second" MAX-ACCESS read-create STATUS current DESCRIPTIONBaker, Chan, Smith Expires September 2001 [Page 46] Internet Draft Differentiated Services MIB March 2001"The token-bucket rate, in kilobits per second (kbps). This attribute is used for: 1. CIR in RFC 2697 for srTCM 2. PIR and CIR in RFC 2698 for trTCM 3. CTR and PTR in RFC 2859 for TSWTCM 4. AverageRate used in [MODEL] section 5." ::= { diffServTBParamEntry 3 } diffServTBParamBurstSize OBJECT-TYPE SYNTAX BurstSize UNITS "Bytes" MAX-ACCESS read-create STATUS current DESCRIPTION "The maximum number of bytes in a single transmission burst. This attribute is used for: 1. CBS and EBS in RFC 2697 for srTCM 2. CBS and PBS in RFC 2698 for trTCM Baker, Chan, Smith Expires December 2001 [Page 55] Internet Draft Differentiated Services MIB May 2001 3. Burst Size used in [MODEL] section 5." ::= { diffServTBParamEntry 4 } diffServTBParamInterval OBJECT-TYPE SYNTAX Unsigned32 UNITS "microseconds" MAX-ACCESS read-create STATUS current DESCRIPTION "The time interval used with the token bucket. For: 1. Average Rate Meter, [MODEL] section 5.2.1, - Delta. 2. Simple Token Bucket Meter, [MODEL] section 5.1, - time interval t. 3. RFC 2859 TSWTCM, - AVG_INTERVAL. 4. RFC 2697 srTCM, RFC 2698 trTCM, - token bucket update time interval." ::= { diffServTBParamEntry 5 } diffServTBParamStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a meter. Any writable variable may be modified whether the row is active or notInService." ::= { diffServTBParamEntry 6 } diffServTBParamSimpleTokenBucket OBJECT-IDENTITY STATUS current DESCRIPTION"Value of"The value tokenBucket(2) indicates the use of Two Parameter Token Bucket Meter as described in [MODEL] section 5.2.3."Baker, Chan, Smith Expires September 2001 [Page 47] Internet Draft Differentiated Services MIB March 2001REFERENCE "[MODEL] sections 5 and 7.1.2" ::= { diffServTBParam 3 } diffServTBParamAvgRate OBJECT-IDENTITY STATUS current DESCRIPTION"Value of"The value avgRate(3) indicates the use of Average Rate Meter as described in [MODEL] section 5.2.1." REFERENCE "[MODEL] sections 5 and 7.1.2" ::= { diffServTBParam 4 } diffServTBParamSrTCMBlind OBJECT-IDENTITY Baker, Chan, Smith Expires December 2001 [Page 56] Internet Draft Differentiated Services MIB May 2001 STATUS current DESCRIPTION"Value of"The values srTCMBlind(4) and srTCMAware(5)indicatesindicate the use of Single Rate Three Color Marker Metering as defined by RFC 2697,within either the `Color Blind' and `Color Aware' mode as described by the RFC." REFERENCE "[MODEL] sections 5 and 7.1.2" ::= { diffServTBParam 5 } diffServTBParamSrTCMAware OBJECT-IDENTITY STATUS current DESCRIPTION"Value of"The values srTCMBlind(4) and srTCMAware(5)indicatesindicate the use of Single Rate Three Color Marker Metering as defined by RFC 2697,within either the `Color Blind' and `Color Aware' mode as described by the RFC." REFERENCE "[MODEL] sections 5 and 7.1.2" ::= { diffServTBParam 6 } diffServTBParamTrTCMBlind OBJECT-IDENTITY STATUS current DESCRIPTION"Value of"The values trTCMBlind(6) and trTCMAware(7)indicatesindicate the use of Two Rate Three Color Marker Metering as defined by RFC 2698,within either the `Color Blind' and `Color Aware' mode as described by the RFC." REFERENCE "[MODEL] sections 5 and 7.1.2" ::= { diffServTBParam 7} diffServTBParamTrTCMAware OBJECT-IDENTITY STATUS current Baker, Chan, Smith Expires September 2001 [Page 48] Internet Draft Differentiated Services MIB March 2001} diffServTBParamTrTCMAware OBJECT-IDENTITY STATUS current DESCRIPTION "Value of trTCMBlind(6) and trTCMAware(7) indicates the use of Two Rate Three Color Marker Metering as defined by RFC 2698, with `Color Blind' and `Color Aware' mode as described by the RFC." REFERENCE "[MODEL] sections 5 and 7.1.2" ::= { diffServTBParam 8 } diffServTBParamTswTCM OBJECT-IDENTITY STATUS current DESCRIPTION"Value of"The value tswTCM(8) indicates the use of Time Sliding Window Three Color Marker Metering as defined by RFC 2859." Baker, Chan, Smith Expires December 2001 [Page 57] Internet Draft Differentiated Services MIB May 2001 REFERENCE "[MODEL] sections 5 and 7.1.2" ::= { diffServTBParam 9 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page49]58] Internet Draft Differentiated Services MIBMarchMay 2001 -- -- Actions -- diffServAction OBJECT IDENTIFIER ::= { diffServMIBObjects 5 } -- -- The Action Table allows enumeration of the different -- types of actions to be applied to a traffic flow. -- diffServActionNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServActionId instance. If a configuring system attempts to create a new row in the diffServActionTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServAction 1 } diffServActionTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServActionEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "The Action Table enumerates actions that can be performed to a stream of traffic. Multiple actions can be concatenated. For example,after marking a stream oftraffic exiting from ameter, a device can then performmeter may be counted, marked, and potentially dropped before entering acount action of the conforming or non-conforming traffic.queue. Specific actions are indicated by diffServActionSpecific which points to an entry of a specific action type parameterizing the action in detail." REFERENCE "[MODEL] section 6." ::= { diffServAction 2 } diffServActionEntry OBJECT-TYPE SYNTAX DiffServActionEntry MAX-ACCESS not-accessible STATUS current DESCRIPTIONBaker, Chan, Smith Expires September 2001 [Page 50] Internet Draft Differentiated Services MIB March 2001"Each entry in the action table allows description of one specific action to be applied to traffic." Baker, Chan, Smith Expires December 2001 [Page 59] Internet Draft Differentiated Services MIB May 2001 INDEX { diffServActionId } ::= { diffServActionTable 1 } DiffServActionEntry ::= SEQUENCE { diffServActionIdUnsigned32,INTEGER, diffServActionNext RowPointer, diffServActionSpecific RowPointer,diffServActionType INTEGER,diffServActionStatus RowStatus } diffServActionId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Action entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServActionNextFree." ::= { diffServActionEntry 1 } diffServActionNext OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "This selects the nextdiffserv functional data pathDifferentiated Services Functional Data Path element to handle traffic for this data path. This RowPointer should point to an instance of one of:diffServClfrEntrydiffServClfrElementEntry diffServMeterEntry diffServActionEntrydiffServAlgDropEntrydiffServQEntry A value of zeroDotZero in this attribute indicates no furtherDiffservDifferentiated Services treatment is performed on traffic of this data path. The use of zeroDotZero is the normal usage for the last functional data path element of the current data path. If the row pointed to does not exist, the treatment is as if this attribute contains a value of zeroDotZero." DEFVAL { zeroDotZero } ::= { diffServActionEntry 2 } diffServActionSpecific OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page51]60] Internet Draft Differentiated Services MIBMarchMay 2001diffServActionSpecific OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS currentDESCRIPTION "A pointer to an object instance providing additional information for the type of action indicated by this action table entry. For the standard actions defined by this MIB module, this should point to one of the following: a diffServDscpMarkActEntry, adiffServCountActEntry. For other actions, it may point to an object instance defined in some other MIB." ::= { diffServActionEntry 3 } diffServActionType OBJECT-TYPE SYNTAX INTEGER { other(1), -- types not specified here specific(2), -- follow the Specific pointer absoluteDrop(3) -- disallow traffic } MAX-ACCESS read-create STATUS current DESCRIPTION "Indicates the type of action. The values specific(2) must be associated with additional information, pointed to by diffServActionSpecific, with the actual action type indicated by the object being pointed to. The value absoluteDrop(3) has no associated information and will have a diffServActionSpecific value of zeroDotZero. The use of other(1) is outside the scope of this definition, although the diffServActionSpecific pointerdiffServCountActEntry. For other actions, it maybe used in this case,point toindicatean object instance defined in some otherinformation."MIB." ::= { diffServActionEntry43 } diffServActionStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation or deletion of an action element. Any writable variable may be modified whether the row is active or notInService." ::= { diffServActionEntry54 } ----DSCP Mark Action Table -- -- Rows of this table are pointed to by diffServActionSpecificBaker, Chan, Smith Expires September 2001 [Page 52] Internet Draft Differentiated Services MIB March 2001 --to -- provide detailed parameters specific to the DSCP--Mark action. -- -- A single entry in this table can beshared, pointed to,shared by--multiplediffServActionTable entries, of same or different--data paths.diffServActionTable entries. -- diffServDscpMarkActTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServDscpMarkActEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "This table enumerates specific DSCPs used for marking or remarking the DSCP field of IP packets. The entries of this table may be referenced by a diffServActionSpecific attribute." REFERENCE "[MODEL] section 6.1" ::= { diffServAction 3 } diffServDscpMarkActEntry OBJECT-TYPE SYNTAX DiffServDscpMarkActEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry in the DSCP mark action table that describes a single Baker, Chan, Smith Expires December 2001 [Page 61] Internet Draft Differentiated Services MIB May 2001 DSCP used for marking." INDEX { diffServDscpMarkActDscp } ::= { diffServDscpMarkActTable 1 } DiffServDscpMarkActEntry ::= SEQUENCE { diffServDscpMarkActDscp Dscp } diffServDscpMarkActDscp OBJECT-TYPE SYNTAX Dscp MAX-ACCESS read-only STATUS current DESCRIPTION "The DSCP that this Actionuses for marking/remarking traffic. Note that awill store into the DSCPvaluefield of-1 is not permitted in this table.the subject. It is quite possible that the only packets subject to this Action are already marked with this DSCP. Note also thatDiffservDifferentiated Services processing may result in packetremarking bothbeing marked on both ingress to a network and on egress fromitit, andit is quite possiblethat ingress and egresswouldcan occur in the samerouter."router. Normally, index variables are not-accessible. However, in this case the OID of the entry serves as a OBJECT-IDENTITY indicating that traffic should be marked in a certain way, and specifying a second object seems redundant." ::= { diffServDscpMarkActEntry 1 }Baker, Chan, Smith Expires September 2001 [Page 53] Internet Draft Differentiated Services MIB March 2001-- -- Count Action Table -- --Due to the fact thatBecause the MIB structure allows multiple--cascading -- diffServActionEntry be used to describe--multiple actions for a -- data path, the counter became an--optional action type. In normal -- implementation, either a--data patheither havehas counters or itdoesn't, it is not -- an element the management entity can add or remove.does not, -- as opposed to being configurable. The management entitycanmay choose -- to read the counter or--not. Hence it is recommended for implementationthat-- that have counters to always configure the count action as--the first -- of multiple actions, for example beforethe -- the absolutea drop action. -- diffServCountActNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServCountActId instance. If a configuring system attempts to create a new row in the diffServCountActTable using this value,that operation will fail if the value has,but an instance has been Baker, Chan, Smith Expires December 2001 [Page 62] Internet Draft Differentiated Services MIB May 2001 created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServAction 4 } diffServCountActTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServCountActEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "This table contains counters for all the traffic passing through an action element." REFERENCE "[MODEL] section 6.4" ::= { diffServAction 5 } diffServCountActEntry OBJECT-TYPE SYNTAX DiffServCountActEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry in the count action table describes a single set of traffic counters."Baker, Chan, Smith Expires September 2001 [Page 54] Internet Draft Differentiated Services MIB March 2001INDEX { diffServCountActId } ::= { diffServCountActTable 1 } DiffServCountActEntry ::= SEQUENCE { diffServCountActIdUnsigned32,INTEGER, diffServCountActOctets Counter32, diffServCountActHCOctets Counter64, diffServCountActPkts Counter32, diffServCountActHCPkts Counter64, diffServCountActDiscontTime TimeStamp, diffServCountActStatus RowStatus } diffServCountActId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Count Action entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServCountActNextFree." ::= { diffServCountActEntry 1 } diffServCountActOctets OBJECT-TYPE SYNTAX Counter32 Baker, Chan, Smith Expires December 2001 [Page 63] Internet Draft Differentiated Services MIB May 2001 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of octets at the Action data path element. Onhighhigh- speed devices, this object implements the least significant 32 bits of diffServCountActHCOctets. Discontinuities in the value of this counter can occur at re- initialization of the management system and at other times as indicated by the value of diffServCountActDiscontTime for this entry." ::= { diffServCountActEntry 2 } diffServCountActHCOctets OBJECT-TYPE SYNTAX Counter64 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of octets at the Action data path element. This object should be used onhigh speedhigh-speed interfaces.Baker, Chan, Smith Expires September 2001 [Page 55] Internet Draft Differentiated Services MIB March 2001Discontinuities in the value of this counter can occur at re- initialization of the management system and at other times as indicated by the value of diffServCountActDiscontTime for this entry." ::= { diffServCountActEntry 3 } diffServCountActPkts OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of packets at the Action data path element. Onhighhigh- speed devices, this object implements the least significant 32 bits of diffServCountActHCPkts. Discontinuities in the value of this counter can occur at re- initialization of the management system and at other times as indicated by the value of diffServCountActDiscontTime for this entry." ::= { diffServCountActEntry 4 } diffServCountActHCPkts OBJECT-TYPE SYNTAX Counter64 MAX-ACCESS read-only STATUS current DESCRIPTION Baker, Chan, Smith Expires December 2001 [Page 64] Internet Draft Differentiated Services MIB May 2001 "The number of packets at the Action data path element. This object should be used onhigh speedhigh-speed interfaces. Discontinuities in the value of this counter can occur at re- initialization of the management system and at other times as indicated by the value of diffServCountActDiscontTime for this entry." ::= { diffServCountActEntry 5 } diffServCountActDiscontTime OBJECT-TYPE SYNTAX TimeStamp MAX-ACCESS read-only STATUS current DESCRIPTION "The value of sysUpTime on the most recent occasion at which any one or more of this entry's counters suffered a discontinuity. If no such discontinuities have occurred since the last re- initialization of the local management subsystem, then this object contains a zero value." ::= { diffServCountActEntry 6 }Baker, Chan, Smith Expires September 2001 [Page 56] Internet Draft Differentiated Services MIB March 2001diffServCountActStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of this entry. Any writable variable may be modified whether the row is active or notInService." ::= { diffServCountActEntry 7 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page57]65] Internet Draft Differentiated Services MIBMarchMay 2001 -- -- Algorithmic Drop Table -- diffServAlgDrop OBJECT IDENTIFIER ::= { diffServMIBObjects 6 } diffServAlgDropNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServAlgDropId instance. If a configuring system attempts to create a new row in the diffServAlgDropTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServAlgDrop 1 } diffServAlgDropTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServAlgDropEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "The algorithmic drop table contains entries describing an element that drops packets according to some algorithm." REFERENCE "[MODEL] section 7.1.3" ::= { diffServAlgDrop 2 } diffServAlgDropEntry OBJECT-TYPE SYNTAX DiffServAlgDropEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry describes a process that drops packets according to some algorithm. Further details of the algorithm type are to be found in diffServAlgDropType and with more detail parameter entry pointed to by diffServAlgDropSpecific when necessary." INDEX { diffServAlgDropId } ::= { diffServAlgDropTable 1 } DiffServAlgDropEntry ::= SEQUENCE { diffServAlgDropIdUnsigned32,INTEGER, diffServAlgDropType INTEGER, diffServAlgDropNext RowPointer, diffServAlgDropQMeasure RowPointer, diffServAlgDropQThreshold Unsigned32, Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page58]66] Internet Draft Differentiated Services MIBMarchMay 2001diffServAlgDropQThreshold Unsigned32,diffServAlgDropSpecific RowPointer, diffServAlgDropOctets Counter32, diffServAlgDropHCOctets Counter64, diffServAlgDropPkts Counter32, diffServAlgDropHCPkts Counter64, diffServAlgDropDiscontinuityTime TimeStamp, diffServAlgDropStatus RowStatus } diffServAlgDropId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Algorithmic Dropper entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServAlgDropNextFree." ::= { diffServAlgDropEntry 1 } diffServAlgDropType OBJECT-TYPE SYNTAX INTEGER { other(1), tailDrop(2), headDrop(3),randomDrop(4)randomDrop(4), alwaysDrop(5) } MAX-ACCESS read-create STATUS current DESCRIPTION "The type of algorithm used by this dropper.A value of tailDrop(2) or headDrop(3) represents an algorithm that is completely specified by this MIB. AThe valueofother(1) requires further specification in some other MIB module.TheIn the tailDrop(2)algorithm is described as follows:algorithm, diffServAlgDropQThreshold represents the maximum depth of the queue, pointed to by diffServAlgDropQMeasure,atbeyond which all newly arriving packets will be dropped.TheIn the headDrop(3)algorithm is described as follows:algorithm, if a packet arrives when the current depth of the queue, pointed to by diffServAlgDropQMeasure, is at diffServAlgDropQThreshold, packets currently at the head of the queue are dropped to make room for the new packet to be enqueued at the tail of the queue.TheIn the randomDrop(4)algorithm is described as follows:algorithm, on packet arrival, an Active Queue Management algorithm is executed which may randomly drop a Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page59]67] Internet Draft Differentiated Services MIBMarchMay 2001arrival, anpacket. This algorithmis executed whichmayrandomlybe proprietary, and it may drop either thepacket,arriving packet ordrop other packet(s) from the queueanother packet inits place. The specifics ofthealgorithm may be proprietary. For this algorithm,queue. diffServAlgDropSpecific points to a diffServRandomDropEntry that describes the algorithm. For this algorithm, diffServAlgQThreshold isunderstood to be the absolute maximum size ofunderstood to be the absolute maximum size of the queue and additional parameters are described in diffServRandomDropTable. The alwaysDrop(5) algorithm is as its name specifies; always drop. In this case, the other configuration values in this Entry are not meaningful; There is no useful the queue are not useful. Therefore, diffServAlgQNext, diffServAlgQMeasure, andadditional parametersdiffServAlgQSpecific aredescribed in diffServRandomDropTable."all zeroDotZero." ::= { diffServAlgDropEntry 2 } diffServAlgDropNext OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "This selects the nextdiffserv functional data pathDifferentiated Services Functional Data Path element to handle traffic for this data path. This RowPointer should point to an instance of one of:diffServClfrEntrydiffServClfrElementEntry diffServMeterEntry diffServActionEntrydiffServAlgDropEntrydiffServQEntry A value of zeroDotZero in this attribute indicates no furtherDiffservDifferentiated Services treatment is performed on traffic of this data path. The use of zeroDotZero is the normal usage for the last functional data path element of the current data path. If the row pointed to does not exist, the treatment is as if this attribute contains a value of zeroDotZero." ::= { diffServAlgDropEntry 3 } diffServAlgDropQMeasure OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "Points to an entry in the diffServQTable to indicate the queue that a drop algorithm is to monitor when deciding whether to drop a packet. If the row pointed to does not exist, the algorithmic dropper element is considered inactive." ::= { diffServAlgDropEntry 4 }diffServAlgDropQThreshold OBJECT-TYPE SYNTAX Unsigned32 UNITS "Bytes"Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page60]68] Internet Draft Differentiated Services MIBMarchMay 2001 diffServAlgDropQThreshold OBJECT-TYPE SYNTAX Unsigned32 UNITS "Bytes" MAX-ACCESS read-create STATUS current DESCRIPTION "A threshold on the depth in bytes of the queue being measured at which a trigger is generated to the dropping algorithm. For the tailDrop(2) or headDrop(3) algorithms, this represents the depth of the queue, pointed to by diffServAlgDropQMeasure, at which the drop action will take place. Other algorithms will need to define their own semantics for this threshold." ::= { diffServAlgDropEntry 5 } diffServAlgDropSpecific OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "Points to a table entry that provides further detail regarding a drop algorithm. Entries with diffServAlgDropType equal to other(1) may have this point to a table defined in another MIB module. Entries with diffServAlgDropType equal to randomDrop(4) must have this point to an entry in diffServRandomDropTable. For all otheralgorithms,algorithms specified in this MIB, this should take the value zeroDotzero." ::= { diffServAlgDropEntry 6 } diffServAlgDropOctets OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of octets that have been dropped by this drop process. Onhigh speedhigh-speed devices, this object implements the least significant 32 bits of diffServAlgDropHCOctets. Discontinuities in the value of this counter can occur at re- initialization of the management system and at other times as indicated by the value ofifCounterDiscontinuityTime appropriate todiffServAlgDropDiscontinuityTime for thisinterface."Entry." ::= { diffServAlgDropEntry 7 }diffServAlgDropHCOctets OBJECT-TYPE SYNTAX Counter64Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page61]69] Internet Draft Differentiated Services MIBMarchMay 2001 diffServAlgDropHCOctets OBJECT-TYPE SYNTAX Counter64 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of octets that have been dropped by this drop process. This object should be used onhigh speedhigh-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 ofifCounterDiscontinuityTime appropriate todiffServAlgDropDiscontinuityTime for thisinterface."Entry." ::= { diffServAlgDropEntry 8 } diffServAlgDropPkts OBJECT-TYPE SYNTAX Counter32 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of packets that have been dropped by this drop process. Onhighhigh- speed devices, this object implements the least significant 32 bits of diffServAlgDropHCPkts. Discontinuities in the value of this counter can occur at re- initialization of the management system and at other times as indicated by the value ofifCounterDiscontinuityTime appropriate todiffServAlgDropDiscontinuityTime for thisinterface."Entry." ::= { diffServAlgDropEntry 9 } diffServAlgDropHCPkts OBJECT-TYPE SYNTAX Counter64 MAX-ACCESS read-only STATUS current DESCRIPTION "The number of packets that have been dropped by this drop process. This object should be used onhigh speedhigh-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 ofifCounterDiscontinuityTime appropriate todiffServAlgDropDiscontinuityTime for thisinterface."Entry." ::= { diffServAlgDropEntry 10 }diffServAlgDropStatusdiffServAlgDropDiscontinuityTime OBJECT-TYPE SYNTAXRowStatusTimeStamp MAX-ACCESSread-createread-only STATUS currentDESCRIPTION "The RowStatus variable controls the activation, deactivation, orBaker, Chan, Smith ExpiresSeptemberDecember 2001 [Page62]70] Internet Draft Differentiated Services MIBMarchMay 2001 DESCRIPTION "The value of sysUpTime on the most recent occasion at which any one or more of this entry's counters suffered a discontinuity. If no such discontinuities have occurred since the last re- initialization of the local management subsystem, then this object contains a zero value." ::= { diffServAlgDropEntry 11 } diffServAlgDropStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of this entry. Any writable variable may be modified whether the row is active or notInService." ::= { diffServAlgDropEntry1112 } -- -- Random Drop Table -- diffServRandomDropNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServRandomDropId instance. If a configuring system attempts to create a new row in the diffServRandomDropTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServAlgDrop 3 } diffServRandomDropTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServRandomDropEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "The random drop table contains entries describing a process that drops packets randomly. Entries in this tableis intended to beare pointed to by diffServAlgDropSpecific." REFERENCE "[MODEL] section 7.1.3" ::= { diffServAlgDrop 4 } diffServRandomDropEntry OBJECT-TYPE Baker, Chan, Smith Expires December 2001 [Page 71] Internet Draft Differentiated Services MIB May 2001 SYNTAX DiffServRandomDropEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry describes a process that drops packets according to a random algorithm." INDEX { diffServRandomDropId } ::= { diffServRandomDropTable 1 } DiffServRandomDropEntry ::= SEQUENCE { diffServRandomDropIdUnsigned32,INTEGER, diffServRandomDropMinThreshBytes Unsigned32, diffServRandomDropMinThreshPkts Unsigned32,Baker, Chan, Smith Expires September 2001 [Page 63] Internet Draft Differentiated Services MIB March 2001diffServRandomDropMaxThreshBytes Unsigned32, diffServRandomDropMaxThreshPkts Unsigned32,diffServRandomDropProbMax Unsigned32, diffServRandomDropInvWeight Unsigned32,diffServRandomDropProbMax INTEGER, diffServRandomDropWeight INTEGER, diffServRandomDropSamplingRateUnsigned32,INTEGER, diffServRandomDropStatus RowStatus } diffServRandomDropId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Random Drop entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServRandomDropNextFree." ::= { diffServRandomDropEntry 1 } diffServRandomDropMinThreshBytes OBJECT-TYPE SYNTAX Unsigned32 UNITS "bytes" MAX-ACCESS read-create STATUS current DESCRIPTION "The average queue depth in bytes, beyond which traffic has a non-zero probability of being dropped. Changes in this variable may or may not be reflected in the reported value of diffServRandomDropMinThreshPkts." ::= { diffServRandomDropEntry 2 } diffServRandomDropMinThreshPkts OBJECT-TYPE SYNTAX Unsigned32 UNITS "packets" Baker, Chan, Smith Expires December 2001 [Page 72] Internet Draft Differentiated Services MIB May 2001 MAX-ACCESS read-create STATUS current DESCRIPTION "The average queue depth in packets, beyond which traffic has a non-zero probability of being dropped. Changes in this variable may or may not be reflected in the reported value of diffServRandomDropMinThreshBytes." ::= { diffServRandomDropEntry 3 } diffServRandomDropMaxThreshBytes OBJECT-TYPE SYNTAX Unsigned32 UNITS "bytes" MAX-ACCESS read-createBaker, Chan, Smith Expires September 2001 [Page 64] Internet Draft Differentiated Services MIB March 2001STATUS current DESCRIPTION "The average queue depth beyond which traffic has a probability indicated by diffServRandomDropProbMax of being dropped or marked. Note that this differs from the physical queue limit, which is stored in diffServAlgDropQThreshold. Changes in this variable may or may not be reflected in the reported value of diffServRandomDropMaxThreshPkts." ::= { diffServRandomDropEntry 4 } diffServRandomDropMaxThreshPkts OBJECT-TYPE SYNTAX Unsigned32 UNITS "packets" MAX-ACCESS read-create STATUS current DESCRIPTION "The average queue depth beyond which traffic has a probability indicated by diffServRandomDropProbMax of being dropped or marked. Note that this differs from the physical queue limit, which is stored in diffServAlgDropQThreshold. Changes in this variable may or may not be reflected in the reported value of diffServRandomDropMaxThreshBytes." ::= { diffServRandomDropEntry 5 } diffServRandomDropProbMax OBJECT-TYPE SYNTAXUnsigned32INTEGER (0..1000) MAX-ACCESS read-create STATUS current DESCRIPTION "The worst case random drop probability, expressed in drops per thousand packets. For example, if in the worst case every arriving packet may be Baker, Chan, Smith Expires December 2001 [Page 73] Internet Draft Differentiated Services MIB May 2001 droppedin the worst case (100%),(100%) for a period, this has the value 1000. Alternatively, if in the worst case only one percent (1%) of traffic may be dropped, it has the value 10." ::= { diffServRandomDropEntry 6 }diffServRandomDropInvWeightdiffServRandomDropWeight OBJECT-TYPE SYNTAXUnsigned32INTEGER (0..65536) MAX-ACCESS read-create STATUS current DESCRIPTION "The weighting of past history in affecting thecalculation ofExponentially Weighted Moving Average function which calculates the currentqueue average. The movingaverageof thequeuedepthdepth. The equation usesthe inverse of this valuediffServRandomDropWeight/65536 as thefactorcoefficient for the newqueue Baker, Chan, Smith Expires September 2001 [Page 65] Internet Draft Differentiated Services MIB March 2001 depth,sample in the equation, andone minus that inverse(65536 - diffServRandomDropWeight)/65536 as thefactor forcoefficient of thehistorical average.old value. Implementations maychoose tolimit theacceptable set ofvalues of diffServRandomDropWeight to aspecified set,subset of the possible range of values, such as powers of2."two. Doing this would facilitate implementation of the Exponentially Weighted Moving Average using shift instructions or registers." ::= { diffServRandomDropEntry 7 } diffServRandomDropSamplingRate OBJECT-TYPE SYNTAXUnsigned32INTEGER (0..1000000) MAX-ACCESS read-create STATUS current DESCRIPTION "The number of times per second the queue is sampled for queue average calculation. A value of zeromeansis used to mean that the queue is sampled approximately each time a packet is enqueued (or dequeued)." ::= { diffServRandomDropEntry 8 } diffServRandomDropStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of this entry. Any writable variable may be modified whether the row is active or notInService." ::= { diffServRandomDropEntry 9 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page66]74] Internet Draft Differentiated Services MIBMarchMay 2001 -- -- Queue Table -- diffServQueue OBJECT IDENTIFIER ::= { diffServMIBObjects 7 } -- -- An entry of diffServQTable represents a FIFO queuediffservDifferentiated --functional data pathServices Functional Data Path element as described in [MODEL] section -- 7.1.1.-- NoticeNote that the specification of scheduling parameters for aqueue-- queue as part of the input to a scheduler functional data path--element -- as described in [MODEL] section 7.1.2. This allows--building of -- hierarchical queuing/scheduling.--A queue thereforeis parameterized by:has these attributes: -- 1. Which scheduler will service this queue, diffServQNext. -- 2. How the scheduler will service this queue, with respect -- to all the other queues the same scheduler needs to service, -- diffServQRate. -- --Notice one or moreNote that upstreamdiffserv data path element may share,Differentiated Services Functional Data Path -- elements may pointto,to a shared diffServQTable entry as described -- in [MODEL] section--7.1.1. ---- Each entry of the diffServQTable belongs to one and only one -- data path. --diffServQNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServQId instance. If a configuring system attempts to create a new row in the diffServQTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServQueue 1 } diffServQTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServQEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "The Queue Table enumerates the individual queues." REFERENCEBaker, Chan, Smith Expires September 2001 [Page 67] Internet Draft Differentiated Services MIB March 2001"[MODEL] section 7.1.1" ::= { diffServQueue 2 } diffServQEntry OBJECT-TYPE SYNTAX DiffServQEntry Baker, Chan, Smith Expires December 2001 [Page 75] Internet Draft Differentiated Services MIB May 2001 MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry in the Queue Table describes a single queue. With each entry belonging to one and only one data path." INDEX { diffServQId } ::= { diffServQTable 1 } DiffServQEntry ::= SEQUENCE { diffServQIdUnsigned32,INTEGER, diffServQNext RowPointer, diffServQRate RowPointer, diffServQShaper RowPointer, diffServQStatus RowStatus } diffServQId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Queue entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServQNextFree." ::= { diffServQEntry 1 } diffServQNext OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "This selects the nextdiffserv functional data pathDifferentiated Services Functional Data Path element to handle traffic for this data path. This RowPointer must point to a diffServSchedulerEntry. A value of zeroDotZero in this attribute indicates an incomplete diffServQEntry instance. In such a case, the entry has no operational effect, since it has no parameters to give it meaning. If the row pointed to does not exist, the treatment is as if thisBaker, Chan, Smith Expires September 2001 [Page 68] Internet Draft Differentiated Services MIB March 2001attribute contains a value of zeroDotZero." ::= { diffServQEntry 2 } diffServQRate OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create Baker, Chan, Smith Expires December 2001 [Page 76] Internet Draft Differentiated Services MIB May 2001 STATUS current DESCRIPTION "This RowPointer indicates theentry in diffServAssuredRateTablediffServAssuredRateEntry that the scheduler, pointed to by diffServQNext, should use to service this queue.A value of zeroDotZero in this attribute indicates an incomplete diffServQEntry instance. An illegal configuration.If the row pointed to is zeroDotZero or does not exist, thetreatmentminimum rate isas if this attribute contains a value of zeroDotZero."unspecified." ::= { diffServQEntry 3 } diffServQShaper OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "This RowPointer indicates theentry in diffServShapingRateTablediffServShapingRateEntry that the scheduler, pointed to by diffServQNext, should use to service this queue.A value of zeroDotZero in this attribute indicates an incomplete diffServQEntry instance. An illegal configuration.If the row pointed to does notexist,exist or is zeroDotZero, thetreatmentmaximum rate isas if this attribute contains a valuethe line speed ofzeroDotZero."the interface." ::= { diffServQEntry 4 } diffServQStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a queue. Any writable variable may be modified whether the row is active or notInService." ::= { diffServQEntry 5 } -- -- Scheduler TableBaker, Chan, Smith Expires September 2001 [Page 69] Internet Draft Differentiated Services MIB March 2001-- diffServScheduler OBJECT IDENTIFIER ::= { diffServMIBObjects 8 } -- --TheA SchedulerTable is used for representingEntry represents a packetschedulers:scheduler, such as a priority --itscheduler or a WFQ scheduler. It provides flexibility for multiple -- scheduling algorithms, each--servicing multiple queues, to be used on -- the same logical/physical--interface. --Notice the servicing parameters the scheduler uses is--specified by each of itsNote that upstreamfunctional data path elements, -- most likelyqueues orschedulers. -- The coordination and coherency between the servicing parameters --schedulers specify several of the -- scheduler'supstream functional data path elementsparameters. These must--bemaintained forproperly specified if the Baker, Chan, Smith Expires December 2001 [Page 77] Internet Draft Differentiated Services MIB May 2001 -- scheduler is tofunction correctly.behave as expected. -- -- The diffServSchedulerShaper attributeis used for specifying --specifies theservicingparametersfor output of a scheduler when its -- downstream functional data path element-- when a scheduler's output is sent to another scheduler.--This is -- usedforin building hierarchicalqueue/scheduler.queues or schedulers. -- -- More discussion of the scheduler functional data path element--is -- in [MODEL] section 7.1.2. -- diffServSchedulerNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServSchedulerId instance. If a configuring system attempts to create a new row in the diffServSchedulerTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServScheduler 1 } diffServSchedulerTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServSchedulerEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "The Scheduler Table enumerates packet schedulers. Multiple scheduling algorithms can be used on a given data path, with each algorithm described by one diffServSchedulerEntry." REFERENCEBaker, Chan, Smith Expires September 2001 [Page 70] Internet Draft Differentiated Services MIB March 2001"[MODEL] section 7.1.2" ::= { diffServScheduler 2 } diffServSchedulerEntry OBJECT-TYPE SYNTAX DiffServSchedulerEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry in the Scheduler Table describing a single instance of a scheduling algorithm." INDEX { diffServSchedulerId } ::= { diffServSchedulerTable 1 } DiffServSchedulerEntry ::= SEQUENCE { diffServSchedulerIdUnsigned32,INTEGER, diffServSchedulerNext RowPointer, Baker, Chan, Smith Expires December 2001 [Page 78] Internet Draft Differentiated Services MIB May 2001 diffServSchedulerMethod OBJECT IDENTIFIER, diffServSchedulerRate RowPointer, diffServSchedulerShaper RowPointer, diffServSchedulerStatus RowStatus } diffServSchedulerId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Scheduler entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServSchedulerNextFree." ::= { diffServSchedulerEntry 1 } diffServSchedulerNext OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "This selects the nextdiffserv functional data pathDifferentiated Services Functional Data Path element to handle traffic for this data path. This RowPointer should point to an instance of one of: diffServSchedulerEntry diffServQEntryAsas indicated by [MODEL] section 7.1.4.ButHowever, this RowPointercanmay also point to an instanceof: diffServClfrEntryof:. diffServClfrElementEntry diffServMeterEntryBaker, Chan, Smith Expires September 2001 [Page 71] Internet Draft Differentiated Services MIB March 2001diffServActionEntry diffServAlgDropEntryFor building of multiple TCBs forto extend the same data path. This should point to another diffServSchedulerEntry for implementation of multiple scheduler methods for the same data path, and for implementation of hierarchical schedulers.A value of zeroDotZero in this attribute indicates no further Diffserv treatment is performed on traffic of this data path. The use of zeroDotZero is the normal usage for the last functional data path element of the current data path.If the row pointed to does notexist, theexist or is zeroDotZero, no further Differentiated Services treatment isas if this attribute contains a valueperformed on traffic ofzeroDotZero."this data path." DEFVAL { zeroDotZero } ::= { diffServSchedulerEntry 2 } diffServSchedulerMethod OBJECT-TYPE SYNTAX OBJECT IDENTIFIER MAX-ACCESS read-create Baker, Chan, Smith Expires December 2001 [Page 79] Internet Draft Differentiated Services MIB May 2001 STATUS current DESCRIPTION "The scheduling algorithm used by this Scheduler.{ 0 0 }zeroDotZero indicates that this is unknown. Standard values for generic algorithms: diffServSchedulerPriority, diffServSchedulerWRR, and diffServSchedulerWFQ are specified in this MIB; additional values may be further specified in other MIBs." REFERENCE "[MODEL] section 7.1.2" ::= { diffServSchedulerEntry 3 } diffServSchedulerRate OBJECT-TYPE SYNTAX RowPointer MAX-ACCESS read-create STATUS current DESCRIPTION "This RowPointer indicates the entry in diffServAssuredRateTable which indicates the priority or minimum output rate from this scheduler. This attribute isonlyused only when there is more than one level of scheduler. It should have the value of zeroDotZero when not used." DEFVAL { zeroDotZero } ::= { diffServSchedulerEntry 4 } diffServSchedulerShaper OBJECT-TYPE SYNTAX RowPointerBaker, Chan, Smith Expires September 2001 [Page 72] Internet Draft Differentiated Services MIB March 2001MAX-ACCESS read-create STATUS current DESCRIPTION "This RowPointer indicates the entry in diffServShapingRateTable which indicates the maximum output rate from this scheduler. This attribute isonlyused only when there is more than one level of scheduler. It should have the value of zeroDotZero when not used." DEFVAL { zeroDotZero } ::= { diffServSchedulerEntry 5 } diffServSchedulerStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a scheduler. Any writable variable may be modified whether the row is active or notInService." ::= { diffServSchedulerEntry 6 } Baker, Chan, Smith Expires December 2001 [Page 80] Internet Draft Differentiated Services MIB May 2001 diffServSchedulerPriority OBJECT-IDENTITY STATUS current DESCRIPTION"For use with diffServSchedulerMethod to indicate"When the next scheduler uses Priorityscheduling method,scheduling, defined as an algorithm in which the presence of data in a queue or set of queues absolutely precludes dequeue from another queue or set ofqueues. Noticequeues, this indicates the relative priority of the traffic stream. Note that attributes from diffServAssuredRateEntry of the queues/schedulers feeding this scheduler are used when determining the next packet to schedule." REFERENCE "[MODEL] section 7.1.2" ::= { diffServScheduler 3 } diffServSchedulerWRR OBJECT-IDENTITY STATUS current DESCRIPTION "For use with diffServSchedulerMethod to indicate Weighted Round Robin scheduling method, defined as any algorithm in which a set of queues are visited in a fixed order, and varying amounts of traffic are removed from each queue in turn to implement an average output rate by class. Notice attributes from diffServAssuredRateEntry of the queues/schedulers feeding this scheduler are used when determining the next packet to schedule." REFERENCE "[MODEL] section 7.1.2" ::= { diffServScheduler 4 }Baker, Chan, Smith Expires September 2001 [Page 73] Internet Draft Differentiated Services MIB March 2001diffServSchedulerWFQ OBJECT-IDENTITY STATUS current DESCRIPTION "For use with diffServSchedulerMethod to indicate Weighted Fair Queuing scheduling method, defined as any algorithm in which a set of queues are conceptually visited in some order, to implement an average output rate by class. Notice attributes from diffServAssuredRateEntry of the queues/schedulers feeding this scheduler are used when determining the next packet to schedule." REFERENCE "[MODEL] section 7.1.2" ::= { diffServScheduler 5 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page74]81] Internet Draft Differentiated Services MIBMarchMay 2001 ---- Assured--Assured Rate Parameters Table -- -- The parameters used by a scheduler for its inputs or outputs are -- maintained separately from the Queue or Scheduler table entriesfor-- for reusability reasons and so that they may be used by both queuesand-- and schedulers. This follows the approach for separation of datapath-- path elements from parameterizationwhichthat is used throughout this MIB.Use-- Use of these Assured Rate Parameter Table entries by Queues andSchedulers-- Schedulers allows themodellingmodeling of hierarchical scheduling systems. -- -- Specifically, a Scheduler has one or more inputs and one output.For-- Any queue feeding a scheduler, or anyinput that requires work-conserving properties, the input is -- parameterised by having the preceding element (e.g.scheduler which feeds aQueue Tablesecond --entry) pointscheduler, might specify a minimum transfer rate by pointing to anAssured Rate Parameter Table entry. The scheduler -- output, if it has work-conserving properties, is parameterised by--having the Scheduler Table entry itself point to aAssured Rate--Parameter Table entry. -- -- The diffServAssuredRatePriority/Abs/Rel attributes are used as -- parameters to the work-conserving portion of a scheduler: --work-conserving"work-conserving" implies that the scheduler can continue to emit -- data as--long as there is data available at its input(s). This has -- the effect--of guaranteeing a certain priority relative to other -- scheduler inputs--and/or a certain minimum proportion of the available -- output bandwidth.--Properly configured, this means a certain minimum -- rate, which may be--exceeded should traffic be available should there -- be spare bandwidth--after all other classes have had opportunities to -- consume their own--minimum rates. -- diffServAssuredRateNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServAssuredRateId instance. If a configuring system attempts to create a new row in the diffServAssuredRateTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServScheduler 6 } diffServAssuredRateTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServAssuredRateEntry MAX-ACCESS not-accessibleBaker, Chan, Smith Expires September 2001 [Page 75] Internet Draft Differentiated Services MIB March 2001STATUS current DESCRIPTION "The Assured Rate Parameters Table enumerates individual sets of scheduling parameter that can be used/reused by Queues and Baker, Chan, Smith Expires December 2001 [Page 82] Internet Draft Differentiated Services MIB May 2001 Schedulers." ::= { diffServScheduler 7 } diffServAssuredRateEntry OBJECT-TYPE SYNTAX DiffServAssuredRateEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry in the Assured Rate Parameters Table describes a single set of scheduling parameters for use by one or more queues or schedulers." INDEX { diffServAssuredRateId } ::= { diffServAssuredRateTable 1 } DiffServAssuredRateEntry ::= SEQUENCE { diffServAssuredRateIdUnsigned32,INTEGER, diffServAssuredRatePriority Unsigned32, diffServAssuredRateAbs Unsigned32, diffServAssuredRateRel Unsigned32, diffServAssuredRateStatus RowStatus } diffServAssuredRateId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Scheduler Parameter entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServAssuredRateNextFree." ::= { diffServAssuredRateEntry 1 } diffServAssuredRatePriority OBJECT-TYPE SYNTAX Unsigned32 MAX-ACCESS read-create STATUS current DESCRIPTION "The priority of this input to the associated scheduler, relative to the scheduler's other inputs." ::= { diffServAssuredRateEntry 2 } diffServAssuredRateAbs OBJECT-TYPE SYNTAX Unsigned32 UNITS "kilobits per second" MAX-ACCESS read-create STATUS current Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page76]83] Internet Draft Differentiated Services MIBMarchMay 2001SYNTAX Unsigned32 UNITS "kilobits per second" MAX-ACCESS read-create STATUS currentDESCRIPTION "The minimum absolute rate, in kilobits/sec, that a downstream scheduler element should allocate to this queue. If the value is zero, then there is effectively no minimum rate guarantee. If the value is non-zero, the scheduler will assure the servicing of this queue to at least this rate. Note that thisattribute'sattribute valueis coupled toand that ofdiffServAssuredRateRel:diffServAssuredRateRel are coupled: changes to one will affect the value of the other. They are linked by the following equation: diffServAssuredRateRel = diffServAssuredRateAbs *10000/ifSpeed1000/ifSpeed or, if appropriate: diffServAssuredRateRel = diffServAssuredRateAbs *10000/ifHighSpeed"1000/ifHighSpeed" REFERENCE "ifSpeed, ifHighSpeed from [IFMIB]" ::= { diffServAssuredRateEntry 3 } diffServAssuredRateRel OBJECT-TYPE SYNTAX Unsigned32 MAX-ACCESS read-create STATUS current DESCRIPTION "The minimum rate that a downstream scheduler element should allocate to this queue, relative to the maximum rate of the interface as reported by ifSpeed or ifHighSpeed, in units of1/10,0001/1000 of 1. If the value is zero, then there is effectively no minimum rate guarantee. If the value is non-zero, the scheduler will assure the servicing of this queue to at least this rate. Note that thisattribute'sattribute valueis coupled toand that ofdiffServAssuredRateAbs:diffServAssuredRateAbs are coupled: changes to one will affect the value of the other. They are linked by the following equation: diffServAssuredRateRel = diffServAssuredRateAbs *10000/ifSpeed1000/ifSpeed or, if appropriate: diffServAssuredRateRel = diffServAssuredRateAbs *10000/ifHighSpeed"1000/ifHighSpeed" REFERENCEBaker, Chan, Smith Expires September 2001 [Page 77] Internet Draft Differentiated Services MIB March 2001"ifSpeed, ifHighSpeed from [IFMIB]" ::= { diffServAssuredRateEntry 4 } diffServAssuredRateStatus OBJECT-TYPE SYNTAX RowStatus Baker, Chan, Smith Expires December 2001 [Page 84] Internet Draft Differentiated Services MIB May 2001 MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a queue. Any writable variable may be modified whether the row is active or notInService." ::= { diffServAssuredRateEntry 5 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page78]85] Internet Draft Differentiated Services MIBMarchMay 2001 -- -- Shaping Parameter Table -- -- The parameters used by a scheduler for its inputs or outputs are -- maintained separately from the Queue or Scheduler table entriesfor-- for reusability reasons and so that they may be used by both queuesand-- and schedulers. This follows the approach for separation of datapath-- path elements from parameterizationwhichthat is used throughout this MIB.Use-- Use of these Shaping Parameter Table entries by Queues and Schedulers -- allows themodellingmodeling of hierarchical scheduling systems. -- -- Specifically, a Scheduler has one or more inputs and one output.For-- Any queue feeding a scheduler, or anyinput that requires non-work-conserving properties, the input is -- parameterised by having the preceding element (e.g.scheduler which feeds aQueue Tablesecond --entry) pointscheduler, might specify a maximum transfer rate by pointing to a -- ShapingRateParameter Table entry.The schedulerMulti-rate shapers, such as a Dual --output, if it has non-work-conserving properties, is parameterisedLeaky Bucket algorithm, specify their rates by positing multiple --having the Scheduler Table entry itself point to aShapingRate --ParameterTable entry.Entries with the same diffServShapingRateId but -- different diffServShapingRateLevels. -- -- The diffServShapingRateLevel/Abs/Rel attributes are used as parameters -- to the non-work-conserving portion of a scheduler: non-work-conserving -- implies that the scheduler may sometimes not emit a packet, even if -- there is data available at its input(s). This has the effect of--limiting -- the servicing of the queue/scheduler input or output, in--effect performing -- shaping of the packet stream passing through the--queue/scheduler, as -- described in [MODEL] section 7.2. -- diffServShapingRateNextFree OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS read-only STATUS current DESCRIPTION "This object yields a value when read that is currently unused for a diffServShapingRateId instance. If a configuring system attempts to create a new row in the diffServShapingRateTable using this value,that operation will fail if the value has,but an instance has been created or is in themeantime, been used to create another rowprocess of being created, thatis currently valid."operation will fail." ::= { diffServScheduler 8 } diffServShapingRateTable OBJECT-TYPE SYNTAX SEQUENCE OF DiffServShapingRateEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "The Shaping Parameter Table enumerates individual sets of scheduling parameter that can be used/reused by Queues and Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page79]86] Internet Draft Differentiated Services MIBMarchMay 2001scheduling parameter that can be used/reused by Queues andSchedulers." ::= { diffServScheduler 9 } diffServShapingRateEntry OBJECT-TYPE SYNTAX DiffServShapingRateEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "An entry in the Shaping Parameter Table describes a single set of scheduling parameters for use by one or more queues or schedulers." INDEX { diffServShapingRateId, diffServShapingRateLevel } ::= { diffServShapingRateTable 1 } DiffServShapingRateEntry ::= SEQUENCE { diffServShapingRateIdUnsigned32,INTEGER, diffServShapingRateLevelUnsigned32,INTEGER, diffServShapingRateAbs Unsigned32, diffServShapingRateRel Unsigned32, diffServShapingRateThreshold BurstSize, diffServShapingRateStatus RowStatus } diffServShapingRateId OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that enumerates the Shaping Parameter entries. The set of such identifiers spans the whole agent. Managersshouldobtain new values for row creation in this table by reading diffServShapingRateNextFree." ::= { diffServShapingRateEntry 1 } diffServShapingRateLevel OBJECT-TYPE SYNTAXUnsigned32INTEGER (1..2147483647) MAX-ACCESS not-accessible STATUS current DESCRIPTION "An index that indicates which level of a multi-rate shaper is being given its parameters.In aA multi-rate shaperwithhas some number of rate levels. Frame Relay's dual rate specification refers to amean'committed' and an 'excess' rate; ATM's dual rate specification refers to apeak rate, for example, the'mean' and a 'peak' rate. This table is generalized to support an arbitrary number of rates. The committed or mean ratemight be applied first, andis level 1, the peak ratesecond under a defined circumstance. By convention, increasing levels have increasing rates." ::= { diffServShapingRateEntry 2 }(if any) is the highest level rate configured, and if there are other rates they are distributed in Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page80]87] Internet Draft Differentiated Services MIBMarchMay 2001 monotonically increasing order between them." ::= { diffServShapingRateEntry 2 } diffServShapingRateAbs OBJECT-TYPE SYNTAX Unsigned32 UNITS "kilobits per second" MAX-ACCESS read-create STATUS current DESCRIPTION "The maximum rate in kilobits/sec that a downstream scheduler element should allocate to this queue. If the value is zero, then there is effectively no maximum rate limit and that the scheduler should attempt to bework-conservingwork conserving for this queue. If the value is non-zero, the scheduler will limit the servicing of this queue to, at most, this rate in a non-work-conserving manner. Note that thisattribute'sattribute valueis coupled toand that ofdiffServShapingRateRel:diffServShapingRateRel are coupled: changes to one will affect the value of the other. They are linked by the following equation: diffServAssuredRateRel = diffServAssuredRateAbs *10000/ifSpeed1000/ifSpeed or, if appropriate: diffServAssuredRateRel = diffServAssuredRateAbs *10000/ifHighSpeed"1000/ifHighSpeed" REFERENCE "ifSpeed, ifHighSpeed from [IFMIB], RFC 2963" ::= { diffServShapingRateEntry 3 } diffServShapingRateRel OBJECT-TYPE SYNTAX Unsigned32 MAX-ACCESS read-create STATUS current DESCRIPTION "The maximum rate that a downstream scheduler element should allocate to this queue, relative to the maximum rate of the interface as reported by ifSpeed or ifHighSpeed, in units of1/10,0001/1000 of 1. If the value is zero, then there is effectively no maximum rate limit and the scheduler should attempt to bework-conservingwork conserving for this queue. If the value is non-zero, the scheduler will limit the servicing of this queue to, at most, this rate in a non-work-conserving manner. Note that thisattribute'sattribute valueis coupled toand that ofdiffServShapingRateAbs:diffServShapingRateAbs are coupled: changes to one will affect the value of the other. They are linked by the following equation:diffServShapingRateAbs = ifSpeed * diffServShapingRateRel/10000 or, if appropriate:Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page81]88] Internet Draft Differentiated Services MIBMarchMay 2001 diffServShapingRateAbs = ifSpeed * diffServShapingRateRel/1000 or, if appropriate: diffServShapingRateAbs = ifHighSpeed *diffServShapingRateRel/10000"diffServShapingRateRel/1000" REFERENCE "ifSpeed, ifHighSpeed from [IFMIB], RFC 2963" ::= { diffServShapingRateEntry 4 } diffServShapingRateThreshold OBJECT-TYPE SYNTAX BurstSize UNITS "Bytes" MAX-ACCESS read-create STATUS current DESCRIPTION "The number of bytes of queue depth at which the rate of a multi-rate scheduler will increase to the next output rate. In the last conceptual row for such a shaper, this threshold is ignored and by convention is zero." REFERENCE "RFC 2963" ::= { diffServShapingRateEntry 5 } diffServShapingRateStatus OBJECT-TYPE SYNTAX RowStatus MAX-ACCESS read-create STATUS current DESCRIPTION "The RowStatus variable controls the activation, deactivation, or deletion of a queue. Any writable variable may be modified whether the row is active or notInService." ::= { diffServShapingRateEntry 6 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page82]89] Internet Draft Differentiated Services MIBMarchMay 2001 -- -- MIB Compliance statements. -- diffServMIBCompliances OBJECT IDENTIFIER ::= { diffServMIBConformance 1 } diffServMIBGroups OBJECT IDENTIFIER ::= { diffServMIBConformance 2 } diffServMIBCompliance MODULE-COMPLIANCE STATUS current DESCRIPTION "This MIB may be implemented as a read-only or as a read-create MIB. As a result, it may be used for monitoring or for configuration." MODULE -- This Module MANDATORY-GROUPS { diffServMIBDataPathGroup, diffServMIBClfrGroup, diffServMIBClfrElementGroup, diffServMIBSixTupleClfrGroup, diffServMIBActionGroup, diffServMIBAlgDropGroup, diffServMIBQGroup, diffServMIBSchedulerGroup, diffServMIBShapingRateGroup, diffServMIBAssuredRateGroup } -- The groups: -- diffServMIBCounterGroup -- diffServMIBHCCounterGroup -- diffServMIBVHCCounterGroup -- -- are mutually exclusive; at most one of these groups is implemented -- for a particular interface. When any of these groups is implemented -- for a particular interface, then ifCounterDiscontinuityGroup from -- [IFMIB] must also be implemented for that interface. --note-- Note that the diffServMIBStaticGroup is--mandatory for implementations -- that implement a--read-write or read-create mode. GROUP diffServMIBCounterGroup DESCRIPTION "This group is mandatory for table objects indexed by ifIndex for which the value of the corresponding instance of ifSpeed is less than or equal to 20,000,000 bits/second." GROUP diffServMIBHCCounterGroup DESCRIPTION "This group is mandatory for table objects indexed by ifIndex forBaker, Chan, Smith Expires September 2001 [Page 83] Internet Draft Differentiated Services MIB March 2001which the value of the corresponding instance of ifSpeed is greater than 20,000,000 bits/second." GROUP diffServMIBVHCCounterGroup Baker, Chan, Smith Expires December 2001 [Page 90] Internet Draft Differentiated Services MIB May 2001 DESCRIPTION "This group is mandatory for table objects indexed by ifIndex for which the value of the corresponding instance of ifSpeed is greater than 650,000,000 bits/second." GROUP diffServMIBMeterGroup DESCRIPTION "This group is mandatory for devices that implement metering functions." GROUP diffServMIBTBParamGroup DESCRIPTION "This group is mandatory for devices that implement token-bucket metering functions." GROUP diffServMIBDscpMarkActGroup DESCRIPTION "This group is mandatory for devices that implement DSCP-Marking functions." GROUP diffServMIBRandomDropGroup DESCRIPTION "This group is mandatory for devices that implement Random Drop functions." GROUP diffServMIBStaticGroup DESCRIPTION "This group is mandatory for devices that allow creation of rows in any of the writable tables of this MIB." OBJECTdiffServClfrStatusdiffServDataPathStart MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServClfrElementPrecedencediffServDataPathStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServClfrElementNextdiffServClfrDataPathStart MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECT diffServClfrStatus MIN-ACCESS read-only Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page84]91] Internet Draft Differentiated Services MIBMarchMay 2001 DESCRIPTION "Write access is not required." OBJECTdiffServClfrElementSpecificdiffServClfrElementPrecedence MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServClfrElementStatusdiffServClfrElementNext MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrDstAddrTypediffServClfrElementSpecific MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrDstAddrdiffServClfrElementStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrDstPrefixLengthdiffServSixTupleClfrDstAddrType MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrSrcAddrTypediffServSixTupleClfrDstAddr MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrSrcAddrdiffServSixTupleClfrDstPrefixLength MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrSrcPrefixLengthdiffServSixTupleClfrSrcAddrType MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrDscpdiffServSixTupleClfrSrcAddr MIN-ACCESS read-only DESCRIPTION "Write access is not required." Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page85]92] Internet Draft Differentiated Services MIBMarchMay 2001 OBJECTdiffServSixTupleClfrProtocoldiffServSixTupleClfrSrcPrefixLength MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrSrcL4PortMindiffServSixTupleClfrDscp MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrSrcL4PortMaxdiffServSixTupleClfrProtocol MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECT diffServSixTupleClfrDstL4PortMin MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECT diffServSixTupleClfrDstL4PortMax MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSixTupleClfrStatusdiffServSixTupleClfrSrcL4PortMin MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServMeterSucceedNextdiffServSixTupleClfrSrcL4PortMax MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServMeterFailNextdiffServSixTupleClfrStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServMeterSpecificdiffServMeterSucceedNext MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServMeterStatusdiffServMeterFailNext MIN-ACCESS read-only Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page86]93] Internet Draft Differentiated Services MIBMarchMay 2001 DESCRIPTION "Write access is not required." OBJECTdiffServTBParamTypediffServMeterSpecific MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServTBParamRatediffServMeterStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServTBParamBurstSizediffServTBParamType MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServTBParamIntervaldiffServTBParamRate MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServTBParamStatusdiffServTBParamBurstSize MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServActionNextdiffServTBParamInterval MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServActionSpecificdiffServTBParamStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServActionTypediffServActionNext MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServActionStatusdiffServActionSpecific MIN-ACCESS read-only DESCRIPTION "Write access is not required." Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page87]94] Internet Draft Differentiated Services MIBMarchMay 2001 OBJECTdiffServCountActStatusdiffServActionStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServAlgDropTypediffServCountActStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServAlgDropNextdiffServAlgDropType MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServAlgDropQMeasurediffServAlgDropNext MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServAlgDropQThresholddiffServAlgDropQMeasure MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServAlgDropSpecificdiffServAlgDropQThreshold MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServAlgDropStatusdiffServAlgDropSpecific MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServRandomDropMinThreshBytesdiffServAlgDropStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServRandomDropMinThreshPktsdiffServRandomDropMinThreshBytes MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServRandomDropMaxThreshBytesdiffServRandomDropMinThreshPkts MIN-ACCESS read-only Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page88]95] Internet Draft Differentiated Services MIBMarchMay 2001 DESCRIPTION "Write access is not required." OBJECTdiffServRandomDropMaxThreshPktsdiffServRandomDropMaxThreshBytes MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServRandomDropProbMaxdiffServRandomDropMaxThreshPkts MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServRandomDropInvWeightdiffServRandomDropProbMax MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServRandomDropSamplingRatediffServRandomDropWeight MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServRandomDropStatusdiffServRandomDropSamplingRate MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServQNextdiffServRandomDropStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServQRatediffServQNext MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServQShaperdiffServQRate MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServQStatusdiffServQShaper MIN-ACCESS read-only DESCRIPTION "Write access is not required." Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page89]96] Internet Draft Differentiated Services MIBMarchMay 2001 OBJECTdiffServSchedulerNextdiffServQStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSchedulerMethoddiffServSchedulerNext MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSchedulerRatediffServSchedulerMethod MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSchedulerShaperdiffServSchedulerRate MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServSchedulerStatusdiffServSchedulerShaper MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServAssuredRatePrioritydiffServSchedulerStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServAssuredRateAbsdiffServAssuredRatePriority MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServAssuredRateReldiffServAssuredRateAbs MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECTdiffServShapingRateThresholddiffServAssuredRateRel MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECT diffServAssuredRateStatus MIN-ACCESS read-only Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page90]97] Internet Draft Differentiated Services MIBMarchMay 2001 DESCRIPTION "Write access is not required." OBJECT diffServShapingRateAbs MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECT diffServShapingRateRel MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECT diffServShapingRateThreshold MIN-ACCESS read-only DESCRIPTION "Write access is not required." OBJECT diffServShapingRateStatus MIN-ACCESS read-only DESCRIPTION "Write access is not required." ::= { diffServMIBCompliances 1 } Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page91]98] Internet Draft Differentiated Services MIBMarchMay 2001 diffServMIBDataPathGroup OBJECT-GROUP OBJECTS { diffServDataPathStart, diffServDataPathStatus } STATUS current DESCRIPTION "The Data Path Group defines the MIB Objects that describe a functional data path." ::= { diffServMIBGroups 1 } diffServMIBClfrGroup OBJECT-GROUP OBJECTS { diffServClfrDataPathStart, diffServClfrStatus } STATUS current DESCRIPTION "The Classifier Group defines the MIB Objects that describea generic classifier."the list the starts of individual classifiers." ::= { diffServMIBGroups 2 } diffServMIBClfrElementGroup OBJECT-GROUP OBJECTS { diffServClfrElementPrecedence, diffServClfrElementNext, diffServClfrElementSpecific, diffServClfrElementStatus } STATUS current DESCRIPTION "The Classifier Element Group defines the MIB Objects that describe the classifier elements that make up a generic classifier." ::= { diffServMIBGroups 3 } diffServMIBSixTupleClfrGroup OBJECT-GROUP OBJECTS { diffServSixTupleClfrDstAddrType, diffServSixTupleClfrDstAddr, diffServSixTupleClfrDstPrefixLength, diffServSixTupleClfrSrcAddrType, diffServSixTupleClfrSrcAddr, diffServSixTupleClfrSrcPrefixLength, diffServSixTupleClfrDscp, diffServSixTupleClfrProtocol, diffServSixTupleClfrDstL4PortMin, diffServSixTupleClfrDstL4PortMax, diffServSixTupleClfrSrcL4PortMin, diffServSixTupleClfrSrcL4PortMax, diffServSixTupleClfrStatus } STATUS current DESCRIPTION "TheSix-tupleSix-Tuple Classifier Group defines the MIB Objects that describe a classifier element for matching on 6 fields of an IP and upper-layer protocol header." Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page92]99] Internet Draft Differentiated Services MIBMarchMay 2001 ::= { diffServMIBGroups 4 } diffServMIBMeterGroup OBJECT-GROUP OBJECTS { diffServMeterSucceedNext, diffServMeterFailNext, diffServMeterSpecific, diffServMeterStatus } STATUS current DESCRIPTION "The Meter Group defines the objects used in describing a generic meter element." ::= { diffServMIBGroups 5 } diffServMIBTBParamGroup OBJECT-GROUP OBJECTS { diffServTBParamType, diffServTBParamRate, diffServTBParamBurstSize, diffServTBParamInterval, diffServTBParamStatus } STATUS current DESCRIPTION "The Token-Bucket Meter Group defines the objects used in describing a token bucket meter element." ::= { diffServMIBGroups 6 } diffServMIBActionGroup OBJECT-GROUP OBJECTS { diffServActionNext, diffServActionSpecific,diffServActionType,diffServActionStatus } STATUS current DESCRIPTION "The Action Group defines the objects used in describing a generic action element." ::= { diffServMIBGroups 7 } diffServMIBDscpMarkActGroup OBJECT-GROUP OBJECTS { diffServDscpMarkActDscp } STATUS current DESCRIPTION "The DSCP Mark Action Group defines the objects used in describing a DSCP Marking Action element." ::= { diffServMIBGroups 8 } diffServMIBCounterGroup OBJECT-GROUP OBJECTS { Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page93]100] Internet Draft Differentiated Services MIBMarchMay 2001OBJECTS {diffServCountActOctets, diffServCountActPkts, diffServCountActDiscontTime, diffServCountActStatus, diffServAlgDropOctets, diffServAlgDropPkts } STATUS current DESCRIPTION "A collection of objects providing information specific to non- high speed(non-high(non- high speed interfaces transmit and receive at speeds less than or equal to 20,000,000 bits/second) packet- oriented network interfaces." ::= { diffServMIBGroups 9 } diffServMIBHCCounterGroup OBJECT-GROUP OBJECTS { diffServCountActOctets, diffServCountActHCOctets, diffServCountActPkts, diffServCountActDiscontTime, diffServCountActStatus, diffServAlgDropOctets, diffServAlgDropHCOctets, diffServAlgDropPkts } STATUS current DESCRIPTION "A collection of objects providing information specific to high speed (high speed interfaces transmit and receive at speeds greater than 20,000,000 but less than or equals to 650,000,000 bits/second) packet-oriented network interfaces." ::= { diffServMIBGroups 10 } diffServMIBVHCCounterGroup OBJECT-GROUP OBJECTS { diffServCountActOctets, diffServCountActHCOctets, diffServCountActPkts, diffServCountActHCPkts, diffServCountActDiscontTime, diffServCountActStatus, diffServAlgDropOctets, diffServAlgDropHCOctets, diffServAlgDropPkts, diffServAlgDropHCPkts } STATUS current DESCRIPTION "A collection of objects providing information specific to very- high speed (very-high speed interfaces transmit and receive at speeds greater than 650,000,000 bits/second) packet-oriented network interfaces." ::= { diffServMIBGroups 11 } diffServMIBAlgDropGroup OBJECT-GROUP OBJECTS { diffServAlgDropType, diffServAlgDropNext, diffServAlgDropDiscontinuityTime, Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page94]101] Internet Draft Differentiated Services MIBMarchMay 2001 diffServAlgDropQMeasure, diffServAlgDropQThreshold, diffServAlgDropSpecific, diffServAlgDropStatus } STATUS current DESCRIPTION "The Algorithmic Drop Group contains the objects that describe algorithmic dropper operation and configuration." ::= { diffServMIBGroups 12 } diffServMIBRandomDropGroup OBJECT-GROUP OBJECTS { diffServRandomDropMinThreshBytes, diffServRandomDropMinThreshPkts, diffServRandomDropMaxThreshBytes, diffServRandomDropMaxThreshPkts, diffServRandomDropProbMax,diffServRandomDropInvWeight,diffServRandomDropWeight, diffServRandomDropSamplingRate, diffServRandomDropStatus } STATUS current DESCRIPTION "The Random Drop Group augments the Algorithmic Drop Group for random dropper operation and configuration." ::= { diffServMIBGroups 13 } diffServMIBQGroup OBJECT-GROUP OBJECTS { diffServQNext, diffServQRate, diffServQShaper, diffServQStatus } STATUS current DESCRIPTION "The Queue Group contains the objects that describe an interface's queues." ::= { diffServMIBGroups 14 } diffServMIBSchedulerGroup OBJECT-GROUP OBJECTS { diffServSchedulerNext, diffServSchedulerMethod, diffServSchedulerRate, diffServSchedulerShaper, diffServSchedulerStatus } STATUS current DESCRIPTION "The Scheduler Group contains the objects that describe packetschedulers on interfaces."Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page95]102] Internet Draft Differentiated Services MIBMarchMay 2001 schedulers on interfaces." ::= { diffServMIBGroups 15 } diffServMIBAssuredRateGroup OBJECT-GROUP OBJECTS { diffServAssuredRatePriority, diffServAssuredRateAbs, diffServAssuredRateRel,diffServShapingRateThreshold,diffServAssuredRateStatus } STATUS current DESCRIPTION "The Scheduler Parameter Group contains the objects that describe packet schedulers' parameters on interfaces." ::= { diffServMIBGroups 16 } diffServMIBShapingRateGroup OBJECT-GROUP OBJECTS { diffServShapingRateAbs, diffServShapingRateRel, diffServShapingRateThreshold, diffServShapingRateStatus } STATUS current DESCRIPTION "The Scheduler Parameter Group contains the objects that describe packet schedulers' parameters on interfaces." ::= { diffServMIBGroups 17 } diffServMIBStaticGroup OBJECT-GROUP OBJECTS { diffServClfrNextFree, diffServClfrElementNextFree, diffServSixTupleClfrNextFree, diffServMeterNextFree, diffServTBParamNextFree, diffServActionNextFree, diffServCountActNextFree, diffServAlgDropNextFree, diffServRandomDropNextFree, diffServQNextFree, diffServSchedulerNextFree, diffServAssuredRateNextFree, diffServShapingRateNextFree } STATUS current DESCRIPTION "The Static Group contains readable scalar objects used in creating unique identifiers for classifiers, meters, actions and queues. These are required whenever row creation operations on such tables are supported." ::= { diffServMIBGroups 18 } END Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page96]103] Internet Draft Differentiated Services MIBMarchMay 20018.7. Acknowledgments This MIB builds on all the work that has gone into the Informal Management Model forDiffservDifferentiated Services Routers,DiffservDifferentiated Services PIB, andDiffservDifferentiated Services Policy MIB (SNMPCONF WG). It has been developed with the active involvement of many people, but most notably Yoram Bernet, Steve Blake, Brian Carpenter, Dave Durham, Michael Fine, Victor Firoiu, Jeremy Greene, Dan Grossman, Roch Guerin, Scott Hahn, Joel Halpern, Harrie Hazewinkel, Van Jacobsen, Keith McCloghrie, Bob Moore, Kathleen Nichols, Ping Pan, Nabil Seddigh, John Seligson, Walter Weiss, and Bert Wijnen.9.8. Security Considerations It is clear that this MIB is potentially useful for configuration, and anything that can be configured can be misconfigured, with potentially disastrous effect. At this writing, no security holes have been identified beyond those that SNMP Security is itself intended to address. These relate primarily to controlled access to sensitive information and the ability to configure a device - or which might result from operator error, which is beyond the scope of any security architecture. There area number ofmany read-write and read-create management objects defined in thisMIB that have a MAX-ACCESS clause of read-write and/or read-create.MIB. Such objectsmay be consideredare often sensitive or vulnerable in some network environments. The support for SET operations in a non-secure environment without proper protection can have a negative effect on network operations. The use of SNMP Version 3 is recommended over prior versions for configuration control as its security model is improved. There are a number of managed objects in this MIB that may contain information that may be sensitive from a business perspective, in that they may represent a customer's service contract or the filters that the service provider chooses to apply to a customer's ingress or egress traffic. There are no objects which are sensitive in their own right, such as passwords or monetary amounts. It may be important to control even GET access to these objects and possibly to even encrypt the values of these object when sending them over the network via SNMP. Not all versions of SNMP provide features for such a secure environment. SNMPv1 by itself is not a secure environment. Even if the network itself is secure (for example by using IPSec), even then, there is no control Baker, Chan, Smith Expires December 2001 [Page 104] Internet Draft Differentiated Services MIB May 2001 as to who on the secure network is allowed to access and GET/SETBaker, Chan, Smith Expires September 2001 [Page 97] Internet Draft Differentiated Services MIB March 2001(read/change/create/delete) the objects in this MIB. It is recommended that the implementers consider the security features as provided by the SNMPv3 framework. Specifically, the use of the User- based Security Model [12] and the View-based Access Control Model [15] is recommended. It is then a customer/user responsibility to ensure that the SNMP entity giving access to an instance of this MIB, is properly configured to give access to the objects only to those principals (users) that have legitimate rights to indeed GET or SET (change/create/delete) them.10.9. References [1] Harrington, D., Presuhn, R., and B. Wijnen, "An Architecture for Describing SNMP Management Frameworks", RFC 2571, Cabletron Systems, Inc., BMC Software, Inc., IBM T. J. Watson Research, April 1999 [2] Rose, M., and K. McCloghrie, "Structure and Identification of Management Information for TCP/IP-based Internets", RFC 1155, STD 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 [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 Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page98]105] Internet Draft Differentiated Services MIBMarchMay 2001 [8] Case, J., Fedor, M., Schoffstall, M., and J. Davin, "Simple Network Management Protocol", RFC 1157, STD 15, SNMP Research, Performance Systems International, Performance Systems International, MIT Laboratory for Computer Science, May 1990. [9] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Introduction to Community-based SNMPv2", RFC 1901, SNMP Research, Inc., Cisco Systems, Inc., Dover Beach Consulting, Inc., International Network Services, January 1996. [10] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Transport Mappings for Version 2 of the Simple Network Management Protocol (SNMPv2)", RFC 1906, SNMP Research, Inc., Cisco Systems, Inc., Dover Beach Consulting, Inc., International Network Services, January 1996. [11] Case, J., Harrington D., Presuhn R., and B. Wijnen, "Message Processing and Dispatching for the Simple Network Management Protocol (SNMP)", RFC 2572, SNMP Research, Inc., Cabletron Systems, 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", 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 Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page99]106] Internet Draft Differentiated Services MIBMarchMay 2001 Congestion Control", March 2000, In IEEE Infocom 2000, http://www.ieee-infocom.org/2000/papers/405.pdf [AQMROUTER] V.Misra, W.Gong, D.Towsley "Fuid-based analysis of a network of AQM routers supporting TCP flows with an application to RED", In SIGCOMM 2000, http://www.acm.org/sigcomm/sigcomm2000/conf/paper/sigcomm2000-4- 3.ps.gz [AF-PHB] J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, "Assured Forwarding PHB Group.", RFC 2597, June 1999. [DSARCH] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, "An Architecture for Differentiated Service", RFC 2475, December 1998. [DSFIELD] K. Nichols, S. Blake, F. Baker, D. Black, "Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers", RFC 2474, December 1998. [DSPIB] M. Fine, K. McCloghrie, J. Seligson, K. Chan, S. Hahn, A. Smith, "Differentiated Services Policy Information Base", Internet Draft<draft-ietf-diffserv-pib-00.txt>,<draft-ietf-Differentiated Services-pib-00.txt>, March 2000 [DSTERMS] D. Grossman, "New Terminology forDiffserv",Differentiated Services", Internet Draft<draft-ietf-diffserv-new-terms-02.txt>,<draft-ietf-Differentiated Services-new-terms- 02.txt>, November 1999. [EF-PHB] V. Jacobson, K. Nichols, K. Poduri, "An Expedited Forwarding PHB." RFC 2598, June 1999. [IFMIB] K. McCloghrie, F. Kastenholz, "The Interfaces Group MIB using SMIv2", RFC 2233, November 1997. [INETADDRESS] Daniele, M., Haberman, B., Routhier, S., Schoenwaelder, J., "Textual Conventions for Internet Network Addresses.", draft-ietf- ops-rfc2851-update-00.txt. [PRIVATE NOTE TO RFC EDITOR: YES, THIS IS INDEED A NORMATIVE REFERENCE. JUERGEN TELLS ME THAT HE WILL PUBLISH IT POSTE HASTE]. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page100]107] Internet Draft Differentiated Services MIBMarchMay 2001 [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 forDiffservDifferentiated Services Routers", Internet Draft<draft-ietf-diffserv- model-04.txt>,<draft- ietf-Differentiated Services-model-04.txt>, July 2000. [POLTERM] F. Reichmeyer, D. Grossman, J. Strassner, M. Condell, "A Common Terminology for Policy Management", Internet Draft <draft- 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. [SRTCM] J. Heinanen, R. Guerin, "A Single Rate Three Color Marker", RFC 2697, September 1999. [TRTCM] J. Heinanen, R. Guerin, "A Two Rate Three Color Marker", RFC 2698, September 1999. [TSWTCM] W. Fang, N. Seddigh, B. Nandy "A Time Sliding Window Three Colour Marker", RFC 2859, June 2000. [SHAPER] "A Rate Adaptive Shaper for Differentiated Services" FC 2963, October 2000.11.10. Authors' Addresses Fred Baker Cisco Systems 519 Lado Drive Santa Barbara, California 93111 fred@cisco.com Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page101]108] Internet Draft Differentiated Services MIBMarchMay 2001 Kwok Ho Chan Nortel Networks 600 Technology Park Drive Billerica, MA 01821 khchan@nortelnetworks.com Andrew Smith Allegro Networks 6399 San Ignacio Ave San Jose, CA 95119 andrew@allegronetworks.com Table of Contents 1 The SNMP Management Framework ................................... 2 2Introduction ....................................................Relationship to other working group documents ................... 3 2.1 Relationship to the Informal Management Model forDiffservDifferentiated Services Router...................................................................................... 3 2.2 Relationship to other MIBs and Policy Management .............. 42.33 MIB Overview...................................................................................................... 43 Structure of this MIB ........................................... 53.1Diffserv Data Paths ........................................... 6Processing Path ............................................... 5 3.1.1 diffServDataPathTable - The Data Path Table.............................................................. 6 3.2Classifiers ...................................................Classifier .................................................... 6 3.2.1Classifier Table ............................................ 8 3.2.2diffServClfrElementTable - The Classifier Element Table.................................... 8 3.2.3 Filter Table..... 7 3.2.2 diffServSixTupleClfrTable -IPThe Six-Tuple Classifier Table.............................................................................. 8 3.3Meters ........................................................ 8Metering Traffic .............................................. 9 3.3.1 diffServMeterTable - The Meter Table................................................. 9........................ 10 3.3.2Token-Bucket MeterdiffServTBParamTable - The Token Bucket Parameters Table.................................... 9.............................................................. 10 3.4 Actions....................................................... 9applied to packets .................................... 11 3.4.1DSCP MarkdiffServActionTable - The Action Table...................................... 10...................... 12 3.4.2 diffServCountActTable - The Count Action Table.......................................... 10 3.4.3 Absolute.............. 12 3.4.3 diffServDscpMarkActTable - The Mark Action Table ............ 13 3.4.4 diffServAlgDropTable - The Algorithmic DropAction ........................................ 10Table ........... 13 3.4.5 diffServRandomDropTable - The Random Drop Parameters Table .............................................................. 14 3.5 QueuingElements .............................................. 10and Scheduling of Packets ............................. 16 3.5.1Algorithmic DropperdiffServQTable - The Class or Queue Table................................... 10................... 16 3.5.2Random DropperdiffServSchedulerTable - The Scheduler Table........................................ 12................ 17 3.5.3Queues and Schedulers ....................................... 13 4 MIB Usage Example ............................................... 15 4.1 Model's Example ............................................... 15 4.2 Additional Data Path Example ..................................diffServAssuredRateTable - The Assured Rate Table ........... 17 3.5.4 diffServShapingRateTable - The Shaping Rate Table ........... 184.2.1 Data Path3.5.5 Using queues andClassifier Example Discussion .................schedulers together ........................ 184.2.2 Meter and Action3.6 ExampleDiscussion .........................configuration for AF and EF ........................... 214.2.3 Queue3.6.1 AF andScheduler Example Discussion ......................EF Ingress Interface Configuration ................... 2153.6.1.1 Classification In The Example ............................. 23 Baker, Chan, Smith Expires December 2001 [Page 109] Internet Draft Differentiated Services MIB May 2001 3.6.1.2 AF Implementation On an Ingress Edge Interface ............ 24 3.6.1.2.1 AF Metering On an Ingress Edge Interface ................ 24 3.6.1.2.2 AF Actions On an Ingress Edge Interface ................. 24 3.6.1.3 EF Implementation On an Ingress Edge Interface ............ 25 3.6.1.3.1 EF Metering On an Ingress Edge Interface ................ 25 3.6.1.3.2 EF Actions On an Ingress Edge Interface ................. 25 3.7 AF and EF Egress Edge Interface Configuration ................. 25 3.7.1 Classification On an Egress Edge Interface .................. 25 3.7.2 AF Implementation On an Egress Edge Interface ............... 27 3.7.2.1 AF Metering On an Egress Edge Interface ................... 27 3.7.2.2 AF Actions On an Egress Edge Interface .................... 28 3.7.2.3 AF Rate-based Queuing On an Egress Edge Interface ......... 28 3.7.3 EF Implementation On an Egress Edge Interface ............... 28 3.7.3.1 EF Metering On an Egress Edge Interface ................... 29 3.7.3.2 EF Actions On an Egress Edge Interface .................... 29 3.7.3.3 EF Priority Queuing On an Egress Edge Interface ........... 29 4 Conventions used in this MIB ....................................22 5.129 4.1 The use of RowPointer to indicate data path linkage ...........22 Baker, Chan, Smith Expires September 2001 [Page 102] Internet Draft Differentiated Services MIB March 2001 5.229 4.2 The use of RowPointer to indicate parameters ..................23 5.330 4.3 Conceptual row creation and deletion ..........................23 631 5 Extending this MIB ..............................................24 731 6 MIB Definition ..................................................25 833 7 Acknowledgments .................................................97 9104 8 Security Considerations .........................................97 10104 9 References..................................................... 98 11...................................................... 105 10 Authors' Addresses .............................................101108 Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page103]110] Internet Draft Differentiated Services MIBMarchMay 200112.11. Full Copyright Copyright (C) The Internet Society (2000). All Rights Reserved. This document and translations of it may be copied and furnished to others, and derivative works that comment on or otherwise explain it or assist in its implementation may be prepared, copied, published and distributed, in whole or in part, without restriction of any kind, provided that the above copyright notice and this paragraph are included on all such copies and derivative works. However, this document itself may not be modified in any way, such as by removing the copyright notice or references to the Internet Society or other Internet organizations, except as needed for the purpose of developing Internet standards in which case the procedures for copyrights defined in the Internet Standards process must be followed, or as required to translate it into languages other than English. The limited permissions granted above are perpetual and will not be revoked by the Internet Society or its successors or assigns. This document and the information contained herein is provided on an "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Baker, Chan, Smith ExpiresSeptemberDecember 2001 [Page104]111] ----