idnits 2.17.1 draft-ietf-diffserv-mib-10.txt: Checking boilerplate required by RFC 5378 and the IETF Trust (see https://trustee.ietf.org/license-info): ---------------------------------------------------------------------------- ** Looks like you're using RFC 2026 boilerplate. This must be updated to follow RFC 3978/3979, as updated by RFC 4748. Checking nits according to https://www.ietf.org/id-info/1id-guidelines.txt: ---------------------------------------------------------------------------- ** The document seems to lack a 1id_guidelines paragraph about Internet-Drafts being working documents. ** The document seems to lack a 1id_guidelines paragraph about 6 months document validity -- however, there's a paragraph with a matching beginning. Boilerplate error? == No 'Intended status' indicated for this document; assuming Proposed Standard == The page length should not exceed 58 lines per page, but there was 111 longer pages, the longest (page 2) being 60 lines Checking nits according to https://www.ietf.org/id-info/checklist : ---------------------------------------------------------------------------- ** The document seems to lack an Introduction section. ** The document seems to lack an IANA Considerations section. (See Section 2.2 of https://www.ietf.org/id-info/checklist for how to handle the case when there are no actions for IANA.) ** The document seems to lack separate sections for Informative/Normative References. All references will be assumed normative when checking for downward references. ** There are 30 instances of too long lines in the document, the longest one being 13 characters in excess of 72. ** The abstract seems to contain references ([DSARCH], [MODEL]), which it shouldn't. Please replace those with straight textual mentions of the documents in question. Miscellaneous warnings: ---------------------------------------------------------------------------- == The copyright year in the RFC 3978 Section 5.4 Copyright Line does not match the current year == Line 4730 has weird spacing: '...ionship to t...' -- The document seems to lack a disclaimer for pre-RFC5378 work, but may have content which was first submitted before 10 November 2008. If you have contacted all the original authors and they are all willing to grant the BCP78 rights to the IETF Trust, then this is fine, and you can ignore this comment. If not, you may need to add the pre-RFC5378 disclaimer. (See the Legal Provisions document at https://trustee.ietf.org/license-info for more information.) -- The document date (June 2001) is 8343 days in the past. Is this intentional? Checking references for intended status: Proposed Standard ---------------------------------------------------------------------------- (See RFCs 3967 and 4897 for information about using normative references to lower-maturity documents in RFCs) == Unused Reference: 'AF-PHB' is defined on line 4632, but no explicit reference was found in the text == Unused Reference: 'DSFIELD' is defined on line 4640, but no explicit reference was found in the text == Unused Reference: 'DSPIB' is defined on line 4645, but no explicit reference was found in the text == Unused Reference: 'DSTERMS' is defined on line 4650, but no explicit reference was found in the text == Unused Reference: 'EF-PHB' is defined on line 4655, but no explicit reference was found in the text == Unused Reference: 'INETADDRESS' is defined on line 4663, but no explicit reference was found in the text == Unused Reference: 'INTSERVMIB' is defined on line 4670, but no explicit reference was found in the text == Unused Reference: 'POLTERM' is defined on line 4679, but no explicit reference was found in the text == Unused Reference: 'QUEUEMGMT' is defined on line 4684, but no explicit reference was found in the text == Unused Reference: 'TSWTCM' is defined on line 4699, but no explicit reference was found in the text == Unused Reference: 'SHAPER' is defined on line 4703, but no explicit reference was found in the text ** Obsolete normative reference: RFC 2571 (ref. '1') (Obsoleted by RFC 3411) ** Downref: Normative reference to an Informational RFC: RFC 1215 (ref. '4') ** Downref: Normative reference to an Historic RFC: RFC 1157 (ref. '8') ** Downref: Normative reference to an Historic RFC: RFC 1901 (ref. '9') ** Obsolete normative reference: RFC 1906 (ref. '10') (Obsoleted by RFC 3417) ** Obsolete normative reference: RFC 2572 (ref. '11') (Obsoleted by RFC 3412) ** Obsolete normative reference: RFC 2574 (ref. '12') (Obsoleted by RFC 3414) ** Obsolete normative reference: RFC 1905 (ref. '13') (Obsoleted by RFC 3416) ** Obsolete normative reference: RFC 2573 (ref. '14') (Obsoleted by RFC 3413) ** Obsolete normative reference: RFC 2575 (ref. '15') (Obsoleted by RFC 3415) ** Obsolete normative reference: RFC 2570 (ref. '16') (Obsoleted by RFC 3410) -- Possible downref: Non-RFC (?) normative reference: ref. 'ACTQMGMT' -- Possible downref: Non-RFC (?) normative reference: ref. 'AQMROUTER' ** Downref: Normative reference to an Informational RFC: RFC 2475 (ref. 'DSARCH') -- Possible downref: Non-RFC (?) normative reference: ref. 'DSPIB' -- Possible downref: Non-RFC (?) normative reference: ref. 'DSTERMS' ** Obsolete normative reference: RFC 2598 (ref. 'EF-PHB') (Obsoleted by RFC 3246) ** Obsolete normative reference: RFC 2233 (ref. 'IFMIB') (Obsoleted by RFC 2863) == Outdated reference: A later version (-06) exists of draft-ietf-ops-rfc2851-update-00 -- Possible downref: Non-RFC (?) normative reference: ref. 'MODEL' -- Possible downref: Non-RFC (?) normative reference: ref. 'POLTERM' ** Obsolete normative reference: RFC 2309 (ref. 'QUEUEMGMT') (Obsoleted by RFC 7567) -- Possible downref: Non-RFC (?) normative reference: ref. 'RED93' ** Downref: Normative reference to an Informational RFC: RFC 2697 (ref. 'SRTCM') ** Downref: Normative reference to an Informational RFC: RFC 2698 (ref. 'TRTCM') ** Downref: Normative reference to an Experimental RFC: RFC 2859 (ref. 'TSWTCM') -- Possible downref: Non-RFC (?) normative reference: ref. 'SHAPER' Summary: 26 errors (**), 0 flaws (~~), 16 warnings (==), 10 comments (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 2 Internet Engineering Task Force F. Baker 3 Diffserv Working Group Cisco Systems 4 INTERNET-DRAFT K. Chan 5 Expires December 2001 Nortel Networks 6 draft-ietf-diffserv-mib-10.txt A. Smith 7 Allegro Networks 8 June 2001 10 Management Information Base for the 11 Differentiated Services Architecture 13 Status of this Memo 15 This document is an Internet-Draft and is in full conformance with all 16 provisions of Section 10 of RFC 2026. Internet-Drafts are working 17 documents of the Internet Engineering Task Force (IETF), its areas, and 18 its working groups. Note that other groups may also distribute working 19 documents as Internet- Drafts. 21 Internet-Drafts are draft documents valid for a maximum of six months 22 and may be updated, replaced, or obsoleted by other documents at any 23 time. It is inappropriate to use Internet Drafts as reference material 24 or to cite them other than as "work in progress." 26 The list of current Internet-Drafts can be accessed at 27 http://www.ietf.org/ietf/1id-abstracts.txt. The list of Internet-Draft 28 Shadow Directories can be accessed at http://www.ietf.org/shadow.html. 30 This document is a product of the IETF's Differentiated Services Working 31 Group. Comments should be addressed to WG's mailing list at 32 Differentiated Services@ietf.org. The charter for Differentiated 33 Services may be found at 34 http://www.ietf.org/html.charters/Differentiated Services-charter.html 36 Copyright (C) The Internet Society (2000). All Rights Reserved. 37 Distribution of this memo is unlimited. 39 Abstract 41 This memo describes an SMIv2 MIB for a device implementing the 42 Differentiated Services Architecture [DSARCH], described in detail by 43 the Informal Management Model for Differentiated Services Routers 44 [MODEL]. 46 1. The SNMP Management Framework 48 The SNMP Management Framework presently consists of five major 49 components: 51 o An overall architecture, described in RFC 2571 [1]. 53 o Mechanisms for describing and naming objects and events for the 54 purpose of management. The first version of this Structure of 55 Management Information (SMI) is called SMIv1 and described in 56 RFC 1155 [2], RFC 1212 [3] and RFC 1215 [4]. The second 57 version, called SMIv2, is described in RFC 2578 [5], RFC 2579 58 [6] and RFC 2580 [7]. 60 o Message protocols for transferring management information. The 61 first version of the SNMP message protocol is called SNMPv1 and 62 described in RFC 1157 [8]. A second version of the SNMP message 63 protocol, which is not an Internet standards track protocol, is 64 called SNMPv2c and described in RFC 1901 [9] and RFC 1906 [10]. 65 The third version of the message protocol is called SNMPv3 and 66 described in RFC 1906 [10], RFC 2572 [11] and RFC 2574 [12]. 68 o Protocol operations for accessing management information. The 69 first set of protocol operations and associated PDU formats is 70 described in RFC 1157 [8]. A second set of protocol operations 71 and associated PDU formats is described in RFC 1905 [13]. 73 o A set of fundamental applications described in RFC 2573 [14] and 74 the view-based access control mechanism described in RFC 2575 75 [15]. 77 A more detailed introduction to the current SNMP Management Framework 78 can be found in RFC 2570 [16]. 80 Managed objects are accessed via a virtual information store, termed the 81 Management Information Base or MIB. Objects in the MIB are defined using 82 the mechanisms defined in the SMI. 84 This memo specifies a MIB module that is compliant to the SMIv2. A MIB 85 conforming to the SMIv1 can be produced through the appropriate 86 translations. The resulting translated MIB must be semantically 87 equivalent, except where objects or events are omitted because no 88 translation is possible (use of Counter64). Some machine-readable 89 information in SMIv2 will be converted into textual descriptions in 90 SMIv1 during the translation process. However, this loss of machine 91 readable information is not considered to change the semantics of the 92 MIB. 94 2. Relationship to other working group documents 96 The working group and related working groups developed other documents, 97 notably the Informal Management Model and the policy configuration 98 paradigm of SNMPCONF. The relationship between the MIB and those 99 documents is clarified here. 101 2.1. Relationship to the Informal Management Model for Differentiated 102 Services Router 104 This MIB is similar in design to [MODEL], although it can be used to 105 build functional data paths that the model would not well describe. The 106 model conceptually describes ingress and egress interfaces of an n-port 107 router, which may find some interfaces at a network edge and others 108 facing into the network core. It describes the configuration and 109 management of a Differentiated Services interface in terms of one or 110 more Traffic Conditioning Block (TCB), each containing, arranged in the 111 specified order, by definition, zero or more classifiers, meters, 112 actions, algorithmic droppers, queues and schedulers. Traffic may be 113 classified, and classified traffic may be metered. Each stream of 114 traffic identified by a combination of classifiers and meters may have 115 some set of actions performed on it; it may have dropping algorithms 116 applied and it may ultimately be stored into a queue before being 117 scheduled out to its next destination, either onto a link or to another 118 TCB. At times, the treatment for a given packet must have any of those 119 elements repeated. [MODEL] models this by cascading multiple TCBs, 120 while this MIB describes the policy by directly linking the functional 121 data path elements. 123 The MIB represents this cascade by following the "Next" attributes of 124 the various elements. They indicate what the next step in 125 Differentiated Services processing will be, whether it be a classifier, 126 meter, action, algorithmic dropper, queue, scheduler or a decision to 127 now forward a packet. 129 The higher level concept of a TCB is not required in the 130 parameterization or in the linking together of the individual elements, 131 hence it is not used in the MIB itself and is only mentioned in the text 132 for relating the MIB with the [MODEL]. Rather, the MIB models the 133 individual elements that make up the TCBs. 135 This MIB uses the notion of a Data Path to indicate the Differentiated 136 Services processing a packet may experience. The Data Path a packet 137 will initially follow is an attribute of the interface in question. The 138 Data Path Start Table provides a starting point for each direction 139 (ingress or egress) on each interface. A Data Path Table Entry 140 indicates the first of possibly multiple elements that will apply 141 Differentiated Services treatment to the packet. 143 2.2. Relationship to other MIBs and Policy Management 145 This MIB provides for direct reporting and manipulation of detailed 146 functional elements. These elements consist of a structural element and 147 one or more parameter-bearing elements. While this can be cumbersome, 148 it allows the reuse of parameters. For example, a service provider may 149 offer three varieties of contracts, and configure three parameter 150 elements. Each such data path on the system may then refer to these 151 sets of parameters. The diffServDataPathTable couples each direction on 152 each interface with the specified data path linkage. The concept of 153 "interface" is as defined by InterfaceIndex/ifIndex of the IETF 154 Interfaces MIB [IFMIB]. 156 Other MIBs and data structure definitions for policy management 157 mechanisms other than SNMP/SMIv2 are likely to exist in the future for 158 the purposes of abstracting the model in other ways. 160 In particular, abstractions in the direction of less detailed 161 definitions of Differentiated Services functionality are likely e.g. 162 some form of "Per-Hop Behavior"-based definition involving a template of 163 detailed object values which is applied to specific instances of objects 164 in this MIB semi-automatically. 166 Another possible direction of abstraction is one using a concept of 167 "roles" (often, but not always, applied to interfaces). In this case, 168 it may be possible to re-use the object definitions in this MIB, 169 especially the parameterization tables. The Data Path table will help 170 in the reuse of the data path linkage tables by having the interface 171 specific information centralized, allowing easier mechanical replacement 172 of ifIndex by some sort of "roleIndex". This work is ongoing. 174 3. MIB Overview 176 The Differentiated Services Architecture does not specify how an 177 implementation should be assembled. The [MODEL] describes a general 178 approach to implementation design, or to user interface design. Its 179 components could, however, be assembled in a different way. Traffic 180 conforming to a meter might be run through a second meter, for example, 181 or reclassified. 183 This MIB models the same functional data path elements, allowing the 184 network manager to assemble them in any fashion that meets the relevant 185 policy. These data path elements include Classifiers, Meters, Actions 186 of various sorts, Queues, and Schedulers. 188 In many of these tables, a distinction is drawn between the structure of 189 the policy (do this, then do that) and the parameters applied to 190 specific policy elements. This is to facilitate configuration, if the 191 MIB is used for that. The concept is that a set of parameters, such as 192 the values that describe a specific token bucket, might be configured 193 once and applied to many interfaces. 195 The RowPointer Textual Convention is therefore used in two ways in this 196 MIB. It is defined for the purpose of connecting an object to an entry 197 dynamically; the RowPointer object identifies the first object in the 198 target Entry, and in so doing points to the entire entry. In this MIB, 199 it is used as a connector between successive functional data path 200 elements, and as the link between the policy structure and the 201 parameters that are used. When used as a connector, it says what 202 happens "next"; what happens to classified traffic, to traffic 203 conforming or not conforming to a meter, and so on. When used to 204 indicate the parameters applied in a policy, it says "specifically" what 205 is meant; the structure points to the parameters of its policy. 207 The use of RowPointers as connectors allows for the simple extension of 208 the MIB. The RowPointers, whether "next" or "specific", may point to 209 Entries defined in other MIB modules. For example, the only type of 210 meter defined in this MIB is a token bucket meter; if another type of 211 meter is required, a proprietary MIB or another standard MIB could be 212 defined describing that type of meter, and diffServMeterSpecific could 213 point to it. Similarly, if a new action is required, the "next" pointer 214 of the previous functional datapath element could point to an Entry 215 defined in a proprietary MIB or one defined in another standard. 217 3.1. Processing Path 219 An interface has an ingress and an egress direction, and will generally 220 have a different policy in each direction. As traffic enters an edge 221 interface, it may be classified, metered, counted, and marked. Traffic 222 leaving the same interface might be remarked according to the contract 223 with the next network, queued to manage the bandwidth, and so on. As 224 [MODEL] points out, the functional datapath elements used on ingress and 225 egress are of the same type, but may be structured in very different 226 ways to implement the relevant policies. 228 3.1.1. diffServDataPathTable - The Data Path Table 230 Therefore, when traffic arrives at an ingress or egress interface, the 231 first step in applying the policy is determining what policy applies. 232 This MIB does that by providing a table of pointers to the first 233 functional data path element, indexed by interface and direction on that 234 interface. The content of the diffServDataPathEntry is a single 235 RowPointer, which points to that functional data path element. 237 When diffServDataPathStart in a direction on an interface is undefined 238 or is set to zeroDotZero, the implication is that there is no specific 239 policy to apply; the manufacturer's default is used. 241 3.2. Classifier 243 Classifiers are used to differentiate among types of traffic. In the 244 Differentiated Services architecture, one usually discusses a behavior 245 aggregate identified by the application of one or more Differentiated 246 Services Code Points (DSCPs). However, especially at network edges 247 (which include hosts and first hop routers serving hosts), traffic may 248 arrive unmarked or the marks may not be trusted. In these cases, one 249 applies a Multi-Field Classifier, which may select an aggregate as 250 coarse as "all traffic", as fine as a specific microflow identified by 251 IP Addresses, IP Protocol, and TCP/UDP ports, or variety of slice in 252 between. 254 Classifiers can be simple or complex. In a core interface, one would 255 expect to find simple behavior aggregate classification to be used. 256 However, in an edge interface, one might first ask what application is 257 being used, meter the arriving traffic, and then apply various policies 258 to the non-conforming traffic depending on the Autonomous System number 259 advertising the destination address. To accomplish such a thing, 260 traffic must be classified, metered, and then reclassified. To this 261 end, the MIB defines separate classifiers, which may be applied at any 262 point in processing, and may have different content as needed. 264 The MIB also allows for ambiguous classification in a structured 265 fashion. In the end, traffic classification must be unambiguous; we 266 must know for certain what policy to apply to any given packet. 267 However, writing an unambiguous specification is often tedious, while 268 writing a specification in steps that permits and excludes various kinds 269 of traffic may be simpler and more intuitive. In such a case, the 270 classification "steps" are enumerated; all classification elements of 271 one precedence are applied as if in parallel, and then all 272 classification elements of the next precedence. 274 This MIB defines a single classifier parameter entry, the Six-Tuple 275 Classifier. A degenerate case of this multi-field classifier is a 276 Behavior Aggregate classifier. Other classifiers may be defined in 277 other MIB modules, to select traffic from a given layer two neighbor or 278 a given interface, traffic whose addresses belong to a given BGP 279 Community or Autonomous System, and so on. 281 3.2.1. diffServClfrElementTable - The Classifier Element Table 283 A classifier consists of classifier elements. A classifier element 284 identifies a specific set of traffic that forms part of a behavior 285 aggregate; other classifier elements within the same classifier may 286 identify other traffic that also falls into the behavior aggregate. For 287 example, in identifying AF traffic for the aggregate AF1, one might 288 implement separate classifier elements for AF11, AF12, and AF13 within 289 the same classifier and pointing to the same subsequent meter. 291 Generally, one would expect Data Path Entry to point to a classifier 292 (which is to say, the first of a set of one or more classifier 293 elements), although it may point to something else when appropriate. 294 Reclassification in a functional data path is achieved by pointing to 295 another Classifier Entry when appropriate. 297 A classifier element is a structural element, indexed by classifier ID 298 and element ID. It has a precedence value, allowing for structured 299 ambiguity as described above, a "specific" pointer that identifies what 300 rule is to be applied, and a "next" pointer directing traffic matching 301 the classifier to the next functional data path element. If the "next" 302 pointer is zeroDotZero, the indication is that there is no further 303 differentiated services processing for this behavior aggregate. If the 304 "specific" pointer is zeroDotZero, however, the device is misconfigured. 305 In such a case, the classifier element should be operationally treated 306 as if it were not present. 308 When the MIB is used for configuration, diffServClfrNextFree always 309 contains a legal value for diffServClfrId that is not currently used in 310 the system's configuration. The Network Management Application reads 311 the variable and uses the value read in a create-and-go or a create- 312 and-wait SET. When the SET is performed, the agent must determine 313 whether the value is indeed still unused; two network managers may 314 attempt to create a configuration entry simultaneously and use the same 315 value. If it is currently unused, the SET succeeds and the agent 316 changes the value of diffServClfrNextFree according to an agent-specific 317 algorithm. If the value is in use, however, the SET fails. The network 318 manager must re-read diffServClfrNextFree to obtain a useful value. 320 Likewise, when the MIB is used for configuration, 321 diffServClfrElementNextFree always contains a legal value for 322 diffServClfrElementClfrId that is not currently used in the system's 323 configuration. The Network Management Application reads the variable 324 and uses the value read in a create-and-go or a create-and-wait SET. 325 When the SET is performed, the agent must determine whether the value is 326 indeed still unused; two network managers may attempt to create a 327 configuration entry simultaneously and use the same value. If it is 328 currently unused, the SET succeeds and the agent changes the value of 329 diffServClfrElementNextFree according to an agent-specific algorithm. 330 If the value is in use, however, the SET fails. The network manager 331 must re-read diffServClfrElementNextFree to obtain a useful value. 333 3.2.2. diffServSixTupleClfrTable - The Six-Tuple Classifier Table 335 This MIB defines a single parameter type for classification, the Six- 336 Tuple Classifier. As a parameter, a filter may be specified once and 337 applied to many interfaces, using diffServClfrElementSpecific. This 338 classifier matches: 340 o IP source address prefix, including host, CIDR Prefix, and "any 341 source address" 343 o IP destination address prefix, including host, CIDR Prefix, and 344 "any destination address" 346 o IP protocol or "any" 348 o TCP/UDP/SCTP source port range, including "any" 350 o TCP/UDP/SCTP destination port range, including "any" 352 o Differentiated Services Code Point 354 In that ranges or "any" are defined in each case, clearly a wide variety 355 of filters can be constructed. The Differentiated Services Behavior 356 Aggregate filter is a special case of this filter. 358 Other MIB modules may define similar filters in the same way. For 359 example, a filter for Ethernet information might define source and 360 destination MAC addresses of "any", Ethernet Packet Type, IEEE 802.2 361 SAPs, and IEEE 802.1 priorities. A filter related to policy routing 362 might be structured like the diffServSixTupleClfrTable, but containing 363 the BGP Communities of the source and destination prefix rather than the 364 prefix itself, meaning "any prefix in this community". For such a 365 filter, a table similar to diffServSixTupleClfrTable is constructed, and 366 diffServClfrElementSpecific configured to point to it. 368 When the MIB is used for configuration, diffServSixTupleClfrNextFree 369 always contains a legal value for diffServSixTupleClfrId that is not 370 currently used in the system's configuration. The Network Management 371 Application reads the variable and uses the value read in a create- 372 and-go or a create-and-wait SET. When the SET is performed, the agent 373 must determine whether the value is indeed still unused; two network 374 managers may attempt to create a configuration entry simultaneously and 375 use the same value. If it is currently unused, the SET succeeds and the 376 agent changes the value of diffServSixTupleClfrNextFree according to an 377 agent-specific algorithm. If the value is in use, however, the SET 378 fails. The network manager must re-read diffServSixTupleClfrNextFree to 379 obtain a useful value. 381 3.3. Metering Traffic 383 As discussed in [MODEL], a "meter" and a "shaper" are functions that 384 operate on opposing ends of a link. A shaper schedules traffic for 385 transmission at specific times in order to approximate a particular line 386 speed or combination of line speeds. In its simplest form, if the 387 traffic stream contains constant sized packet, it might transmit one 388 packet per unit time to build the equivalent of a CBR circuit. However, 389 various factors intervene to make the approximation inexact; multiple 390 classes of traffic may occasionally schedule their traffic and the same 391 time, the variable length nature of IP traffic may introduce variation, 392 and factors in the link or physical layer may change traffic timing. A 393 "meter" integrates the arrival rate of traffic and determines whether 394 the shaper at the far end was correctly applied, or whether the behavior 395 of the application in question is naturally close enough to such 396 behavior to be acceptable under a given contract. 398 A common type of meter is a Token Bucket meter, such as [SRTCM] or 399 [TRTCM]. This type of meter assumes the use of a shaper at a previous 400 node; applications which send at a constant rate when sending may 401 conform if the token bucket is properly specified. It specifies the 402 acceptable arrival rate and quantifies the acceptable variability, often 403 by specifying a burst size or an interval; since rate = quantity/time, 404 specifying any two of those parameters implies the third, and a large 405 interval provides for a forgiving system. Multiple rates may be 406 specified, as in AF, such that a subset of the traffic (up to one rate) 407 is accepted with one set of guarantees, and traffic in excess of that 408 but below another rate has a different set of guarantees. Other types 409 of meters exist as well. 411 One use of a meter is when a service provider sells at most a certain 412 bit rate to one of its customers, and wants to drop the excess. In such 413 a case, the fractal nature of normal Internet traffic must be reflected 414 in large burst intervals, as TCP frequently sends packet pairs or larger 415 bursts, and responds poorly when more than one packet in a round trip 416 interval is dropped. Applications like FTP contain the effect by simply 417 staying below the target bit rate; this type of configuration very 418 adversely affects transaction applications like HTTP, however. Another 419 use of a meter is in the AF specification, in which excess traffic is 420 marked with a related DSCP and subjected to slightly more active queue 421 depth management. The application is not sharply limited to a 422 contracted rate in such a case, but can be readily contained should its 423 traffic create a burden. 425 3.3.1. diffServMeterTable - The Meter Table 427 The Meter Table is a structural table, specifying a specific functional 428 data path element. Its entry consists essentially of three RowPointers 429 - a "succeed" pointer, for traffic conforming to the meter, a "fail" 430 pointer, for traffic not conforming, and a "specific" pointer, to 431 identify the parameters in question. This structure is a bow to SNMP's 432 limitations; it would be better to have a structure with N rates and N+1 433 "next" pointers, with a single algorithm specified. In this case, 434 multiple meter entries connected by the "fail" link are understood to 435 contain the parameters for a specified algorithm, and traffic conforming 436 to a given rate follows their "succeed" paths. Within this MIB, only 437 Token Bucket parameters are specified; other varieties of meters may be 438 designed in other MIB modules. 440 When the MIB is used for configuration, diffServMeterNextFree always 441 contains a legal value for diffServMeterId that is not currently used in 442 the system's configuration. The Network Management Application reads 443 the variable and uses the value read in a create-and-go or a create- 444 and-wait SET. When the SET is performed, the agent must determine 445 whether the value is indeed still unused; two network managers may 446 attempt to create a configuration entry simultaneously and use the same 447 value. If it is currently unused, the SET succeeds and the agent 448 changes the value of diffServMeterNextFree according to an agent- 449 specific algorithm. If the value is in use, however, the SET fails. 450 The network manager must re-read diffServMeterNextFree to obtain a 451 useful value. 453 3.3.2. diffServTBParamTable - The Token Bucket Parameters Table 455 The Token Bucket Parameters Table is a set of parameters that define a 456 Token Bucket Meter. As a parameter, a token bucket may be specified 457 once and applied to many interfaces, using diffServMeterSpecific. 458 Specifically, several modes of [SRTCM] and [TRTCM] are addressed. Other 459 varieties of meters may be specified in other MIB modules. 461 In general, if a Token Bucket has N rates, it has N+1 potential outcomes 462 - the traffic stream is slower than and therefore conforms to all of the 463 rates, it fails the first few but is slower than and therefore conforms 464 to the higher rates, or it fails all of them. As such, multi-rate 465 meters should specify those rates in montonically increasing order, 466 passing through the diffServMeterFailNext from more committed to more 467 excess rates, and finally falling through diffServMeterFailNext to the 468 set of actions that apply to traffic which conforms to none of the 469 specified rates. DiffServTBParamType in the first entry indicates the 470 algorithm being used. At each rate, diffServTBParamRate is derivable 471 from diffServTBParamBurstSize and diffServTBParamInterval; a superior 472 implementation will allow the configuration of any two of 473 diffServTBParamRate, diffServTBParamBurstSize, and 474 diffServTBParamInterval, and respond "badValue" if all three are 475 specified but are not mathematically related. 477 When the MIB is used for configuration, diffServTBParamNextFree always 478 contains a legal value for diffServTBParamId that is not currently used 479 in the system's configuration. The Network Management Application reads 480 the variable and uses the value read in a create- and-go or a create- 481 and-wait SET. When the SET is performed, the agent must determine 482 whether the value is indeed still unused; two network managers may 483 attempt to create a configuration entry simultaneously and use the same 484 value. If it is currently unused, the SET succeeds and the agent 485 changes the value of diffServTBParamNextFree according to an agent- 486 specific algorithm. If the value is in use, however, the SET fails. 487 The network manager must re-read diffServTBParamNextFree to obtain a 488 useful value. 490 3.4. Actions applied to packets 492 "Actions" are the things a differentiated services interface PHB may do 493 to a packet in transit. At minimum, such a policy might calculate 494 statistics on traffic in various configured classes, mark it with a 495 DSCP, drop it, or enqueue it before passing it on for other processing. 497 Actions are composed of a structural element, the diffServActionTable, 498 and various component action entries that may be applied. In the case 499 of the Algorithmic Dropper, an additional parameter table may be 500 specified to control Active Queue Management, as defined in [RED93] and 501 other AQM specifications. 503 3.4.1. diffServActionTable - The Action Table 505 The action table identifies sequences of actions to be applied to a 506 packet. Successive actions are chained through diffServActionNext, 507 ultimately terminating in zeroDotZero (indicating that the policy is 508 complete), a pointer to a queue, or a pointer to some other functional 509 data path element. 511 When the MIB is used for configuration, diffServActionNextFree always 512 contains a legal value for diffServActionId that is not currently used 513 in the system's configuration. The Network Management Application reads 514 the variable and uses the value read in a create- and-go or a create- 515 and-wait SET. When the SET is performed, the agent must determine 516 whether the value is indeed still unused; two network managers may 517 attempt to create a configuration entry simultaneously and use the same 518 value. If it is currently unused, the SET succeeds and the agent 519 changes the value of diffServActionNextFree according to an agent- 520 specific algorithm. If the value is in use, however, the SET fails. 521 The network manager must re-read diffServActionNextFree to obtain a 522 useful value. 524 3.4.2. diffServCountActTable - The Count Action Table 526 The count action accumulates statistics pertaining to traffic passing 527 through a given path through the policy. It is intended to be useful 528 for usage-based billing, for statistical studies, or for analysis of the 529 behavior of a policy in a given network. The objects in the Count 530 Action are various counters and a discontinuity time. The counters 531 display the number of packets and bytes encountered on the path since 532 the discontinuity time. They share the same discontinuity time. 534 The designers of this MIB expect that every path through a policy should 535 have a corresponding counter. In early versions, it was impossible to 536 configure an action without implementing a counter, although the current 537 design makes them in effect the network manager's option, as a result of 538 making actions consistent in structure and extensible. The assurance of 539 proper debug and accounting is therefore left with the policy designer. 541 When the MIB is used for configuration, diffServCountActNextFree always 542 contains a legal value for diffServCountActId that is not currently used 543 in the system's configuration. The Network Management Application reads 544 the variable and uses the value read in a create- and-go or a create- 545 and-wait SET. When the SET is performed, the agent must determine 546 whether the value is indeed still unused; two network managers may 547 attempt to create a configuration entry simultaneously and use the same 548 value. If it is currently unused, the SET succeeds and the agent 549 changes the value of diffServCountActNextFree according to an agent- 550 specific algorithm. If the value is in use, however, the SET fails. 551 The network manager must re-read diffServCountActNextFree to obtain a 552 useful value. 554 3.4.3. diffServDscpMarkActTable - The Mark Action Table 556 The Mark Action table is an unusual table, both in SNMP and in this MIB. 557 I might be viewed not so much as an array of single-object entries as an 558 array of OBJECT-IDENTIFIER conventions, as the OID for a 559 diffServDscpMarkActDscp instance conveys all of the necessary 560 information: packets are to be marked with the requisite DSCP. 562 As such, contrary to common practice, the index for the table is read- 563 only, and is both the Entry's index and its only value. 565 3.4.4. diffServAlgDropTable - The Algorithmic Drop Table 567 The Algorithmic Drop Table identifies a dropping algorithm, drops 568 packets, and counts the drops. Classified as an action, it is in effect 569 a method which applies a packet to a queue, and may modify either. When 570 the algorithm is "always drop", this is simple; when the algorithm calls 571 for head-drop, tail-drop, or a variety of Active Queue Management, the 572 queue is inspected, and in the case of Active Queue Management, 573 additional parameters are required. 575 What may not be clear from the name is that an Algorithmic Drop action 576 often does not drop traffic. Algorithms other than "always drop" 577 normally drop a few percent of packets at most. The action inspects the 578 diffServQEntry that diffSeervAlgQMeasure points to in to determine 579 whether the packet should be dropped. 581 When the MIB is used for configuration, diffServAlgDropNextFree always 582 contains a legal value for diffServAlgDropId that is not currently used 583 in the system's configuration. The Network Management Application reads 584 the variable and uses the value read in a create- and-go or a create- 585 and-wait SET. When the SET is performed, the agent must determine 586 whether the value is indeed still unused; two network managers may 587 attempt to create a configuration entry simultaneously and use the same 588 value. If it is currently unused, the SET succeeds and the agent 589 changes the value of diffServAlgDropNextFree according to an agent- 590 specific algorithm. If the value is in use, however, the SET fails. 591 The network manager must re-read diffServAlgDropNextFree to obtain a 592 useful value. 594 3.4.5. diffServRandomDropTable - The Random Drop Parameters Table 596 The Random Drop Table is an extension of the Algorithmic Drop Table 597 intended for use on queues whose depth is actively managed. Active 598 Queue Management algorithms are typified by [RED93], but the parameters 599 they use vary. It was deemed for the purposes of this MIB that the 600 proper values to represent include: 602 o Target case mean queue depth, expressed in bytes or packets 604 o Worst case mean queue depth, expressed in bytes or packets 606 o Maximum drop rate expressed as drops per thousand 608 o Coefficient of an exponentially weighted moving average, 609 expressed as the numerator of a fraction whose denominator is 610 65536. 612 o Sampling rate 614 An example of the representation chosen in this MIB for this element is 615 shown in Figure 1. 617 Random droppers often have their drop probability function described as 618 a plot of drop probability (P) against averaged queue length (Q). 619 (Qmin,Pmin) then defines the start of the characteristic plot. Normally 620 Pmin=0, meaning with average queue length below Qmin, there will be no 621 drops. (Qmax,Pmax) defines a "knee" on the plot, after which point the 622 drop probability become more progressive (greater slope). (Qclip,1) 623 defines the queue length at which all packets will be dropped. Notice 624 this is different from Tail Drop because this uses an averaged queue 626 AlgDrop Queue 627 +-----------------+ +-------+ 628 --->| Next ---------+--+------------------->| Next -+--> ... 629 | QMeasure -------+--+ | ... | 630 | QThreshold | RandomDrop +-------+ 631 | Type=randomDrop | +----------------+ 632 | Specific -------+---->| MinThreshBytes | 633 +-----------------+ | MaxThreshBytes | 634 | ProbMax | 635 | Weight | 636 | SamplingRate | 637 +----------------+ 638 length, although it is possible for Qclip to equal Qmax. 640 In the MIB module, DiffServRandomDropMinThreshBytes and 641 DiffServRandomDropMinThreshPkts represent Qmin. 642 DiffServRandomDropMaxThreshBytes and DiffServRandomDropMaxThreshPkts 643 represent Qmax. DiffServAlgDropQThreshold represents Qclip. 644 DiffServRandomDropInvProbMax represents Pmax (inverse). This MIB does 645 not represent Pmin (assumed to be zero unless otherwise represented). 646 In addition, since message memory is finite, queues generally have some 647 upper bound above which they are incapable of storing additional 648 traffic. Normally this number is equal to Qclip, specified by 649 diffServAlgDropQThreshold. 651 Each random dropper specification is associated with a queue. This 652 allows multiple drop processes (of same or different types) to be 653 associated with the same queue, as different PHB implementations may 654 require. This also allows for sequences of multiple droppers if 655 necessary. 657 The calculation of a smoothed queue length may also have an important 658 bearing on the behavior of the dropper: parameters may include the 659 sampling interval or rate, and the weight of each sample. The 660 performance may be very sensitive to the values of these parameters and 661 a wide range of possible values may be required due to a wide range of 662 link speeds. Most algorithms include a sample weight, represented here 663 by DiffServRandomDropInvWeight. The availability of 664 DiffServRandomDropSamplingRate as readable is important, the information 665 provided by Sampling Rate is essential to the configuration of 666 DiffServRandomDropInvWeight. Having Sampling Rate be configurable is 667 also helpful, as line speed increases, the ability to have queue 668 sampling be less frequent than packet arrival is needed. Note, however, 669 that there is ongoing research on this topic, see e.g. [ACTQMGMT] and 670 [AQMROUTER]. 672 Additional parameters may be added in an enterprise MIB module, e.g. by 673 using AUGMENTS on this table, to handle aspects of random drop 674 algorithms that are not standardized here. 676 When the MIB is used for configuration, diffServRandomDropNextFree 677 always contains a legal value for diffServRandomDropId that is not 678 currently used in the system's configuration. The Network Management 679 Application reads the variable and uses the value read in a create- 680 and-go or a create-and-wait SET. When the SET is performed, the agent 681 must determine whether the value is indeed still unused; two network 682 managers may attempt to create a configuration entry simultaneously and 683 use the same value. If it is currently unused, the SET succeeds and the 684 agent changes the value of diffServRandomDropNextFree according to an 685 agent-specific algorithm. If the value is in use, however, the SET 686 fails. The network manager must re-read diffServRandomDropNextFree to 687 obtain a useful value. 689 3.5. Queuing and Scheduling of Packets 691 These include Queues and Schedulers, which are inter-related in their 692 use of queuing techniques. By doing so, it is possible to build multi- 693 level schedulers, such as those which treat a set of queues as having 694 priority among them, and at a specific priority find a secondary WFQ 695 scheduler with some number of queues. 697 3.5.1. diffServQTable - The Class or Queue Table 699 The Queue Table models simple FIFO queues. The Scheduler Table allows 700 flexibility in constructing both simple and somewhat more complex 701 queuing hierarchies from those queues. 703 Queue Table entries are pointed at by the "next" attributes of the 704 upstream elements, such as DiffServMeterSucceedNext or 705 diffServActionNext. Note that multiple upstream elements may direct 706 their traffic to the same Queue Table entry. For example, the Assured 707 Forwarding PHB suggests that all traffic marked AF11, AF12 or AF13 be 708 placed in the same queue, after metering, without reordering. To 709 accomplish that, the upstream diffServAlgDropNext pointers each point to 710 the same diffServQEntry. 712 A common requirement of a queue is that its traffic enjoy a certain 713 minimum or maximum rate, or that it be given a certain priority. 714 Functionally, the selection of such is a function of a scheduler, as in 715 Section .sh 4 "The parameter is associated with the queue, however, 716 using the Assured or Shaping Rate Parameters Table. 718 When the MIB is used for configuration, diffServQNextFree always 719 contains a legal value for diffServQId that is not currently used in the 720 system's configuration. The Network Management Application reads the 721 variable and uses the value read in a create-and-go or a create- and- 722 wait SET. When the SET is performed, the agent must determine whether 723 the value is indeed still unused; two network managers may attempt to 724 create a configuration entry simultaneously and use the same value. If 725 it is currently unused, the SET succeeds and the agent changes the value 726 of diffServQNextFree according to an agent- specific algorithm. If the 727 value is in use, however, the SET fails. The network manager must re- 728 read diffServQNextFree to obtain a useful value. 730 3.5.2. diffServSchedulerTable - The Scheduler Table 732 The scheduler, and therefore the Scheduler Table, accepts inputs from 733 either queues or a preceding scheduler. The Scheduler Table allows 734 flexibility in constructing both simple and somewhat more complex 735 queuing hierarchies from those queues. 737 When the MIB is used for configuration, diffServSchedulerNextFree always 738 contains a legal value for diffServSchedulerId that is not currently 739 used in the system's configuration. The Network Management Application 740 reads the variable and uses the value read in a create- and-go or a 741 create-and-wait SET. When the SET is performed, the agent must 742 determine whether the value is indeed still unused; two network managers 743 may attempt to create a configuration entry simultaneously and use the 744 same value. If it is currently unused, the SET succeeds and the agent 745 changes the value of diffServSchedulerNextFree according to an agent- 746 specific algorithm. If the value is in use, however, the SET fails. 747 The network manager must re-read diffServSchedulerNextFree to obtain a 748 useful value. 750 3.5.3. diffServAssuredRateTable - The Assured Rate Table 752 When the output rate of a queue or scheduler must be given a minimum 753 rate or a priority, this is done using the diffServAssuredRateTable. 754 Rates may be expressed as absolute rates, or as a fraction of ifSpeed, 755 and imply the use of a rate-based scheduler such as WFQ or WRR. The use 756 of a priority implies the use of a Priority Scheduler. Only one of the 757 Absolute or Relative rate need be set; the other takes the relevant 758 value as a result. Excess capacity is distributed proportionally among 759 the inputs to a scheduler. 761 The effect of combining priority and rate is to make the rates be in 762 fact fractions of ifSpeed less the actual amount of traffic passing, 763 although the fraction is calculated against the ifSpeed value. 765 When the MIB is used for configuration, diffServAssuredRateNextFree 766 always contains a legal value for diffServAssuredRateId that is not 767 currently used in the system's configuration. The Network Management 768 Application reads the variable and uses the value read in a create- 769 and-go or a create-and-wait SET. When the SET is performed, the agent 770 must determine whether the value is indeed still unused; two network 771 managers may attempt to create a configuration entry simultaneously and 772 use the same value. If it is currently unused, the SET succeeds and the 773 agent changes the value of diffServAssuredRateNextFree according to an 774 agent-specific algorithm. If the value is in use, however, the SET 775 fails. The network manager must re-read diffServAssuredRateNextFree to 776 obtain a useful value. 778 3.5.4. diffServShapingRateTable - The Shaping Rate Table 780 When the output rate of a queue or scheduler must be limited to at most 781 a specified maximum rate, this is done using the 782 diffServShapingRateTable. Rates may be expressed as absolute rates, or 783 as a fraction of ifSpeed. Only one of the Absolute or Relative rate 784 need be set; the other takes the relevant value as a result. 786 The definition of a multirate shaper requires multiple 787 diffServShapingRateEntries. In this case, an algorithm such as SHAPING 788 is used. In that algorithm, more than one rate is specified, and at any 789 given time traffic is shaped to the lowest specified rate which exceeds 790 the arrival rate of traffic. 792 When the MIB is used for configuration, diffServShapingRateNextFree 793 always contains a legal value for diffServShapingRateId that is not 794 currently used in the system's configuration. The Network Management 795 Application reads the variable and uses the value read in a create- 796 and-go or a create-and-wait SET. When the SET is performed, the agent 797 must determine whether the value is indeed still unused; two network 798 managers may attempt to create a configuration entry simultaneously and 799 use the same value. If it is currently unused, the SET succeeds and the 800 agent changes the value of diffServShapingRateNextFree according to an 801 agent-specific algorithm. If the value is in use, however, the SET 802 fails. The network manager must re-read diffServShapingRateNextFree to 803 obtain a useful value. 805 3.5.5. Using queues and schedulers together 807 For representing a Strict Priority scheduler, each scheduler input is 808 assigned a priority with respect to all the other inputs feeding the 809 same scheduler, with default values for the other parameters. Higher- 810 priority traffic that is not being delayed for shaping will be serviced 811 before a lower-priority input. An example is found in Figure 2. 813 For Weighted Queuing methods, such as WFQ or WRR, the "weight" of a 814 given scheduler input is represented with a Minimum Service Rate leaky- 815 bucket profile which provides guaranteed minimum bandwidth to that 816 input, if required. This is represented by a rate 817 DiffServAssuredRateAbs; the classical weight is the ratio between that 818 rate and the interface speed, or perhaps the ratio between that rate and 819 the sum of the configured rates for classes. The rate may be 820 represented by a relative value, as a fraction of the interface's 821 +-----+ 822 +-------+ | P S | 823 | Queue +------------>+ r c | 824 +-------+-+--------+ | i h | 825 |Priority| | o e | 826 +--------+ | r d +-----------> 827 +-------+ | i u | 828 | Queue +------------>+ t l | 829 +-------+-+--------+ | y e | 830 |Priority| | r | 831 +--------+ +-----+ 833 current line rate. DiffServAssuredRateRel to assist in cases where line 834 rates are variable or where a higher-level policy might be expressed in 835 terms of fractions of network resources. The two rate parameters are 836 inter-related and changes in one may be reflected in the other. An 837 example is found in figure 4. 839 For weighted scheduling methods, one can say loosely, that WRR focuses 840 on meeting bandwidth sharing, without concern for relative delay amongst 841 the queues; where WFQ control both queue service order and amount of 842 traffic serviced, providing meeting bandwidth sharing and relative delay 843 ordering amongst the queues. 845 A queue or scheduled set of queues (which is an input to a scheduler) 846 may also be capable of acting as a non-work-conserving [MODEL] traffic 847 shaper: this is done by defining a Maximum Service Rate leaky-bucket 849 +-----+ 850 +-------+ | W S | 851 | Queue +------------>+ R c | 852 +-------+-+--------+ | R h | 853 | Rate | | e | 854 +--------+ | o d +-----------> 855 +-------+ | r u | 856 | Queue +------------>+ l | 857 +-------+-+--------+ | W e | 858 | Rate | | F r | 859 +--------+ | Q | 860 +-----+ 861 profile in order to limit the scheduler bandwidth available to that 862 input. This is represented by a rate, in DiffServShapingRateAbs; the 863 classical weight is the ratio between that rate and the interface speed, 864 or perhaps the ratio between that rate and the sum of the configured 865 rates for classes. The rate may be represented by a relative value, as 866 a fraction of the interface's current line rate, DiffServShapingRateRel. 867 There was discussion in the working group about alternative modeling 868 approaches, such as defining a shaping action or a shaping element. 869 This MIB does not take this approach because shaping is in fact 870 something a scheduler does to its inputs, (which we model as a queue 871 with a maximum rate or a scheduler whose output has a maximum rate) and 872 the authors felt it was simpler and more elegant to simply describe it 873 in that context. 875 The same may be done on a queue, if a given class is to be shaped to a 876 maximum rate without shaping other classes, as in Figure 5. 878 Other types of priority and weighted scheduling methods can be defined 879 using existing parameters in DiffServAssuredRateEntry. NOTE: 880 DiffServSchedulerMethod uses OBJECT IDENTIFIER syntax, with the 881 different types of scheduling methods defined as OBJECT-IDENTITY. 882 Future scheduling methods may be defined in other MIBs. This requires 883 an OBJECT-IDENTITY definition, a description of how the existing objects 884 are reused, if they are, and any new objects they require. 886 Queue Table entries are pointed at by the "next" attributes of the 887 upstream elements, such as DiffServMeterSucceedNext or 888 diffServActionNext. Note that multiple upstream elements may direct 889 their traffic to the same Queue Table entry. For example, the Assured 890 Forwarding PHB suggests that all traffic marked AF11, AF12 or AF13 be 892 +---+ 893 +-------+ | S | 894 | Queue +------------>+ c | 895 +-------+-+--------+ | h | 896 | | | e +-----------> 897 +--------+ | d +-+-------+ 898 | u | |Maximum| 899 +-------+ | l | | Rate | 900 | Queue +------------>+ e | +-------+ 901 +-------+-+--------+ | r | 902 | | |---+ 903 +--------+ 904 +---+ 905 +-------+ | S | 906 | Queue +------------>+ c | 907 +-------+-+--------+ | h | 908 |Min Rate| | e +-----------> 909 +--------+ | d | 910 | u | 911 +-------+ | l | 912 | Queue +------------>+ e | 913 +-------+-+--------+ | r | 914 |Min Rate| | | 915 +--------+ | | 916 |Max Rate| | | 917 +--------+ +---+ 919 placed in the same queue, after metering, without reordering. To 920 accomplish that, the upstream diffServAlgDropNext pointers each point to 921 the same diffServQEntry. 923 A common requirement of a queue is that its traffic enjoy a certain 924 minimum or maximum rate, or that it be given a certain priority. 925 Functionally, the selection of such is a function of a scheduler, as in 926 Section .sh 4 "The parameter is associated with the queue, however, 927 using the Assured or Shaping Rate Parameters Table. 929 To implement an EF and two AF classes, one must use a combination of 930 priority and WRR/WFQ scheduling. This requires us to cascade two 931 schedulers. If we were to additionally shape the output of the system 932 to a rate lower than the interface rate, we must place an upper bound 933 rate on the output of the priority scheduler. See figure 4. 935 3.6. Example configuration for AF and EF 937 For the sake of argument, let us build an example with one EF class and 938 four AF classes using the constructs in this MIB. 940 3.6.1. AF and EF Ingress Interface Configuration 942 The ingress edge interface identifies traffic into classes, meters it, 943 and ensures that any excess is appropriately dealth with according to 944 the PHB. For AF, this means marking excess; for EF, it means dropping 945 excess or shaping it to a maximum rate. 947 +-----+ 948 +-------+ | P S | 949 | Queue +---------------------------------->+ r c | 950 +-------+----------------------+--------+ | i h | 951 |Priority| | o e +-----------> 952 +--------+ | r d +-+-------+ 953 +------+ | i u | |Maximum| 954 +-------+ | W S +------------->+ t l | | Rate | 955 | Queue +------------>+ R c +-+--------+ | y e | +-------+ 956 +-------+-+--------+ | R h | |Priority| | r | 957 |Min Rate| | e | +--------+ +-----+ 958 +--------+ | o d | 959 +-------+ | r u | 960 | Queue +------------>+ l | 961 +-------+-+--------+ | W e | 962 |Min Rate| | F r | 963 +--------+ | Q | 964 +------+ 965 +-----------------------+ 966 | diffServDataPathStart | 967 +-----------+-----------+ 968 | 969 +----------+ 970 | 971 +--+--+ +-----+ +-----+ +-----+ +-----+ 972 | AF1 +-----+ AF2 +-----+ AF3 +-----+ AF4 +-----+ EF | 973 +--+--+ +--+--+ +--+--+ +--+--+ +--+--+ 974 | | | | | 975 +--+--+ +--+--+ +--+--+ +--+--+ +--+--+ 976 |TRTCM| |TRTCM| |TRTCM| |TRTCM| |srTCM| 977 |Meter| |Meter| |Meter| |Meter| |Meter| 978 |-+++-| |-+++-| |-+++-| |-+++-| +-+-+-+ 979 ||| ||| ||| ||| | | 980 +-+||---+ +-+||---+ +-+||---+ +-+||---+ +-+-|---+ 981 |+-+|----+ |+-+|----+ |+-+|----+ |+-+|----+ |+--+----+ 982 ||+-+-----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||Actions| 983 +||Actions| +||Actions| +||Actions| +||Actions| +|Below | 984 +|Below | +|Below | +|Below | +|Below | +-+-----+ 985 +-+-----+ +-+-----+ +-+-----+ +-+-----+ | 986 ||| ||| ||| ||| | 987 VVV VVV VVV VVV V 989 Accepted traffic is sent to IP forwarding 991 3.6.1.1. Classification In The Example 993 A packet arriving at an ingress interface picks up its "program" from 994 the diffServDataPathTable. This points to a classifier, which will 995 select traffic according to some specification for each traffic class. 997 An example of a classifier for an AFm class would be a succession of 998 three classifier elements, each pointing to a Six-tuple classification 999 parameter block identifying one of the AFmn DSCPs. Alternatively, the 1000 six-tuples might contain selectors for HTTP traffic or some other 1001 application. 1003 An example of a classifier for EF traffic might be either a classifier 1004 element pointing to a six-tuple parameter specifying the EF code point, 1005 or a collection of classifiers with parameter blocks specifying 1006 individual telephone calls, or a variety of other approaches. 1008 Each classifier hands its traffic off to appropriate functional data 1009 path elements. 1011 3.6.1.2. AF Implementation On an Ingress Edge Interface 1013 Each Afm class applies a Two Rate Three Color Meter, dividing traffic 1014 into three groups. These groups of traffic conform to both specified 1015 rates, only the higher one, or none. The intent, on the ingress 1016 interface at the edge of the network, is to measure and appropriately 1017 mark traffic. 1019 3.6.1.2.1. AF Metering On an Ingress Edge Interface 1021 Each Afm class applies a Two Rate Three Color Meter, dividing traffic 1022 into three groups. If two rates R and S, with R < S, are specified and 1023 traffic arrives at rate T, traffic comprising up to R bits per second is 1024 considered to conform to the "confirmed" rate, R. If R < T, traffic 1025 comprising up to S-R bits per second is considered to conform to the 1026 "excess" rate, S. Any further excess is non- conformant. 1028 To configure this, we apply two Meter Entries, one for the conforming 1029 rate and one for the excess rate. The rate parameters are stored in 1030 associated Token Bucket Parameter Entries. The "FailNext" pointer of 1031 the lower rate Meter Entry points to the other Meter Entry; both 1032 "SucceedNext" pointers and the "FailNext" pointer of the higher Meter 1033 Entry point to lists of actions. In the color-blind mode, all three 1034 classifier "next" entries point to the lower rate meter entry. In the 1035 color-aware mode, the AFm1 classifier points to the lower rate entry, 1036 the AFm2 classifier points to the higher rate entry (as it is only 1037 compared against that rate), and the AFm3 classifier points directly to 1038 the actions taken when both rates fail. 1040 3.6.1.2.2. AF Actions On an Ingress Edge Interface 1042 For network planning and perhaps for billing purposes, arriving traffic 1043 is normally counted. Therefore, a "count" action, consisting of an 1044 action table entry pointing to a count table entry, is configured. 1046 Also, traffic is marked with the appropriate DSCP. The first R bits per 1047 second are marked AFm1, the next S-R bits per second are marked AFm2, 1048 and the rest is marked AFm3. It may be that traffic is arriving marked 1049 with the same DSCP, but in general, the additional complexity of 1050 deciding that it is being remarked to the same value is not useful. 1051 Therefore, a "mark" action, consisting of an action table entry pointing 1052 to a mark table entry, is configured. 1054 At this point, the usual case is that traffic is now forwarded in the 1055 usual manner. To indicate this, we set the "SucceedNext" pointer of the 1056 Mark Action is left at zeroDotZero. 1058 3.6.1.3. EF Implementation On an Ingress Edge Interface 1060 The EF class applies a Single Rate Two Color Meter, dividing traffic 1061 into "conforming" and "excess" groups. The intent, on the ingress 1062 interface at the edge of the network, is to measure and appropriately 1063 mark conforming traffic and drop the excess. 1065 3.6.1.3.1. EF Metering On an Ingress Edge Interface 1067 A single rate two color (SRTCM) meter requires one token bucket. It is 1068 therefore configured using a single meter entry with a corresponding 1069 Token Bucket Parameter Entry. Arriving traffic either "succeeds" or 1070 "fails". 1072 3.6.1.3.2. EF Actions On an Ingress Edge Interface 1074 For network planning and perhaps for billing purposes, arriving traffic 1075 that conforms to the meter is normally counted. Therefore, a "count" 1076 action, consisting of an action table entry pointing to a count table 1077 entry, is configured. 1079 Also, traffic is (re)marked with the EF DSCP. Therefore, a "mark" 1080 action, consisting of an action table entry pointing to a mark table 1081 entry, is configured. 1083 At this point, the successful traffic is now forwarded in the usual 1084 manner. To indicate this, we set the "SucceedNext" pointer of the Mark 1085 Action is left at zeroDotZero. 1087 Traffic that exceeded the arrival policy, however, is to be dropped. We 1088 can use a count action on this traffic if the several counters are 1089 interesting. However, since the drop counter in the Algorithmic Drop 1090 Entry will count packets dropped, this is not clearly necessary. We 1091 configure an Alorithmic Drop Entry of the type "alwaysDrop," with no 1092 successor. 1094 3.7. AF and EF Egress Edge Interface Configuration 1096 3.7.1. Classification On an Egress Edge Interface 1098 A packet arriving at an egress interface may have been classified on an 1099 ingress interface, and the egress interface may have access to that 1100 +-----------------------+ 1101 | diffServDataPathStart | 1102 +-----------+-----------+ 1103 | 1104 +----------+ 1105 | 1106 +--+--+ +-----+ +-----+ +-----+ +-----+ 1107 | AF1 +-----+ AF2 +-----+ AF3 +-----+ AF4 +-----+ EF | 1108 |-+++-| |-+++-| |-+++-| |-+++-| +-+-+-+ 1109 ||| ||| ||| ||| | | 1110 |-+++-| |-+++-| |-+++-| |-+++-| +-+-+-+ 1111 |TRTCM| |TRTCM| |TRTCM| |TRTCM| |srTCM| 1112 |Meter| |Meter| |Meter| |Meter| |Meter| 1113 |-+++-| |-+++-| |-+++-| |-+++-| +-+-+-+ 1114 ||| ||| ||| ||| | | 1115 +-+||---+ +-+||---+ +-+||---+ +-+||---+ +-+-|---+ 1116 |+-+|----+ |+-+|----+ |+-+|----+ |+-+|----+ |+--+----+ 1117 ||+-+-----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||Actions| 1118 +||Actions| +||Actions| +||Actions| +||Actions| +|Below | 1119 +|Below | +|Below | +|Below | +|Below | +-+-----+ 1120 +-+-----+ +-+-----+ +-+-----+ +-+-----+ | 1121 ||| ||| ||| ||| | 1122 +-+++--+ +-+++--+ +-+++--+ +-+++--+ +--+---+ 1123 | Queue| | Queue| | Queue| | Queue| | Queue| 1124 +--+---+ +--+---+ +--+---+ +--+---+ +--+---+ 1125 | | | | | 1126 +--+-----------+-----------+-----------+---+ | 1127 | WFQ/WRR Scheduler | | 1128 +--------------------------------------+---+ | 1129 | | 1130 +-----+-----------+----+ 1131 | Priority Scheduler | 1132 +----------+-----------+ 1133 | 1134 V 1136 information. If it is relevant, there is no reason not to use that 1137 information. If it is not available, however, there may be a need to 1138 (re)classify on the egress interface. In any event, it picks up its 1139 "program" from the diffServDataPathTable. This points to a classifier, 1140 which will select traffic according to some specification for each 1141 traffic class. 1143 An example of a classifier for an AFm class would be a succession of 1144 three classifier elements, each pointing to a Six-tuple classification 1145 parameter block identifying one of the AFmn DSCPs. Alternatively, the 1146 six-tuples might contain selectors for HTTP traffic or some other 1147 application. 1149 An example of a classifier for EF traffic might be either a classifier 1150 element pointing to a six-tuple parameter specifying the EF code point, 1151 or a collection of classifiers with parameter blocks specifying 1152 individual telephone calls, or a variety of other approaches. 1154 Each classifier hands its traffic off to appropriate functional data 1155 path elements. 1157 3.7.2. AF Implementation On an Egress Edge Interface 1159 Each Afm class applies a Two Rate Three Color Meter, dividing traffic 1160 into three groups. These groups of traffic conform to both specified 1161 rates, only the higher one, or none. The intent, on the ingress 1162 interface at the edge of the network, is to measure and appropriately 1163 mark traffic. 1165 3.7.2.1. AF Metering On an Egress Edge Interface 1167 Each Afm class applies a Two Rate Three Color Meter, dividing traffic 1168 into three groups. If two rates R and S, with R < S, are specified and 1169 traffic arrives at rate T, traffic comprising up to R bits per second is 1170 considered to conform to the "confirmed" rate, R. If R < T, traffic 1171 comprising up to S-R bits per second is considered to conform to the 1172 "excess" rate, S. Any further excess is non- conformant. 1174 To configure this, we apply two Meter Entries, one for the conforming 1175 rate and one for the excess rate. The rate parameters are stored in 1176 associated Token Bucket Parameter Entries. The "FailNext" pointer of 1177 the lower rate Meter Entry points to the other Meter Entry; both 1178 "SucceedNext" pointers and the "FailNext" pointer of the higher Meter 1179 Entry point to lists of actions. In the color-blind mode, all three 1180 classifier "next" entries point to the lower rate meter entry. In the 1181 color-aware mode, the AFm1 classifier points to the lower rate entry, 1182 the AFm2 classifier points to the higher rate entry (as it is only 1183 compared against that rate), and the AFm3 classifier points directly to 1184 the actions taken when both rates fail. 1186 3.7.2.2. AF Actions On an Egress Edge Interface 1188 For network planning and perhaps for billing purposes, departing traffic 1189 is normally counted. Therefore, a "count" action, consisting of an 1190 action table entry pointing to a count table entry, is configured. 1192 Also, traffic may be marked with an appropriate DSCP. The first R bits 1193 per second are marked AFm1, the next S-R bits per second are marked 1194 AFm2, and the rest is marked AFm3. It may be that traffic is arriving 1195 marked with the same DSCP, but in general, the additional complexity of 1196 deciding that it is being remarked to the same value is not useful. 1197 Therefore, a "mark" action, consisting of an action table entry pointing 1198 to a mark table entry, is configured. 1200 At this point, the usual case is that traffic is now queued for 1201 transmission. The queue uses Active Queue Management, using an 1202 algorithm such as RED. Therefore, an Algorithmic Dropper is configured 1203 for each AFmn traffic stream, with a slightly lower min- threshold (and 1204 possibly lower max-threshold) for the excess traffic than for the 1205 committed traffic. 1207 3.7.2.3. AF Rate-based Queuing On an Egress Edge Interface 1209 The queue expected by AF is normally a work-conserving queue. It 1210 usually has a specified minimum rate, and may have a maximum rate below 1211 the bandwidth of the interface. In concept, it will use as much 1212 bandwidth as is available to it, but assure the lower bound. 1214 Common ways to implement this include various forms of Weighted Fair 1215 Queuing (WFQ) or Weighted Round Robin (WRR). Integrated over a longer 1216 interval, these give each class a predictable throughput rate. They 1217 differ in that over short intervals they will order traffic differently. 1218 In general, traffic classes that keep traffic in queue will tend to 1219 absorb latency from queues with lower mean occupancy, in exchange for 1220 which they make use of any available capacity. 1222 3.7.3. EF Implementation On an Egress Edge Interface 1224 The EF class applies a Single Rate Two Color Meter, dividing traffic 1225 into "conforming" and "excess" groups. The intent, on the egress 1226 interface at the edge of the network, is to measure and appropriately 1227 mark conforming traffic and drop the excess. 1229 3.7.3.1. EF Metering On an Egress Edge Interface 1231 A single rate two color (SRTCM) meter requires one token bucket. It is 1232 therefore configured using a single meter entry with a corresponding 1233 Token Bucket Parameter Entry. Arriving traffic either "succeeds" or 1234 "fails". 1236 3.7.3.2. EF Actions On an Egress Edge Interface 1238 For network planning and perhaps for billing purposes, departing traffic 1239 that conforms to the meter is normally counted. Therefore, a "count" 1240 action, consisting of an action table entry pointing to a count table 1241 entry, is configured. 1243 Also, traffic is (re)marked with the EF DSCP. Therefore, a "mark" 1244 action, consisting of an action table entry pointing to a mark table 1245 entry, is configured. 1247 At this point, the successful traffic is now queued for transmission, 1248 using a priority queue or perhaps a rate-based queue with significant 1249 over-provision. Since the amount of traffic present is known, one might 1250 not drop from this queue at all. 1252 Traffic that exceeded the policy, however, is dropped. We can use a 1253 count action on this traffic if the several counters are interesting. 1254 However, since the drop counter in the Algorithmic Drop Entry will count 1255 packets dropped, this is not clearly necessary. We configure an 1256 Alorithmic Drop Entry of the type "alwaysDrop," with no successor. 1258 3.7.3.3. EF Priority Queuing On an Egress Edge Interface 1260 The normal implementation is a priority queue, to minimize induced 1261 jitter. By this, we mean that a separate queue is used for each EF 1262 class, with a strict ordering. 1264 4. Conventions used in this MIB 1266 4.1. The use of RowPointer to indicate data path linkage 1268 RowPointer is a textual convention used to identify a conceptual row in 1269 an SNMP Table by pointing to one of its objects. One of the ways it this 1270 MIB uses it is to indicate succession, pointing to data path linkage 1271 table entries. 1273 For succession, it answers the question "what happens next?". Rather 1274 than presume that the next table must be as specified in the conceptual 1275 model [MODEL] and providing its index, the RowPointer takes you to the 1276 MIB row representing that thing. In the DiffServMeterTable, for example, 1277 the DiffServMeterFailNext RowPointer might take you to another meter, 1278 while the DiffServMeterSucceedNext RowPointer would take you to an 1279 action. 1281 Since a RowPointer is not tied to any specific object except by the 1282 value it contains, it is possible and acceptable to use RowPointers to 1283 merge data paths. An obvious example of such a use is in the 1284 classifier: traffic matching the DSCPs AF11, AF12, and AF13 might be 1285 presented to the same meter in order to perform the processing described 1286 in the Assured Forwarding PHB. Another use would be to merge data paths 1287 from several interfaces; if they represent a single service contract, 1288 having them share a common set of counters and common policy may be a 1289 desireable configuration. Note well, however, that suchconfigurations 1290 may have related implementation issues - if Differentiated Services 1291 processing for the interfaces is implemented in multiple forwarding 1292 engines, the engines will need to communicate if they are to implement 1293 such a feature. An implementation that fails to provide this capability 1294 is not considered to have failed the intention of this MIB or of the 1295 [MODEL]; an implementation that does provide it is not considered 1296 superior from a standards perspective. 1298 NOTE -- the RowPointer construct is used to connect the functional 1299 data paths. The [MODEL] describes these as TCBs, as an aid to 1300 understanding. This MIB, however, does not model TCBs directly. It 1301 operates at a lower level of abstraction using only individual 1302 elements, connected in succession by RowPointers. Therefore, the 1303 concept of TCBs enclosing individual Functional Data Path elements 1304 is not directly applicable to this MIB, although management tools 1305 that use this MIB may employ such a concept. 1307 It is possible that a path through a device following a set of 1308 RowPointers is indeterminate i.e. it ends in a dangling RowPointer. 1309 Guidance is provided in the MIB module's DESCRIPTION-clause for each of 1310 the linkage attribute. In general, for both zeroDotZero and dangling 1311 RowPointer, it is assumed the data path ends and the traffic should be 1312 given to the next logical part of the device, usually a forwarding 1313 process or a transmission engine, or the proverbial bit-bucket. Any 1314 variation from this usage is indicated by the attribute affected. 1316 4.2. The use of RowPointer to indicate parameters 1318 RowPointer is also used in this MIB to indicate parameterization, for 1319 pointing to parameterization table entries. 1321 For indirection (as in the DiffServClfrElementTable), the idea is to 1322 allow other MIBs, including proprietary ones, to define new and arcane 1323 filters - MAC headers, IPv4 and IPv6 headers, BGP Communities and all 1324 sorts of other things - whilst still utilizing the structures of this 1325 MIB. This is a form of class inheritance (in "object oriented" 1326 language): it allows base object definitions ("classes") to be extended 1327 in proprietary or standard ways, in the future, by other documents. 1329 RowPointer also clearly indicates the identified conceptual row's 1330 content does not change, hence they can be simultaneously used, pointed 1331 to, by more than one data path linkage table entries. The 1332 identification of RowPointer allows higher level policy mechanisms to 1333 take advantage of this characteristic. 1335 4.3. Conceptual row creation and deletion 1337 A number of conceptual tables defined in this MIB use as an index an 1338 arbitrary integer value, unique across the scope of the agent. In order 1339 to help with multi-manager row-creation problems, a mechanism must be 1340 provided to allow a manager to obtain unique values for such an index 1341 and to ensure that, when used, the manager knows whether it got what it 1342 wanted or not. 1344 Typically, such a table has an associated NextFree variable e.g. 1345 DiffServClfrNextFree which provides a suitable value for the index of 1346 the next row to be created e.g. DiffServClfrElementClfrId. The value 1347 zero is used to indicate that the agent can configure no more entries. 1348 The table also has a columnar Status attribute with RowStatus syntax 1349 [6]. 1351 Generally, if a manager attempts to create a row, using either 1352 createAndGo or createAndWait, the agent will create the row and return 1353 success. If the agent has insufficient resources or such a row already 1354 exists, then it returns an error. A manager must be prepared to try 1355 again in such circumstances, probably by re-reading the NextFree to 1356 obtain a new index value in case a second manager had got in between the 1357 first manager's read of the NextFree value and the first manager's row- 1358 creation attempt. The use of RowStatus is covered in more detail in [6]. 1360 5. Extending this MIB 1362 With the structures of this MIB divided into data path linkage tables 1363 and parameterization tables, and with the use of RowPointer, new data 1364 path linkage and parameterization tables can be defined in other MIB 1365 modules, and used with tables defined in this MIB. This MIB does not 1366 limit on the type of entries its RowPointer attributes can point to, 1367 hence new functional data path elements can be defined in other MIBs and 1368 integrated with functional data path elements of this MIB. For example, 1369 new Action functional data path element can be defined for Traffic 1370 Engineering and be integrated with Differentiated Services functional 1371 data path elements, possibly used within the same data path sharing the 1372 same classifiers and meters. 1374 It is more likely that new parameterization tables will be created in 1375 other MIBs as new methods or proprietary methods get deployed for 1376 existing Differentiated Services functional data path elements. For 1377 example, different kinds of filters can be defined by using new filter 1378 parameterization tables. New scheduling methods can be deployed by 1379 defining new scheduling method OIDs and new scheduling parameter tables. 1381 Notice both new data path linkage tables and parameterization tables can 1382 be added without needing to change this MIB document or affect existing 1383 tables and their usage. 1385 6. MIB Definition 1387 DIFFSERV-DSCP-TC DEFINITIONS ::= BEGIN 1389 IMPORTS 1390 Integer32, MODULE-IDENTITY, mib-2 1391 FROM SNMPv2-SMI 1392 TEXTUAL-CONVENTION 1393 FROM SNMPv2-TC; 1395 diffServDSCPTC MODULE-IDENTITY 1396 LAST-UPDATED "0101080000Z" 1397 ORGANIZATION "IETF Differentiated Services WG" 1398 CONTACT-INFO 1399 " Fred Baker 1400 Cisco Systems 1401 519 Lado Drive 1402 Santa Barbara, CA 93111, USA 1403 E-mail: fred@cisco.com 1405 Kwok Ho Chan 1406 Nortel Networks 1407 600 Technology Park Drive 1408 Billerica, MA 01821, USA 1409 E-mail: khchan@nortelnetworks.com 1411 Andrew Smith 1412 Allegro Networks 1413 6399 San Ignacio Ave 1414 San Jose, CA 95119, USA 1415 E-mail: andrew@allegronetworks.com 1417 Differentiated Services Working Group: 1418 diffserv@ietf.org" 1419 DESCRIPTION 1420 "The Textual Conventions defined in this module should be used 1421 whenever a Differentiated Services Code Point is used in a MIB." 1422 REVISION "0106030000Z" 1423 DESCRIPTION 1424 "Initial version, published as RFC xxxx." 1425 ::= { mib-2 12344 } -- to be assigned by IANA 1427 Dscp ::= TEXTUAL-CONVENTION 1428 DISPLAY-HINT "d" 1429 STATUS current 1430 DESCRIPTION 1431 "A Differentiated Services Code-Point that may be used for 1432 marking a traffic stream." 1433 REFERENCE 1434 "RFC 2474, RFC 2780" 1435 SYNTAX Integer32 (0..63) 1437 DscpOrAny ::= TEXTUAL-CONVENTION 1438 DISPLAY-HINT "d" 1439 STATUS current 1440 DESCRIPTION 1441 "The IP header Differentiated Services Code-Point that may be 1442 used for discriminating among traffic streams. The value -1 is 1443 used to indicate a wild card i.e. any value." 1444 REFERENCE 1445 "RFC 2474, RFC 2780" 1446 SYNTAX Integer32 (-1 | 0..63) 1447 END 1448 DIFFSERV-MIB DEFINITIONS ::= BEGIN 1450 IMPORTS 1451 Unsigned32, Counter32, Counter64, 1452 MODULE-IDENTITY, OBJECT-TYPE, OBJECT-IDENTITY, 1453 zeroDotZero, mib-2 1454 FROM SNMPv2-SMI 1455 TEXTUAL-CONVENTION, RowStatus, RowPointer, TimeStamp 1456 FROM SNMPv2-TC 1457 MODULE-COMPLIANCE, OBJECT-GROUP 1458 FROM SNMPv2-CONF 1459 ifIndex 1460 FROM IF-MIB 1461 InetAddressType, InetAddress, InetAddressPrefixLength, 1462 InetPortNumber 1463 FROM INET-ADDRESS-MIB 1464 BurstSize 1465 FROM INTEGRATED-SERVICES-MIB 1466 Dscp, DscpOrAny 1467 FROM DIFFSERV-DSCP-TC; 1469 diffServMib MODULE-IDENTITY 1470 LAST-UPDATED "0102210000Z" 1471 ORGANIZATION "IETF Differentiated Services WG" 1472 CONTACT-INFO 1473 " Fred Baker 1474 Cisco Systems 1475 519 Lado Drive 1476 Santa Barbara, CA 93111, USA 1477 E-mail: fred@cisco.com 1479 Kwok Ho Chan 1480 Nortel Networks 1481 600 Technology Park Drive 1482 Billerica, MA 01821, USA 1483 E-mail: khchan@nortelnetworks.com 1485 Andrew Smith 1486 Allegro Networks 1487 6399 San Ignacio Ave 1488 San Jose, CA 95119, USA 1489 E-mail: andrew@allegronetworks.com 1491 Differentiated Services Working Group: 1492 diffserv@ietf.org" 1493 DESCRIPTION 1494 "This MIB defines the objects necessary to manage a device that 1495 uses the Differentiated Services Architecture described in RFC 1496 2475. The Conceptual Model of a Differentiated Services Router 1497 provides supporting information on how such a router is modeled." 1498 REVISION "0106030000Z" 1499 DESCRIPTION 1500 "Initial version, published as RFC xxxx." 1501 ::= { mib-2 1 } 1503 diffServMIBObjects OBJECT IDENTIFIER ::= { diffServMib 1 } 1504 diffServMIBConformance OBJECT IDENTIFIER ::= { diffServMib 2 } 1506 -- These textual conventions have no effect on either the syntax 1507 -- or the semantics of any managed object. Objects defined using 1508 -- this convention are always encoded by means of the rules that 1509 -- define their primitive type. 1511 IfDirection ::= TEXTUAL-CONVENTION 1512 STATUS current 1513 DESCRIPTION 1514 "IfDirection specifies a direction of data travel on an 1515 interface. 'inbound' traffic is operated on during reception from 1516 the interface, while 'outbound' traffic is operated on prior to 1517 transmission on the interface." 1518 SYNTAX INTEGER { 1519 inbound(1), -- ingress interface 1520 outbound(2) -- egress interface 1521 } 1522 -- 1523 -- Data Path 1524 -- 1526 diffServDataPath OBJECT IDENTIFIER ::= { diffServMIBObjects 1 } 1528 -- 1529 -- Data Path Table 1530 -- 1531 -- The Data Path Table enumerates the Differentiated Services 1532 -- Functional Data Paths within this device. Each entry in this 1533 -- table is indexed by ifIndex and ifDirection. Each entry provides 1534 -- the first Differentiated Services Functional Data Path Element to 1535 -- process data flowing along specific data path. This table should 1536 -- have at most two entries for each interface capable of Differentiated 1537 -- Services processing on this device: ingress and egress. 1539 -- Note that Differentiated Services Functional Data Path Elements 1540 -- linked together using their individual next pointers and anchored 1541 -- by an entry of the diffServDataPathTable constitute a functional data 1542 -- path. 1543 -- 1545 diffServDataPathTable OBJECT-TYPE 1546 SYNTAX SEQUENCE OF DiffServDataPathEntry 1547 MAX-ACCESS not-accessible 1548 STATUS current 1549 DESCRIPTION 1550 "The data path table contains RowPointers indicating the start of 1551 the functional data path for each interface and traffic direction 1552 in this device. These may merge, or be separated into parallel 1553 data paths by meters or classifiers." 1554 ::= { diffServDataPath 1 } 1556 diffServDataPathEntry OBJECT-TYPE 1557 SYNTAX DiffServDataPathEntry 1558 MAX-ACCESS not-accessible 1559 STATUS current 1560 DESCRIPTION 1561 "An entry in the data path table indicates the start of a single 1562 Differentiated Services Functional Data Path in this device." 1563 INDEX { ifIndex, diffServDataPathIfDirection } 1564 ::= { diffServDataPathTable 1 } 1566 DiffServDataPathEntry ::= SEQUENCE { 1567 diffServDataPathIfDirection IfDirection, 1568 diffServDataPathStart RowPointer, 1569 diffServDataPathStatus RowStatus 1570 } 1572 diffServDataPathIfDirection OBJECT-TYPE 1573 SYNTAX IfDirection 1574 MAX-ACCESS not-accessible 1575 STATUS current 1576 DESCRIPTION 1577 "IfDirection specifies whether the reception or transmission path 1578 for this interface is in view." 1579 ::= { diffServDataPathEntry 1 } 1581 diffServDataPathStart OBJECT-TYPE 1582 SYNTAX RowPointer 1583 MAX-ACCESS read-create 1584 STATUS current 1585 DESCRIPTION 1586 "This selects the first Differentiated Services Functional Data 1587 Path element to handle traffic for this data path. This 1588 RowPointer should point to an instance of one of: 1589 diffServClfrElementEntry 1590 diffServMeterEntry 1591 diffServActionEntry 1592 diffServAlgDropEntry 1593 diffServQEntry 1595 A value of zeroDotZero in this attribute indicates that no 1596 Differentiated Services treatment is performed on traffic of this 1597 data path. A pointer with the value zeroDotZero normally 1598 terminates a functional data path. 1600 If the row pointed to does not exist, the treatment is as if this 1601 attribute contains a value of zeroDotZero." 1602 ::= { diffServDataPathEntry 2 } 1604 diffServDataPathStatus OBJECT-TYPE 1605 SYNTAX RowStatus 1606 MAX-ACCESS read-create 1607 STATUS current 1608 DESCRIPTION 1609 "The RowStatus variable controls the activation, deactivation, or 1610 deletion of a row/entry. Any writable variable may be modified 1611 whether the row is active or notInService." 1612 ::= { diffServDataPathEntry 3 } 1613 -- 1614 -- Classifiers 1615 -- 1617 diffServClassifier OBJECT IDENTIFIER ::= { diffServMIBObjects 2 } 1619 -- 1620 -- Classifier Table 1621 -- 1622 --The Classifier Table allows multiple classifier elements, of same 1623 --or different types, to be used together. A classifier must completely 1624 --classify all packets presented to it. This means that all traffic 1625 --presented to a classifier must match at least one classifier element 1626 --within the classifier, with the classifier element parameters 1627 --specified by a filter. 1628 -- 1629 --If there is ambiguity between classifier elements of different 1630 --classifier, classifier linkage order indicates their precedence; 1631 --the first classifier in the link is applied to the traffic first. 1632 -- 1633 --Entries in the classifier element table serves as the anchor for 1634 --each classification pattern, defined in filter table entries. 1635 --Each classifier element table entry also specifies the subsequent 1636 --downstream Differentiated Services Functional Data Path element 1637 --when the classification pattern is satisfied. Each entry in the 1638 --classifier element table describes one branch of the fan-out 1639 --characteristic of a classifier indicated in [MODEL] section 4.1. 1640 --A classifier is composed of one or more classifier elements. 1642 diffServClfrNextFree OBJECT-TYPE 1643 SYNTAX INTEGER (1..2147483647) 1644 MAX-ACCESS read-only 1645 STATUS current 1646 DESCRIPTION 1647 "This object yields a value when read that is currently unused 1648 for a diffServClfrId instance. If a configuring system attempts 1649 to create a new row in the diffServClfrTable using this value, 1650 but an instance has been created or is in the process of being 1651 created, that operation will fail." 1652 ::= { diffServClassifier 1 } 1654 diffServClfrTable OBJECT-TYPE 1655 SYNTAX SEQUENCE OF DiffServClfrEntry 1656 MAX-ACCESS not-accessible 1657 STATUS current 1658 DESCRIPTION 1659 "This table enumerates all the diffserv classifier functional 1660 data path elements of this device. The actual classification 1661 definitions are defined in diffServClfrElementTable entries 1662 belonging to each classifier." 1663 REFERENCE 1664 "[MODEL] section 4.1" 1665 ::= { diffServClassifier 2 } 1667 diffServClfrEntry OBJECT-TYPE 1668 SYNTAX DiffServClfrEntry 1669 MAX-ACCESS not-accessible 1670 STATUS current 1671 DESCRIPTION 1672 "An entry in the classifier table describes a single classifier. 1673 All classifier elements belonging to the same classifier uses the 1674 classifier's diffServClfrId in their diffServClfrElementClfrId 1675 attribute." 1676 INDEX { diffServClfrId } 1677 ::= { diffServClfrTable 1 } 1679 DiffServClfrEntry ::= SEQUENCE { 1680 diffServClfrId Unsigned32, 1681 diffServClfrDataPathStart RowPointer, 1682 diffServClfrStatus RowStatus 1683 } 1685 diffServClfrId OBJECT-TYPE 1686 SYNTAX Unsigned32 1687 MAX-ACCESS not-accessible 1688 STATUS current 1689 DESCRIPTION 1690 "An index that enumerates the classifier entries. The set of such 1691 identifiers spans the whole agent. Managers should obtain new 1692 values for row creation in this table by reading 1693 diffServClfrNextFree." 1694 ::= { diffServClfrEntry 1 } 1696 diffServClfrDataPathStart OBJECT-TYPE 1697 SYNTAX RowPointer 1698 MAX-ACCESS read-create 1699 STATUS current 1700 DESCRIPTION 1701 "This selects the first Differentiated Services Functional Data 1702 Path element to handle traffic for this classifier. This 1703 RowPointer should point to an instance of a 1704 diffServClfrElementEntry. It is primarily useful in indicating 1705 the first classifier element in a classifier other than the one 1706 pointed to by diffServClfrDataPathStart, although it may be used 1707 for those classifiers as well. 1709 A value of zeroDotZero in this attribute indicates that no 1710 Differentiated Services treatment is performed on traffic of this 1711 data path. A pointer with the value zeroDotZero normally 1712 terminates a functional data path. 1714 If the row pointed to does not exist, the treatment is as if this 1715 attribute contains a value of zeroDotZero." 1716 ::= { diffServClfrEntry 2 } 1718 diffServClfrStatus OBJECT-TYPE 1719 SYNTAX RowStatus 1720 MAX-ACCESS read-create 1721 STATUS current 1722 DESCRIPTION 1723 "The RowStatus variable controls the activation, deactivation, or 1724 deletion of a classifier. Any writable variable may be modified 1725 whether the row is active or notInService." 1726 ::= { diffServClfrEntry 3 } 1727 -- Classifier Element Table 1728 -- 1729 diffServClfrElementNextFree OBJECT-TYPE 1730 SYNTAX INTEGER (1..2147483647) 1731 MAX-ACCESS read-only 1732 STATUS current 1733 DESCRIPTION 1734 "This object yields a value when read that is currently unused 1735 for a diffServClfrElementId instance. If a configuring system 1736 attempts to create a new row in the diffServClfrElementTable 1737 using this value, but an instance has been created or is in the 1738 process of being created, that operation will fail." 1739 ::= { diffServClassifier 3 } 1741 diffServClfrElementTable OBJECT-TYPE 1742 SYNTAX SEQUENCE OF DiffServClfrElementEntry 1743 MAX-ACCESS not-accessible 1744 STATUS current 1745 DESCRIPTION 1746 "The classifier element table enumerates the relationship between 1747 classification patterns and subsequent downstream Differentiated 1748 Services Functional Data Path elements. 1749 diffServClfrElementSpecific points to a filter that specifies the 1750 classification parameters. A classifier may use filter tables of 1751 different types together. 1753 One example of a filter table defined in this MIB is 1754 diffServSixTupleClfrTable, for IP Multi-Field Classifiers (MFCs). 1755 Such an entry might identify anything from a single micro-flow 1756 (an identifiable sub-session packet stream directed from one 1757 sending transport to the receiving transport or transports), or 1758 aggregates of those such as the traffic from a host, traffic for 1759 an application, or traffic between two hosts using an application 1760 and a given DSCP. The standard Behavior Aggregate used in the 1761 Differentiated Services Architecture is encoded as a degenerate 1762 case of such an aggregate - the traffic using a particular DSCP 1763 value. 1765 Filter tables for other filter types may be defined elsewhere." 1766 REFERENCE 1767 "[MODEL] section 4.1" 1768 ::= { diffServClassifier 4 } 1770 diffServClfrElementEntry OBJECT-TYPE 1771 SYNTAX DiffServClfrElementEntry 1772 MAX-ACCESS not-accessible 1773 STATUS current 1774 DESCRIPTION 1775 "An entry in the classifier element table describes a single 1776 element of the classifier." 1777 INDEX { diffServClfrElementClfrId, diffServClfrElementId } 1778 ::= { diffServClfrElementTable 1 } 1780 DiffServClfrElementEntry ::= SEQUENCE { 1781 diffServClfrElementClfrId INTEGER, 1782 diffServClfrElementId INTEGER, 1783 diffServClfrElementPrecedence Unsigned32, 1784 diffServClfrElementNext RowPointer, 1785 diffServClfrElementSpecific RowPointer, 1786 diffServClfrElementStatus RowStatus 1787 } 1789 diffServClfrElementClfrId OBJECT-TYPE 1790 SYNTAX INTEGER (1..2147483647) 1791 MAX-ACCESS not-accessible 1792 STATUS current 1793 DESCRIPTION 1794 "An index that enumerates the classifier entries. The set of such 1795 identifiers spans the whole agent. Managers obtain new values for 1796 row creation in this table by reading diffServClfrNextFree. 1798 A classifier Id identifies which classifier this classifier 1799 element is a part of." 1800 ::= { diffServClfrElementEntry 1 } 1802 diffServClfrElementId OBJECT-TYPE 1803 SYNTAX INTEGER (1..2147483647) 1804 MAX-ACCESS not-accessible 1805 STATUS current 1806 DESCRIPTION 1807 "An index that enumerates the Classifier Element entries. The set 1808 of such identifiers spans the whole agent. Managers obtain new 1809 values for row creation in this table by reading 1810 diffServClfrElementNextFree." 1811 ::= { diffServClfrElementEntry 2 } 1813 diffServClfrElementPrecedence OBJECT-TYPE 1814 SYNTAX Unsigned32 1815 MAX-ACCESS read-create 1816 STATUS current 1817 DESCRIPTION 1818 "The relative order in which classifier elements are applied: 1819 higher numbers represent classifier element with higher 1820 precedence. Classifier elements with the same order must be 1821 unambiguous i.e. they must define non-overlapping patterns, and 1822 are considered to be applied simultaneously to the traffic 1823 stream. Classifier elements with different order may overlap in 1824 their filters: the classifier element with the highest order 1825 that matches is taken. 1827 On a given interface, there must be a complete classifier in 1828 place at all times in the ingress direction. This means one or 1829 more filters must match any possible pattern. There is no such 1830 requirement in the egress direction." 1831 DEFVAL { 0 } 1832 ::= { diffServClfrElementEntry 3 } 1834 diffServClfrElementNext OBJECT-TYPE 1835 SYNTAX RowPointer 1836 MAX-ACCESS read-create 1837 STATUS current 1838 DESCRIPTION 1839 "This attribute provides one branch of the fan-out functionality 1840 of a classifier described in [MODEL] section 4.1. 1842 This selects the next Differentiated Services Functional Data 1843 Path element to handle traffic for this data path. This 1844 RowPointer should point to an instance of one of: 1845 diffServClfrElementEntry 1846 diffServMeterEntry 1847 diffServActionEntry 1848 diffServAlgDropEntry 1849 diffServQEntry 1851 A value of zeroDotZero in this attribute indicates no further 1852 Differentiated Services treatment is performed on traffic of this 1853 data path. The use of zeroDotZero is the normal usage for the 1854 last functional data path element of the current data path. 1856 If the row pointed to does not exist, the treatment is as if this 1857 attribute contains a value of zeroDotZero." 1859 ::= { diffServClfrElementEntry 4 } 1861 diffServClfrElementSpecific OBJECT-TYPE 1862 SYNTAX RowPointer 1863 MAX-ACCESS read-create 1864 STATUS current 1865 DESCRIPTION 1866 "A pointer to a valid entry in another table, filter table, that 1867 describes the applicable classification parameters, e.g. an entry 1868 in diffServSixTupleClfrTable. 1870 If the row pointed to does not exist, the classifier element is 1871 ignored. 1873 The value zeroDotZero is interpreted to match anything not 1874 matched by another classifier element - only one such entry may 1875 exist for each classifier." 1876 DEFVAL { zeroDotZero } 1877 ::= { diffServClfrElementEntry 5 } 1879 diffServClfrElementStatus OBJECT-TYPE 1880 SYNTAX RowStatus 1881 MAX-ACCESS read-create 1882 STATUS current 1883 DESCRIPTION 1884 "The RowStatus variable controls the activation, deactivation, or 1885 deletion of a classifier element. Any writ- able variable may be 1886 modified whether the row is active or notInService." 1887 ::= { diffServClfrElementEntry 6 } 1889 -- 1890 -- IP Six-Tuple Classification Table 1891 -- 1892 --Classification based on six different fields in the IP header. 1893 --Functional Data Paths may share definitions by using the same entry. 1894 -- 1896 diffServSixTupleClfrNextFree OBJECT-TYPE 1897 SYNTAX INTEGER (1..2147483647) 1898 MAX-ACCESS read-only 1899 STATUS current 1900 DESCRIPTION 1901 "This object yields a value when read that is currently unused for a 1902 diffServSixTupleClfrId instance. If a configuring system attempts to create a 1903 new row in the diffServSixTupleClfrTable using this value, but an instance has 1904 been created or is in the process of being created, that operation will fail." 1905 ::= { diffServClassifier 5 } 1907 diffServSixTupleClfrTable OBJECT-TYPE 1908 SYNTAX SEQUENCE OF DiffServSixTupleClfrEntry 1909 MAX-ACCESS not-accessible 1910 STATUS current 1911 DESCRIPTION 1912 "A table of IP Six-Tuple Classifier filter entries that a system 1913 may use to identify IP traffic." 1914 REFERENCE 1915 "[MODEL] section 4.2.2" 1916 ::= { diffServClassifier 6 } 1918 diffServSixTupleClfrEntry OBJECT-TYPE 1919 SYNTAX DiffServSixTupleClfrEntry 1920 MAX-ACCESS not-accessible 1921 STATUS current 1922 DESCRIPTION 1923 "An IP Six-Tuple Classifier entry describes a single filter." 1924 INDEX { diffServSixTupleClfrId } 1925 ::= { diffServSixTupleClfrTable 1 } 1927 DiffServSixTupleClfrEntry ::= SEQUENCE { 1928 diffServSixTupleClfrId INTEGER, 1929 diffServSixTupleClfrDstAddrType InetAddressType, 1930 diffServSixTupleClfrDstAddr InetAddress, 1931 diffServSixTupleClfrDstPrefixLength InetAddressPrefixLength, 1932 diffServSixTupleClfrSrcAddrType InetAddressType, 1933 diffServSixTupleClfrSrcAddr InetAddress, 1934 diffServSixTupleClfrSrcPrefixLength InetAddressPrefixLength, 1935 diffServSixTupleClfrDscp DscpOrAny, 1936 diffServSixTupleClfrProtocol Unsigned32, 1937 diffServSixTupleClfrDstL4PortMin InetPortNumber, 1938 diffServSixTupleClfrDstL4PortMax InetPortNumber, 1939 diffServSixTupleClfrSrcL4PortMin InetPortNumber, 1940 diffServSixTupleClfrSrcL4PortMax InetPortNumber, 1941 diffServSixTupleClfrStatus RowStatus 1942 } 1944 diffServSixTupleClfrId OBJECT-TYPE 1945 SYNTAX INTEGER (1..2147483647) 1946 MAX-ACCESS not-accessible 1947 STATUS current 1948 DESCRIPTION 1949 "An index that enumerates the Six Tuple Classifier filter 1950 entries. The set of such identifiers spans the whole agent. 1951 Managers obtain new values for row creation in this table by 1952 reading diffServSixTupleClfrNextFree." 1954 ::= { diffServSixTupleClfrEntry 1 } 1956 diffServSixTupleClfrDstAddrType OBJECT-TYPE 1957 SYNTAX InetAddressType 1958 MAX-ACCESS read-create 1959 STATUS current 1960 DESCRIPTION 1961 "The type of IP destination address used by this classifier 1962 entry." 1963 ::= { diffServSixTupleClfrEntry 2 } 1965 diffServSixTupleClfrDstAddr OBJECT-TYPE 1966 SYNTAX InetAddress 1967 MAX-ACCESS read-create 1968 STATUS current 1969 DESCRIPTION 1970 "The IP address to match against the packet's destination IP 1971 address. diffServSixTupleClfrDstPrefixLength indicates the number 1972 of bits that are relevant." 1973 ::= { diffServSixTupleClfrEntry 3 } 1975 diffServSixTupleClfrDstPrefixLength OBJECT-TYPE 1976 SYNTAX InetAddressPrefixLength 1977 UNITS "bits" 1978 MAX-ACCESS read-create 1979 STATUS current 1980 DESCRIPTION 1981 "The length of the CIDR Prefix carried in 1982 diffServSixTupleClfrDstAddr. In IPv4 addresses, a length of 0 1983 indicates a match of any address; a length of 32 indicates a 1984 match of a single host address, and a length between 0 and 32 1985 indicates the use of a CIDR Prefix. IPv6 is similar, except that 1986 prefix lengths range from 0..128." 1987 DEFVAL { 0 } 1988 ::= { diffServSixTupleClfrEntry 4 } 1990 diffServSixTupleClfrSrcAddrType OBJECT-TYPE 1991 SYNTAX InetAddressType 1992 MAX-ACCESS read-create 1993 STATUS current 1994 DESCRIPTION 1995 "The type of IP source address used by this classifier entry." 1996 ::= { diffServSixTupleClfrEntry 5 } 1998 diffServSixTupleClfrSrcAddr OBJECT-TYPE 1999 SYNTAX InetAddress 2000 MAX-ACCESS read-create 2001 STATUS current 2002 DESCRIPTION 2003 "The IP address to match against the packet's source IP address. 2004 diffServSixTupleClfrSrcPrefixLength indicates the number of bits 2005 that are relevant." 2006 ::= { diffServSixTupleClfrEntry 6 } 2008 diffServSixTupleClfrSrcPrefixLength OBJECT-TYPE 2009 SYNTAX InetAddressPrefixLength 2010 UNITS "bits" 2011 MAX-ACCESS read-create 2012 STATUS current 2013 DESCRIPTION 2014 "The length of the CIDR Prefix carried in 2015 diffServSixTupleClfrSrcAddr. In IPv4 addresses, a length of 0 2016 indicates a match of any address; a length of 32 indicates a 2017 match of a single host address, and a length between 0 and 32 2018 indicates the use of a CIDR Prefix. IPv6 is similar, except that 2019 prefix lengths range from 0..128." 2020 DEFVAL { 0 } 2021 ::= { diffServSixTupleClfrEntry 7 } 2023 diffServSixTupleClfrDscp OBJECT-TYPE 2024 SYNTAX DscpOrAny 2025 MAX-ACCESS read-create 2026 STATUS current 2027 DESCRIPTION 2028 "The value that the DSCP in the packet must have to match this 2029 entry. A value of -1 indicates that a specific DSCP value has not 2030 been defined and thus all DSCP values are considered a match." 2031 DEFVAL { -1 } 2032 ::= { diffServSixTupleClfrEntry 8 } 2034 diffServSixTupleClfrProtocol OBJECT-TYPE 2035 SYNTAX Unsigned32 (0..255) 2036 MAX-ACCESS read-create 2037 STATUS current 2038 DESCRIPTION 2039 "The IP protocol to match against the IPv4 protocol number or the 2040 IPv6 Next- Header number in the packet. A value of 255 means 2041 match all. Note the protocol number of 255 is reserved by IANA, 2042 and Next-Header number of 0 is used in IPv6." 2043 DEFVAL { 255 } 2044 ::= { diffServSixTupleClfrEntry 9 } 2046 diffServSixTupleClfrDstL4PortMin OBJECT-TYPE 2047 SYNTAX InetPortNumber 2048 MAX-ACCESS read-create 2049 STATUS current 2050 DESCRIPTION 2051 "The minimum value that the layer-4 destination port number in 2052 the packet must have in order to match this classifier entry." 2053 DEFVAL { 0 } 2054 ::= { diffServSixTupleClfrEntry 10 } 2055 diffServSixTupleClfrDstL4PortMax OBJECT-TYPE 2056 SYNTAX InetPortNumber 2057 MAX-ACCESS read-create 2058 STATUS current 2059 DESCRIPTION 2060 "The maximum value that the layer-4 destination port number in 2061 the packet must have in order to match this classifier entry. 2062 This value must be equal to or greater than the value specified 2063 for this entry in diffServSixTupleClfrDstL4PortMin." 2064 DEFVAL { 65535 } 2065 ::= { diffServSixTupleClfrEntry 11 } 2067 diffServSixTupleClfrSrcL4PortMin OBJECT-TYPE 2068 SYNTAX InetPortNumber 2069 MAX-ACCESS read-create 2070 STATUS current 2071 DESCRIPTION 2072 "The minimum value that the layer-4 source port number in the 2073 packet must have in order to match this classifier entry." 2074 DEFVAL { 0 } 2075 ::= { diffServSixTupleClfrEntry 12 } 2077 diffServSixTupleClfrSrcL4PortMax OBJECT-TYPE 2078 SYNTAX InetPortNumber 2079 MAX-ACCESS read-create 2080 STATUS current 2081 DESCRIPTION 2082 "The maximum value that the layer-4 source port number in the 2083 packet must have in oder to match this classifier entry. This 2084 value must be equal to or greater than the value specified for 2085 this entry in diffServSixTupleClfrSrcL4PortMin." 2086 DEFVAL { 65535 } 2087 ::= { diffServSixTupleClfrEntry 13 } 2089 diffServSixTupleClfrStatus OBJECT-TYPE 2090 SYNTAX RowStatus 2091 MAX-ACCESS read-create 2092 STATUS current 2093 DESCRIPTION 2094 "The RowStatus variable controls the activation, deactivation, or 2095 deletion of a classifier. Any writable variable may be modified 2096 whether the row is active or notInService." 2097 ::= { diffServSixTupleClfrEntry 14 } 2098 -- 2099 -- Meters 2100 -- 2102 diffServMeter OBJECT IDENTIFIER ::= { diffServMIBObjects 3 } 2104 -- 2105 -- This MIB supports a variety of Meters. It includes a specific 2106 -- definition for Token Bucket Meter, which are but one type of 2107 -- specification. Other metering parameter sets can be defined in other MIBs. 2108 -- 2109 -- Multiple meter elements may be logically cascaded using their 2110 -- diffServMeterSucceedNext and diffServMeterFailNext pointers if 2111 -- required. One example of this might be for an AF PHB implementation 2112 -- that uses multiple level conformance meters. 2113 -- 2114 -- Cascading of individual meter elements in the MIB is intended to be 2115 -- functionally equivalent to multiple level conformance determination 2116 -- of a packet. The sequential nature of the representation is merely 2117 -- a notational convenience for this MIB. 2118 -- 2119 -- srTCM meters (RFC 2697) can be specified using a single diffServMeterEntry 2120 -- and diffServTBParamEntry. It specifies the Committed Burst Size 2121 -- token-bucket. diffServTBParamRate reflects the Committed Information Rate. 2122 -- 2123 -- trTCM meters (RFC 2698) can be specified using a two diffServMeterEntries 2124 -- and diffServTBParamEntries. It specifies the Committed Burst Size in the 2125 -- first token-bucket, and the Excess Burst Size in the second. 2126 -- diffServTBParamRate in the first token bucket reflects the Committed 2127 -- Information Rate. 2128 -- 2129 -- tswTCM meters (RFC 2859) can be specified using a two diffServMeterEntries 2130 -- and diffServTBParamEntries. It specifies the Committed Target Rate in the 2131 -- first token-bucket, and the Excess Target Rate in the second. 2132 -- diffServTBParamInterval in each token bucket reflects the Average Interval. 2134 diffServMeterNextFree OBJECT-TYPE 2135 SYNTAX INTEGER (1..2147483647) 2136 MAX-ACCESS read-only 2137 STATUS current 2138 DESCRIPTION 2139 "This object yields a value when read that is currently unused 2140 for a diffServMeterId instance. If a configuring system attempts 2141 to create a new row in the diffServMeterTable using this value, 2142 but an instance has been created or is in the process of being 2143 created, that operation will fail." 2144 ::= { diffServMeter 1 } 2145 diffServMeterTable OBJECT-TYPE 2146 SYNTAX SEQUENCE OF DiffServMeterEntry 2147 MAX-ACCESS not-accessible 2148 STATUS current 2149 DESCRIPTION 2150 "This table enumerates specific meters that a system may use to 2151 police, or shape, a stream of traffic. The traffic stream to be 2152 metered is determined by the Differentiated Services Functional 2153 Data Path element(s) upstream of the meter i.e. by the object(s) 2154 that point to each entry in this table. This may include all 2155 traffic on an interface. 2157 Specific meter details are to be found in table entry referenced 2158 by diffServMeterSpecific." 2159 REFERENCE 2160 "[MODEL] section 5.1" 2161 ::= { diffServMeter 2 } 2163 diffServMeterEntry OBJECT-TYPE 2164 SYNTAX DiffServMeterEntry 2165 MAX-ACCESS not-accessible 2166 STATUS current 2167 DESCRIPTION 2168 "An entry in the meter table describes a single conformance level 2169 of a meter." 2170 INDEX { diffServMeterId } 2171 ::= { diffServMeterTable 1 } 2173 DiffServMeterEntry ::= SEQUENCE { 2174 diffServMeterId INTEGER, 2175 diffServMeterSucceedNext RowPointer, 2176 diffServMeterFailNext RowPointer, 2177 diffServMeterSpecific RowPointer, 2178 diffServMeterStatus RowStatus 2179 } 2181 diffServMeterId OBJECT-TYPE 2182 SYNTAX INTEGER (1..2147483647) 2183 MAX-ACCESS not-accessible 2184 STATUS current 2185 DESCRIPTION 2186 "An index that enumerates the Meter entries. The set of such 2187 identifiers spans the whole agent. Managers obtain new values for 2188 row creation in this table by reading diffServMeterNextFree." 2189 ::= { diffServMeterEntry 1 } 2191 diffServMeterSucceedNext OBJECT-TYPE 2192 SYNTAX RowPointer 2193 MAX-ACCESS read-create 2194 STATUS current 2195 DESCRIPTION 2196 "If the traffic does conform, this selects the next 2197 Differentiated Services Functional Data Path element to handle 2198 traffic for this data path. This RowPointer should point to an 2199 instance of one of: 2200 diffServClfrElementEntry 2201 diffServMeterEntry 2202 diffServActionEntry 2203 diffServAlgDropEntry 2204 diffServQEntry 2206 A value of zeroDotZero in this attribute indicates that no 2207 further Differentiated Services treatment is performed on traffic 2208 of this data path. The use of zeroDotZero is the normal usage for 2209 the last functional data path element of the current data path. 2211 If the row pointed to does not exist, the treatment is as if this 2212 attribute contains a value of zeroDotZero." 2213 DEFVAL { zeroDotZero } 2214 ::= { diffServMeterEntry 2 } 2216 diffServMeterFailNext OBJECT-TYPE 2217 SYNTAX RowPointer 2218 MAX-ACCESS read-create 2219 STATUS current 2220 DESCRIPTION 2221 "If the traffic does not conform, this selects the next 2222 Differentiated Services Functional Data Path element to handle 2223 traffic for this data path. This RowPointer should point to an 2224 instance of one of: 2225 diffServClfrElementEntry 2226 diffServMeterEntry 2227 diffServActionEntry 2228 diffServAlgDropEntry 2229 diffServQEntry 2231 A value of zeroDotZero in this attribute indicates no further 2232 Differentiated Services treatment is performed on traffic of this 2233 data path. The use of zeroDotZero is the normal usage for the 2234 last functional data path element of the current data path. 2236 If the row pointed to does not exist, the treatment is as if this 2237 attribute contains a value of zeroDotZero." 2238 DEFVAL { zeroDotZero } 2239 ::= { diffServMeterEntry 3 } 2241 diffServMeterSpecific OBJECT-TYPE 2242 SYNTAX RowPointer 2243 MAX-ACCESS read-create 2244 STATUS current 2245 DESCRIPTION 2246 "This indicates the behavior of the meter by pointing to an entry 2247 containing detailed parameters. Note that entries in that 2248 specific table must be managed explicitly. 2250 For example, diffServMeterSpecific may point to an entry in 2251 diffServTBParamTable, which contains an instance of a single set 2252 of Token Bucket parameters." 2253 ::= { diffServMeterEntry 4 } 2255 diffServMeterStatus OBJECT-TYPE 2256 SYNTAX RowStatus 2257 MAX-ACCESS read-create 2258 STATUS current 2259 DESCRIPTION 2260 "The RowStatus variable controls the activation, deactivation, or 2261 deletion of a meter. Any writable variable may be modified 2262 whether the row is active or notInService." 2263 ::= { diffServMeterEntry 5 } 2265 -- 2266 -- Token Bucket Parameter Table 2267 -- 2269 diffServTBParam OBJECT IDENTIFIER ::= { diffServMIBObjects 4 } 2271 -- Each entry in the Token Bucket Parameter Table parameterize a single 2272 -- token bucket. Multiple token buckets can be used together to 2273 -- parameterize multiple levels of conformance. 2274 -- 2275 -- Note that an entry in the Token Bucket Parameter Table can be shared 2276 -- by multiple diffServMeterTable and diffServSchedulerTable entries. 2277 -- 2279 diffServTBParamNextFree OBJECT-TYPE 2280 SYNTAX INTEGER (1..2147483647) 2281 MAX-ACCESS read-only 2282 STATUS current 2283 DESCRIPTION 2284 "This object yields a value when read that is currently unused 2285 for a diffServTBParamId instance. If a configuring system 2286 attempts to create a new row in the diffServTBParamTable using 2287 this value, but an instance has been created or is in the process 2288 of being created, that operation will fail." 2289 ::= { diffServTBParam 1 } 2291 diffServTBParamTable OBJECT-TYPE 2292 SYNTAX SEQUENCE OF DiffServTBParamEntry 2293 MAX-ACCESS not-accessible 2294 STATUS current 2295 DESCRIPTION 2296 "This table enumerates a single set of token bucket meter 2297 parameters that a system may use to police or shape a stream of 2298 traffic. Such meters are modeled here as having a single rate and 2299 a single burst size. Multiple entries are used when multiple 2300 rates/burst sizes are needed." 2301 REFERENCE 2302 "[MODEL] section 5.1" 2303 ::= { diffServTBParam 2 } 2305 diffServTBParamEntry OBJECT-TYPE 2306 SYNTAX DiffServTBParamEntry 2307 MAX-ACCESS not-accessible 2308 STATUS current 2309 DESCRIPTION 2310 "An entry that describes a single set of token bucket 2311 parameters." 2312 INDEX { diffServTBParamId } 2313 ::= { diffServTBParamTable 1 } 2315 DiffServTBParamEntry ::= SEQUENCE { 2316 diffServTBParamId INTEGER, 2317 diffServTBParamType OBJECT IDENTIFIER, 2318 diffServTBParamRate Unsigned32, 2319 diffServTBParamBurstSize BurstSize, 2320 diffServTBParamInterval Unsigned32, 2321 diffServTBParamStatus RowStatus 2322 } 2324 diffServTBParamId OBJECT-TYPE 2325 SYNTAX INTEGER (1..2147483647) 2326 MAX-ACCESS not-accessible 2327 STATUS current 2328 DESCRIPTION 2329 "An index that enumerates the Token Bucket Parameter entries. The 2330 set of such identifiers spans the whole agent. Managers obtain 2331 new values for row creation in this table by reading 2332 diffServTBParamNextFree." 2333 ::= { diffServTBParamEntry 1 } 2335 diffServTBParamType OBJECT-TYPE 2336 SYNTAX OBJECT IDENTIFIER 2337 MAX-ACCESS read-create 2338 STATUS current 2339 DESCRIPTION 2340 "The Metering/Shaping algorithm associated with the Token Bucket 2341 parameters. 2343 zeroDotZero indicates this is unknown. 2345 Standard values for generic algorithms: 2346 diffServTBParamSimpleTokenBucket, diffServTBParamAvgRate, 2347 diffServTBParamSrTCMBlind, diffServTBParamSrTCMAware, 2348 diffServTBParamTrTCMBlind, diffServTBParamTrTCMAware, and 2349 diffServTBParamTswTCM are specified in this MIB as OBJECT- 2350 IDENTITYS; additional values may be further specified in other 2351 MIBs." 2352 REFERENCE 2353 "[MODEL] section 5" 2354 ::= { diffServTBParamEntry 2 } 2356 diffServTBParamRate OBJECT-TYPE 2357 SYNTAX Unsigned32 2358 UNITS "kilobits per second" 2359 MAX-ACCESS read-create 2360 STATUS current 2361 DESCRIPTION 2362 "The token-bucket rate, in kilobits per second (kbps). This 2363 attribute is used for: 2364 1. CIR in RFC 2697 for srTCM 2365 2. PIR and CIR in RFC 2698 for trTCM 2366 3. CTR and PTR in RFC 2859 for TSWTCM 2367 4. AverageRate used in [MODEL] section 5." 2368 ::= { diffServTBParamEntry 3 } 2370 diffServTBParamBurstSize OBJECT-TYPE 2371 SYNTAX BurstSize 2372 UNITS "Bytes" 2373 MAX-ACCESS read-create 2374 STATUS current 2375 DESCRIPTION 2376 "The maximum number of bytes in a single transmission burst. This 2377 attribute is used for: 2378 1. CBS and EBS in RFC 2697 for srTCM 2379 2. CBS and PBS in RFC 2698 for trTCM 2380 3. Burst Size used in [MODEL] section 5." 2381 ::= { diffServTBParamEntry 4 } 2383 diffServTBParamInterval OBJECT-TYPE 2384 SYNTAX Unsigned32 2385 UNITS "microseconds" 2386 MAX-ACCESS read-create 2387 STATUS current 2388 DESCRIPTION 2389 "The time interval used with the token bucket. For: 2390 1. Average Rate Meter, [MODEL] section 5.2.1, - Delta. 2391 2. Simple Token Bucket Meter, [MODEL] section 5.1, 2392 - time interval t. 2393 3. RFC 2859 TSWTCM, - AVG_INTERVAL. 2394 4. RFC 2697 srTCM, RFC 2698 trTCM, - token bucket 2395 update time interval." 2396 ::= { diffServTBParamEntry 5 } 2398 diffServTBParamStatus OBJECT-TYPE 2399 SYNTAX RowStatus 2400 MAX-ACCESS read-create 2401 STATUS current 2402 DESCRIPTION 2403 "The RowStatus variable controls the activation, deactivation, or 2404 deletion of a meter. Any writable variable may be modified 2405 whether the row is active or notInService." 2406 ::= { diffServTBParamEntry 6 } 2408 diffServTBParamSimpleTokenBucket OBJECT-IDENTITY 2409 STATUS current 2410 DESCRIPTION 2411 "The value tokenBucket(2) indicates the use of Two Parameter 2412 Token Bucket Meter as described in [MODEL] section 5.2.3." 2413 REFERENCE 2414 "[MODEL] sections 5 and 7.1.2" 2415 ::= { diffServTBParam 3 } 2417 diffServTBParamAvgRate OBJECT-IDENTITY 2418 STATUS current 2419 DESCRIPTION 2420 "The value avgRate(3) indicates the use of Average Rate Meter as 2421 described in [MODEL] section 5.2.1." 2422 REFERENCE 2423 "[MODEL] sections 5 and 7.1.2" 2424 ::= { diffServTBParam 4 } 2426 diffServTBParamSrTCMBlind OBJECT-IDENTITY 2427 STATUS current 2428 DESCRIPTION 2429 "The values srTCMBlind(4) and srTCMAware(5) indicate the use of 2430 Single Rate Three Color Marker Metering as defined by RFC 2697, 2431 in either the `Color Blind' and `Color Aware' mode as described 2432 by the RFC." 2433 REFERENCE 2434 "[MODEL] sections 5 and 7.1.2" 2435 ::= { diffServTBParam 5 } 2437 diffServTBParamSrTCMAware OBJECT-IDENTITY 2438 STATUS current 2439 DESCRIPTION 2440 "The values srTCMBlind(4) and srTCMAware(5) indicate the use of 2441 Single Rate Three Color Marker Metering as defined by RFC 2697, 2442 in either the `Color Blind' and `Color Aware' mode as described 2443 by the RFC." 2444 REFERENCE 2445 "[MODEL] sections 5 and 7.1.2" 2446 ::= { diffServTBParam 6 } 2448 diffServTBParamTrTCMBlind OBJECT-IDENTITY 2449 STATUS current 2450 DESCRIPTION 2451 "The values trTCMBlind(6) and trTCMAware(7) indicate the use of 2452 Two Rate Three Color Marker Metering as defined by RFC 2698, in 2453 either the `Color Blind' and `Color Aware' mode as described by 2454 the RFC." 2455 REFERENCE 2456 "[MODEL] sections 5 and 7.1.2" 2457 ::= { diffServTBParam 7 } 2459 diffServTBParamTrTCMAware OBJECT-IDENTITY 2460 STATUS current 2461 DESCRIPTION 2462 "Value of trTCMBlind(6) and trTCMAware(7) indicates the use of 2463 Two Rate Three Color Marker Metering as defined by RFC 2698, with 2464 `Color Blind' and `Color Aware' mode as described by the RFC." 2465 REFERENCE 2466 "[MODEL] sections 5 and 7.1.2" 2467 ::= { diffServTBParam 8 } 2469 diffServTBParamTswTCM OBJECT-IDENTITY 2470 STATUS current 2471 DESCRIPTION 2472 "The value tswTCM(8) indicates the use of Time Sliding Window 2473 Three Color Marker Metering as defined by RFC 2859." 2474 REFERENCE 2475 "[MODEL] sections 5 and 7.1.2" 2476 ::= { diffServTBParam 9 } 2477 -- 2478 -- Actions 2479 -- 2481 diffServAction OBJECT IDENTIFIER ::= { diffServMIBObjects 5 } 2483 -- 2484 -- The Action Table allows enumeration of the different 2485 -- types of actions to be applied to a traffic flow. 2486 -- 2488 diffServActionNextFree OBJECT-TYPE 2489 SYNTAX INTEGER (1..2147483647) 2490 MAX-ACCESS read-only 2491 STATUS current 2492 DESCRIPTION 2493 "This object yields a value when read that is currently unused 2494 for a diffServActionId instance. If a configuring system attempts 2495 to create a new row in the diffServActionTable using this value, 2496 but an instance has been created or is in the process of being 2497 created, that operation will fail." 2498 ::= { diffServAction 1 } 2500 diffServActionTable OBJECT-TYPE 2501 SYNTAX SEQUENCE OF DiffServActionEntry 2502 MAX-ACCESS not-accessible 2503 STATUS current 2504 DESCRIPTION 2505 "The Action Table enumerates actions that can be performed to a 2506 stream of traffic. Multiple actions can be concatenated. For 2507 example, traffic exiting from a meter may be counted, marked, and 2508 potentially dropped before entering a queue. 2510 Specific actions are indicated by diffServActionSpecific which 2511 points to an entry of a specific action type parameterizing the 2512 action in detail." 2513 REFERENCE 2514 "[MODEL] section 6." 2515 ::= { diffServAction 2 } 2517 diffServActionEntry OBJECT-TYPE 2518 SYNTAX DiffServActionEntry 2519 MAX-ACCESS not-accessible 2520 STATUS current 2521 DESCRIPTION 2522 "Each entry in the action table allows description of one 2523 specific action to be applied to traffic." 2524 INDEX { diffServActionId } 2525 ::= { diffServActionTable 1 } 2527 DiffServActionEntry ::= SEQUENCE { 2528 diffServActionId INTEGER, 2529 diffServActionNext RowPointer, 2530 diffServActionSpecific RowPointer, 2531 diffServActionStatus RowStatus 2532 } 2534 diffServActionId OBJECT-TYPE 2535 SYNTAX INTEGER (1..2147483647) 2536 MAX-ACCESS not-accessible 2537 STATUS current 2538 DESCRIPTION 2539 "An index that enumerates the Action entries. The set of such 2540 identifiers spans the whole agent. Managers obtain new values for 2541 row creation in this table by reading diffServActionNextFree." 2542 ::= { diffServActionEntry 1 } 2544 diffServActionNext OBJECT-TYPE 2545 SYNTAX RowPointer 2546 MAX-ACCESS read-create 2547 STATUS current 2548 DESCRIPTION 2549 "This selects the next Differentiated Services Functional Data 2550 Path element to handle traffic for this data path. This 2551 RowPointer should point to an instance of one of: 2552 diffServClfrElementEntry 2553 diffServMeterEntry 2554 diffServActionEntry 2555 diffServQEntry 2557 A value of zeroDotZero in this attribute indicates no further 2558 Differentiated Services treatment is performed on traffic of this 2559 data path. The use of zeroDotZero is the normal usage for the 2560 last functional data path element of the current data path. 2562 If the row pointed to does not exist, the treatment is as if this 2563 attribute contains a value of zeroDotZero." 2564 DEFVAL { zeroDotZero } 2565 ::= { diffServActionEntry 2 } 2567 diffServActionSpecific OBJECT-TYPE 2568 SYNTAX RowPointer 2569 MAX-ACCESS read-create 2570 STATUS current 2571 DESCRIPTION 2572 "A pointer to an object instance providing additional information 2573 for the type of action indicated by this action table entry. 2575 For the standard actions defined by this MIB module, this should 2576 point to one of the following: a diffServDscpMarkActEntry, a 2577 diffServCountActEntry. For other actions, it may point to an 2578 object instance defined in some other MIB." 2579 ::= { diffServActionEntry 3 } 2581 diffServActionStatus OBJECT-TYPE 2582 SYNTAX RowStatus 2583 MAX-ACCESS read-create 2584 STATUS current 2585 DESCRIPTION 2586 "The RowStatus variable controls the activation, deactivation or 2587 deletion of an action element. Any writable variable may be 2588 modified whether the row is active or notInService." 2589 ::= { diffServActionEntry 4 } 2591 -- DSCP Mark Action Table 2592 -- 2593 -- Rows of this table are pointed to by diffServActionSpecific to 2594 -- provide detailed parameters specific to the DSCP Mark action. 2595 -- 2596 -- A single entry in this table can be shared by multiple 2597 -- diffServActionTable entries. 2598 -- 2600 diffServDscpMarkActTable OBJECT-TYPE 2601 SYNTAX SEQUENCE OF DiffServDscpMarkActEntry 2602 MAX-ACCESS not-accessible 2603 STATUS current 2604 DESCRIPTION 2605 "This table enumerates specific DSCPs used for marking or 2606 remarking the DSCP field of IP packets. The entries of this table 2607 may be referenced by a diffServActionSpecific attribute." 2608 REFERENCE 2609 "[MODEL] section 6.1" 2610 ::= { diffServAction 3 } 2612 diffServDscpMarkActEntry OBJECT-TYPE 2613 SYNTAX DiffServDscpMarkActEntry 2614 MAX-ACCESS not-accessible 2615 STATUS current 2616 DESCRIPTION 2617 "An entry in the DSCP mark action table that describes a single 2618 DSCP used for marking." 2619 INDEX { diffServDscpMarkActDscp } 2620 ::= { diffServDscpMarkActTable 1 } 2622 DiffServDscpMarkActEntry ::= SEQUENCE { 2623 diffServDscpMarkActDscp Dscp 2624 } 2626 diffServDscpMarkActDscp OBJECT-TYPE 2627 SYNTAX Dscp 2628 MAX-ACCESS read-only 2629 STATUS current 2630 DESCRIPTION 2631 "The DSCP that this Action will store into the DSCP field of the 2632 subject. It is quite possible that the only packets subject to 2633 this Action are already marked with this DSCP. Note also that 2634 Differentiated Services processing may result in packet being 2635 marked on both ingress to a network and on egress from it, and 2636 that ingress and egress can occur in the same router. 2638 Normally, index variables are not-accessible. However, in this 2639 case the OID of the entry serves as a OBJECT-IDENTITY indicating 2640 that traffic should be marked in a certain way, and specifying a 2641 second object seems redundant." 2642 ::= { diffServDscpMarkActEntry 1 } 2644 -- 2645 -- Count Action Table 2646 -- 2647 -- Because the MIB structure allows multiple cascading 2648 -- diffServActionEntry be used to describe multiple actions for a 2649 -- data path, the counter became an optional action type. In normal 2650 -- implementation, either a data path has counters or it does not, 2651 -- as opposed to being configurable. The management entity may choose 2652 -- to read the counter or not. Hence it is recommended for implementation 2653 -- that have counters to always configure the count action as the first 2654 -- of multiple actions, for example before a drop action. 2655 -- 2657 diffServCountActNextFree OBJECT-TYPE 2658 SYNTAX INTEGER (1..2147483647) 2659 MAX-ACCESS read-only 2660 STATUS current 2661 DESCRIPTION 2662 "This object yields a value when read that is currently unused for a 2663 diffServCountActId instance. If a configuring system attempts to create a new 2664 row in the diffServCountActTable using this value, but an instance has been 2665 created or is in the process of being created, that operation will fail." 2666 ::= { diffServAction 4 } 2668 diffServCountActTable OBJECT-TYPE 2669 SYNTAX SEQUENCE OF DiffServCountActEntry 2670 MAX-ACCESS not-accessible 2671 STATUS current 2672 DESCRIPTION 2673 "This table contains counters for all the traffic passing through 2674 an action element." 2675 REFERENCE 2676 "[MODEL] section 6.4" 2677 ::= { diffServAction 5 } 2679 diffServCountActEntry OBJECT-TYPE 2680 SYNTAX DiffServCountActEntry 2681 MAX-ACCESS not-accessible 2682 STATUS current 2683 DESCRIPTION 2684 "An entry in the count action table describes a single set of 2685 traffic counters." 2686 INDEX { diffServCountActId } 2687 ::= { diffServCountActTable 1 } 2689 DiffServCountActEntry ::= SEQUENCE { 2690 diffServCountActId INTEGER, 2691 diffServCountActOctets Counter32, 2692 diffServCountActHCOctets Counter64, 2693 diffServCountActPkts Counter32, 2694 diffServCountActHCPkts Counter64, 2695 diffServCountActDiscontTime TimeStamp, 2696 diffServCountActStatus RowStatus 2697 } 2699 diffServCountActId OBJECT-TYPE 2700 SYNTAX INTEGER (1..2147483647) 2701 MAX-ACCESS not-accessible 2702 STATUS current 2703 DESCRIPTION 2704 "An index that enumerates the Count Action entries. The set of 2705 such identifiers spans the whole agent. Managers obtain new 2706 values for row creation in this table by reading 2707 diffServCountActNextFree." 2708 ::= { diffServCountActEntry 1 } 2710 diffServCountActOctets OBJECT-TYPE 2711 SYNTAX Counter32 2712 MAX-ACCESS read-only 2713 STATUS current 2714 DESCRIPTION 2715 "The number of octets at the Action data path element. On high- 2716 speed devices, this object implements the least significant 32 2717 bits of diffServCountActHCOctets. 2719 Discontinuities in the value of this counter can occur at re- 2720 initialization of the management system and at other times as 2721 indicated by the value of diffServCountActDiscontTime for this 2722 entry." 2723 ::= { diffServCountActEntry 2 } 2725 diffServCountActHCOctets OBJECT-TYPE 2726 SYNTAX Counter64 2727 MAX-ACCESS read-only 2728 STATUS current 2729 DESCRIPTION 2730 "The number of octets at the Action data path element. This 2731 object should be used on high-speed interfaces. 2733 Discontinuities in the value of this counter can occur at re- 2734 initialization of the management system and at other times as 2735 indicated by the value of diffServCountActDiscontTime for this 2736 entry." 2737 ::= { diffServCountActEntry 3 } 2739 diffServCountActPkts OBJECT-TYPE 2740 SYNTAX Counter32 2741 MAX-ACCESS read-only 2742 STATUS current 2743 DESCRIPTION 2744 "The number of packets at the Action data path element. On high- 2745 speed devices, this object implements the least significant 32 2746 bits of diffServCountActHCPkts. 2748 Discontinuities in the value of this counter can occur at re- 2749 initialization of the management system and at other times as 2750 indicated by the value of diffServCountActDiscontTime for this 2751 entry." 2752 ::= { diffServCountActEntry 4 } 2754 diffServCountActHCPkts OBJECT-TYPE 2755 SYNTAX Counter64 2756 MAX-ACCESS read-only 2757 STATUS current 2758 DESCRIPTION 2759 "The number of packets at the Action data path element. This 2760 object should be used on high-speed interfaces. 2762 Discontinuities in the value of this counter can occur at re- 2763 initialization of the management system and at other times as 2764 indicated by the value of diffServCountActDiscontTime for this 2765 entry." 2766 ::= { diffServCountActEntry 5 } 2768 diffServCountActDiscontTime OBJECT-TYPE 2769 SYNTAX TimeStamp 2770 MAX-ACCESS read-only 2771 STATUS current 2772 DESCRIPTION 2773 "The value of sysUpTime on the most recent occasion at which any 2774 one or more of this entry's counters suffered a discontinuity. If 2775 no such discontinuities have occurred since the last re- 2776 initialization of the local management subsystem, then this 2777 object contains a zero value." 2778 ::= { diffServCountActEntry 6 } 2780 diffServCountActStatus OBJECT-TYPE 2781 SYNTAX RowStatus 2782 MAX-ACCESS read-create 2783 STATUS current 2784 DESCRIPTION 2785 "The RowStatus variable controls the activation, deactivation, or 2786 deletion of this entry. Any writable variable may be modified 2787 whether the row is active or notInService." 2788 ::= { diffServCountActEntry 7 } 2789 -- 2790 -- Algorithmic Drop Table 2791 -- 2793 diffServAlgDrop OBJECT IDENTIFIER ::= { diffServMIBObjects 6 } 2795 diffServAlgDropNextFree OBJECT-TYPE 2796 SYNTAX INTEGER (1..2147483647) 2797 MAX-ACCESS read-only 2798 STATUS current 2799 DESCRIPTION 2800 "This object yields a value when read that is currently unused 2801 for a diffServAlgDropId instance. If a configuring system 2802 attempts to create a new row in the diffServAlgDropTable using 2803 this value, but an instance has been created or is in the process 2804 of being created, that operation will fail." 2805 ::= { diffServAlgDrop 1 } 2807 diffServAlgDropTable OBJECT-TYPE 2808 SYNTAX SEQUENCE OF DiffServAlgDropEntry 2809 MAX-ACCESS not-accessible 2810 STATUS current 2811 DESCRIPTION 2812 "The algorithmic drop table contains entries describing an 2813 element that drops packets according to some algorithm." 2814 REFERENCE 2815 "[MODEL] section 7.1.3" 2816 ::= { diffServAlgDrop 2 } 2818 diffServAlgDropEntry OBJECT-TYPE 2819 SYNTAX DiffServAlgDropEntry 2820 MAX-ACCESS not-accessible 2821 STATUS current 2822 DESCRIPTION 2823 "An entry describes a process that drops packets according to 2824 some algorithm. Further details of the algorithm type are to be 2825 found in diffServAlgDropType and with more detail parameter entry 2826 pointed to by diffServAlgDropSpecific when necessary." 2827 INDEX { diffServAlgDropId } 2828 ::= { diffServAlgDropTable 1 } 2830 DiffServAlgDropEntry ::= SEQUENCE { 2831 diffServAlgDropId INTEGER, 2832 diffServAlgDropType INTEGER, 2833 diffServAlgDropNext RowPointer, 2834 diffServAlgDropQMeasure RowPointer, 2835 diffServAlgDropQThreshold Unsigned32, 2836 diffServAlgDropSpecific RowPointer, 2837 diffServAlgDropOctets Counter32, 2838 diffServAlgDropHCOctets Counter64, 2839 diffServAlgDropPkts Counter32, 2840 diffServAlgDropHCPkts Counter64, 2841 diffServAlgDropDiscontinuityTime TimeStamp, 2842 diffServAlgDropStatus RowStatus 2843 } 2845 diffServAlgDropId OBJECT-TYPE 2846 SYNTAX INTEGER (1..2147483647) 2847 MAX-ACCESS not-accessible 2848 STATUS current 2849 DESCRIPTION 2850 "An index that enumerates the Algorithmic Dropper entries. The 2851 set of such identifiers spans the whole agent. Managers obtain 2852 new values for row creation in this table by reading 2853 diffServAlgDropNextFree." 2854 ::= { diffServAlgDropEntry 1 } 2856 diffServAlgDropType OBJECT-TYPE 2857 SYNTAX INTEGER { 2858 other(1), 2859 tailDrop(2), 2860 headDrop(3), 2861 randomDrop(4), 2862 alwaysDrop(5) 2863 } 2864 MAX-ACCESS read-create 2865 STATUS current 2866 DESCRIPTION 2867 "The type of algorithm used by this dropper. The value other(1) 2868 requires further specification in some other MIB module. 2870 In the tailDrop(2) algorithm, diffServAlgDropQThreshold 2871 represents the maximum depth of the queue, pointed to by 2872 diffServAlgDropQMeasure, beyond which all newly arriving packets 2873 will be dropped. 2875 In the headDrop(3) algorithm, if a packet arrives when the 2876 current depth of the queue, pointed to by 2877 diffServAlgDropQMeasure, is at diffServAlgDropQThreshold, packets 2878 currently at the head of the queue are dropped to make room for 2879 the new packet to be enqueued at the tail of the queue. 2881 In the randomDrop(4) algorithm, on packet arrival, an Active 2882 Queue Management algorithm is executed which may randomly drop a 2883 packet. This algorithm may be proprietary, and it may drop either 2884 the arriving packet or another packet in the queue. 2885 diffServAlgDropSpecific points to a diffServRandomDropEntry that 2886 describes the algorithm. For this algorithm, 2887 diffServAlgQThreshold is understood to be the absolute maximum 2888 size of the queue and additional parameters are described in 2889 diffServRandomDropTable. 2891 The alwaysDrop(5) algorithm is as its name specifies; always 2892 drop. In this case, the other configuration values in this Entry 2893 are not meaningful; There is no useful the queue are not useful. 2894 Therefore, diffServAlgQNext, diffServAlgQMeasure, and 2895 diffServAlgQSpecific are all zeroDotZero." 2896 ::= { diffServAlgDropEntry 2 } 2898 diffServAlgDropNext OBJECT-TYPE 2899 SYNTAX RowPointer 2900 MAX-ACCESS read-create 2901 STATUS current 2902 DESCRIPTION 2903 "This selects the next Differentiated Services Functional Data 2904 Path element to handle traffic for this data path. This 2905 RowPointer should point to an instance of one of: 2906 diffServClfrElementEntry 2907 diffServMeterEntry 2908 diffServActionEntry 2909 diffServQEntry 2911 A value of zeroDotZero in this attribute indicates no further 2912 Differentiated Services treatment is performed on traffic of this 2913 data path. The use of zeroDotZero is the normal usage for the 2914 last functional data path element of the current data path. 2916 If the row pointed to does not exist, the treatment is as if this 2917 attribute contains a value of zeroDotZero." 2918 ::= { diffServAlgDropEntry 3 } 2920 diffServAlgDropQMeasure OBJECT-TYPE 2921 SYNTAX RowPointer 2922 MAX-ACCESS read-create 2923 STATUS current 2924 DESCRIPTION 2925 "Points to an entry in the diffServQTable to indicate the queue 2926 that a drop algorithm is to monitor when deciding whether to drop 2927 a packet. If the row pointed to does not exist, the algorithmic 2928 dropper element is considered inactive." 2929 ::= { diffServAlgDropEntry 4 } 2930 diffServAlgDropQThreshold OBJECT-TYPE 2931 SYNTAX Unsigned32 2932 UNITS "Bytes" 2933 MAX-ACCESS read-create 2934 STATUS current 2935 DESCRIPTION 2936 "A threshold on the depth in bytes of the queue being measured at 2937 which a trigger is generated to the dropping algorithm. 2939 For the tailDrop(2) or headDrop(3) algorithms, this represents 2940 the depth of the queue, pointed to by diffServAlgDropQMeasure, at 2941 which the drop action will take place. Other algorithms will need 2942 to define their own semantics for this threshold." 2943 ::= { diffServAlgDropEntry 5 } 2945 diffServAlgDropSpecific OBJECT-TYPE 2946 SYNTAX RowPointer 2947 MAX-ACCESS read-create 2948 STATUS current 2949 DESCRIPTION 2950 "Points to a table entry that provides further detail regarding a 2951 drop algorithm. 2953 Entries with diffServAlgDropType equal to other(1) may have this 2954 point to a table defined in another MIB module. 2956 Entries with diffServAlgDropType equal to randomDrop(4) must have 2957 this point to an entry in diffServRandomDropTable. 2959 For all other algorithms specified in this MIB, this should take 2960 the value zeroDotzero." 2961 ::= { diffServAlgDropEntry 6 } 2963 diffServAlgDropOctets OBJECT-TYPE 2964 SYNTAX Counter32 2965 MAX-ACCESS read-only 2966 STATUS current 2967 DESCRIPTION 2968 "The number of octets that have been dropped by this drop 2969 process. On high-speed devices, this object implements the least 2970 significant 32 bits of diffServAlgDropHCOctets. 2972 Discontinuities in the value of this counter can occur at re- 2973 initialization of the management system and at other times as 2974 indicated by the value of diffServAlgDropDiscontinuityTime for 2975 this Entry." 2976 ::= { diffServAlgDropEntry 7 } 2977 diffServAlgDropHCOctets OBJECT-TYPE 2978 SYNTAX Counter64 2979 MAX-ACCESS read-only 2980 STATUS current 2981 DESCRIPTION 2982 "The number of octets that have been dropped by this drop 2983 process. This object should be used on high-speed interfaces. 2985 Discontinuities in the value of this counter can occur at re- 2986 initialization of the management system and at other times as 2987 indicated by the value of diffServAlgDropDiscontinuityTime for 2988 this Entry." 2989 ::= { diffServAlgDropEntry 8 } 2991 diffServAlgDropPkts OBJECT-TYPE 2992 SYNTAX Counter32 2993 MAX-ACCESS read-only 2994 STATUS current 2995 DESCRIPTION 2996 "The number of packets that have been dropped by this drop 2997 process. On high- speed devices, this object implements the least 2998 significant 32 bits of diffServAlgDropHCPkts. 3000 Discontinuities in the value of this counter can occur at re- 3001 initialization of the management system and at other times as 3002 indicated by the value of diffServAlgDropDiscontinuityTime for 3003 this Entry." 3004 ::= { diffServAlgDropEntry 9 } 3006 diffServAlgDropHCPkts OBJECT-TYPE 3007 SYNTAX Counter64 3008 MAX-ACCESS read-only 3009 STATUS current 3010 DESCRIPTION 3011 "The number of packets that have been dropped by this drop 3012 process. This object should be used on high-speed interfaces. 3014 Discontinuities in the value of this counter can occur at re- 3015 initialization of the management system and at other times as 3016 indicated by the value of diffServAlgDropDiscontinuityTime for 3017 this Entry." 3018 ::= { diffServAlgDropEntry 10 } 3020 diffServAlgDropDiscontinuityTime OBJECT-TYPE 3021 SYNTAX TimeStamp 3022 MAX-ACCESS read-only 3023 STATUS current 3024 DESCRIPTION 3025 "The value of sysUpTime on the most recent occasion at which any 3026 one or more of this entry's counters suffered a discontinuity. If 3027 no such discontinuities have occurred since the last re- 3028 initialization of the local management subsystem, then this 3029 object contains a zero value." 3030 ::= { diffServAlgDropEntry 11 } 3032 diffServAlgDropStatus OBJECT-TYPE 3033 SYNTAX RowStatus 3034 MAX-ACCESS read-create 3035 STATUS current 3036 DESCRIPTION 3037 "The RowStatus variable controls the activation, deactivation, or 3038 deletion of this entry. Any writable variable may be modified 3039 whether the row is active or notInService." 3040 ::= { diffServAlgDropEntry 12 } 3042 -- 3043 -- Random Drop Table 3044 -- 3046 diffServRandomDropNextFree OBJECT-TYPE 3047 SYNTAX INTEGER (1..2147483647) 3048 MAX-ACCESS read-only 3049 STATUS current 3050 DESCRIPTION 3051 "This object yields a value when read that is currently unused 3052 for a diffServRandomDropId instance. If a configuring system 3053 attempts to create a new row in the diffServRandomDropTable using 3054 this value, but an instance has been created or is in the process 3055 of being created, that operation will fail." 3056 ::= { diffServAlgDrop 3 } 3058 diffServRandomDropTable OBJECT-TYPE 3059 SYNTAX SEQUENCE OF DiffServRandomDropEntry 3060 MAX-ACCESS not-accessible 3061 STATUS current 3062 DESCRIPTION 3063 "The random drop table contains entries describing a process that 3064 drops packets randomly. Entries in this table are pointed to by 3065 diffServAlgDropSpecific." 3066 REFERENCE 3067 "[MODEL] section 7.1.3" 3068 ::= { diffServAlgDrop 4 } 3070 diffServRandomDropEntry OBJECT-TYPE 3071 SYNTAX DiffServRandomDropEntry 3072 MAX-ACCESS not-accessible 3073 STATUS current 3074 DESCRIPTION 3075 "An entry describes a process that drops packets according to a 3076 random algorithm." 3077 INDEX { diffServRandomDropId } 3078 ::= { diffServRandomDropTable 1 } 3080 DiffServRandomDropEntry ::= SEQUENCE { 3081 diffServRandomDropId INTEGER, 3082 diffServRandomDropMinThreshBytes Unsigned32, 3083 diffServRandomDropMinThreshPkts Unsigned32, 3084 diffServRandomDropMaxThreshBytes Unsigned32, 3085 diffServRandomDropMaxThreshPkts Unsigned32, 3086 diffServRandomDropProbMax INTEGER, 3087 diffServRandomDropWeight INTEGER, 3088 diffServRandomDropSamplingRate INTEGER, 3089 diffServRandomDropStatus RowStatus 3090 } 3092 diffServRandomDropId OBJECT-TYPE 3093 SYNTAX INTEGER (1..2147483647) 3094 MAX-ACCESS not-accessible 3095 STATUS current 3096 DESCRIPTION 3097 "An index that enumerates the Random Drop entries. The set of 3098 such identifiers spans the whole agent. Managers obtain new 3099 values for row creation in this table by reading 3100 diffServRandomDropNextFree." 3101 ::= { diffServRandomDropEntry 1 } 3103 diffServRandomDropMinThreshBytes OBJECT-TYPE 3104 SYNTAX Unsigned32 3105 UNITS "bytes" 3106 MAX-ACCESS read-create 3107 STATUS current 3108 DESCRIPTION 3109 "The average queue depth in bytes, beyond which traffic has a 3110 non-zero probability of being dropped. Changes in this variable 3111 may or may not be reflected in the reported value of 3112 diffServRandomDropMinThreshPkts." 3113 ::= { diffServRandomDropEntry 2 } 3115 diffServRandomDropMinThreshPkts OBJECT-TYPE 3116 SYNTAX Unsigned32 3117 UNITS "packets" 3118 MAX-ACCESS read-create 3119 STATUS current 3120 DESCRIPTION 3121 "The average queue depth in packets, beyond which traffic has a 3122 non-zero probability of being dropped. Changes in this variable 3123 may or may not be reflected in the reported value of 3124 diffServRandomDropMinThreshBytes." 3125 ::= { diffServRandomDropEntry 3 } 3127 diffServRandomDropMaxThreshBytes OBJECT-TYPE 3128 SYNTAX Unsigned32 3129 UNITS "bytes" 3130 MAX-ACCESS read-create 3131 STATUS current 3132 DESCRIPTION 3133 "The average queue depth beyond which traffic has a probability 3134 indicated by diffServRandomDropProbMax of being dropped or 3135 marked. Note that this differs from the physical queue limit, 3136 which is stored in diffServAlgDropQThreshold. Changes in this 3137 variable may or may not be reflected in the reported value of 3138 diffServRandomDropMaxThreshPkts." 3139 ::= { diffServRandomDropEntry 4 } 3141 diffServRandomDropMaxThreshPkts OBJECT-TYPE 3142 SYNTAX Unsigned32 3143 UNITS "packets" 3144 MAX-ACCESS read-create 3145 STATUS current 3146 DESCRIPTION 3147 "The average queue depth beyond which traffic has a probability 3148 indicated by diffServRandomDropProbMax of being dropped or 3149 marked. Note that this differs from the physical queue limit, 3150 which is stored in diffServAlgDropQThreshold. Changes in this 3151 variable may or may not be reflected in the reported value of 3152 diffServRandomDropMaxThreshBytes." 3153 ::= { diffServRandomDropEntry 5 } 3155 diffServRandomDropProbMax OBJECT-TYPE 3156 SYNTAX INTEGER (0..1000) 3157 MAX-ACCESS read-create 3158 STATUS current 3159 DESCRIPTION 3160 "The worst case random drop probability, expressed in drops per 3161 thousand packets. 3163 For example, if in the worst case every arriving packet may be 3164 dropped (100%) for a period, this has the value 1000. 3165 Alternatively, if in the worst case only one percent (1%) of 3166 traffic may be dropped, it has the value 10." 3167 ::= { diffServRandomDropEntry 6 } 3169 diffServRandomDropWeight OBJECT-TYPE 3170 SYNTAX INTEGER (0..65536) 3171 MAX-ACCESS read-create 3172 STATUS current 3173 DESCRIPTION 3174 "The weighting of past history in affecting the Exponentially 3175 Weighted Moving Average function which calculates the current 3176 average queue depth. The equation uses 3177 diffServRandomDropWeight/65536 as the coefficient for the new 3178 sample in the equation, and (65536 - 3179 diffServRandomDropWeight)/65536 as the coefficient of the old 3180 value. 3182 Implementations may limit the values of diffServRandomDropWeight 3183 to a subset of the possible range of values, such as powers of 3184 two. Doing this would facilitate implementation of the 3185 Exponentially Weighted Moving Average using shift instructions or 3186 registers." 3187 ::= { diffServRandomDropEntry 7 } 3189 diffServRandomDropSamplingRate OBJECT-TYPE 3190 SYNTAX INTEGER (0..1000000) 3191 MAX-ACCESS read-create 3192 STATUS current 3193 DESCRIPTION 3194 "The number of times per second the queue is sampled for queue 3195 average calculation. A value of zero is used to mean that the 3196 queue is sampled approximately each time a packet is enqueued (or 3197 dequeued)." 3198 ::= { diffServRandomDropEntry 8 } 3200 diffServRandomDropStatus OBJECT-TYPE 3201 SYNTAX RowStatus 3202 MAX-ACCESS read-create 3203 STATUS current 3204 DESCRIPTION 3205 "The RowStatus variable controls the activation, deactivation, or 3206 deletion of this entry. Any writable variable may be modified 3207 whether the row is active or notInService." 3208 ::= { diffServRandomDropEntry 9 } 3209 -- 3210 -- Queue Table 3211 -- 3213 diffServQueue OBJECT IDENTIFIER ::= { diffServMIBObjects 7 } 3215 -- 3216 -- An entry of diffServQTable represents a FIFO queue Differentiated 3217 -- Services Functional Data Path element as described in [MODEL] section 3218 -- 7.1.1. Note that the specification of scheduling parameters for a 3219 -- queue as part of the input to a scheduler functional data path element 3220 -- as described in [MODEL] section 7.1.2. This allows building of 3221 -- hierarchical queuing/scheduling. A queue therefore has these attributes: 3222 -- 1. Which scheduler will service this queue, diffServQNext. 3223 -- 2. How the scheduler will service this queue, with respect 3224 -- to all the other queues the same scheduler needs to service, 3225 -- diffServQRate. 3226 -- 3227 -- Note that upstream Differentiated Services Functional Data Path 3228 -- elements may point to a shared diffServQTable entry as described 3229 -- in [MODEL] section 7.1.1. 3230 -- 3232 diffServQNextFree OBJECT-TYPE 3233 SYNTAX INTEGER (1..2147483647) 3234 MAX-ACCESS read-only 3235 STATUS current 3236 DESCRIPTION 3237 "This object yields a value when read that is currently unused 3238 for a diffServQId instance. If a configuring system attempts to 3239 create a new row in the diffServQTable using this value, but an 3240 instance has been created or is in the process of being created, 3241 that operation will fail." 3242 ::= { diffServQueue 1 } 3244 diffServQTable OBJECT-TYPE 3245 SYNTAX SEQUENCE OF DiffServQEntry 3246 MAX-ACCESS not-accessible 3247 STATUS current 3248 DESCRIPTION 3249 "The Queue Table enumerates the individual queues." 3250 REFERENCE 3251 "[MODEL] section 7.1.1" 3252 ::= { diffServQueue 2 } 3254 diffServQEntry OBJECT-TYPE 3255 SYNTAX DiffServQEntry 3256 MAX-ACCESS not-accessible 3257 STATUS current 3258 DESCRIPTION 3259 "An entry in the Queue Table describes a single queue. With each 3260 entry belonging to one and only one data path." 3261 INDEX { diffServQId } 3262 ::= { diffServQTable 1 } 3264 DiffServQEntry ::= SEQUENCE { 3265 diffServQId INTEGER, 3266 diffServQNext RowPointer, 3267 diffServQRate RowPointer, 3268 diffServQShaper RowPointer, 3269 diffServQStatus RowStatus 3270 } 3272 diffServQId OBJECT-TYPE 3273 SYNTAX INTEGER (1..2147483647) 3274 MAX-ACCESS not-accessible 3275 STATUS current 3276 DESCRIPTION 3277 "An index that enumerates the Queue entries. The set of such 3278 identifiers spans the whole agent. Managers obtain new values for 3279 row creation in this table by reading diffServQNextFree." 3280 ::= { diffServQEntry 1 } 3282 diffServQNext OBJECT-TYPE 3283 SYNTAX RowPointer 3284 MAX-ACCESS read-create 3285 STATUS current 3286 DESCRIPTION 3287 "This selects the next Differentiated Services Functional Data 3288 Path element to handle traffic for this data path. This 3289 RowPointer must point to a diffServSchedulerEntry. 3291 A value of zeroDotZero in this attribute indicates an incomplete 3292 diffServQEntry instance. In such a case, the entry has no 3293 operational effect, since it has no parameters to give it 3294 meaning. 3296 If the row pointed to does not exist, the treatment is as if this 3297 attribute contains a value of zeroDotZero." 3298 ::= { diffServQEntry 2 } 3300 diffServQRate OBJECT-TYPE 3301 SYNTAX RowPointer 3302 MAX-ACCESS read-create 3303 STATUS current 3304 DESCRIPTION 3305 "This RowPointer indicates the diffServAssuredRateEntry that the 3306 scheduler, pointed to by diffServQNext, should use to service 3307 this queue. 3309 If the row pointed to is zeroDotZero or does not exist, the 3310 minimum rate is unspecified." 3311 ::= { diffServQEntry 3 } 3313 diffServQShaper OBJECT-TYPE 3314 SYNTAX RowPointer 3315 MAX-ACCESS read-create 3316 STATUS current 3317 DESCRIPTION 3318 "This RowPointer indicates the diffServShapingRateEntry that the 3319 scheduler, pointed to by diffServQNext, should use to service 3320 this queue. 3322 If the row pointed to does not exist or is zeroDotZero, the 3323 maximum rate is the line speed of the interface." 3324 ::= { diffServQEntry 4 } 3326 diffServQStatus OBJECT-TYPE 3327 SYNTAX RowStatus 3328 MAX-ACCESS read-create 3329 STATUS current 3330 DESCRIPTION 3331 "The RowStatus variable controls the activation, deactivation, or 3332 deletion of a queue. Any writable variable may be modified 3333 whether the row is active or notInService." 3334 ::= { diffServQEntry 5 } 3336 -- 3337 -- Scheduler Table 3338 -- 3340 diffServScheduler OBJECT IDENTIFIER ::= { diffServMIBObjects 8 } 3342 -- 3343 -- A Scheduler Entry represents a packet scheduler, such as a priority 3344 -- scheduler or a WFQ scheduler. It provides flexibility for multiple 3345 -- scheduling algorithms, each servicing multiple queues, to be used on 3346 -- the same logical/physical interface. 3347 -- 3348 -- Note that upstream queues or schedulers specify several of the 3349 -- scheduler's parameters. These must be properly specified if the 3350 -- scheduler is to behave as expected. 3351 -- 3352 -- The diffServSchedulerShaper attribute specifies the parameters 3353 -- when a scheduler's output is sent to another scheduler. This is 3354 -- used in building hierarchical queues or schedulers. 3355 -- 3356 -- More discussion of the scheduler functional data path element is 3357 -- in [MODEL] section 7.1.2. 3358 -- 3360 diffServSchedulerNextFree OBJECT-TYPE 3361 SYNTAX INTEGER (1..2147483647) 3362 MAX-ACCESS read-only 3363 STATUS current 3364 DESCRIPTION 3365 "This object yields a value when read that is currently unused 3366 for a diffServSchedulerId instance. If a configuring system 3367 attempts to create a new row in the diffServSchedulerTable using 3368 this value, but an instance has been created or is in the process 3369 of being created, that operation will fail." 3370 ::= { diffServScheduler 1 } 3372 diffServSchedulerTable OBJECT-TYPE 3373 SYNTAX SEQUENCE OF DiffServSchedulerEntry 3374 MAX-ACCESS not-accessible 3375 STATUS current 3376 DESCRIPTION 3377 "The Scheduler Table enumerates packet schedulers. Multiple 3378 scheduling algorithms can be used on a given data path, with each 3379 algorithm described by one diffServSchedulerEntry." 3380 REFERENCE 3381 "[MODEL] section 7.1.2" 3382 ::= { diffServScheduler 2 } 3384 diffServSchedulerEntry OBJECT-TYPE 3385 SYNTAX DiffServSchedulerEntry 3386 MAX-ACCESS not-accessible 3387 STATUS current 3388 DESCRIPTION 3389 "An entry in the Scheduler Table describing a single instance of 3390 a scheduling algorithm." 3391 INDEX { diffServSchedulerId } 3392 ::= { diffServSchedulerTable 1 } 3394 DiffServSchedulerEntry ::= SEQUENCE { 3395 diffServSchedulerId INTEGER, 3396 diffServSchedulerNext RowPointer, 3397 diffServSchedulerMethod OBJECT IDENTIFIER, 3398 diffServSchedulerRate RowPointer, 3399 diffServSchedulerShaper RowPointer, 3400 diffServSchedulerStatus RowStatus 3401 } 3403 diffServSchedulerId OBJECT-TYPE 3404 SYNTAX INTEGER (1..2147483647) 3405 MAX-ACCESS not-accessible 3406 STATUS current 3407 DESCRIPTION 3408 "An index that enumerates the Scheduler entries. The set of such 3409 identifiers spans the whole agent. Managers obtain new values for 3410 row creation in this table by reading diffServSchedulerNextFree." 3411 ::= { diffServSchedulerEntry 1 } 3413 diffServSchedulerNext OBJECT-TYPE 3414 SYNTAX RowPointer 3415 MAX-ACCESS read-create 3416 STATUS current 3417 DESCRIPTION 3418 "This selects the next Differentiated Services Functional Data 3419 Path element to handle traffic for this data path. This 3420 RowPointer should point to an instance of one of: 3421 diffServSchedulerEntry 3422 diffServQEntry as indicated by [MODEL] section 7.1.4. 3424 However, this RowPointer may also point to an instance of:. 3425 diffServClfrElementEntry 3426 diffServMeterEntry 3427 diffServActionEntry 3428 diffServAlgDropEntry to extend the same data path. 3430 This should point to another diffServSchedulerEntry for 3431 implementation of multiple scheduler methods for the same data 3432 path, and for implementation of hierarchical schedulers. 3434 If the row pointed to does not exist or is zeroDotZero, no 3435 further Differentiated Services treatment is performed on traffic 3436 of this data path." 3438 DEFVAL { zeroDotZero } 3439 ::= { diffServSchedulerEntry 2 } 3441 diffServSchedulerMethod OBJECT-TYPE 3442 SYNTAX OBJECT IDENTIFIER 3443 MAX-ACCESS read-create 3444 STATUS current 3445 DESCRIPTION 3446 "The scheduling algorithm used by this Scheduler. zeroDotZero 3447 indicates that this is unknown. Standard values for generic 3448 algorithms: diffServSchedulerPriority, diffServSchedulerWRR, and 3449 diffServSchedulerWFQ are specified in this MIB; additional values 3450 may be further specified in other MIBs." 3451 REFERENCE 3452 "[MODEL] section 7.1.2" 3453 ::= { diffServSchedulerEntry 3 } 3455 diffServSchedulerRate OBJECT-TYPE 3456 SYNTAX RowPointer 3457 MAX-ACCESS read-create 3458 STATUS current 3459 DESCRIPTION 3460 "This RowPointer indicates the entry in diffServAssuredRateTable 3461 which indicates the priority or minimum output rate from this 3462 scheduler. This attribute is used only when there is more than 3463 one level of scheduler. It should have the value of zeroDotZero 3464 when not used." 3465 DEFVAL { zeroDotZero } 3466 ::= { diffServSchedulerEntry 4 } 3468 diffServSchedulerShaper OBJECT-TYPE 3469 SYNTAX RowPointer 3470 MAX-ACCESS read-create 3471 STATUS current 3472 DESCRIPTION 3473 "This RowPointer indicates the entry in diffServShapingRateTable 3474 which indicates the maximum output rate from this scheduler. This 3475 attribute is used only when there is more than one level of 3476 scheduler. It should have the value of zeroDotZero when not 3477 used." 3478 DEFVAL { zeroDotZero } 3479 ::= { diffServSchedulerEntry 5 } 3481 diffServSchedulerStatus OBJECT-TYPE 3482 SYNTAX RowStatus 3483 MAX-ACCESS read-create 3484 STATUS current 3485 DESCRIPTION 3486 "The RowStatus variable controls the activation, deactivation, or 3487 deletion of a scheduler. Any writable variable may be modified 3488 whether the row is active or notInService." 3489 ::= { diffServSchedulerEntry 6 } 3490 diffServSchedulerPriority OBJECT-IDENTITY 3491 STATUS current 3492 DESCRIPTION 3493 "When the next scheduler uses Priority scheduling, defined as an 3494 algorithm in which the presence of data in a queue or set of 3495 queues absolutely precludes dequeue from another queue or set of 3496 queues, this indicates the relative priority of the traffic 3497 stream. Note that attributes from diffServAssuredRateEntry of the 3498 queues/schedulers feeding this scheduler are used when 3499 determining the next packet to schedule." 3500 REFERENCE 3501 "[MODEL] section 7.1.2" 3502 ::= { diffServScheduler 3 } 3504 diffServSchedulerWRR OBJECT-IDENTITY 3505 STATUS current 3506 DESCRIPTION 3507 "For use with diffServSchedulerMethod to indicate Weighted Round 3508 Robin scheduling method, defined as any algorithm in which a set 3509 of queues are visited in a fixed order, and varying amounts of 3510 traffic are removed from each queue in turn to implement an 3511 average output rate by class. Notice attributes from 3512 diffServAssuredRateEntry of the queues/schedulers feeding this 3513 scheduler are used when determining the next packet to schedule." 3514 REFERENCE 3515 "[MODEL] section 7.1.2" 3516 ::= { diffServScheduler 4 } 3518 diffServSchedulerWFQ OBJECT-IDENTITY 3519 STATUS current 3520 DESCRIPTION 3521 "For use with diffServSchedulerMethod to indicate Weighted Fair 3522 Queuing scheduling method, defined as any algorithm in which a 3523 set of queues are conceptually visited in some order, to 3524 implement an average output rate by class. Notice attributes from 3525 diffServAssuredRateEntry of the queues/schedulers feeding this 3526 scheduler are used when determining the next packet to schedule." 3527 REFERENCE 3528 "[MODEL] section 7.1.2" 3529 ::= { diffServScheduler 5 } 3530 -- 3531 --Assured Rate Parameters Table 3532 -- 3533 -- The parameters used by a scheduler for its inputs or outputs are 3534 -- maintained separately from the Queue or Scheduler table entries 3535 -- for reusability reasons and so that they may be used by both queues 3536 -- and schedulers. This follows the approach for separation of data 3537 -- path elements from parameterization that is used throughout this MIB. 3538 -- Use of these Assured Rate Parameter Table entries by Queues and 3539 -- Schedulers allows the modeling of hierarchical scheduling systems. 3540 -- 3541 -- Specifically, a Scheduler has one or more inputs and one output. 3542 -- Any queue feeding a scheduler, or any scheduler which feeds a second 3543 -- scheduler, might specify a minimum transfer rate by pointing to an 3544 -- Assured Rate Parameter Table entry. 3545 -- 3546 -- The diffServAssuredRatePriority/Abs/Rel attributes are used as 3547 -- parameters to the work-conserving portion of a scheduler: 3548 -- "work-conserving" implies that the scheduler can continue to emit 3549 -- data as long as there is data available at its input(s). This has 3550 -- the effect of guaranteeing a certain priority relative to other 3551 -- scheduler inputs and/or a certain minimum proportion of the available 3552 -- output bandwidth. Properly configured, this means a certain minimum 3553 -- rate, which may be exceeded should traffic be available should there 3554 -- be spare bandwidth after all other classes have had opportunities to 3555 -- consume their own minimum rates. 3556 -- 3558 diffServAssuredRateNextFree OBJECT-TYPE 3559 SYNTAX INTEGER (1..2147483647) 3560 MAX-ACCESS read-only 3561 STATUS current 3562 DESCRIPTION 3563 "This object yields a value when read that is currently unused 3564 for a diffServAssuredRateId instance. If a configuring system 3565 attempts to create a new row in the diffServAssuredRateTable 3566 using this value, but an instance has been created or is in the 3567 process of being created, that operation will fail." 3568 ::= { diffServScheduler 6 } 3570 diffServAssuredRateTable OBJECT-TYPE 3571 SYNTAX SEQUENCE OF DiffServAssuredRateEntry 3572 MAX-ACCESS not-accessible 3573 STATUS current 3574 DESCRIPTION 3575 "The Assured Rate Parameters Table enumerates individual sets of 3576 scheduling parameter that can be used/reused by Queues and 3577 Schedulers." 3578 ::= { diffServScheduler 7 } 3580 diffServAssuredRateEntry OBJECT-TYPE 3581 SYNTAX DiffServAssuredRateEntry 3582 MAX-ACCESS not-accessible 3583 STATUS current 3584 DESCRIPTION 3585 "An entry in the Assured Rate Parameters Table describes a single 3586 set of scheduling parameters for use by one or more queues or 3587 schedulers." 3588 INDEX { diffServAssuredRateId } 3589 ::= { diffServAssuredRateTable 1 } 3591 DiffServAssuredRateEntry ::= SEQUENCE { 3592 diffServAssuredRateId INTEGER, 3593 diffServAssuredRatePriority Unsigned32, 3594 diffServAssuredRateAbs Unsigned32, 3595 diffServAssuredRateRel Unsigned32, 3596 diffServAssuredRateStatus RowStatus 3597 } 3599 diffServAssuredRateId OBJECT-TYPE 3600 SYNTAX INTEGER (1..2147483647) 3601 MAX-ACCESS not-accessible 3602 STATUS current 3603 DESCRIPTION 3604 "An index that enumerates the Scheduler Parameter entries. The 3605 set of such identifiers spans the whole agent. Managers obtain 3606 new values for row creation in this table by reading 3607 diffServAssuredRateNextFree." 3608 ::= { diffServAssuredRateEntry 1 } 3610 diffServAssuredRatePriority OBJECT-TYPE 3611 SYNTAX Unsigned32 3612 MAX-ACCESS read-create 3613 STATUS current 3614 DESCRIPTION 3615 "The priority of this input to the associated scheduler, relative 3616 to the scheduler's other inputs." 3617 ::= { diffServAssuredRateEntry 2 } 3619 diffServAssuredRateAbs OBJECT-TYPE 3620 SYNTAX Unsigned32 3621 UNITS "kilobits per second" 3622 MAX-ACCESS read-create 3623 STATUS current 3624 DESCRIPTION 3625 "The minimum absolute rate, in kilobits/sec, that a downstream 3626 scheduler element should allocate to this queue. If the value is 3627 zero, then there is effectively no minimum rate guarantee. If the 3628 value is non-zero, the scheduler will assure the servicing of 3629 this queue to at least this rate. 3631 Note that this attribute value and that of diffServAssuredRateRel 3632 are coupled: changes to one will affect the value of the other. 3633 They are linked by the following equation: 3635 diffServAssuredRateRel = diffServAssuredRateAbs * 1000/ifSpeed 3637 or, if appropriate: 3639 diffServAssuredRateRel = diffServAssuredRateAbs * 1000/ifHighSpeed" 3640 REFERENCE 3641 "ifSpeed, ifHighSpeed from [IFMIB]" 3642 ::= { diffServAssuredRateEntry 3 } 3644 diffServAssuredRateRel OBJECT-TYPE 3645 SYNTAX Unsigned32 3646 MAX-ACCESS read-create 3647 STATUS current 3648 DESCRIPTION 3649 "The minimum rate that a downstream scheduler element should 3650 allocate to this queue, relative to the maximum rate of the 3651 interface as reported by ifSpeed or ifHighSpeed, in units of 3652 1/1000 of 1. If the value is zero, then there is effectively no 3653 minimum rate guarantee. If the value is non-zero, the scheduler 3654 will assure the servicing of this queue to at least this rate. 3656 Note that this attribute value and that of diffServAssuredRateAbs 3657 are coupled: changes to one will affect the value of the other. 3658 They are linked by the following equation: 3660 diffServAssuredRateRel = diffServAssuredRateAbs * 1000/ifSpeed 3662 or, if appropriate: 3664 diffServAssuredRateRel = diffServAssuredRateAbs * 1000/ifHighSpeed" 3665 REFERENCE 3666 "ifSpeed, ifHighSpeed from [IFMIB]" 3667 ::= { diffServAssuredRateEntry 4 } 3669 diffServAssuredRateStatus OBJECT-TYPE 3670 SYNTAX RowStatus 3671 MAX-ACCESS read-create 3672 STATUS current 3673 DESCRIPTION 3674 "The RowStatus variable controls the activation, deactivation, or 3675 deletion of a queue. Any writable variable may be modified 3676 whether the row is active or notInService." 3677 ::= { diffServAssuredRateEntry 5 } 3678 -- 3679 -- Shaping Parameter Table 3680 -- 3681 -- The parameters used by a scheduler for its inputs or outputs are 3682 -- maintained separately from the Queue or Scheduler table entries 3683 -- for reusability reasons and so that they may be used by both queues 3684 -- and schedulers. This follows the approach for separation of data 3685 -- path elements from parameterization that is used throughout this MIB. 3686 -- Use of these Shaping Parameter Table entries by Queues and Schedulers 3687 -- allows the modeling of hierarchical scheduling systems. 3688 -- 3689 -- Specifically, a Scheduler has one or more inputs and one output. 3690 -- Any queue feeding a scheduler, or any scheduler which feeds a second 3691 -- scheduler, might specify a maximum transfer rate by pointing to a 3692 -- Shaping Parameter Table entry. Multi-rate shapers, such as a Dual 3693 -- Leaky Bucket algorithm, specify their rates by positing multiple 3694 -- Shaping Parameter Entries with the same diffServShapingRateId but 3695 -- different diffServShapingRateLevels. 3696 -- 3697 -- The diffServShapingRateLevel/Abs/Rel attributes are used as parameters 3698 -- to the non-work-conserving portion of a scheduler: non-work-conserving 3699 -- implies that the scheduler may sometimes not emit a packet, even if 3700 -- there is data available at its input(s). This has the effect of limiting 3701 -- the servicing of the queue/scheduler input or output, in effect performing 3702 -- shaping of the packet stream passing through the queue/scheduler, as 3703 -- described in [MODEL] section 7.2. 3704 -- 3706 diffServShapingRateNextFree OBJECT-TYPE 3707 SYNTAX INTEGER (1..2147483647) 3708 MAX-ACCESS read-only 3709 STATUS current 3710 DESCRIPTION 3711 "This object yields a value when read that is currently unused 3712 for a diffServShapingRateId instance. If a configuring system 3713 attempts to create a new row in the diffServShapingRateTable 3714 using this value, but an instance has been created or is in the 3715 process of being created, that operation will fail." 3716 ::= { diffServScheduler 8 } 3718 diffServShapingRateTable OBJECT-TYPE 3719 SYNTAX SEQUENCE OF DiffServShapingRateEntry 3720 MAX-ACCESS not-accessible 3721 STATUS current 3722 DESCRIPTION 3723 "The Shaping Parameter Table enumerates individual sets of 3724 scheduling parameter that can be used/reused by Queues and 3725 Schedulers." 3726 ::= { diffServScheduler 9 } 3728 diffServShapingRateEntry OBJECT-TYPE 3729 SYNTAX DiffServShapingRateEntry 3730 MAX-ACCESS not-accessible 3731 STATUS current 3732 DESCRIPTION 3733 "An entry in the Shaping Parameter Table describes a single set 3734 of scheduling parameters for use by one or more queues or 3735 schedulers." 3736 INDEX { diffServShapingRateId, diffServShapingRateLevel } 3737 ::= { diffServShapingRateTable 1 } 3739 DiffServShapingRateEntry ::= SEQUENCE { 3740 diffServShapingRateId INTEGER, 3741 diffServShapingRateLevel INTEGER, 3742 diffServShapingRateAbs Unsigned32, 3743 diffServShapingRateRel Unsigned32, 3744 diffServShapingRateThreshold BurstSize, 3745 diffServShapingRateStatus RowStatus 3746 } 3748 diffServShapingRateId OBJECT-TYPE 3749 SYNTAX INTEGER (1..2147483647) 3750 MAX-ACCESS not-accessible 3751 STATUS current 3752 DESCRIPTION 3753 "An index that enumerates the Shaping Parameter entries. The set 3754 of such identifiers spans the whole agent. Managers obtain new 3755 values for row creation in this table by reading 3756 diffServShapingRateNextFree." 3757 ::= { diffServShapingRateEntry 1 } 3759 diffServShapingRateLevel OBJECT-TYPE 3760 SYNTAX INTEGER (1..2147483647) 3761 MAX-ACCESS not-accessible 3762 STATUS current 3763 DESCRIPTION 3764 "An index that indicates which level of a multi-rate shaper is 3765 being given its parameters. A multi-rate shaper has some number 3766 of rate levels. Frame Relay's dual rate specification refers to a 3767 'committed' and an 'excess' rate; ATM's dual rate specification 3768 refers to a 'mean' and a 'peak' rate. This table is generalized 3769 to support an arbitrary number of rates. The committed or mean 3770 rate is level 1, the peak rate (if any) is the highest level rate 3771 configured, and if there are other rates they are distributed in 3772 monotonically increasing order between them." 3773 ::= { diffServShapingRateEntry 2 } 3775 diffServShapingRateAbs OBJECT-TYPE 3776 SYNTAX Unsigned32 3777 UNITS "kilobits per second" 3778 MAX-ACCESS read-create 3779 STATUS current 3780 DESCRIPTION 3781 "The maximum rate in kilobits/sec that a downstream scheduler 3782 element should allocate to this queue. If the value is zero, then 3783 there is effectively no maximum rate limit and that the scheduler 3784 should attempt to be work conserving for this queue. If the value 3785 is non-zero, the scheduler will limit the servicing of this queue 3786 to, at most, this rate in a non-work-conserving manner. 3788 Note that this attribute value and that of diffServShapingRateRel 3789 are coupled: changes to one will affect the value of the other. 3790 They are linked by the following equation: 3792 diffServAssuredRateRel = diffServAssuredRateAbs * 1000/ifSpeed 3794 or, if appropriate: 3796 diffServAssuredRateRel = diffServAssuredRateAbs * 1000/ifHighSpeed" 3797 REFERENCE 3798 "ifSpeed, ifHighSpeed from [IFMIB], RFC 2963" 3799 ::= { diffServShapingRateEntry 3 } 3801 diffServShapingRateRel OBJECT-TYPE 3802 SYNTAX Unsigned32 3803 MAX-ACCESS read-create 3804 STATUS current 3805 DESCRIPTION 3806 "The maximum rate that a downstream scheduler element should 3807 allocate to this queue, relative to the maximum rate of the 3808 interface as reported by ifSpeed or ifHighSpeed, in units of 3809 1/1000 of 1. If the value is zero, then there is effectively no 3810 maximum rate limit and the scheduler should attempt to be work 3811 conserving for this queue. If the value is non-zero, the 3812 scheduler will limit the servicing of this queue to, at most, 3813 this rate in a non-work-conserving manner. 3815 Note that this attribute value and that of diffServShapingRateAbs 3816 are coupled: changes to one will affect the value of the other. 3817 They are linked by the following equation: 3819 diffServShapingRateAbs = ifSpeed * diffServShapingRateRel/1000 3821 or, if appropriate: 3823 diffServShapingRateAbs = ifHighSpeed * diffServShapingRateRel/1000" 3824 REFERENCE 3825 "ifSpeed, ifHighSpeed from [IFMIB], RFC 2963" 3826 ::= { diffServShapingRateEntry 4 } 3828 diffServShapingRateThreshold OBJECT-TYPE 3829 SYNTAX BurstSize 3830 UNITS "Bytes" 3831 MAX-ACCESS read-create 3832 STATUS current 3833 DESCRIPTION 3834 "The number of bytes of queue depth at which the rate of a 3835 multi-rate scheduler will increase to the next output rate. In 3836 the last conceptual row for such a shaper, this threshold is 3837 ignored and by convention is zero." 3838 REFERENCE 3839 "RFC 2963" 3840 ::= { diffServShapingRateEntry 5 } 3842 diffServShapingRateStatus OBJECT-TYPE 3843 SYNTAX RowStatus 3844 MAX-ACCESS read-create 3845 STATUS current 3846 DESCRIPTION 3847 "The RowStatus variable controls the activation, deactivation, or 3848 deletion of a queue. Any writable variable may be modified 3849 whether the row is active or notInService." 3850 ::= { diffServShapingRateEntry 6 } 3851 -- 3852 -- MIB Compliance statements. 3853 -- 3855 diffServMIBCompliances OBJECT IDENTIFIER ::= { diffServMIBConformance 1 } 3856 diffServMIBGroups OBJECT IDENTIFIER ::= { diffServMIBConformance 2 } 3858 diffServMIBCompliance MODULE-COMPLIANCE 3859 STATUS current 3860 DESCRIPTION 3861 "This MIB may be implemented as a read-only or as a read-create 3862 MIB. As a result, it may be used for monitoring or for 3863 configuration." 3864 MODULE -- This Module 3865 MANDATORY-GROUPS { 3866 diffServMIBDataPathGroup, diffServMIBClfrGroup, 3867 diffServMIBClfrElementGroup, diffServMIBSixTupleClfrGroup, 3868 diffServMIBActionGroup, diffServMIBAlgDropGroup, 3869 diffServMIBQGroup, diffServMIBSchedulerGroup, 3870 diffServMIBShapingRateGroup, diffServMIBAssuredRateGroup } 3872 -- The groups: 3873 -- diffServMIBCounterGroup 3874 -- diffServMIBHCCounterGroup 3875 -- diffServMIBVHCCounterGroup 3876 -- 3877 -- are mutually exclusive; at most one of these groups is implemented 3878 -- for a particular interface. When any of these groups is implemented 3879 -- for a particular interface, then ifCounterDiscontinuityGroup from 3880 -- [IFMIB] must also be implemented for that interface. 3881 -- 3882 -- Note that the diffServMIBStaticGroup is mandatory for implementations 3883 -- that implement a read-write or read-create mode. 3885 GROUP diffServMIBCounterGroup 3886 DESCRIPTION 3887 "This group is mandatory for table objects indexed by ifIndex for 3888 which the value of the corresponding instance of ifSpeed is less 3889 than or equal to 20,000,000 bits/second." 3891 GROUP diffServMIBHCCounterGroup 3892 DESCRIPTION 3893 "This group is mandatory for table objects indexed by ifIndex for 3894 which the value of the corresponding instance of ifSpeed is 3895 greater than 20,000,000 bits/second." 3897 GROUP diffServMIBVHCCounterGroup 3898 DESCRIPTION 3899 "This group is mandatory for table objects indexed by ifIndex for 3900 which the value of the corresponding instance of ifSpeed is 3901 greater than 650,000,000 bits/second." 3903 GROUP diffServMIBMeterGroup 3904 DESCRIPTION 3905 "This group is mandatory for devices that implement metering 3906 functions." 3908 GROUP diffServMIBTBParamGroup 3909 DESCRIPTION 3910 "This group is mandatory for devices that implement token-bucket 3911 metering functions." 3913 GROUP diffServMIBDscpMarkActGroup 3914 DESCRIPTION 3915 "This group is mandatory for devices that implement DSCP-Marking 3916 functions." 3918 GROUP diffServMIBRandomDropGroup 3919 DESCRIPTION 3920 "This group is mandatory for devices that implement Random Drop 3921 functions." 3923 GROUP diffServMIBStaticGroup 3924 DESCRIPTION 3925 "This group is mandatory for devices that allow creation of rows 3926 in any of the writable tables of this MIB." 3928 OBJECT diffServDataPathStart 3929 MIN-ACCESS read-only 3930 DESCRIPTION 3931 "Write access is not required." 3933 OBJECT diffServDataPathStatus 3934 MIN-ACCESS read-only 3935 DESCRIPTION 3936 "Write access is not required." 3938 OBJECT diffServClfrDataPathStart 3939 MIN-ACCESS read-only 3940 DESCRIPTION 3941 "Write access is not required." 3943 OBJECT diffServClfrStatus 3944 MIN-ACCESS read-only 3945 DESCRIPTION 3946 "Write access is not required." 3948 OBJECT diffServClfrElementPrecedence 3949 MIN-ACCESS read-only 3950 DESCRIPTION 3951 "Write access is not required." 3953 OBJECT diffServClfrElementNext 3954 MIN-ACCESS read-only 3955 DESCRIPTION 3956 "Write access is not required." 3958 OBJECT diffServClfrElementSpecific 3959 MIN-ACCESS read-only 3960 DESCRIPTION 3961 "Write access is not required." 3963 OBJECT diffServClfrElementStatus 3964 MIN-ACCESS read-only 3965 DESCRIPTION 3966 "Write access is not required." 3968 OBJECT diffServSixTupleClfrDstAddrType 3969 MIN-ACCESS read-only 3970 DESCRIPTION 3971 "Write access is not required." 3973 OBJECT diffServSixTupleClfrDstAddr 3974 MIN-ACCESS read-only 3975 DESCRIPTION 3976 "Write access is not required." 3978 OBJECT diffServSixTupleClfrDstPrefixLength 3979 MIN-ACCESS read-only 3980 DESCRIPTION 3981 "Write access is not required." 3983 OBJECT diffServSixTupleClfrSrcAddrType 3984 MIN-ACCESS read-only 3985 DESCRIPTION 3986 "Write access is not required." 3988 OBJECT diffServSixTupleClfrSrcAddr 3989 MIN-ACCESS read-only 3990 DESCRIPTION 3991 "Write access is not required." 3992 OBJECT diffServSixTupleClfrSrcPrefixLength 3993 MIN-ACCESS read-only 3994 DESCRIPTION 3995 "Write access is not required." 3997 OBJECT diffServSixTupleClfrDscp 3998 MIN-ACCESS read-only 3999 DESCRIPTION 4000 "Write access is not required." 4002 OBJECT diffServSixTupleClfrProtocol 4003 MIN-ACCESS read-only 4004 DESCRIPTION 4005 "Write access is not required." 4007 OBJECT diffServSixTupleClfrDstL4PortMin 4008 MIN-ACCESS read-only 4009 DESCRIPTION 4010 "Write access is not required." 4012 OBJECT diffServSixTupleClfrDstL4PortMax 4013 MIN-ACCESS read-only 4014 DESCRIPTION 4015 "Write access is not required." 4017 OBJECT diffServSixTupleClfrSrcL4PortMin 4018 MIN-ACCESS read-only 4019 DESCRIPTION 4020 "Write access is not required." 4022 OBJECT diffServSixTupleClfrSrcL4PortMax 4023 MIN-ACCESS read-only 4024 DESCRIPTION 4025 "Write access is not required." 4027 OBJECT diffServSixTupleClfrStatus 4028 MIN-ACCESS read-only 4029 DESCRIPTION 4030 "Write access is not required." 4032 OBJECT diffServMeterSucceedNext 4033 MIN-ACCESS read-only 4034 DESCRIPTION 4035 "Write access is not required." 4037 OBJECT diffServMeterFailNext 4038 MIN-ACCESS read-only 4039 DESCRIPTION 4040 "Write access is not required." 4042 OBJECT diffServMeterSpecific 4043 MIN-ACCESS read-only 4044 DESCRIPTION 4045 "Write access is not required." 4047 OBJECT diffServMeterStatus 4048 MIN-ACCESS read-only 4049 DESCRIPTION 4050 "Write access is not required." 4052 OBJECT diffServTBParamType 4053 MIN-ACCESS read-only 4054 DESCRIPTION 4055 "Write access is not required." 4057 OBJECT diffServTBParamRate 4058 MIN-ACCESS read-only 4059 DESCRIPTION 4060 "Write access is not required." 4062 OBJECT diffServTBParamBurstSize 4063 MIN-ACCESS read-only 4064 DESCRIPTION 4065 "Write access is not required." 4067 OBJECT diffServTBParamInterval 4068 MIN-ACCESS read-only 4069 DESCRIPTION 4070 "Write access is not required." 4072 OBJECT diffServTBParamStatus 4073 MIN-ACCESS read-only 4074 DESCRIPTION 4075 "Write access is not required." 4077 OBJECT diffServActionNext 4078 MIN-ACCESS read-only 4079 DESCRIPTION 4080 "Write access is not required." 4082 OBJECT diffServActionSpecific 4083 MIN-ACCESS read-only 4084 DESCRIPTION 4085 "Write access is not required." 4086 OBJECT diffServActionStatus 4087 MIN-ACCESS read-only 4088 DESCRIPTION 4089 "Write access is not required." 4091 OBJECT diffServCountActStatus 4092 MIN-ACCESS read-only 4093 DESCRIPTION 4094 "Write access is not required." 4096 OBJECT diffServAlgDropType 4097 MIN-ACCESS read-only 4098 DESCRIPTION 4099 "Write access is not required." 4101 OBJECT diffServAlgDropNext 4102 MIN-ACCESS read-only 4103 DESCRIPTION 4104 "Write access is not required." 4106 OBJECT diffServAlgDropQMeasure 4107 MIN-ACCESS read-only 4108 DESCRIPTION 4109 "Write access is not required." 4111 OBJECT diffServAlgDropQThreshold 4112 MIN-ACCESS read-only 4113 DESCRIPTION 4114 "Write access is not required." 4116 OBJECT diffServAlgDropSpecific 4117 MIN-ACCESS read-only 4118 DESCRIPTION 4119 "Write access is not required." 4121 OBJECT diffServAlgDropStatus 4122 MIN-ACCESS read-only 4123 DESCRIPTION 4124 "Write access is not required." 4126 OBJECT diffServRandomDropMinThreshBytes 4127 MIN-ACCESS read-only 4128 DESCRIPTION 4129 "Write access is not required." 4131 OBJECT diffServRandomDropMinThreshPkts 4132 MIN-ACCESS read-only 4133 DESCRIPTION 4134 "Write access is not required." 4136 OBJECT diffServRandomDropMaxThreshBytes 4137 MIN-ACCESS read-only 4138 DESCRIPTION 4139 "Write access is not required." 4141 OBJECT diffServRandomDropMaxThreshPkts 4142 MIN-ACCESS read-only 4143 DESCRIPTION 4144 "Write access is not required." 4146 OBJECT diffServRandomDropProbMax 4147 MIN-ACCESS read-only 4148 DESCRIPTION 4149 "Write access is not required." 4151 OBJECT diffServRandomDropWeight 4152 MIN-ACCESS read-only 4153 DESCRIPTION 4154 "Write access is not required." 4156 OBJECT diffServRandomDropSamplingRate 4157 MIN-ACCESS read-only 4158 DESCRIPTION 4159 "Write access is not required." 4161 OBJECT diffServRandomDropStatus 4162 MIN-ACCESS read-only 4163 DESCRIPTION 4164 "Write access is not required." 4166 OBJECT diffServQNext 4167 MIN-ACCESS read-only 4168 DESCRIPTION 4169 "Write access is not required." 4171 OBJECT diffServQRate 4172 MIN-ACCESS read-only 4173 DESCRIPTION 4174 "Write access is not required." 4176 OBJECT diffServQShaper 4177 MIN-ACCESS read-only 4178 DESCRIPTION 4179 "Write access is not required." 4180 OBJECT diffServQStatus 4181 MIN-ACCESS read-only 4182 DESCRIPTION 4183 "Write access is not required." 4185 OBJECT diffServSchedulerNext 4186 MIN-ACCESS read-only 4187 DESCRIPTION 4188 "Write access is not required." 4190 OBJECT diffServSchedulerMethod 4191 MIN-ACCESS read-only 4192 DESCRIPTION 4193 "Write access is not required." 4195 OBJECT diffServSchedulerRate 4196 MIN-ACCESS read-only 4197 DESCRIPTION 4198 "Write access is not required." 4200 OBJECT diffServSchedulerShaper 4201 MIN-ACCESS read-only 4202 DESCRIPTION 4203 "Write access is not required." 4205 OBJECT diffServSchedulerStatus 4206 MIN-ACCESS read-only 4207 DESCRIPTION 4208 "Write access is not required." 4210 OBJECT diffServAssuredRatePriority 4211 MIN-ACCESS read-only 4212 DESCRIPTION 4213 "Write access is not required." 4215 OBJECT diffServAssuredRateAbs 4216 MIN-ACCESS read-only 4217 DESCRIPTION 4218 "Write access is not required." 4220 OBJECT diffServAssuredRateRel 4221 MIN-ACCESS read-only 4222 DESCRIPTION 4223 "Write access is not required." 4225 OBJECT diffServAssuredRateStatus 4226 MIN-ACCESS read-only 4227 DESCRIPTION 4228 "Write access is not required." 4230 OBJECT diffServShapingRateAbs 4231 MIN-ACCESS read-only 4232 DESCRIPTION 4233 "Write access is not required." 4235 OBJECT diffServShapingRateRel 4236 MIN-ACCESS read-only 4237 DESCRIPTION 4238 "Write access is not required." 4240 OBJECT diffServShapingRateThreshold 4241 MIN-ACCESS read-only 4242 DESCRIPTION 4243 "Write access is not required." 4245 OBJECT diffServShapingRateStatus 4246 MIN-ACCESS read-only 4247 DESCRIPTION 4248 "Write access is not required." 4250 ::= { diffServMIBCompliances 1 } 4251 diffServMIBDataPathGroup OBJECT-GROUP 4252 OBJECTS { 4253 diffServDataPathStart, diffServDataPathStatus 4254 } 4255 STATUS current 4256 DESCRIPTION 4257 "The Data Path Group defines the MIB Objects that describe a 4258 functional data path." 4259 ::= { diffServMIBGroups 1 } 4261 diffServMIBClfrGroup OBJECT-GROUP 4262 OBJECTS { 4263 diffServClfrDataPathStart, diffServClfrStatus 4264 } 4265 STATUS current 4266 DESCRIPTION 4267 "The Classifier Group defines the MIB Objects that describe the 4268 list the starts of individual classifiers." 4269 ::= { diffServMIBGroups 2 } 4271 diffServMIBClfrElementGroup OBJECT-GROUP 4272 OBJECTS { 4273 diffServClfrElementPrecedence, diffServClfrElementNext, 4274 diffServClfrElementSpecific, diffServClfrElementStatus 4275 } 4276 STATUS current 4277 DESCRIPTION 4278 "The Classifier Element Group defines the MIB Objects that 4279 describe the classifier elements that make up a generic 4280 classifier." 4281 ::= { diffServMIBGroups 3 } 4283 diffServMIBSixTupleClfrGroup OBJECT-GROUP 4284 OBJECTS { 4285 diffServSixTupleClfrDstAddrType, diffServSixTupleClfrDstAddr, 4286 diffServSixTupleClfrDstPrefixLength, 4287 diffServSixTupleClfrSrcAddrType, diffServSixTupleClfrSrcAddr, 4288 diffServSixTupleClfrSrcPrefixLength, diffServSixTupleClfrDscp, 4289 diffServSixTupleClfrProtocol, diffServSixTupleClfrDstL4PortMin, 4290 diffServSixTupleClfrDstL4PortMax, diffServSixTupleClfrSrcL4PortMin, 4291 diffServSixTupleClfrSrcL4PortMax, diffServSixTupleClfrStatus 4292 } 4293 STATUS current 4294 DESCRIPTION 4295 "The Six-Tuple Classifier Group defines the MIB Objects that 4296 describe a classifier element for matching on 6 fields of an IP 4297 and upper-layer protocol header." 4298 ::= { diffServMIBGroups 4 } 4300 diffServMIBMeterGroup OBJECT-GROUP 4301 OBJECTS { 4302 diffServMeterSucceedNext, diffServMeterFailNext, 4303 diffServMeterSpecific, diffServMeterStatus 4304 } 4305 STATUS current 4306 DESCRIPTION 4307 "The Meter Group defines the objects used in describing a generic 4308 meter element." 4309 ::= { diffServMIBGroups 5 } 4311 diffServMIBTBParamGroup OBJECT-GROUP 4312 OBJECTS { 4313 diffServTBParamType, diffServTBParamRate, 4314 diffServTBParamBurstSize, diffServTBParamInterval, 4315 diffServTBParamStatus 4316 } 4317 STATUS current 4318 DESCRIPTION 4319 "The Token-Bucket Meter Group defines the objects used in 4320 describing a token bucket meter element." 4321 ::= { diffServMIBGroups 6 } 4323 diffServMIBActionGroup OBJECT-GROUP 4324 OBJECTS { 4325 diffServActionNext, diffServActionSpecific, diffServActionStatus 4326 } 4327 STATUS current 4328 DESCRIPTION 4329 "The Action Group defines the objects used in describing a 4330 generic action element." 4331 ::= { diffServMIBGroups 7 } 4333 diffServMIBDscpMarkActGroup OBJECT-GROUP 4334 OBJECTS { 4335 diffServDscpMarkActDscp 4336 } 4337 STATUS current 4338 DESCRIPTION 4339 "The DSCP Mark Action Group defines the objects used in 4340 describing a DSCP Marking Action element." 4341 ::= { diffServMIBGroups 8 } 4343 diffServMIBCounterGroup OBJECT-GROUP 4344 OBJECTS { 4345 diffServCountActOctets, diffServCountActPkts, 4346 diffServCountActDiscontTime, diffServCountActStatus, 4347 diffServAlgDropOctets, diffServAlgDropPkts 4348 } 4349 STATUS current 4350 DESCRIPTION 4351 "A collection of objects providing information specific to non- 4352 high speed (non- high speed interfaces transmit and receive at 4353 speeds less than or equal to 20,000,000 bits/second) packet- 4354 oriented network interfaces." 4355 ::= { diffServMIBGroups 9 } 4357 diffServMIBHCCounterGroup OBJECT-GROUP 4358 OBJECTS { 4359 diffServCountActOctets, diffServCountActHCOctets, 4360 diffServCountActPkts, diffServCountActDiscontTime, 4361 diffServCountActStatus, diffServAlgDropOctets, 4362 diffServAlgDropHCOctets, diffServAlgDropPkts 4363 } 4364 STATUS current 4365 DESCRIPTION 4366 "A collection of objects providing information specific to high 4367 speed (high speed interfaces transmit and receive at speeds 4368 greater than 20,000,000 but less than or equals to 650,000,000 4369 bits/second) packet-oriented network interfaces." 4370 ::= { diffServMIBGroups 10 } 4372 diffServMIBVHCCounterGroup OBJECT-GROUP 4373 OBJECTS { 4374 diffServCountActOctets, diffServCountActHCOctets, 4375 diffServCountActPkts, diffServCountActHCPkts, 4376 diffServCountActDiscontTime, diffServCountActStatus, 4377 diffServAlgDropOctets, diffServAlgDropHCOctets, 4378 diffServAlgDropPkts, diffServAlgDropHCPkts 4379 } 4380 STATUS current 4381 DESCRIPTION 4382 "A collection of objects providing information specific to very- 4383 high speed (very-high speed interfaces transmit and receive at 4384 speeds greater than 650,000,000 bits/second) packet-oriented 4385 network interfaces." 4386 ::= { diffServMIBGroups 11 } 4388 diffServMIBAlgDropGroup OBJECT-GROUP 4389 OBJECTS { 4390 diffServAlgDropType, diffServAlgDropNext, 4391 diffServAlgDropDiscontinuityTime, 4392 diffServAlgDropQMeasure, diffServAlgDropQThreshold, 4393 diffServAlgDropSpecific, diffServAlgDropStatus 4394 } 4395 STATUS current 4396 DESCRIPTION 4397 "The Algorithmic Drop Group contains the objects that describe 4398 algorithmic dropper operation and configuration." 4399 ::= { diffServMIBGroups 12 } 4401 diffServMIBRandomDropGroup OBJECT-GROUP 4402 OBJECTS { 4403 diffServRandomDropMinThreshBytes, 4404 diffServRandomDropMinThreshPkts, 4405 diffServRandomDropMaxThreshBytes, 4406 diffServRandomDropMaxThreshPkts, 4407 diffServRandomDropProbMax, 4408 diffServRandomDropWeight, 4409 diffServRandomDropSamplingRate, 4410 diffServRandomDropStatus 4411 } 4412 STATUS current 4413 DESCRIPTION 4414 "The Random Drop Group augments the Algorithmic Drop Group for 4415 random dropper operation and configuration." 4417 ::= { diffServMIBGroups 13 } 4419 diffServMIBQGroup OBJECT-GROUP 4420 OBJECTS { 4421 diffServQNext, diffServQRate, diffServQShaper, 4422 diffServQStatus 4423 } 4424 STATUS current 4425 DESCRIPTION 4426 "The Queue Group contains the objects that describe an 4427 interface's queues." 4428 ::= { diffServMIBGroups 14 } 4430 diffServMIBSchedulerGroup OBJECT-GROUP 4431 OBJECTS { 4432 diffServSchedulerNext, diffServSchedulerMethod, 4433 diffServSchedulerRate, diffServSchedulerShaper, 4434 diffServSchedulerStatus 4435 } 4436 STATUS current 4437 DESCRIPTION 4438 "The Scheduler Group contains the objects that describe packet 4439 schedulers on interfaces." 4440 ::= { diffServMIBGroups 15 } 4442 diffServMIBAssuredRateGroup OBJECT-GROUP 4443 OBJECTS { 4444 diffServAssuredRatePriority, diffServAssuredRateAbs, 4445 diffServAssuredRateRel, diffServAssuredRateStatus 4446 } 4447 STATUS current 4448 DESCRIPTION 4449 "The Scheduler Parameter Group contains the objects that describe 4450 packet schedulers' parameters on interfaces." 4451 ::= { diffServMIBGroups 16 } 4453 diffServMIBShapingRateGroup OBJECT-GROUP 4454 OBJECTS { 4455 diffServShapingRateAbs, diffServShapingRateRel, 4456 diffServShapingRateThreshold, diffServShapingRateStatus 4457 } 4458 STATUS current 4459 DESCRIPTION 4460 "The Scheduler Parameter Group contains the objects that describe 4461 packet schedulers' parameters on interfaces." 4462 ::= { diffServMIBGroups 17 } 4464 diffServMIBStaticGroup OBJECT-GROUP 4465 OBJECTS { 4466 diffServClfrNextFree, diffServClfrElementNextFree, 4467 diffServSixTupleClfrNextFree, diffServMeterNextFree, 4468 diffServTBParamNextFree, diffServActionNextFree, 4469 diffServCountActNextFree, diffServAlgDropNextFree, 4470 diffServRandomDropNextFree, diffServQNextFree, 4471 diffServSchedulerNextFree, diffServAssuredRateNextFree, 4472 diffServShapingRateNextFree 4473 } 4474 STATUS current 4475 DESCRIPTION 4476 "The Static Group contains readable scalar objects used in 4477 creating unique identifiers for classifiers, meters, actions and 4478 queues. These are required whenever row creation operations on 4479 such tables are supported." 4480 ::= { diffServMIBGroups 18 } 4482 END 4483 7. Acknowledgments 4485 This MIB builds on all the work that has gone into the Informal 4486 Management Model for Differentiated Services Routers, Differentiated 4487 Services PIB, and Differentiated Services Policy MIB (SNMPCONF WG). 4489 It has been developed with the active involvement of many people, but 4490 most notably Yoram Bernet, Steve Blake, Brian Carpenter, Dave Durham, 4491 Michael Fine, Victor Firoiu, Jeremy Greene, Dan Grossman, Roch Guerin, 4492 Scott Hahn, Joel Halpern, Harrie Hazewinkel, Van Jacobsen, Keith 4493 McCloghrie, Bob Moore, Kathleen Nichols, Ping Pan, Nabil Seddigh, John 4494 Seligson, Walter Weiss, and Bert Wijnen. 4496 8. Security Considerations 4498 It is clear that this MIB is potentially useful for configuration, and 4499 anything that can be configured can be misconfigured, with potentially 4500 disastrous effect. 4502 At this writing, no security holes have been identified beyond those 4503 that SNMP Security is itself intended to address. These relate primarily 4504 to controlled access to sensitive information and the ability to 4505 configure a device - or which might result from operator error, which is 4506 beyond the scope of any security architecture. 4508 There are many read-write and read-create management objects defined in 4509 this MIB. Such objects are often sensitive or vulnerable in some network 4510 environments. The support for SET operations in a non-secure environment 4511 without proper protection can have a negative effect on network 4512 operations. The use of SNMP Version 3 is recommended over prior versions 4513 for configuration control as its security model is improved. 4515 There are a number of managed objects in this MIB that may contain 4516 information that may be sensitive from a business perspective, in that 4517 they may represent a customer's service contract or the filters that the 4518 service provider chooses to apply to a customer's ingress or egress 4519 traffic. There are no objects which are sensitive in their own right, 4520 such as passwords or monetary amounts. 4522 It may be important to control even GET access to these objects and 4523 possibly to even encrypt the values of these object when sending them 4524 over the network via SNMP. Not all versions of SNMP provide features for 4525 such a secure environment. 4527 SNMPv1 by itself is not a secure environment. Even if the network itself 4528 is secure (for example by using IPSec), even then, there is no control 4529 as to who on the secure network is allowed to access and GET/SET 4530 (read/change/create/delete) the objects in this MIB. 4532 It is recommended that the implementers consider the security features 4533 as provided by the SNMPv3 framework. Specifically, the use of the User- 4534 based Security Model [12] and the View-based Access Control Model [15] 4535 is recommended. 4537 It is then a customer/user responsibility to ensure that the SNMP entity 4538 giving access to an instance of this MIB, is properly configured to give 4539 access to the objects only to those principals (users) that have 4540 legitimate rights to indeed GET or SET (change/create/delete) them. 4542 9. References 4544 [1] Harrington, D., Presuhn, R., and B. Wijnen, "An Architecture for 4545 Describing SNMP Management Frameworks", RFC 2571, Cabletron 4546 Systems, Inc., BMC Software, Inc., IBM T. J. Watson Research, April 4547 1999 4549 [2] Rose, M., and K. McCloghrie, "Structure and Identification of 4550 Management Information for TCP/IP-based Internets", RFC 1155, STD 4551 16, Performance Systems International, Hughes LAN Systems, May 1990 4553 [3] Rose, M., and K. McCloghrie, "Concise MIB Definitions", RFC 1212, 4554 STD 16, Performance Systems International, Hughes LAN Systems, 4555 March 1991 4557 [4] M. Rose, "A Convention for Defining Traps for use with the SNMP", 4558 RFC 1215, Performance Systems International, March 1991 4560 [5] McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M., 4561 and S. Waldbusser, "Structure of Management Information Version 2 4562 (SMIv2)", RFC 2578, STD 58, Cisco Systems, SNMPinfo, TU 4563 Braunschweig, SNMP Research, First Virtual Holdings, International 4564 Network Services, April 1999 4566 [6] McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M., 4567 and S. Waldbusser, "Textual Conventions for SMIv2", RFC 2579, STD 4568 58, Cisco Systems, SNMPinfo, TU Braunschweig, SNMP Research, First 4569 Virtual Holdings, International Network Services, April 1999 4571 [7] McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M., 4572 and S. Waldbusser, "Conformance Statements for SMIv2", RFC 2580, 4573 STD 58, Cisco Systems, SNMPinfo, TU Braunschweig, SNMP Research, 4574 First Virtual Holdings, International Network Services, April 1999 4575 [8] Case, J., Fedor, M., Schoffstall, M., and J. Davin, "Simple Network 4576 Management Protocol", RFC 1157, STD 15, SNMP Research, Performance 4577 Systems International, Performance Systems International, MIT 4578 Laboratory for Computer Science, May 1990. 4580 [9] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, 4581 "Introduction to Community-based SNMPv2", RFC 1901, SNMP Research, 4582 Inc., Cisco Systems, Inc., Dover Beach Consulting, Inc., 4583 International Network Services, January 1996. 4585 [10] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Transport 4586 Mappings for Version 2 of the Simple Network Management Protocol 4587 (SNMPv2)", RFC 1906, SNMP Research, Inc., Cisco Systems, Inc., 4588 Dover Beach Consulting, Inc., International Network Services, 4589 January 1996. 4591 [11] Case, J., Harrington D., Presuhn R., and B. Wijnen, "Message 4592 Processing and Dispatching for the Simple Network Management 4593 Protocol (SNMP)", RFC 2572, SNMP Research, Inc., Cabletron Systems, 4594 Inc., BMC Software, Inc., IBM T. J. Watson Research, April 1999 4596 [12] Blumenthal, U., and B. Wijnen, "User-based Security Model (USM) for 4597 version 3 of the Simple Network Management Protocol (SNMPv3)", RFC 4598 2574, IBM T. J. Watson Research, April 1999 4600 [13] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Protocol 4601 Operations for Version 2 of the Simple Network Management Protocol 4602 (SNMPv2)", RFC 1905, SNMP Research, Inc., Cisco Systems, Inc., 4603 Dover Beach Consulting, Inc., International Network Services, 4604 January 1996. 4606 [14] Levi, D., Meyer, P., and B. Stewart, "SNMPv3 Applications", RFC 4607 2573, SNMP Research, Inc., Secure Computing Corporation, Cisco 4608 Systems, April 1999 4610 [15] Wijnen, B., Presuhn, R., and K. McCloghrie, "View-based Access 4611 Control Model (VACM) for the Simple Network Management Protocol 4612 (SNMP)", RFC 2575, IBM T. J. Watson Research, BMC Software, Inc., 4613 Cisco Systems, Inc., April 1999 4615 [16] Case, J., Mundy, R., Partain, D., and B. Stewart, "Introduction to 4616 Version 3 of the Internet-standard Network Management Framework", 4617 RFC 2570, SNMP Research, Inc., TIS Labs at Network Associates, 4618 Inc., Ericsson, Cisco Systems, April 1999 4620 [ACTQMGMT] 4621 V. Firoiu, M. Borden "A Study of Active Queue Management for 4622 Congestion Control", March 2000, In IEEE Infocom 2000, 4623 http://www.ieee-infocom.org/2000/papers/405.pdf 4625 [AQMROUTER] 4626 V.Misra, W.Gong, D.Towsley "Fuid-based analysis of a network of AQM 4627 routers supporting TCP flows with an application to RED", In 4628 SIGCOMM 2000, 4629 http://www.acm.org/sigcomm/sigcomm2000/conf/paper/sigcomm2000-4- 4630 3.ps.gz 4632 [AF-PHB] 4633 J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, "Assured Forwarding 4634 PHB Group.", RFC 2597, June 1999. 4636 [DSARCH] 4637 S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, "An 4638 Architecture for Differentiated Service", RFC 2475, December 1998. 4640 [DSFIELD] 4641 K. Nichols, S. Blake, F. Baker, D. Black, "Definition of the 4642 Differentiated Services Field (DS Field) in the IPv4 and IPv6 4643 Headers", RFC 2474, December 1998. 4645 [DSPIB] 4646 M. Fine, K. McCloghrie, J. Seligson, K. Chan, S. Hahn, A. Smith, 4647 "Differentiated Services Policy Information Base", Internet Draft 4648 , March 2000 4650 [DSTERMS] 4651 D. Grossman, "New Terminology for Differentiated Services", 4652 Internet Draft , November 1999. 4655 [EF-PHB] 4656 V. Jacobson, K. Nichols, K. Poduri, "An Expedited Forwarding PHB." 4657 RFC 2598, June 1999. 4659 [IFMIB] 4660 K. McCloghrie, F. Kastenholz, "The Interfaces Group MIB using 4661 SMIv2", RFC 2233, November 1997. 4663 [INETADDRESS] 4664 Daniele, M., Haberman, B., Routhier, S., Schoenwaelder, J., 4665 "Textual Conventions for Internet Network Addresses.", draft-ietf- 4666 ops-rfc2851-update-00.txt. [PRIVATE NOTE TO RFC EDITOR: YES, THIS 4667 IS INDEED A NORMATIVE REFERENCE. JUERGEN TELLS ME THAT HE WILL 4668 PUBLISH IT POSTE HASTE]. 4670 [INTSERVMIB] 4671 F. Baker, J. Krawczyk, A. Sastry, "Integrated Services Management 4672 Information Base using SMIv2", RFC 2213, September 1997. 4674 [MODEL] 4675 Y. Bernet, S. Blake, A. Smith, D. Grossman, "An Informal Management 4676 Model for Differentiated Services Routers", Internet Draft , July 2000. 4679 [POLTERM] 4680 F. Reichmeyer, D. Grossman, J. Strassner, M. Condell, "A Common 4681 Terminology for Policy Management", Internet Draft , March 2000 4684 [QUEUEMGMT] 4685 B. Braden et al., "Recommendations on Queue Management and 4686 Congestion Avoidance in the Internet", RFC 2309, April 1998. 4688 [RED93] 4689 "Random Early Detection", 1993. 4691 [SRTCM] 4692 J. Heinanen, R. Guerin, "A Single Rate Three Color Marker", RFC 4693 2697, September 1999. 4695 [TRTCM] 4696 J. Heinanen, R. Guerin, "A Two Rate Three Color Marker", RFC 2698, 4697 September 1999. 4699 [TSWTCM] 4700 W. Fang, N. Seddigh, B. Nandy "A Time Sliding Window Three Colour 4701 Marker", RFC 2859, June 2000. 4703 [SHAPER] 4704 "A Rate Adaptive Shaper for Differentiated Services" FC 2963, 4705 October 2000. 4707 10. Authors' Addresses 4709 Fred Baker 4710 Cisco Systems 4711 519 Lado Drive 4712 Santa Barbara, California 93111 4713 fred@cisco.com 4714 Kwok Ho Chan 4715 Nortel Networks 4716 600 Technology Park Drive 4717 Billerica, MA 01821 4718 khchan@nortelnetworks.com 4720 Andrew Smith 4721 Allegro Networks 4722 6399 San Ignacio Ave 4723 San Jose, CA 95119 4724 andrew@allegronetworks.com 4726 Table of Contents 4728 1 The SNMP Management Framework ................................... 2 4729 2 Relationship to other working group documents ................... 3 4730 2.1 Relationship to the Informal Management Model for 4731 Differentiated Services Router ............................... 3 4732 2.2 Relationship to other MIBs and Policy Management .............. 4 4733 3 MIB Overview .................................................... 4 4734 3.1 Processing Path ............................................... 5 4735 3.1.1 diffServDataPathTable - The Data Path Table ................. 6 4736 3.2 Classifier .................................................... 6 4737 3.2.1 diffServClfrElementTable - The Classifier Element Table ..... 7 4738 3.2.2 diffServSixTupleClfrTable - The Six-Tuple Classifier Table 4739 .............................................................. 8 4740 3.3 Metering Traffic .............................................. 9 4741 3.3.1 diffServMeterTable - The Meter Table ........................ 10 4742 3.3.2 diffServTBParamTable - The Token Bucket Parameters Table 4743 .............................................................. 10 4744 3.4 Actions applied to packets .................................... 11 4745 3.4.1 diffServActionTable - The Action Table ...................... 12 4746 3.4.2 diffServCountActTable - The Count Action Table .............. 12 4747 3.4.3 diffServDscpMarkActTable - The Mark Action Table ............ 13 4748 3.4.4 diffServAlgDropTable - The Algorithmic Drop Table ........... 13 4749 3.4.5 diffServRandomDropTable - The Random Drop Parameters Table 4750 .............................................................. 14 4751 3.5 Queuing and Scheduling of Packets ............................. 16 4752 3.5.1 diffServQTable - The Class or Queue Table ................... 16 4753 3.5.2 diffServSchedulerTable - The Scheduler Table ................ 17 4754 3.5.3 diffServAssuredRateTable - The Assured Rate Table ........... 17 4755 3.5.4 diffServShapingRateTable - The Shaping Rate Table ........... 18 4756 3.5.5 Using queues and schedulers together ........................ 18 4757 3.6 Example configuration for AF and EF ........................... 21 4758 3.6.1 AF and EF Ingress Interface Configuration ................... 21 4759 3.6.1.1 Classification In The Example ............................. 23 4760 3.6.1.2 AF Implementation On an Ingress Edge Interface ............ 24 4761 3.6.1.2.1 AF Metering On an Ingress Edge Interface ................ 24 4762 3.6.1.2.2 AF Actions On an Ingress Edge Interface ................. 24 4763 3.6.1.3 EF Implementation On an Ingress Edge Interface ............ 25 4764 3.6.1.3.1 EF Metering On an Ingress Edge Interface ................ 25 4765 3.6.1.3.2 EF Actions On an Ingress Edge Interface ................. 25 4766 3.7 AF and EF Egress Edge Interface Configuration ................. 25 4767 3.7.1 Classification On an Egress Edge Interface .................. 25 4768 3.7.2 AF Implementation On an Egress Edge Interface ............... 27 4769 3.7.2.1 AF Metering On an Egress Edge Interface ................... 27 4770 3.7.2.2 AF Actions On an Egress Edge Interface .................... 28 4771 3.7.2.3 AF Rate-based Queuing On an Egress Edge Interface ......... 28 4772 3.7.3 EF Implementation On an Egress Edge Interface ............... 28 4773 3.7.3.1 EF Metering On an Egress Edge Interface ................... 29 4774 3.7.3.2 EF Actions On an Egress Edge Interface .................... 29 4775 3.7.3.3 EF Priority Queuing On an Egress Edge Interface ........... 29 4776 4 Conventions used in this MIB .................................... 29 4777 4.1 The use of RowPointer to indicate data path linkage ........... 29 4778 4.2 The use of RowPointer to indicate parameters .................. 30 4779 4.3 Conceptual row creation and deletion .......................... 31 4780 5 Extending this MIB .............................................. 31 4781 6 MIB Definition .................................................. 33 4782 7 Acknowledgments ................................................. 104 4783 8 Security Considerations ......................................... 104 4784 9 References ...................................................... 105 4785 10 Authors' Addresses ............................................. 108 4786 11. Full Copyright 4788 Copyright (C) The Internet Society (2000). All Rights Reserved. 4790 This document and translations of it may be copied and furnished to 4791 others, and derivative works that comment on or otherwise explain it 4792 or assist in its implementation may be prepared, copied, published 4793 and distributed, in whole or in part, without restriction of any 4794 kind, provided that the above copyright notice and this paragraph are 4795 included on all such copies and derivative works. However, this 4796 document itself may not be modified in any way, such as by removing 4797 the copyright notice or references to the Internet Society or other 4798 Internet organizations, except as needed for the purpose of 4799 developing Internet standards in which case the procedures for 4800 copyrights defined in the Internet Standards process must be 4801 followed, or as required to translate it into languages other than 4802 English. 4804 The limited permissions granted above are perpetual and will not be 4805 revoked by the Internet Society or its successors or assigns. 4807 This document and the information contained herein is provided on an 4808 "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING 4809 TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING 4810 BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION 4811 HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF 4812 MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.