idnits 2.17.1 draft-ietf-diffserv-mib-15.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 127 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 3 instances of too long lines in the document, the longest one being 1 character in excess of 72. ** The abstract seems to contain references ([RFC2119]), 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 48 has weird spacing: '...this document...' == Line 1428 has weird spacing: '...ntValue error...' == Line 5223 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 (October 2001) is 8229 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 5134, but no explicit reference was found in the text == Unused Reference: 'DSARCH' is defined on line 5138, but no explicit reference was found in the text == Unused Reference: 'DSFIELD' is defined on line 5142, but no explicit reference was found in the text == Unused Reference: 'DSTERMS' is defined on line 5152, but no explicit reference was found in the text == Unused Reference: 'EF-PHB' is defined on line 5156, but no explicit reference was found in the text == Unused Reference: 'INETADDRESS' is defined on line 5165, but no explicit reference was found in the text == Unused Reference: 'INTSERVMIB' is defined on line 5172, but no explicit reference was found in the text == Unused Reference: 'TSWTCM' is defined on line 5192, 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) == Outdated reference: A later version (-06) exists of draft-ietf-ops-rfc2851-update-02 -- Possible downref: Non-RFC (?) normative reference: ref. 'MODEL' -- Possible downref: Non-RFC (?) normative reference: ref. 'RED93' ** Downref: Normative reference to an Experimental RFC: RFC 2859 (ref. 'TSWTCM') -- Possible downref: Non-RFC (?) normative reference: ref. 'SHAPER' Summary: 22 errors (**), 0 flaws (~~), 15 warnings (==), 9 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 April 2002 Nortel Networks 6 draft-ietf-diffserv-mib-15.txt A. Smith 7 Allegro Networks 8 October 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 (2001). 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. It may be used both for 43 monitoring and configuration of a router or switch capable of 44 Differentiated Services functionality. 46 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", 47 "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in 48 this document are to be interpreted as described in [RFC2119]. 50 1. The SNMP Management Framework 52 The SNMP Management Framework presently consists of five major 53 components: 55 o An overall architecture, described in RFC 2571 [1]. 57 o Mechanisms for describing and naming objects and events for the 58 purpose of management. The first version of this Structure of 59 Management Information (SMI) is called SMIv1 and described in 60 RFC 1155 [2], RFC 1212 [3] and RFC 1215 [4]. The second 61 version, called SMIv2, is described in RFC 2578 [5], RFC 2579 62 [6] and RFC 2580 [7]. 64 o Message protocols for transferring management information. The 65 first version of the SNMP message protocol is called SNMPv1 and 66 described in RFC 1157 [8]. A second version of the SNMP message 67 protocol, which is not an Internet standards track protocol, is 68 called SNMPv2c and described in RFC 1901 [9] and RFC 1906 [10]. 69 The third version of the message protocol is called SNMPv3 and 70 described in RFC 1906 [10], RFC 2572 [11] and RFC 2574 [12]. 72 o Protocol operations for accessing management information. The 73 first set of protocol operations and associated PDU formats is 74 described in RFC 1157 [8]. A second set of protocol operations 75 and associated PDU formats is described in RFC 1905 [13]. 77 o A set of fundamental applications described in RFC 2573 [14] and 78 the view-based access control mechanism described in RFC 2575 79 [15]. 81 A more detailed introduction to the current SNMP Management Framework 82 can be found in RFC 2570 [16]. 84 Managed objects are accessed via a virtual information store, termed the 85 Management Information Base or MIB. Objects in the MIB are defined using 86 the mechanisms defined in the SMI. 88 This memo specifies a MIB module that is compliant to the SMIv2. A MIB 89 conforming to the SMIv1 can be produced through the appropriate 90 translations. The resulting translated MIB must be semantically 91 equivalent, except where objects or events are omitted because no 92 translation is possible (use of Counter64). Some machine-readable 93 information in SMIv2 will be converted into textual descriptions in 94 SMIv1 during the translation process. However, this loss of machine 95 readable information is not considered to change the semantics of the 96 MIB. 98 2. Relationship to other working group documents 100 The Differentiated Services Working Group and related working groups 101 developed other documents, notably the Informal Management Model and the 102 policy configuration paradigm of SNMPCONF. The relationship between the 103 MIB and those documents is clarified here. 105 2.1. Relationship to the Informal Management Model for Differentiated 106 Services Router 108 This MIB is similar in design to [MODEL], although it can be used to 109 build functional data paths that the model would not well describe. The 110 model conceptually describes ingress and egress interfaces of an n-port 111 router, which may find some interfaces at a network edge and others 112 facing into the network core. It describes the configuration and 113 management of a Differentiated Services interface in terms of one or 114 more Traffic Conditioning Block (TCB), each containing, arranged in the 115 specified order, by definition, zero or more classifiers, meters, 116 actions, algorithmic droppers, queues and schedulers. Traffic may be 117 classified, and classified traffic may be metered. Each stream of 118 traffic identified by a combination of classifiers and meters may have 119 some set of actions performed on it; it may have dropping algorithms 120 applied and it may ultimately be stored into a queue before being 121 scheduled out to its next destination, either onto a link or to another 122 TCB. At times, the treatment for a given packet must have any of those 123 elements repeated. [MODEL] models this by cascading multiple TCBs, 124 while this MIB describes the policy by directly linking the functional 125 data path elements. 127 The MIB represents this cascade by following the "Next" attributes of 128 the various elements. They indicate what the next step in 129 Differentiated Services processing will be, whether it be a classifier, 130 meter, action, algorithmic dropper, queue, scheduler or a decision to 131 now forward a packet. 133 The higher level concept of a TCB is not required in the 134 parameterization or in the linking together of the individual elements, 135 hence it is not used in the MIB itself and is only mentioned in the text 136 for relating the MIB with the [MODEL]. Rather, the MIB models the 137 individual elements that make up the TCBs. 139 This MIB uses the notion of a Data Path to indicate the Differentiated 140 Services processing a packet may experience. The Data Path a packet 141 will initially follow is an attribute of the interface in question. The 142 Data Path Table provides a starting point for each direction (ingress or 143 egress) on each interface. A Data Path Table Entry indicates the first 144 of possibly multiple elements that will apply Differentiated Services 145 treatment to the packet. 147 2.2. Relationship to other MIBs and Policy Management 149 This MIB provides for direct reporting and manipulation of detailed 150 functional elements. These elements consist of a structural element and 151 one or more parameter-bearing elements. While this can be cumbersome, 152 it allows the reuse of parameters. For example, a service provider may 153 offer three varieties of contracts, and configure three parameter 154 elements. Each such data path on the system may then refer to these 155 sets of parameters. The diffServDataPathTable couples each direction on 156 each interface with the specified data path linkage. The concept of 157 "interface" is as defined by InterfaceIndex/ifIndex of the IETF 158 Interfaces MIB [IF-MIB]. 160 Other MIBs and data structure definitions for policy management 161 mechanisms other than SNMP/SMIv2 are likely to exist in the future for 162 the purposes of abstracting the model in other ways. An example is the 163 Differentiated Services Policy Information Base, [DSPIB]. 165 In particular, abstractions in the direction of less detailed 166 definitions of Differentiated Services functionality are likely e.g. 167 some form of "Per-Hop Behavior"-based definition involving a template of 168 detailed object values which is applied to specific instances of objects 169 in this MIB semi-automatically. 171 Another possible direction of abstraction is one using a concept of 172 "roles" (often, but not always, applied to interfaces). In this case, 173 it may be possible to re-use the object definitions in this MIB, 174 especially the parameterization tables. The Data Path table will help 175 in the reuse of the data path linkage tables by having the interface 176 specific information centralized, allowing easier mechanical replacement 177 of ifIndex by some sort of "roleIndex". This work is ongoing. 179 The reuse of parameter blocks on a variety of functional data paths is 180 intended to simplify network management. In many cases, one could also 181 re-use the structural elements as well; this has the unfortunate side- 182 effect of re-using the counters, so that monitoring information is lost. 183 For this reason, the re-use of structural elements is not generally 184 recommended. 186 3. MIB Overview 188 The Differentiated Services Architecture does not specify how an 189 implementation should be assembled. The [MODEL] describes a general 190 approach to implementation design, or to user interface design. Its 191 components could, however, be assembled in a different way. Traffic 192 conforming to a meter might be run through a second meter, for example, 193 or reclassified. 195 This MIB models the same functional data path elements, allowing the 196 network manager to assemble them in any fashion that meets the relevant 197 policy. These data path elements include Classifiers, Meters, Actions 198 of various sorts, Queues, and Schedulers. 200 In many of these tables, a distinction is drawn between the structure of 201 the policy (do this, then do that) and the parameters applied to 202 specific policy elements. This is to facilitate configuration, if the 203 MIB is used for that. The concept is that a set of parameters, such as 204 the values that describe a specific token bucket, might be configured 205 once and applied to many interfaces. 207 The RowPointer Textual Convention is therefore used in two ways in this 208 MIB. It is defined for the purpose of connecting an object to an entry 209 dynamically; the RowPointer object identifies the first object in the 210 target Entry, and in so doing points to the entire entry. In this MIB, 211 it is used as a connector between successive functional data path 212 elements, and as the link between the policy structure and the 213 parameters that are used. When used as a connector, it says what 214 happens "next"; what happens to classified traffic, to traffic 215 conforming or not conforming to a meter, and so on. When used to 216 indicate the parameters applied in a policy, it says "specifically" what 217 is meant; the structure points to the parameters of its policy. 219 The use of RowPointers as connectors allows for the simple extension of 220 the MIB. The RowPointers, whether "next" or "specific", may point to 221 Entries defined in other MIB modules. For example, the only type of 222 meter defined in this MIB is a token bucket meter; if another type of 223 meter is required, another MIB could be defined describing that type of 224 meter, and diffServMeterSpecific could point to it. Similarly, if a new 225 action is required, the "next" pointer of the previous functional 226 datapath element could point to an Entry defined in another MIB, public 227 or proprietary. 229 3.1. Processing Path 231 An interface has an ingress and an egress direction, and will generally 232 have a different policy in each direction. As traffic enters an edge 233 interface, it may be classified, metered, counted, and marked. Traffic 234 leaving the same interface might be remarked according to the contract 235 with the next network, queued to manage the bandwidth, and so on. As 236 [MODEL] points out, the functional datapath elements used on ingress and 237 egress are of the same type, but may be structured in very different 238 ways to implement the relevant policies. 240 3.1.1. diffServDataPathTable - The Data Path Table 242 Therefore, when traffic arrives at an ingress or egress interface, the 243 first step in applying the policy is determining what policy applies. 244 This MIB does that by providing a table of pointers to the first 245 functional data path element, indexed by interface and direction on that 246 interface. The content of the diffServDataPathEntry is a single 247 RowPointer, which points to that functional data path element. 249 When diffServDataPathStart in a direction on an interface is undefined 250 or is set to zeroDotZero, the implication is that there is no specific 251 policy to apply. 253 3.2. Classifier 255 Classifiers are used to differentiate among types of traffic. In the 256 Differentiated Services architecture, one usually discusses a behavior 257 aggregate identified by the application of one or more Differentiated 258 Services Code Points (DSCPs). However, especially at network edges 259 (which include hosts and first hop routers serving hosts), traffic may 260 arrive unmarked or the marks may not be trusted. In these cases, one 261 applies a Multi-Field Classifier, which may select an aggregate as 262 coarse as "all traffic", as fine as a specific microflow identified by 263 IP Addresses, IP Protocol, and TCP or UDP ports, or variety of slices in 264 between. 266 Classifiers can be simple or complex. In a core interface, one would 267 expect to find simple behavior aggregate classification to be used. 268 However, in an edge interface, one might first ask what application is 269 being used, meter the arriving traffic, and then apply various policies 270 to the non-conforming traffic depending on the Autonomous System number 271 advertising the destination address. To accomplish such a thing, 272 traffic must be classified, metered, and then reclassified. To this 273 end, the MIB defines separate classifiers, which may be applied at any 274 point in processing, and may have different content as needed. 276 The MIB also allows for ambiguous classification in a structured 277 fashion. In the end, traffic classification must be unambiguous; one 278 must know for certain what policy to apply to any given packet. 279 However, writing an unambiguous specification is often tedious, while 280 writing a specification in steps that permits and excludes various kinds 281 of traffic may be simpler and more intuitive. In such a case, the 282 classification "steps" are enumerated; all classification elements of 283 one precedence are applied as if in parallel, and then all 284 classification elements of the next precedence. 286 This MIB defines a single classifier parameter entry, the Multi-field 287 Classifier. A degenerate case of this multi-field classifier is a 288 Behavior Aggregate classifier. Other classifiers may be defined in 289 other MIB modules, to select traffic from a given layer two neighbor or 290 a given interface, traffic whose addresses belong to a given BGP 291 Community or Autonomous System, and so on. 293 3.2.1. diffServClfrElementTable - The Classifier Element Table 295 A classifier consists of classifier elements. A classifier element 296 identifies a specific set of traffic that forms part of a behavior 297 aggregate; other classifier elements within the same classifier may 298 identify other traffic that also falls into the behavior aggregate. For 299 example, in identifying AF traffic for the aggregate AF1, one might 300 implement separate classifier elements for AF11, AF12, and AF13 within 301 the same classifier and pointing to the same subsequent meter. 303 Generally, one would expect Data Path Entry to point to a classifier 304 (which is to say, a set of one or more classifier elements), although it 305 may point to something else when appropriate. Reclassification in a 306 functional data path is achieved by pointing to another Classifier Entry 307 when appropriate. 309 A classifier element is a structural element, indexed by classifier ID 310 and element ID. It has a precedence value, allowing for structured 311 ambiguity as described above, a "specific" pointer that identifies what 312 rule is to be applied, and a "next" pointer directing traffic matching 313 the classifier to the next functional data path element. If the "next" 314 pointer is zeroDotZero, the indication is that there is no further 315 differentiated services processing for this behavior aggregate. If the 316 "specific" pointer is zeroDotZero, however, the device is misconfigured. 317 In such a case, the classifier element should be operationally treated 318 as if it were not present. 320 When the MIB is used for configuration, diffServClfrNextFree and 321 diffServClfrElementNextFree always contain legal values for 322 diffServClfrId and diffServClfrElementId that are not currently used in 323 the system's configuration. The values are validated when creating 324 diffServClfrId and diffServClfrElementId, and in the event of a failure 325 (which would happen if two managers simultaneously attempted to create 326 an entry) must be re-read. 328 3.2.2. diffServMultiFieldClfrTable - The Multi-field Classifier Table 330 This MIB defines a single parameter type for classification, the Multi- 331 field Classifier. As a parameter, a filter may be specified once and 332 applied to many interfaces, using diffServClfrElementSpecific. This 333 filter matches: 335 o IP source address prefix, including host, CIDR Prefix, and "any 336 source address" 338 o IP destination address prefix, including host, CIDR Prefix, and 339 "any destination address" 341 o IPv6 Flow ID 343 o IP protocol or "any" 345 o TCP/UDP/SCTP source port range, including "any" 347 o TCP/UDP/SCTP destination port range, including "any" 349 o Differentiated Services Code Point 351 Since port ranges, IP prefixes, or "any" are defined in each case, it is 352 clear that a wide variety of filters can be constructed. The 353 Differentiated Services Behavior Aggregate filter is a special case of 354 this filter, in which only the DSCP is specified. 356 Other MIB modules may define similar filters in the same way. For 357 example, a filter for Ethernet information might define source and 358 destination MAC addresses of "any", Ethernet Packet Type, IEEE 802.2 359 SAPs, and IEEE 802.1 priorities. A filter related to policy routing 360 might be structured like the diffServMultiFieldClfrTable, but containing 361 the BGP Communities of the source and destination prefix rather than the 362 prefix itself, meaning "any prefix in this community". For such a 363 filter, a table similar to diffServMultiFieldClfrTable is constructed, 364 and diffServClfrElementSpecific configured to point to it. 366 When the MIB is used for configuration, diffServMultiFieldClfrNextFree 367 always contains a legal value for diffServMultiFieldClfrId that is not 368 currently used in the system's configuration. 370 3.3. Metering Traffic 372 As discussed in [MODEL], a meter and a shaper are functions that operate 373 on opposing ends of a link. A shaper schedules traffic for transmission 374 at specific times in order to approximate a particular line speed or 375 combination of line speeds. In its simplest form, if the traffic stream 376 contains constant sized packet, it might transmit one packet per unit 377 time to build the equivalent of a CBR circuit. However, various factors 378 intervene to make the approximation inexact; multiple classes of traffic 379 may occasionally schedule their traffic at the same time, the variable 380 length nature of IP traffic may introduce variation, and factors in the 381 link or physical layer may change traffic timing. A meter integrates 382 the arrival rate of traffic and determines whether the shaper at the far 383 end was correctly applied, or whether the behavior of the application in 384 question is naturally close enough to such behavior to be acceptable 385 under a given policy. 387 A common type of meter is a Token Bucket meter, such as [srTCM] or 388 [trTCM]. This type of meter assumes the use of a shaper at a previous 389 node; applications which send at a constant rate when sending may 390 conform if the token bucket is properly specified. It specifies the 391 acceptable arrival rate and quantifies the acceptable variability, often 392 by specifying a burst size or an interval; since rate = quantity/time, 393 specifying any two of those parameters implies the third, and a large 394 interval provides for a forgiving system. Multiple rates may be 395 specified, as in AF, such that a subset of the traffic (up to one rate) 396 is accepted with one set of guarantees, and traffic in excess of that 397 but below another rate has a different set of guarantees. Other types 398 of meters exist as well. 400 One use of a meter is when a service provider sells at most a certain 401 bit rate to one of its customers, and wants to drop the excess. In such 402 a case, the fractal nature of normal Internet traffic must be reflected 403 in large burst intervals, as TCP frequently sends packet pairs or larger 404 bursts, and responds poorly when more than one packet in a round trip 405 interval is dropped. Applications like FTP contain the effect by simply 406 staying below the target bit rate; this type of configuration very 407 adversely affects transaction applications like HTTP, however. Another 408 use of a meter is in the AF specification, in which excess traffic is 409 marked with a related DSCP and subjected to slightly more active queue 410 depth management. The application is not sharply limited to a 411 contracted rate in such a case, but can be readily contained should its 412 traffic create a burden. 414 3.3.1. diffServMeterTable - The Meter Table 416 The Meter Table is a structural table, specifying a specific functional 417 data path element. Its entry consists essentially of three RowPointers 418 - a "succeed" pointer, for traffic conforming to the meter, a "fail" 419 pointer, for traffic not conforming, and a "specific" pointer, to 420 identify the parameters in question. This structure is a bow to SNMP's 421 limitations; it would be better to have a structure with N rates and N+1 422 "next" pointers, with a single algorithm specified. In this case, 423 multiple meter entries connected by the "fail" link are understood to 424 contain the parameters for a specified algorithm, and traffic conforming 425 to a given rate follows their "succeed" paths. Within this MIB, only 426 Token Bucket parameters are specified; other varieties of meters may be 427 designed in other MIB modules. 429 When the MIB is used for configuration, diffServMeterNextFree always 430 contains a legal value for diffServMeterId that is not currently used in 431 the system's configuration. 433 3.3.2. diffServTBParamTable - The Token Bucket Parameters Table 435 The Token Bucket Parameters Table is a set of parameters that define a 436 Token Bucket Meter. As a parameter, a token bucket may be specified 437 once and applied to many interfaces, using diffServMeterSpecific. 438 Specifically, several modes of [srTCM] and [trTCM] are addressed. Other 439 varieties of meters may be specified in other MIB modules. 441 In general, if a Token Bucket has N rates, it has N+1 potential outcomes 442 - the traffic stream is slower than and therefore conforms to all of the 443 rates, it fails the first few but is slower than and therefore conforms 444 to the higher rates, or it fails all of them. As such, multi-rate 445 meters should specify those rates in monotonically increasing order, 446 passing through the diffServMeterFailNext from more committed to more 447 excess rates, and finally falling through diffServMeterFailNext to the 448 set of actions that apply to traffic which conforms to none of the 449 specified rates. diffServTBParamType in the first entry indicates the 450 algorithm being used. At each rate, diffServTBParamRate is derivable 451 from diffServTBParamBurstSize and diffServTBParamInterval; a superior 452 implementation will allow the configuration of any two of 453 diffServTBParamRate, diffServTBParamBurstSize, and 454 diffServTBParamInterval, and respond with the appropriate error code if 455 all three are specified but are not mathematically related. 457 When the MIB is used for configuration, diffServTBParamNextFree always 458 contains a legal value for diffServTBParamId that is not currently used 459 in the system's configuration. 461 3.4. Actions applied to packets 463 "Actions" are the things a differentiated services interface PHB may do 464 to a packet in transit. At minimum, such a policy might calculate 465 statistics on traffic in various configured classes, mark it with a 466 DSCP, drop it, or enqueue it before passing it on for other processing. 468 Actions are composed of a structural element, the diffServActionTable, 469 and various component action entries that may be applied. In the case 470 of the Algorithmic Dropper, an additional parameter table may be 471 specified to control Active Queue Management, as defined in [RED93] and 472 other AQM specifications. 474 3.4.1. diffServActionTable - The Action Table 476 The action table identifies sequences of actions to be applied to a 477 packet. Successive actions are chained through diffServActionNext, 478 ultimately terminating in zeroDotZero (indicating that the policy is 479 complete), a pointer to a queue, or a pointer to some other functional 480 data path element. 482 When the MIB is used for configuration, diffServActionNextFree always 483 contains a legal value for diffServActionId that is not currently used 484 in the system's configuration. 486 3.4.2. diffServCountActTable - The Count Action Table 488 The count action accumulates statistics pertaining to traffic passing 489 through a given path through the policy. It is intended to be useful 490 for usage-based billing, for statistical studies, or for analysis of the 491 behavior of a policy in a given network. The objects in the Count 492 Action are various counters and a discontinuity time. The counters 493 display the number of packets and bytes encountered on the path since 494 the discontinuity time. They share the same discontinuity time, which 495 is the discontinuity time of the interface or agent. 497 The designers of this MIB expect that every path through a policy should 498 have a corresponding counter. In early versions, it was impossible to 499 configure an action without implementing a counter, although the current 500 design makes them in effect the network manager's option, as a result of 501 making actions consistent in structure and extensible. The assurance of 502 proper debug and accounting is therefore left with the policy designer. 504 When the MIB is used for configuration, diffServCountActNextFree always 505 contains a legal value for diffServCountActId that is not currently used 506 in the system's configuration. 508 3.4.3. diffServDscpMarkActTable - The Mark Action Table 510 The Mark Action table is an unusual table, both in SNMP and in this MIB. 511 It might be viewed not so much as an array of single-object entries as 512 an array of OBJECT-IDENTIFIER conventions, as the OID for a 513 diffServDscpMarkActDscp instance conveys all of the necessary 514 information: packets are to be marked with the requisite DSCP. 516 As such, contrary to common practice, the index for the table is read- 517 only, and is both the Entry's index and its only value. 519 3.4.4. diffServAlgDropTable - The Algorithmic Drop Table 521 The Algorithmic Drop Table identifies a dropping algorithm, drops 522 packets, and counts the drops. Classified as an action, it is in effect 523 a method which applies a packet to a queue, and may modify either. When 524 the algorithm is "always drop", this is simple; when the algorithm calls 525 for head-drop, tail-drop, or a variety of Active Queue Management, the 526 queue is inspected, and in the case of Active Queue Management, 527 additional parameters are required. 529 What may not be clear from the name is that an Algorithmic Drop action 530 often does not drop traffic. Algorithms other than "always drop" 531 normally drop a few percent of packets at most. The action inspects the 532 diffServQEntry that diffServAlgDropQMeasure points to in order to 533 determine whether the packet should be dropped. 535 When the MIB is used for configuration, diffServAlgDropNextFree always 536 contains a legal value for diffServAlgDropId that is not currently used 537 in the system's configuration. 539 3.4.5. diffServRandomDropTable - The Random Drop Parameters Table 541 The Random Drop Table is an extension of the Algorithmic Drop Table 542 intended for use on queues whose depth is actively managed. Active 543 Queue Management algorithms are typified by [RED93], but the parameters 544 they use vary. It was deemed for the purposes of this MIB that the 545 proper values to represent include: 547 o Target case mean queue depth, expressed in bytes or packets 549 o Worst case mean queue depth, expressed in bytes or packets 550 o Maximum drop rate expressed as drops per thousand 552 o Coefficient of an exponentially weighted moving average, 553 expressed as the numerator of a fraction whose denominator is 554 65536. 556 o Sampling rate 558 An example of the representation chosen in this MIB for this element is 559 shown in Figure 1. 561 Random droppers often have their drop probability function described as 562 a plot of drop probability (P) against averaged queue length (Q). 563 (Qmin,Pmin) then defines the start of the characteristic plot. Normally 564 Pmin=0, meaning with average queue length below Qmin, there will be no 565 drops. (Qmax,Pmax) defines a "knee" on the plot, after which point the 566 drop probability become more progressive (greater slope). (Qclip,1) 567 defines the queue length at which all packets will be dropped. Notice 568 this is different from Tail Drop because this uses an averaged queue 569 length, although it is possible for Qclip to equal Qmax. 571 In the MIB module, diffServRandomDropMinThreshBytes and 572 diffServRandomDropMinThreshPkts represent Qmin. 573 diffServRandomDropMaxThreshBytes and diffServRandomDropMaxThreshPkts 574 represent Qmax. diffServAlgDropQThreshold represents Qclip. 575 diffServRandomDropInvProbMax represents Pmax (inverse). This MIB does 576 not represent Pmin (assumed to be zero unless otherwise represented). 577 In addition, since message memory is finite, queues generally have some 578 upper bound above which they are incapable of storing additional 579 traffic. Normally this number is equal to Qclip, specified by 581 AlgDrop Queue 582 +-----------------+ +-------+ 583 --->| Next ---------+--+------------------->| Next -+--> ... 584 | QMeasure -------+--+ | ... | 585 | QThreshold | RandomDrop +-------+ 586 | Type=randomDrop | +----------------+ 587 | Specific -------+---->| MinThreshBytes | 588 +-----------------+ | MaxThreshBytes | 589 | ProbMax | 590 | Weight | 591 | SamplingRate | 592 +----------------+ 594 Figure 1: Example Use of the RandomDropTable for Random Droppers 595 diffServAlgDropQThreshold. 597 Each random dropper specification is associated with a queue. This 598 allows multiple drop processes (of same or different types) to be 599 associated with the same queue, as different PHB implementations may 600 require. This also allows for sequences of multiple droppers if 601 necessary. 603 The calculation of a smoothed queue length may also have an important 604 bearing on the behavior of the dropper: parameters may include the 605 sampling interval or rate, and the weight of each sample. The 606 performance may be very sensitive to the values of these parameters and 607 a wide range of possible values may be required due to a wide range of 608 link speeds. Most algorithms include a sample weight, represented here 609 by diffServRandomDropWeight. The availability of 610 diffServRandomDropSamplingRate as readable is important, the information 611 provided by Sampling Rate is essential to the configuration of 612 diffServRandomDropWeight. Having Sampling Rate be configurable is also 613 helpful, as line speed increases, the ability to have queue sampling be 614 less frequent than packet arrival is needed. Note, however, that there 615 is ongoing research on this topic, see e.g. [ACTQMGMT] and [AQMROUTER]. 617 Additional parameters may be added in an enterprise MIB module, e.g. by 618 using AUGMENTS on this table, to handle aspects of random drop 619 algorithms that are not standardized here. 621 When the MIB is used for configuration, diffServRandomDropNextFree 622 always contains a legal value for diffServRandomDropId that is not 623 currently used in the system's configuration. 625 3.5. Queuing and Scheduling of Packets 627 These include Queues and Schedulers, which are inter-related in their 628 use of queuing techniques. By doing so, it is possible to build multi- 629 level schedulers, such as those which treat a set of queues as having 630 priority among them, and at a specific priority find a secondary WFQ 631 scheduler with some number of queues. 633 3.5.1. diffServQTable - The Class or Queue Table 635 The Queue Table models simple FIFO queues. The Scheduler Table allows 636 flexibility in constructing both simple and somewhat more complex 637 queuing hierarchies from those queues. 639 Queue Table entries are pointed at by the "next" attributes of the 640 upstream elements, such as diffServMeterSucceedNext or 641 diffServActionNext. Note that multiple upstream elements may direct 642 their traffic to the same Queue Table entry. For example, the Assured 643 Forwarding PHB suggests that all traffic marked AF11, AF12 or AF13 be 644 placed in the same queue, after metering, without reordering. To 645 accomplish that, the upstream diffServAlgDropNext pointers each point to 646 the same diffServQEntry. 648 A common requirement of a queue is that its traffic enjoy a certain 649 minimum or maximum rate, or that it be given a certain priority. 650 Functionally, the selection of such is a function of a scheduler. The 651 parameter is associated with the queue, however, using the Minimum or 652 Maximum Rate Parameters Table. 654 When the MIB is used for configuration, diffServQNextFree always 655 contains a legal value for diffServQId that is not currently used in the 656 system's configuration. 658 3.5.2. diffServSchedulerTable - The Scheduler Table 660 The scheduler, and therefore the Scheduler Table, accepts inputs from 661 either queues or a preceding scheduler. The Scheduler Table allows 662 flexibility in constructing both simple and somewhat more complex 663 queuing hierarchies from those queues. 665 When the MIB is used for configuration, diffServSchedulerNextFree always 666 contains a legal value for diffServSchedulerId that is not currently 667 used in the system's configuration. 669 3.5.3. diffServMinRateTable - The Minimum Rate Table 671 When the output rate of a queue or scheduler must be given a minimum 672 rate or a priority, this is done using the diffServMinRateTable. Rates 673 may be expressed as absolute rates, or as a fraction of ifSpeed, and 674 imply the use of a rate-based scheduler such as WFQ or WRR. The use of 675 a priority implies the use of a Priority Scheduler. Only one of the 676 Absolute or Relative rate need be set; the other takes the relevant 677 value as a result. Excess capacity is distributed proportionally among 678 the inputs to a scheduler using the assured rate. More complex 679 functionality may be described by augmenting this MIB. 681 When a priority scheduler is used, its effect is to give the queue the 682 entire capacity of the subject interface less the capacity used by 683 higher priorities, if there is traffic present to use it. This is true 684 regardless of the rate specifications applied to that queue or other 685 queues on the interface. Policing excess traffic will mitigate this 686 behavior. 688 When the MIB is used for configuration, diffServMinRateNextFree always 689 contains a legal value for diffServMinRateId that is not currently used 690 in the system's configuration. 692 3.5.4. diffServMaxRateTable - The Maximum Rate Table 694 When the output rate of a queue or scheduler must be limited to at most 695 a specified maximum rate, this is done using the diffServMaxRateTable. 696 Rates may be expressed as absolute rates, or as a fraction of ifSpeed. 697 Only one of the Absolute or Relative rate need be set; the other takes 698 the relevant value as a result. 700 The definition of a multirate shaper requires multiple 701 diffServMaxRateEntries. In this case, an algorithm such as [SHAPER] is 702 used. In that algorithm, more than one rate is specified, and at any 703 given time traffic is shaped to the lowest specified rate which exceeds 704 the arrival rate of traffic. 706 When the MIB is used for configuration, diffServMaxRateNextFree always 707 contains a legal value for diffServMaxRateId that is not currently used 708 in the system's configuration. 710 3.5.5. Using queues and schedulers together 712 For representing a Strict Priority scheduler, each scheduler input is 713 assigned a priority with respect to all the other inputs feeding the 714 same scheduler, with default values for the other parameters. Higher- 715 priority traffic that is not being delayed for shaping will be serviced 716 before a lower-priority input. An example is found in Figure 2. 718 For weighted scheduling methods, such as WFQ or WRR, the "weight" of a 719 given scheduler input is represented with a Minimum Service Rate leaky- 720 bucket profile which provides guaranteed minimum bandwidth to that 721 input, if required. This is represented by a rate 722 diffServMinRateAbsolute; the classical weight is the ratio between that 723 rate and the interface speed, or perhaps the ratio between that rate and 724 the sum of the configured rates for classes. The rate may be 725 represented by a relative value, as a fraction of the interface's 726 current line rate, diffServMinRateRelative, to assist in cases where 727 line rates are variable or where a higher-level policy might be 728 expressed in terms of fractions of network resources. The two rate 729 parameters are inter-related and changes in one may be reflected in the 730 +-----+ 731 +-------+ | P S | 732 | Queue +------------>+ r c | 733 +-------+-+--------+ | i h | 734 |Priority| | o e | 735 +--------+ | r d +-----------> 736 +-------+ | i u | 737 | Queue +------------>+ t l | 738 +-------+-+--------+ | y e | 739 |Priority| | r | 740 +--------+ +-----+ 742 Figure 2: Priority Scheduler with two queues 744 other. An example is found in figure 3. 746 For weighted scheduling methods, one can say loosely, that WRR focuses 747 on meeting bandwidth sharing, without concern for relative delay amongst 748 the queues; where WFQ controls both queue the service order and the 749 amount of traffic serviced, providing bandwidth sharing and relative 750 delay ordering amongst the queues. 752 A queue or scheduled set of queues (which is an input to a scheduler) 753 may also be capable of acting as a non-work-conserving [MODEL] traffic 754 shaper: this is done by defining a Maximum Service Rate leaky-bucket 755 profile in order to limit the scheduler bandwidth available to that 756 input. This is represented by a rate, in diffServMaxRateAbsolute; the 757 classical weight is the ratio between that rate and the interface speed, 759 +-----+ 760 +-------+ | W S | 761 | Queue +------------>+ R c | 762 +-------+-+--------+ | R h | 763 | Rate | | e | 764 +--------+ | o d +-----------> 765 +-------+ | r u | 766 | Queue +------------>+ l | 767 +-------+-+--------+ | W e | 768 | Rate | | F r | 769 +--------+ | Q | 770 +-----+ 772 Figure 3: WRR or WFQ rate-based scheduler with two inputs 773 or perhaps the ratio between that rate and the sum of the configured 774 rates for classes. The rate may be represented by a relative value, as 775 a fraction of the interface's current line rate, 776 diffServMaxRateRelative. This MIB presumes that shaping is something a 777 scheduler does to its inputs, which it models as a queue with a maximum 778 rate or a scheduler whose output has a maximum rate. 780 The same may be done on a queue, if a given class is to be shaped to a 781 maximum rate without shaping other classes, as in Figure 5. 783 Other types of priority and weighted scheduling methods can be defined 784 using existing parameters in diffServMinRateEntry. NOTE: 785 diffServSchedulerMethod uses OBJECT IDENTIFIER syntax, with the 786 different types of scheduling methods defined as OBJECT-IDENTITY. 788 +---+ 789 +-------+ | S | 790 | Queue +------------>+ c | 791 +-------+-+--------+ | h | 792 | | | e +-----------> 793 +--------+ | d +-+-------+ 794 | u | |Shaping| 795 +-------+ | l | | Rate | 796 | Queue +------------>+ e | +-------+ 797 +-------+-+--------+ | r | 798 | | +---+ 799 +--------+ 801 Figure 4: Shaping scheduled traffic to a known rate 803 +---+ 804 +-------+ | S | 805 | Queue +------------>+ c | 806 +-------+-+--------+ | h | 807 |Min Rate| | e +-----------> 808 +--------+ | d | 809 | u | 810 +-------+ | l | 811 | Queue +------------>+ e | 812 +-------+-+--------+ | r | 813 |Min Rate| | | 814 +--------+ | | 815 |Max Rate| | | 816 +--------+ +---+ 817 Figure 5: Shaping one input to a work-conserving scheduler 818 Future scheduling methods may be defined in other MIBs. This requires 819 an OBJECT-IDENTITY definition, a description of how the existing objects 820 are reused, if they are, and any new objects they require. 822 To implement an EF and two AF classes, one must use a combination of 823 priority and WRR/WFQ scheduling. This requires us to cascade two 824 schedulers. If one were to additionally shape the output of the system 825 to a rate lower than the interface rate, one must place an upper bound 826 rate on the output of the priority scheduler. See figure 6. 828 3.6. Example configuration for AF and EF 830 For the sake of argument, let us build an example with one EF class and 831 four AF classes using the constructs in this MIB. 833 3.6.1. AF and EF Ingress Interface Configuration 835 The ingress edge interface identifies traffic into classes, meters it, 836 and ensures that any excess is appropriately dealt with according to the 837 PHB. For AF, this means marking excess; for EF, it means dropping 838 excess or shaping it to a maximum rate. 840 +-----+ 841 +-------+ | P S | 842 | Queue +---------------------------------->+ r c | 843 +-------+----------------------+--------+ | i h | 844 |Priority| | o e +-----------> 845 +--------+ | r d +-+-------+ 846 +------+ | i u | |Shaping| 847 +-------+ | W S +------------->+ t l | | Rate | 848 | Queue +------------>+ R c +-+--------+ | y e | +-------+ 849 +-------+-+--------+ | R h | |Priority| | r | 850 |Min Rate| | e | +--------+ +-----+ 851 +--------+ | o d | 852 +-------+ | r u | 853 | Queue +------------>+ l | 854 +-------+-+--------+ | W e | 855 |Min Rate| | F r | 856 +--------+ | Q | 857 +------+ 859 Figure 6: Combined EF and AF services using cascaded schedulers. 861 +-----------------------+ 862 | diffServDataPathStart | 863 +-----------+-----------+ 864 | 865 +----------+ 866 | 867 +--+--+ +-----+ +-----+ +-----+ +-----+ 868 | AF1 +-----+ AF2 +-----+ AF3 +-----+ AF4 +-----+ EF | 869 +--+--+ +--+--+ +--+--+ +--+--+ +--+--+ 870 | | | | | 871 +--+--+ +--+--+ +--+--+ +--+--+ +--+--+ 872 |trTCM| |trTCM| |trTCM| |trTCM| |srTCM| 873 |Meter| |Meter| |Meter| |Meter| |Meter| 874 +-+++-+ +-+++-+ +-+++-+ +-+++-+ +-+-+-+ 875 ||| ||| ||| ||| | | 876 +-+||---+ +-+||---+ +-+||---+ +-+||---+ +-+-|---+ 877 |+-+|----+ |+-+|----+ |+-+|----+ |+-+|----+ |+--+----+ 878 ||+-+-----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||Actions| 879 +||Actions| +||Actions| +||Actions| +||Actions| +| | 880 +| | +| | +| | +| | +-+-----+ 881 +-+-----+ +-+-----+ +-+-----+ +-+-----+ | 882 ||| ||| ||| ||| | 883 VVV VVV VVV VVV V 885 Accepted traffic is sent to IP forwarding 887 Figure 7: combined EF and AF implementation, ingress side 889 3.6.1.1. Classification In The Example 891 A packet arriving at an ingress interface picks up its policy from the 892 diffServDataPathTable. This points to a classifier, which will select 893 traffic according to some specification for each traffic class. 895 An example of a classifier for an AFm class would be a set of three 896 classifier elements, each pointing to a Multi-field classification 897 parameter block identifying one of the AFmn DSCPs. Alternatively, the 898 filters might contain selectors for HTTP traffic or some other 899 application. 901 An example of a classifier for EF traffic might be either a classifier 902 element pointing to a filter specifying the EF code point, or a 903 collection of classifiers with parameter blocks specifying individual 904 telephone calls, or a variety of other approaches. 906 Typically, of course, a classifier identifies a variety of traffic and 907 breaks it up into separate classes. It might very well contain fourteen 908 classifier elements indicating the twelve AFmn DSCP values, EF, and 909 "everything else". These would presumably direct traffic down six 910 functional data paths: one for each AF or EF class, and one for all 911 other traffic. 913 3.6.1.2. AF Implementation On an Ingress Edge Interface 915 Each AFm class applies a Two Rate Three Color Meter, dividing traffic 916 into three groups. These groups of traffic conform to both specified 917 rates, only the higher one, or none. The intent, on the ingress 918 interface at the edge of the network, is to measure and appropriately 919 mark traffic. 921 3.6.1.2.1. AF Metering On an Ingress Edge Interface 923 Each AFm class applies a Two Rate Three Color Meter, dividing traffic 924 into three groups. If two rates R and S, with R < S, are specified and 925 traffic arrives at rate T, traffic comprising up to R bits per second is 926 considered to conform to the "confirmed" rate, R. If R < T, traffic 927 comprising up to S-R bits per second is considered to conform to the 928 "excess" rate, S. Any further excess is non-conformant. 930 Two meter entries are used to configure this, one for the conforming 931 rate and one for the excess rate. The rate parameters are stored in 932 associated Token Bucket Parameter Entries. The "FailNext" pointer of 933 the lower rate Meter Entry points to the other Meter Entry; both 934 "SucceedNext" pointers and the "FailNext" pointer of the higher Meter 935 Entry point to lists of actions. In the color-blind mode, all three 936 classifier "next" entries point to the lower rate meter entry. In the 937 color-aware mode, the AFm1 classifier points to the lower rate entry, 938 the AFm2 classifier points to the higher rate entry (as it is only 939 compared against that rate), and the AFm3 classifier points directly to 940 the actions taken when both rates fail. 942 3.6.1.2.2. AF Actions On an Ingress Edge Interface 944 For network planning and perhaps for billing purposes, arriving traffic 945 is normally counted. Therefore, a "count" action, consisting of an 946 action table entry pointing to a count table entry, is configured. 948 Also, traffic is marked with the appropriate DSCP. The first R bits per 949 second are marked AFm1, the next S-R bits per second are marked AFm2, 950 and the rest is marked AFm3. It may be that traffic is arriving marked 951 with the same DSCP, but in general, the additional complexity of 952 deciding that it is being remarked to the same value is not useful. 953 Therefore, a "mark" action, consisting of an action table entry pointing 954 to a mark table entry, is configured. 956 At this point, the usual case is that traffic is now forwarded in the 957 usual manner. To indicate this, the "SucceedNext" pointer of the Mark 958 Action is set to zeroDotZero. 960 3.6.1.3. EF Implementation On an Ingress Edge Interface 962 The EF class applies a Single Rate Two Color Meter, dividing traffic 963 into "conforming" and "excess" groups. The intent, on the ingress 964 interface at the edge of the network, is to measure and appropriately 965 mark conforming traffic and drop the excess. 967 3.6.1.3.1. EF Metering On an Ingress Edge Interface 969 A single rate two color (srTCM) meter requires one token bucket. It is 970 therefore configured using a single meter entry with a corresponding 971 Token Bucket Parameter Entry. Arriving traffic either "succeeds" or 972 "fails". 974 3.6.1.3.2. EF Actions On an Ingress Edge Interface 976 For network planning and perhaps for billing purposes, arriving traffic 977 that conforms to the meter is normally counted. Therefore, a "count" 978 action, consisting of an action table entry pointing to a count table 979 entry, is configured. 981 Also, traffic is (re)marked with the EF DSCP. Therefore, a "mark" 982 action, consisting of an action table entry pointing to a mark table 983 entry, is configured. 985 At this point, the successful traffic is now forwarded in the usual 986 manner. To indicate this, the "SucceedNext" pointer of the Mark Action 987 is set to zeroDotZero. 989 Traffic that exceeded the arrival policy, however, is to be dropped. 990 One can use a count action on this traffic if the several counters are 991 interesting. However, since the drop counter in the Algorithmic Drop 992 Entry will count packets dropped, this is not clearly necessary. An 993 Alorithmic Drop Entry of the type "alwaysDrop" with no successor is 994 sufficient. 996 3.7. AF and EF Egress Edge Interface Configuration 998 3.7.1. Classification On an Egress Edge Interface 1000 A packet arriving at an egress interface may have been classified on an 1001 ingress interface, and the egress interface may have access to that 1002 information. If it is relevant, there is no reason not to use that 1004 +-----------------------+ 1005 | diffServDataPathStart | 1006 +-----------+-----------+ 1007 | 1008 +----------+ 1009 | 1010 +--+--+ +-----+ +-----+ +-----+ +-----+ 1011 | AF1 +-----+ AF2 +-----+ AF3 +-----+ AF4 +-----+ EF | 1012 +-+++-+ +-+++-+ +-+++-+ +-+++-+ +-+-+-+ 1013 ||| ||| ||| ||| | | 1014 +-+++-+ +-+++-+ +-+++-+ +-+++-+ +-+-+-+ 1015 |trTCM| |trTCM| |trTCM| |trTCM| |srTCM| 1016 |Meter| |Meter| |Meter| |Meter| |Meter| 1017 +-+++-+ +-+++-+ +-+++-+ +-+++-+ +-+-+-+ 1018 ||| ||| ||| ||| | | 1019 +-+||---+ +-+||---+ +-+||---+ +-+||---+ +-+-|---+ 1020 |+-+|----+ |+-+|----+ |+-+|----+ |+-+|----+ |+--+----+ 1021 ||+-+-----+ ||+-+-----+ ||+-+-----+ ||+-+-----+ ||Actions| 1022 +||Actions| +||Actions| +||Actions| +||Actions| +| | 1023 +| | +| | +| | +| | +-+-----+ 1024 +-+-----+ +-+-----+ +-+-----+ +-+-----+ | 1025 ||| ||| ||| ||| | 1026 +-+++--+ +-+++--+ +-+++--+ +-+++--+ +--+---+ 1027 | Queue| | Queue| | Queue| | Queue| | Queue| 1028 +--+---+ +--+---+ +--+---+ +--+---+ +--+---+ 1029 | | | | | 1030 +--+-----------+-----------+-----------+---+ | 1031 | WFQ/WRR Scheduler | | 1032 +--------------------------------------+---+ | 1033 | | 1034 +-----+-----------+----+ 1035 | Priority Scheduler | 1036 +----------+-----------+ 1037 | 1038 V 1040 Figure 8: combined EF and AF implementation 1041 information. If it is not available, however, there may be a need to 1042 (re)classify on the egress interface. In any event, it picks up its 1043 "program" from the diffServDataPathTable. This points to a classifier, 1044 which will select traffic according to some specification for each 1045 traffic class. 1047 An example of a classifier for an AFm class would be a succession of 1048 three classifier elements, each pointing to a Multi-field classification 1049 parameter block identifying one of the AFmn DSCPs. Alternatively, the 1050 filter might contain selectors for HTTP traffic or some other 1051 application. 1053 An example of a classifier for EF traffic might be either a classifier 1054 element pointing to a Multi-field parameter specifying the EF code 1055 point, or a collection of classifiers with parameter blocks specifying 1056 individual telephone calls, or a variety of other approaches. 1058 Each classifier delivers traffic to appropriate functional data path 1059 elements. 1061 3.7.2. AF Implementation On an Egress Edge Interface 1063 Each AFm class applies a Two Rate Three Color Meter, dividing traffic 1064 into three groups. These groups of traffic conform to both specified 1065 rates, only the higher one, or none. The intent, on the ingress 1066 interface at the edge of the network, is to measure and appropriately 1067 mark traffic. 1069 3.7.2.1. AF Metering On an Egress Edge Interface 1071 Each AFm class applies a Two Rate Three Color Meter, dividing traffic 1072 into three groups. If two rates R and S, with R < S, are specified and 1073 traffic arrives at rate T, traffic comprising up to R bits per second is 1074 considered to conform to the "confirmed" rate, R. If R < T, traffic 1075 comprising up to S-R bits per second is considered to conform to the 1076 "excess" rate, S. Any further excess is non-conformant. 1078 Two meter entries are used to configure this, one for the conforming 1079 rate and one for the excess rate. The rate parameters are stored in 1080 associated Token Bucket Parameter Entries. The "FailNext" pointer of 1081 the lower rate Meter Entry points to the other Meter Entry; both 1082 "SucceedNext" pointers and the "FailNext" pointer of the higher Meter 1083 Entry point to lists of actions. In the color-blind mode, all three 1084 classifier "next" entries point to the lower rate meter entry. In the 1085 color-aware mode, the AFm1 classifier points to the lower rate entry, 1086 the AFm2 classifier points to the higher rate entry (as it is only 1087 +-----------------------------------------------------+ 1088 | Classifier | 1089 +--------+--------------------------------------------+ 1090 |Green| Yellow| Red 1091 | | | 1092 +--+-----+-------+--+ Fail +--------------------+ 1093 | Meter +------+ Meter | 1094 +--+----------------+ +---+-------+--------+ 1095 | Succeed (Green) | |Fail (Red) 1096 | +---------+ | 1097 | | Succeed (Yellow)| 1098 +----+----+ +----+----+ +----+----+ 1099 | Count | | Count | | Count | 1100 | Action | | Action | | Action | 1101 +----+----+ +----+----+ +----+----+ 1102 | | | 1103 +----+----+ +----+----+ +----+----+ 1104 |Mark AFx1| |Mark AFx2| |Mark AFx3| 1105 | Action | | Action | | Action | 1106 +----+----+ +----+----+ +----+----+ 1107 | | | 1108 +----+----+ +----+----+ +----+----+ 1109 | Random | | Random | | Random | 1110 | Drop | | Drop | | Drop | 1111 | Action | | Action | | Action | 1112 +----+----+ +----+----+ +----+----+ 1113 | | | 1114 +--------+-----------------+-----------------+--------+ 1115 | Queue | 1116 +--------------------------+--------------------------+ 1117 | 1118 +----+----+ 1119 | Rate | 1120 |Scheduler| 1121 +----+----+ 1122 | 1124 Figure 9a: Typical AF Edge egress interface configuration, 1125 using color-blind meters 1126 +-----------------------------------------------------+ 1127 | Classifier | 1128 +--------+--------------------------------------------+ 1129 |Green | Yellow | Red 1130 | | | 1131 +----+----+ +----+----+ | 1132 | Count | | Count | | 1133 | Action +-------+ Action +------------+ 1134 +----+----+ Fail +----+----+ Fail | 1135 |Succeed |Succeed | 1136 +----+----+ +----+----+ +----+----+ 1137 | Count | | Count | | Count | 1138 | Action | | Action | | Action | 1139 +----+----+ +----+----+ +----+----+ 1140 | | | 1141 +----+----+ +----+----+ +----+----+ 1142 |Mark AFx1| |Mark AFx2| |Mark AFx3| 1143 | Action | | Action | | Action | 1144 +----+----+ +----+----+ +----+----+ 1145 | | | 1146 +----+----+ +----+----+ +----+----+ 1147 | Random | | Random | | Random | 1148 | Drop | | Drop | | Drop | 1149 | Action | | Action | | Action | 1150 +----+----+ +----+----+ +----+----+ 1151 | | | 1152 +--------+-----------------+-----------------+--------+ 1153 | Queue | 1154 +--------------------------+--------------------------+ 1155 | 1156 +----+----+ 1157 | Rate | 1158 |Scheduler| 1159 +----+----+ 1160 | 1162 Figure 9b: Typical AF Edge egress interface configuration, 1163 using color-aware meters 1164 +-----------------------------------------------------+ 1165 | Classifier | 1166 +--------+-----------------+-----------------+--------+ 1167 | Green | Yellow | Red 1168 | | | 1169 +----+----+ +----+----+ +----+----+ 1170 | Count | | Count | | Count | 1171 | Action | | Action | | Action | 1172 +----+----+ +----+----+ +----+----+ 1173 | | | 1174 +----+----+ +----+----+ +----+----+ 1175 | Random | | Random | | Random | 1176 | Drop | | Drop | | Drop | 1177 | Action | | Action | | Action | 1178 +----+----+ +----+----+ +----+----+ 1179 | | | 1180 +--------+-----------------+-----------------+--------+ 1181 | Queue | 1182 +--------------------------+--------------------------+ 1183 | 1184 +----+----+ 1185 | Rate | 1186 |Scheduler| 1187 +----+----+ 1188 | 1190 Figure 10: Typical AF Edge core interface configuration 1192 compared against that rate), and the AFm3 classifier points directly to 1193 the actions taken when both rates fail. 1195 3.7.2.2. AF Actions On an Egress Edge Interface 1197 For network planning and perhaps for billing purposes, departing traffic 1198 is normally counted. Therefore, a "count" action, consisting of an 1199 action table entry pointing to a count table entry, is configured. 1201 Also, traffic may be marked with an appropriate DSCP. The first R bits 1202 per second are marked AFm1, the next S-R bits per second are marked 1203 AFm2, and the rest is marked AFm3. It may be that traffic is arriving 1204 marked with the same DSCP, but in general, the additional complexity of 1205 deciding that it is being remarked to the same value is not useful. 1206 Therefore, a "mark" action, consisting of an action table entry pointing 1207 to a mark table entry, is configured. 1209 At this point, the usual case is that traffic is now queued for 1210 transmission. The queue uses Active Queue Management, using an 1211 algorithm such as RED. Therefore, an Algorithmic Dropper is configured 1212 for each AFmn traffic stream, with a slightly lower min- threshold (and 1213 possibly lower max-threshold) for the excess traffic than for the 1214 committed traffic. 1216 3.7.2.3. AF Rate-based Queuing On an Egress Edge Interface 1218 The queue expected by AF is normally a work-conserving queue. It 1219 usually has a specified minimum rate, and may have a maximum rate below 1220 the bandwidth of the interface. In concept, it will use as much 1221 bandwidth as is available to it, but assure the lower bound. 1223 Common ways to implement this include various forms of Weighted Fair 1224 Queuing (WFQ) or Weighted Round Robin (WRR). Integrated over a longer 1225 interval, these give each class a predictable throughput rate. They 1226 differ in that over short intervals they will order traffic differently. 1227 In general, traffic classes that keep traffic in queue will tend to 1228 absorb latency from queues with lower mean occupancy, in exchange for 1229 which they make use of any available capacity. 1231 3.7.3. EF Implementation On an Egress Edge Interface 1233 The EF class applies a Single Rate Two Color Meter, dividing traffic 1234 into "conforming" and "excess" groups. The intent, on the egress 1235 interface at the edge of the network, is to measure and appropriately 1236 mark conforming traffic and drop the excess. 1238 3.7.3.1. EF Metering On an Egress Edge Interface 1240 A single rate two color (srTCM) meter requires one token bucket. It is 1241 therefore configured using a single meter entry with a corresponding 1242 Token Bucket Parameter Entry. Arriving traffic either "succeeds" or 1243 "fails". 1245 3.7.3.2. EF Actions On an Egress Edge Interface 1247 For network planning and perhaps for billing purposes, departing traffic 1248 that conforms to the meter is normally counted. Therefore, a "count" 1249 action, consisting of an action table entry pointing to a count table 1250 entry, is configured. 1252 Also, traffic is (re)marked with the EF DSCP. Therefore, a "mark" 1253 action, consisting of an action table entry pointing to a mark table 1254 entry, is configured. 1256 +-----------------------------------------------------+ 1257 | Classifier | 1258 +-------------------------+---------------------------+ 1259 | Voice 1260 | 1261 +-------------+----------+ 1262 | Meter | 1263 +----+-------------+-----+ 1264 | Succeed | Fail 1265 | | 1266 +----+----+ +----+----+ 1267 | Count | | Always | 1268 | Action | | Drop | 1269 +----+----+ | Action | 1270 | +---------+ 1271 +----+---------+ 1272 | Algorithmic | 1273 | Drop Action | 1274 +----+---------+ 1275 | 1276 +----------------+---------------+ 1277 | Queue | 1278 +----------------+---------------+ 1279 | 1280 +-----+-----+ 1281 | Priority | 1282 | Scheduler | 1283 +-----+-----+ 1285 Figure 11: Typical EF Edge (Policing) Configuration 1286 +--------------------------------+ 1287 | Classifier | 1288 +----------------+---------------+ 1289 | Voice 1290 | 1291 +----+----+ 1292 | Count | 1293 | Action | 1294 +----+----+ 1295 | 1296 +------+-------+ 1297 | Algorithmic | 1298 | Drop Action | 1299 +------+-------+ 1300 | 1301 +----------------+---------------+ 1302 | Queue | 1303 +----------------+---------------+ 1304 | 1305 +-----+-----+ 1306 | Priority | 1307 | Scheduler | 1308 +-----+-----+ 1310 Figure 12: Typical EF Core interface Configuration 1312 At this point, the successful traffic is now queued for transmission, 1313 using a priority queue or perhaps a rate-based queue with significant 1314 over-provision. Since the amount of traffic present is known, one might 1315 not drop from this queue at all. 1317 Traffic that exceeded the policy, however, is dropped. A count action 1318 can be used on this traffic if the several counters are interesting. 1319 However, since the drop counter in the Algorithmic Drop Entry will count 1320 packets dropped, this is not clearly necessary. An Alorithmic Drop 1321 Entry of the type "alwaysDrop" with no successor is sufficient. 1323 3.7.3.3. EF Priority Queuing On an Egress Edge Interface 1325 The normal implementation is a priority queue, to minimize induced 1326 jitter. A separate queue is used for each EF class, with a strict 1327 ordering. 1329 4. Conventions used in this MIB 1331 4.1. The use of RowPointer to indicate data path linkage 1333 RowPointer is a textual convention used to identify a conceptual row in 1334 a MIB Table by pointing to one of its objects. One of the ways this MIB 1335 uses it is to indicate succession, pointing to data path linkage table 1336 entries. 1338 For succession, it answers the question "what happens next?". Rather 1339 than presume that the next table must be as specified in the conceptual 1340 model [MODEL] and providing its index, the RowPointer takes you to the 1341 MIB row representing that thing. In the diffServMeterTable, for example, 1342 the diffServMeterFailNext RowPointer might take you to another meter, 1343 while the diffServMeterSucceedNext RowPointer would take you to an 1344 action. 1346 Since a RowPointer is not tied to any specific object except by the 1347 value it contains, it is possible and acceptable to use RowPointers to 1348 merge data paths. An obvious example of such a use is in the 1349 classifier: traffic matching the DSCPs AF11, AF12, and AF13 might be 1350 presented to the same meter in order to perform the processing described 1351 in the Assured Forwarding PHB. Another use would be to merge data paths 1352 from several interfaces; if they represent a single service contract, 1353 having them share a common set of counters and common policy may be a 1354 desirable configuration. Note well, however, that such configurations 1355 may have related implementation issues - if Differentiated Services 1356 processing for the interfaces is implemented in multiple forwarding 1357 engines, the engines will need to communicate if they are to implement 1358 such a feature. An implementation that fails to provide this capability 1359 is not considered to have failed the intention of this MIB or of the 1360 [MODEL]; an implementation that does provide it is not considered 1361 superior from a standards perspective. 1363 NOTE -- the RowPointer construct is used to connect the functional 1364 data paths. The [MODEL] describes these as TCBs, as an aid to 1365 understanding. This MIB, however, does not model TCBs directly. It 1366 operates at a lower level of abstraction using only individual 1367 elements, connected in succession by RowPointers. Therefore, the 1368 concept of TCBs enclosing individual Functional Data Path elements 1369 is not directly applicable to this MIB, although management tools 1370 that use this MIB may employ such a concept. 1372 It is possible that a path through a device following a set of 1373 RowPointers is indeterminate i.e. it ends in a dangling RowPointer. 1374 Guidance is provided in the MIB module's DESCRIPTION-clause for each of 1375 the linkage attribute. In general, for both zeroDotZero and dangling 1376 RowPointer, it is assumed the data path ends and the traffic should be 1377 given to the next logical part of the device, usually a forwarding 1378 process or a transmission engine, or the proverbial bit-bucket. Any 1379 variation from this usage is indicated by the attribute affected. 1381 4.2. The use of RowPointer to indicate parameters 1383 RowPointer is also used in this MIB to indicate parameterization, for 1384 pointing to parameterization table entries. 1386 For indirection (as in the diffServClfrElementTable), the idea is to 1387 allow other MIBs, including proprietary ones, to define new and arcane 1388 filters - MAC headers, IPv4 and IPv6 headers, BGP Communities and all 1389 sorts of other things - whilst still utilizing the structures of this 1390 MIB. This is a form of class inheritance (in "object oriented" 1391 language): it allows base object definitions ("classes") to be extended 1392 in proprietary or standard ways, in the future, by other documents. 1394 RowPointer also clearly indicates the identified conceptual row's 1395 content does not change, hence they can be simultaneously used, pointed 1396 to, by more than one data path linkage table entries. The 1397 identification of RowPointer allows higher level policy mechanisms to 1398 take advantage of this characteristic. 1400 4.3. Conceptual row creation and deletion 1402 A number of conceptual tables defined in this MIB use as an index an 1403 arbitrary integer value, unique across the scope of the agent. In order 1404 to help with multi-manager row-creation problems, a mechanism must be 1405 provided to allow a manager to obtain unique values for such an index 1406 and to ensure that, when used, the manager knows whether it got what it 1407 wanted or not. 1409 Typically, such a table has an associated NextFree variable e.g. 1410 diffServClfrNextFree which provides a suitable value for the index of 1411 the next row to be created e.g. diffServClfrId. The value zero is used 1412 to indicate that the agent can configure no more entries. The table 1413 also has a columnar Status attribute with RowStatus syntax [6]. 1415 Generally, if a manager attempts to create a row, the agent will create 1416 the row and return success. If the agent has insufficient resources or 1417 such a row already exists, then it returns an error. A manager must be 1418 prepared to try again in such circumstances, probably by re-reading the 1419 NextFree to obtain a new index value in case a second manager had got in 1420 between the first manager's read of the NextFree value and the first 1421 manager's row-creation attempt. 1423 To simplify management creation and deletion of rows in this MIB, the 1424 agent is expected to assist in maintaining its consistency. It may 1425 accomplish this by maintaining internal usage counters for any row that 1426 might be pointed to by a RowPointer, or by any equivalent means. When a 1427 RowPointer is created or written, and the row it points to does not 1428 exist, the SET returns an inconsistentValue error. When a RowStatus 1429 variable is set to 'destroy' but the usage counter is non-zero, the SET 1430 returns no error but the indicated row is left intact. The agent should 1431 later remove the row in the event that the usage counter becomes zero. 1433 The use of RowStatus is covered in more detail in [6]. 1435 5. Extending this MIB 1437 With the structures of this MIB divided into data path linkage tables 1438 and parameterization tables, and with the use of RowPointer, new data 1439 path linkage and parameterization tables can be defined in other MIB 1440 modules, and used with tables defined in this MIB. This MIB does not 1441 limit the type of entries its RowPointer attributes can point to, hence 1442 new functional data path elements can be defined in other MIBs and 1443 integrated with functional data path elements of this MIB. For example, 1444 new Action functional data path element can be defined for Traffic 1445 Engineering and be integrated with Differentiated Services functional 1446 data path elements, possibly used within the same data path sharing the 1447 same classifiers and meters. 1449 It is more likely that new parameterization tables will be created in 1450 other MIBs as new methods or proprietary methods get deployed for 1451 existing Differentiated Services Functional Data Path Elements. For 1452 example, different kinds of filters can be defined by using new filter 1453 parameterization tables. New scheduling methods can be deployed by 1454 defining new scheduling method OIDs and new scheduling parameter tables. 1456 Notice both new data path linkage tables and parameterization tables can 1457 be added without needing to change this MIB document or affect existing 1458 tables and their usage. 1460 6. MIB Definition 1462 DIFFSERV-DSCP-TC DEFINITIONS ::= BEGIN 1464 IMPORTS 1465 Integer32, MODULE-IDENTITY, mib-2 1466 FROM SNMPv2-SMI 1467 TEXTUAL-CONVENTION 1468 FROM SNMPv2-TC; 1470 diffServDSCPTC MODULE-IDENTITY 1471 LAST-UPDATED "200110220644Z" 1472 ORGANIZATION "IETF Differentiated Services WG" 1473 CONTACT-INFO 1474 " Fred Baker 1475 Cisco Systems 1476 519 Lado Drive 1477 Santa Barbara, CA 93111, USA 1478 E-mail: fred@cisco.com 1480 Kwok Ho Chan 1481 Nortel Networks 1482 600 Technology Park Drive 1483 Billerica, MA 01821, USA 1484 E-mail: khchan@nortelnetworks.com 1486 Andrew Smith 1487 Allegro Networks 1488 6399 San Ignacio Ave 1489 San Jose, CA 95119, USA 1490 E-mail: andrew@allegronetworks.com 1492 Differentiated Services Working Group: 1493 diffserv@ietf.org" 1494 DESCRIPTION 1495 "The Textual Conventions defined in this module should be used 1496 whenever a Differentiated Services Code Point is used in a MIB." 1497 REVISION "200110220644Z" 1498 DESCRIPTION 1499 "Initial version, published as RFC xxxx." 1500 ::= { mib-2 xxx } -- to be assigned by IANA 1502 Dscp ::= TEXTUAL-CONVENTION 1503 DISPLAY-HINT "d" 1504 STATUS current 1505 DESCRIPTION 1506 "A Differentiated Services Code-Point that may be used for 1507 marking a traffic stream." 1508 REFERENCE 1509 "RFC 2474, RFC 2780" 1510 SYNTAX Integer32 (0..63) 1512 DscpOrAny ::= TEXTUAL-CONVENTION 1513 DISPLAY-HINT "d" 1514 STATUS current 1515 DESCRIPTION 1516 "The IP header Differentiated Services Code-Point that may be 1517 used for discriminating among traffic streams. The value -1 is 1518 used to indicate a wild card i.e. any value." 1519 REFERENCE 1520 "RFC 2474, RFC 2780" 1521 SYNTAX Integer32 (-1 | 0..63) 1523 END 1524 DIFFSERV-MIB DEFINITIONS ::= BEGIN 1526 IMPORTS 1527 Unsigned32, Counter64, MODULE-IDENTITY, OBJECT-TYPE, OBJECT-IDENTITY, 1528 zeroDotZero, mib-2 1529 FROM SNMPv2-SMI 1530 TEXTUAL-CONVENTION, RowStatus, RowPointer, 1531 StorageType, AutonomousType 1532 FROM SNMPv2-TC 1533 MODULE-COMPLIANCE, OBJECT-GROUP 1534 FROM SNMPv2-CONF 1535 ifIndex, InterfaceIndexOrZero 1536 FROM IF-MIB 1537 InetAddressType, InetAddress, InetAddressPrefixLength, 1538 InetPortNumber 1539 FROM INET-ADDRESS-MIB 1540 BurstSize 1541 FROM INTEGRATED-SERVICES-MIB 1542 Dscp, DscpOrAny 1543 FROM DIFFSERV-DSCP-TC; 1545 diffServMib MODULE-IDENTITY 1546 LAST-UPDATED "200110220644Z" 1547 ORGANIZATION "IETF Differentiated Services WG" 1548 CONTACT-INFO 1549 " Fred Baker 1550 Cisco Systems 1551 519 Lado Drive 1552 Santa Barbara, CA 93111, USA 1553 E-mail: fred@cisco.com 1555 Kwok Ho Chan 1556 Nortel Networks 1557 600 Technology Park Drive 1558 Billerica, MA 01821, USA 1559 E-mail: khchan@nortelnetworks.com 1561 Andrew Smith 1562 Allegro Networks 1563 6399 San Ignacio Ave 1564 San Jose, CA 95119, USA 1565 E-mail: andrew@allegronetworks.com 1567 Differentiated Services Working Group: 1568 diffserv@ietf.org" 1569 DESCRIPTION 1570 "This MIB defines the objects necessary to manage a device that 1571 uses the Differentiated Services Architecture described in RFC 1572 2475. The Conceptual Model of a Differentiated Services Router 1573 provides supporting information on how such a router is modeled." 1574 REVISION "200110220644Z" 1575 DESCRIPTION 1576 "Initial version, published as RFC xxxx." 1577 ::= { mib-2 xxx } -- to be assigned by IANA 1579 diffServMIBObjects OBJECT IDENTIFIER ::= { diffServMib 1 } 1580 diffServMIBConformance OBJECT IDENTIFIER ::= { diffServMib 2 } 1581 diffServMIBAdmin OBJECT IDENTIFIER ::= { diffServMib 3 } 1583 IndexInteger ::= TEXTUAL-CONVENTION 1584 DISPLAY-HINT "d" 1585 STATUS current 1586 DESCRIPTION 1587 "An integer which may be used as a table index." 1588 SYNTAX Unsigned32 (1..4294967295) 1590 IndexIntegerNextFree ::= TEXTUAL-CONVENTION 1591 DISPLAY-HINT "d" 1592 STATUS current 1593 DESCRIPTION 1594 "An integer which may be used as a new Index in a table. 1596 The special value of 0 indicates that no more new entries can be 1597 created in the relevant table. 1599 When a MIB is used for configuration, an object with this SYNTAX 1600 always contains a legal value (if non-zero) for an index that is 1601 not currently used in the relevant table. The Command Generator 1602 (Network Management Application) reads this variable and uses the 1603 (non-zero) value read when creating a new row with an SNMP SET. 1604 When the SET is performed, the Command Responder (agent) must 1605 determine whether the value is indeed still unused; Two Network 1606 Management Applications may attempt to create a row 1607 (configuration entry) simultaneously and use the same value. If 1608 it is currently unused, the SET succeeds and the Command 1609 Responder (agent) changes the value of this object, according to 1610 an implementation-specific algorithm. If the value is in use, 1611 however, the SET fails. The Network Management Application must 1612 then re-read this variable to obtain a new usable value. 1614 An OBJECT-TYPE definition using this SYNTAX MUST specify the 1615 relevant table for which the object is providing this 1616 functionality." 1617 SYNTAX Unsigned32 (0..4294967295) 1618 IfDirection ::= TEXTUAL-CONVENTION 1619 STATUS current 1620 DESCRIPTION 1621 "IfDirection specifies a direction of data travel on an 1622 interface. 'inbound' traffic is operated on during reception from 1623 the interface, while 'outbound' traffic is operated on prior to 1624 transmission on the interface." 1625 SYNTAX INTEGER { 1626 inbound(1), -- ingress interface 1627 outbound(2) -- egress interface 1628 } 1629 -- 1630 -- Data Path 1631 -- 1633 diffServDataPath OBJECT IDENTIFIER ::= { diffServMIBObjects 1 } 1635 -- 1636 -- Data Path Table 1637 -- 1638 -- The Data Path Table enumerates the Differentiated Services 1639 -- Functional Data Paths within this device. Each entry in this table 1640 -- is indexed by ifIndex and ifDirection. Each entry provides the 1641 -- first Differentiated Services Functional Data Path Element to 1642 -- process data flowing along specific data path. This table should 1643 -- have at most two entries for each interface capable of 1644 -- Differentiated Services processing on this device: ingress and 1645 -- egress. 1647 -- Note that Differentiated Services Functional Data Path Elements 1648 -- linked together using their individual next pointers and anchored by 1649 -- an entry of the diffServDataPathTable constitute a functional data 1650 -- path. 1651 -- 1653 diffServDataPathTable OBJECT-TYPE 1654 SYNTAX SEQUENCE OF DiffServDataPathEntry 1655 MAX-ACCESS not-accessible 1656 STATUS current 1657 DESCRIPTION 1658 "The data path table contains RowPointers indicating the start of 1659 the functional data path for each interface and traffic direction 1660 in this device. These may merge, or be separated into parallel 1661 data paths." 1662 ::= { diffServDataPath 1 } 1664 diffServDataPathEntry OBJECT-TYPE 1665 SYNTAX DiffServDataPathEntry 1666 MAX-ACCESS not-accessible 1667 STATUS current 1668 DESCRIPTION 1669 "An entry in the data path table indicates the start of a single 1670 Differentiated Services Functional Data Path in this device. 1672 These are associated with individual interfaces, logical or 1673 physical, and therefore are instantiated by ifIndex. Therefore, 1674 the interface index must have been assigned, according to the 1675 procedures applicable to that, before it can be meaningfully 1676 used. Generally, this means that the interface must exist. 1678 When diffServDataPathStorage is of type nonVolatile, however, 1679 this may reflect the configuration for an interface whose ifIndex 1680 has been assigned but for which the supporting implementation is 1681 not currently present." 1682 INDEX { ifIndex, diffServDataPathIfDirection } 1683 ::= { diffServDataPathTable 1 } 1685 DiffServDataPathEntry ::= SEQUENCE { 1686 diffServDataPathIfDirection IfDirection, 1687 diffServDataPathStart RowPointer, 1688 diffServDataPathStorage StorageType, 1689 diffServDataPathStatus RowStatus 1690 } 1692 diffServDataPathIfDirection OBJECT-TYPE 1693 SYNTAX IfDirection 1694 MAX-ACCESS not-accessible 1695 STATUS current 1696 DESCRIPTION 1697 "IfDirection specifies whether the reception or transmission path 1698 for this interface is in view." 1699 ::= { diffServDataPathEntry 1 } 1701 diffServDataPathStart OBJECT-TYPE 1702 SYNTAX RowPointer 1703 MAX-ACCESS read-create 1704 STATUS current 1705 DESCRIPTION 1706 "This selects the first Differentiated Services Functional Data 1707 Path Element to handle traffic for this data path. This 1708 RowPointer should point to an instance of one of: 1709 diffServClfrEntry 1710 diffServMeterEntry 1711 diffServActionEntry 1712 diffServAlgDropEntry 1713 diffServQEntry 1715 A value of zeroDotZero in this attribute indicates that no 1716 Differentiated Services treatment is performed on traffic of this 1717 data path. A pointer with the value zeroDotZero normally 1718 terminates a functional data path. 1720 Setting this to point to a target that does not exist results in 1721 an inconsistentValue error. If the row pointed to is removed or 1722 becomes inactive by other means, the treatment is as if this 1723 attribute contains a value of zeroDotZero." 1724 ::= { diffServDataPathEntry 2 } 1726 diffServDataPathStorage OBJECT-TYPE 1727 SYNTAX StorageType 1728 MAX-ACCESS read-create 1729 STATUS current 1730 DESCRIPTION 1731 "The storage type for this conceptual row. Conceptual rows 1732 having the value 'permanent' need not allow write-access to any 1733 columnar objects in the row." 1734 DEFVAL { nonVolatile } 1735 ::= { diffServDataPathEntry 3 } 1737 diffServDataPathStatus OBJECT-TYPE 1738 SYNTAX RowStatus 1739 MAX-ACCESS read-create 1740 STATUS current 1741 DESCRIPTION 1742 "The status of this conceptual row. All writable objects in this 1743 row may be modified at any time." 1744 ::= { diffServDataPathEntry 4 } 1745 -- 1746 -- Classifiers 1747 -- 1749 diffServClassifier OBJECT IDENTIFIER ::= { diffServMIBObjects 2 } 1751 -- 1752 -- Classifier Table 1753 -- 1754 -- The Classifier Table allows multiple classifier elements, of same or 1755 -- different types, to be used together. A classifier must completely 1756 -- classify all packets presented to it. This means that all traffic 1757 -- presented to a classifier must match at least one classifier element 1758 -- within the classifier, with the classifier element parameters 1759 -- specified by a filter. 1761 -- If there is ambiguity between classifier elements of different 1762 -- classifier, classifier linkage order indicates their precedence; the 1763 -- first classifier in the link is applied to the traffic first. 1765 -- Entries in the classifier element table serves as the anchor for 1766 -- each classification pattern, defined in filter table entries. Each 1767 -- classifier element table entry also specifies the subsequent 1768 -- downstream Differentiated Services Functional Data Path Element when 1769 -- the classification pattern is satisfied. Each entry in the 1770 -- classifier element table describes one branch of the fan-out 1771 -- characteristic of a classifier indicated in the Informal 1772 -- Differentiated Services Model section 4.1. A classifier is composed 1773 -- of one or more classifier elements. 1775 diffServClfrNextFree OBJECT-TYPE 1776 SYNTAX IndexIntegerNextFree 1777 MAX-ACCESS read-only 1778 STATUS current 1779 DESCRIPTION 1780 "This object contains an unused value for diffServClfrId, or a 1781 zero to indicate that none exist." 1782 ::= { diffServClassifier 1 } 1784 diffServClfrTable OBJECT-TYPE 1785 SYNTAX SEQUENCE OF DiffServClfrEntry 1786 MAX-ACCESS not-accessible 1787 STATUS current 1788 DESCRIPTION 1789 "This table enumerates all the diffserv classifier functional 1790 data path elements of this device. The actual classification 1791 definitions are defined in diffServClfrElementTable entries 1792 belonging to each classifier. 1794 An entry in this table, pointed to by a RowPointer specifying an 1795 instance of diffServClfrStatus, is frequently used as the name 1796 for a set of classifier elements, which all use the index 1797 diffServClfrId. Per the semantics of the classifier element 1798 table, these entries constitute one or more unordered sets of 1799 tests which may be simultaneously applied to a message to 1800 classify it. 1802 The primary function of this table is to ensure that the value of 1803 diffServClfrId is unique before attempting to use it in creating 1804 a diffServClfrElementEntry. Therefore, the diffServClfrEntry must 1805 be created on the same SET as the diffServClfrElementEntry, or 1806 before the diffServClfrElementEntry is created." 1807 ::= { diffServClassifier 2 } 1809 diffServClfrEntry OBJECT-TYPE 1810 SYNTAX DiffServClfrEntry 1811 MAX-ACCESS not-accessible 1812 STATUS current 1813 DESCRIPTION 1814 "An entry in the classifier table describes a single classifier. 1815 All classifier elements belonging to the same classifier use the 1816 classifier's diffServClfrId as part of their index." 1817 INDEX { diffServClfrId } 1818 ::= { diffServClfrTable 1 } 1820 DiffServClfrEntry ::= SEQUENCE { 1821 diffServClfrId IndexInteger, 1822 diffServClfrStorage StorageType, 1823 diffServClfrStatus RowStatus 1824 } 1826 diffServClfrId OBJECT-TYPE 1827 SYNTAX IndexInteger 1828 MAX-ACCESS not-accessible 1829 STATUS current 1830 DESCRIPTION 1831 "An index that enumerates the classifier entries. Managers 1832 should obtain new values for row creation in this table by 1833 reading diffServClfrNextFree." 1834 ::= { diffServClfrEntry 1 } 1836 diffServClfrStorage OBJECT-TYPE 1837 SYNTAX StorageType 1838 MAX-ACCESS read-create 1839 STATUS current 1840 DESCRIPTION 1841 "The storage type for this conceptual row. Conceptual rows 1842 having the value 'permanent' need not allow write-access to any 1843 columnar objects in the row." 1844 DEFVAL { nonVolatile } 1845 ::= { diffServClfrEntry 2 } 1847 diffServClfrStatus OBJECT-TYPE 1848 SYNTAX RowStatus 1849 MAX-ACCESS read-create 1850 STATUS current 1851 DESCRIPTION 1852 "The status of this conceptual row. All writable objects in this 1853 row may be modified at any time. Setting this variable to 1854 'destroy' when the MIB contains one or more RowPointers pointing 1855 to it results in destruction being delayed until the row is no 1856 longer used." 1857 ::= { diffServClfrEntry 3 } 1858 -- 1859 -- Classifier Element Table 1860 -- 1861 diffServClfrElementNextFree OBJECT-TYPE 1862 SYNTAX IndexIntegerNextFree 1863 MAX-ACCESS read-only 1864 STATUS current 1865 DESCRIPTION 1866 "This object contains an unused value for diffServClfrElementId, 1867 or a zero to indicate that none exist." 1868 ::= { diffServClassifier 3 } 1870 diffServClfrElementTable OBJECT-TYPE 1871 SYNTAX SEQUENCE OF DiffServClfrElementEntry 1872 MAX-ACCESS not-accessible 1873 STATUS current 1874 DESCRIPTION 1875 "The classifier element table enumerates the relationship between 1876 classification patterns and subsequent downstream Differentiated 1877 Services Functional Data Path elements. 1878 diffServClfrElementSpecific points to a filter that specifies the 1879 classification parameters. A classifier may use filter tables of 1880 different types together. 1882 One example of a filter table defined in this MIB is 1883 diffServMultiFieldClfrTable, for IP Multi-Field Classifiers 1884 (MFCs). Such an entry might identify anything from a single 1885 micro-flow (an identifiable sub-session packet stream directed 1886 from one sending transport to the receiving transport or 1887 transports), or aggregates of those such as the traffic from a 1888 host, traffic for an application, or traffic between two hosts 1889 using an application and a given DSCP. The standard Behavior 1890 Aggregate used in the Differentiated Services Architecture is 1891 encoded as a degenerate case of such an aggregate - the traffic 1892 using a particular DSCP value. 1894 Filter tables for other filter types may be defined elsewhere." 1895 ::= { diffServClassifier 4 } 1897 diffServClfrElementEntry OBJECT-TYPE 1898 SYNTAX DiffServClfrElementEntry 1899 MAX-ACCESS not-accessible 1900 STATUS current 1901 DESCRIPTION 1902 "An entry in the classifier element table describes a single 1903 element of the classifier." 1904 INDEX { diffServClfrId, diffServClfrElementId } 1905 ::= { diffServClfrElementTable 1 } 1907 DiffServClfrElementEntry ::= SEQUENCE { 1908 diffServClfrElementId IndexInteger, 1909 diffServClfrElementPrecedence Unsigned32, 1910 diffServClfrElementNext RowPointer, 1911 diffServClfrElementSpecific RowPointer, 1912 diffServClfrElementStorage StorageType, 1913 diffServClfrElementStatus RowStatus 1914 } 1916 diffServClfrElementId OBJECT-TYPE 1917 SYNTAX IndexInteger 1918 MAX-ACCESS not-accessible 1919 STATUS current 1920 DESCRIPTION 1921 "An index that enumerates the Classifier Element entries. 1922 Managers obtain new values for row creation in this table by 1923 reading diffServClfrElementNextFree." 1924 ::= { diffServClfrElementEntry 1 } 1926 diffServClfrElementPrecedence OBJECT-TYPE 1927 SYNTAX Unsigned32 (1..4294967295) 1928 MAX-ACCESS read-create 1929 STATUS current 1930 DESCRIPTION 1931 "The relative order in which classifier elements are applied: 1932 higher numbers represent classifier element with higher 1933 precedence. Classifier elements with the same order must be 1934 unambiguous i.e. they must define non-overlapping patterns, and 1935 are considered to be applied simultaneously to the traffic 1936 stream. Classifier elements with different order may overlap in 1937 their filters: the classifier element with the highest order 1938 that matches is taken. 1940 On a given interface, there must be a complete classifier in 1941 place at all times in the ingress direction. This means one or 1942 more filters must match any possible pattern. There is no such 1943 requirement in the egress direction." 1944 ::= { diffServClfrElementEntry 2 } 1946 diffServClfrElementNext OBJECT-TYPE 1947 SYNTAX RowPointer 1948 MAX-ACCESS read-create 1949 STATUS current 1950 DESCRIPTION 1951 "This attribute provides one branch of the fan-out functionality 1952 of a classifier described in the Informal Differentiated Services 1953 Model section 4.1. 1955 This selects the next Differentiated Services Functional Data 1956 Path Element to handle traffic for this data path. This 1957 RowPointer should point to an instance of one of: 1958 diffServClfrEntry 1959 diffServMeterEntry 1960 diffServActionEntry 1961 diffServAlgDropEntry 1962 diffServQEntry 1964 A value of zeroDotZero in this attribute indicates no further 1965 Differentiated Services treatment is performed on traffic of this 1966 data path. The use of zeroDotZero is the normal usage for the 1967 last functional data path element of the current data path. 1969 Setting this to point to a target that does not exist results in 1970 an inconsistentValue error. If the row pointed to is removed or 1971 becomes inactive by other means, the treatment is as if this 1972 attribute contains a value of zeroDotZero." 1974 ::= { diffServClfrElementEntry 3 } 1976 diffServClfrElementSpecific OBJECT-TYPE 1977 SYNTAX RowPointer 1978 MAX-ACCESS read-create 1979 STATUS current 1980 DESCRIPTION 1981 "A pointer to a valid entry in another table, filter table, that 1982 describes the applicable classification parameters, e.g. an entry 1983 in diffServMultiFieldClfrTable. 1985 The value zeroDotZero is interpreted to match anything not 1986 matched by another classifier element - only one such entry may 1987 exist for each classifier. 1989 Setting this to point to a target that does not exist results in 1990 an inconsistentValue error. If the row pointed to is removed or 1991 becomes inactive by other means, the element is ignored." 1992 ::= { diffServClfrElementEntry 4 } 1994 diffServClfrElementStorage OBJECT-TYPE 1995 SYNTAX StorageType 1996 MAX-ACCESS read-create 1997 STATUS current 1998 DESCRIPTION 1999 "The storage type for this conceptual row. Conceptual rows 2000 having the value 'permanent' need not allow write-access to any 2001 columnar objects in the row." 2002 DEFVAL { nonVolatile } 2003 ::= { diffServClfrElementEntry 5 } 2005 diffServClfrElementStatus OBJECT-TYPE 2006 SYNTAX RowStatus 2007 MAX-ACCESS read-create 2008 STATUS current 2009 DESCRIPTION 2010 "The status of this conceptual row. All writable objects in this 2011 row may be modified at any time. Setting this variable to 2012 'destroy' when the MIB contains one or more RowPointers pointing 2013 to it results in destruction being delayed until the row is no 2014 longer used." 2015 ::= { diffServClfrElementEntry 6 } 2016 -- 2017 -- IP Multi-field Classification Table 2018 -- 2019 -- Classification based on six different fields in the IP header. 2020 -- Functional Data Paths may share definitions by using the same entry. 2021 -- 2023 diffServMultiFieldClfrNextFree OBJECT-TYPE 2024 SYNTAX IndexIntegerNextFree 2025 MAX-ACCESS read-only 2026 STATUS current 2027 DESCRIPTION 2028 "This object contains an unused value for 2029 diffServMultiFieldClfrId, or a zero to indicate that none exist." 2030 ::= { diffServClassifier 5 } 2032 diffServMultiFieldClfrTable OBJECT-TYPE 2033 SYNTAX SEQUENCE OF DiffServMultiFieldClfrEntry 2034 MAX-ACCESS not-accessible 2035 STATUS current 2036 DESCRIPTION 2037 "A table of IP Multi-field Classifier filter entries that a 2038 system may use to identify IP traffic." 2039 ::= { diffServClassifier 6 } 2041 diffServMultiFieldClfrEntry OBJECT-TYPE 2042 SYNTAX DiffServMultiFieldClfrEntry 2043 MAX-ACCESS not-accessible 2044 STATUS current 2045 DESCRIPTION 2046 "An IP Multi-field Classifier entry describes a single filter." 2047 INDEX { diffServMultiFieldClfrId } 2048 ::= { diffServMultiFieldClfrTable 1 } 2050 DiffServMultiFieldClfrEntry ::= SEQUENCE { 2051 diffServMultiFieldClfrId IndexInteger, 2052 diffServMultiFieldClfrAddrType InetAddressType, 2053 diffServMultiFieldClfrDstAddr InetAddress, 2054 diffServMultiFieldClfrDstPrefixLength InetAddressPrefixLength, 2055 diffServMultiFieldClfrSrcAddr InetAddress, 2056 diffServMultiFieldClfrSrcPrefixLength InetAddressPrefixLength, 2057 diffServMultiFieldClfrDscp DscpOrAny, 2058 diffServMultiFieldClfrFlowId Unsigned32, 2059 diffServMultiFieldClfrProtocol Unsigned32, 2060 diffServMultiFieldClfrDstL4PortMin InetPortNumber, 2061 diffServMultiFieldClfrDstL4PortMax InetPortNumber, 2062 diffServMultiFieldClfrSrcL4PortMin InetPortNumber, 2063 diffServMultiFieldClfrSrcL4PortMax InetPortNumber, 2064 diffServMultiFieldClfrStorage StorageType, 2065 diffServMultiFieldClfrStatus RowStatus 2066 } 2068 diffServMultiFieldClfrId OBJECT-TYPE 2069 SYNTAX IndexInteger 2070 MAX-ACCESS not-accessible 2071 STATUS current 2072 DESCRIPTION 2073 "An index that enumerates the MultiField Classifier filter 2074 entries. Managers obtain new values for row creation in this 2075 table by reading diffServMultiFieldClfrNextFree." 2077 ::= { diffServMultiFieldClfrEntry 1 } 2079 diffServMultiFieldClfrAddrType OBJECT-TYPE 2080 SYNTAX InetAddressType 2081 MAX-ACCESS read-create 2082 STATUS current 2083 DESCRIPTION 2084 "The type of IP address used by this classifier entry. While 2085 other types of addresses are defined in the InetAddressType 2086 textual convention, and DNS names, a classifier can only look at 2087 packets on the wire. Therefore, this object is limited to IPv4 2088 and IPv6 addresses." 2089 ::= { diffServMultiFieldClfrEntry 2 } 2091 diffServMultiFieldClfrDstAddr OBJECT-TYPE 2092 SYNTAX InetAddress 2093 MAX-ACCESS read-create 2094 STATUS current 2095 DESCRIPTION 2096 "The IP address to match against the packet's destination IP 2097 address. This may not be a DNS name, but may be an IPv4 or IPv6 2098 prefix. diffServMultiFieldClfrDstPrefixLength indicates the 2099 number of bits that are relevant." 2100 ::= { diffServMultiFieldClfrEntry 3 } 2102 diffServMultiFieldClfrDstPrefixLength OBJECT-TYPE 2103 SYNTAX InetAddressPrefixLength 2104 UNITS "bits" 2105 MAX-ACCESS read-create 2106 STATUS current 2107 DESCRIPTION 2108 "The length of the CIDR Prefix carried in 2109 diffServMultiFieldClfrDstAddr. In IPv4 addresses, a length of 0 2110 indicates a match of any address; a length of 32 indicates a 2111 match of a single host address, and a length between 0 and 32 2112 indicates the use of a CIDR Prefix. IPv6 is similar, except that 2113 prefix lengths range from 0..128." 2114 DEFVAL { 0 } 2115 ::= { diffServMultiFieldClfrEntry 4 } 2117 diffServMultiFieldClfrSrcAddr OBJECT-TYPE 2118 SYNTAX InetAddress 2119 MAX-ACCESS read-create 2120 STATUS current 2121 DESCRIPTION 2122 "The IP address to match against the packet's source IP address. 2123 This may not be a DNS name, but may be an IPv4 or IPv6 prefix. 2124 diffServMultiFieldClfrSrcPrefixLength indicates the number of 2125 bits that are relevant." 2126 ::= { diffServMultiFieldClfrEntry 5 } 2128 diffServMultiFieldClfrSrcPrefixLength OBJECT-TYPE 2129 SYNTAX InetAddressPrefixLength 2130 UNITS "bits" 2131 MAX-ACCESS read-create 2132 STATUS current 2133 DESCRIPTION 2134 "The length of the CIDR Prefix carried in 2135 diffServMultiFieldClfrSrcAddr. In IPv4 addresses, a length of 0 2136 indicates a match of any address; a length of 32 indicates a 2137 match of a single host address, and a length between 0 and 32 2138 indicates the use of a CIDR Prefix. IPv6 is similar, except that 2139 prefix lengths range from 0..128." 2140 DEFVAL { 0 } 2141 ::= { diffServMultiFieldClfrEntry 6 } 2143 diffServMultiFieldClfrDscp OBJECT-TYPE 2144 SYNTAX DscpOrAny 2145 MAX-ACCESS read-create 2146 STATUS current 2147 DESCRIPTION 2148 "The value that the DSCP in the packet must have to match this 2149 entry. A value of -1 indicates that a specific DSCP value has not 2150 been defined and thus all DSCP values are considered a match." 2151 DEFVAL { -1 } 2152 ::= { diffServMultiFieldClfrEntry 7 } 2154 diffServMultiFieldClfrFlowId OBJECT-TYPE 2155 SYNTAX Unsigned32 (0..1048575) 2156 MAX-ACCESS read-create 2157 STATUS current 2158 DESCRIPTION 2159 "The flow identifier in an IPv6 header." 2160 ::= { diffServMultiFieldClfrEntry 8 } 2162 diffServMultiFieldClfrProtocol OBJECT-TYPE 2163 SYNTAX Unsigned32 (0..255) 2164 MAX-ACCESS read-create 2165 STATUS current 2166 DESCRIPTION 2167 "The IP protocol to match against the IPv4 protocol number or the 2168 IPv6 Next- Header number in the packet. A value of 255 means 2169 match all. Note the protocol number of 255 is reserved by IANA, 2170 and Next-Header number of 0 is used in IPv6." 2171 DEFVAL { 255 } 2172 ::= { diffServMultiFieldClfrEntry 9 } 2174 diffServMultiFieldClfrDstL4PortMin OBJECT-TYPE 2175 SYNTAX InetPortNumber 2176 MAX-ACCESS read-create 2177 STATUS current 2178 DESCRIPTION 2179 "The minimum value that the layer-4 destination port number in 2180 the packet must have in order to match this classifier entry." 2181 DEFVAL { 0 } 2182 ::= { diffServMultiFieldClfrEntry 10 } 2184 diffServMultiFieldClfrDstL4PortMax OBJECT-TYPE 2185 SYNTAX InetPortNumber 2186 MAX-ACCESS read-create 2187 STATUS current 2188 DESCRIPTION 2189 "The maximum value that the layer-4 destination port number in 2190 the packet must have in order to match this classifier entry. 2191 This value must be equal to or greater than the value specified 2192 for this entry in diffServMultiFieldClfrDstL4PortMin." 2193 DEFVAL { 65535 } 2194 ::= { diffServMultiFieldClfrEntry 11 } 2196 diffServMultiFieldClfrSrcL4PortMin OBJECT-TYPE 2197 SYNTAX InetPortNumber 2198 MAX-ACCESS read-create 2199 STATUS current 2200 DESCRIPTION 2201 "The minimum value that the layer-4 source port number in the 2202 packet must have in order to match this classifier entry." 2203 DEFVAL { 0 } 2204 ::= { diffServMultiFieldClfrEntry 12 } 2206 diffServMultiFieldClfrSrcL4PortMax OBJECT-TYPE 2207 SYNTAX InetPortNumber 2208 MAX-ACCESS read-create 2209 STATUS current 2210 DESCRIPTION 2211 "The maximum value that the layer-4 source port number in the 2212 packet must have in order to match this classifier entry. This 2213 value must be equal to or greater than the value specified for 2214 this entry in diffServMultiFieldClfrSrcL4PortMin." 2215 DEFVAL { 65535 } 2216 ::= { diffServMultiFieldClfrEntry 13 } 2218 diffServMultiFieldClfrStorage OBJECT-TYPE 2219 SYNTAX StorageType 2220 MAX-ACCESS read-create 2221 STATUS current 2222 DESCRIPTION 2223 "The storage type for this conceptual row. Conceptual rows 2224 having the value 'permanent' need not allow write-access to any 2225 columnar objects in the row." 2226 DEFVAL { nonVolatile } 2227 ::= { diffServMultiFieldClfrEntry 14 } 2229 diffServMultiFieldClfrStatus OBJECT-TYPE 2230 SYNTAX RowStatus 2231 MAX-ACCESS read-create 2232 STATUS current 2233 DESCRIPTION 2234 "The status of this conceptual row. All writable objects in this 2235 row may be modified at any time. Setting this variable to 2236 'destroy' when the MIB contains one or more RowPointers pointing 2237 to it results in destruction being delayed until the row is no 2238 longer used." 2239 ::= { diffServMultiFieldClfrEntry 15 } 2240 -- 2241 -- Meters 2242 -- 2244 diffServMeter OBJECT IDENTIFIER ::= { diffServMIBObjects 3 } 2246 -- 2247 -- This MIB supports a variety of Meters. It includes a specific 2248 -- definition for Token Bucket Meter, which are but one type of 2249 -- specification. Other metering parameter sets can be defined in other 2250 -- MIBs. 2252 -- Multiple meter elements may be logically cascaded using their 2253 -- diffServMeterSucceedNext and diffServMeterFailNext pointers if 2254 -- required. One example of this might be for an AF PHB implementation 2255 -- that uses multiple level conformance meters. 2257 -- Cascading of individual meter elements in the MIB is intended to be 2258 -- functionally equivalent to multiple level conformance determination 2259 -- of a packet. The sequential nature of the representation is merely 2260 -- a notational convenience for this MIB. 2262 -- srTCM meters (RFC 2697) can be specified using two sets of 2263 -- diffServMeterEntry and diffServTBParamEntry. The first set specifies 2264 -- the Committed Information Rate and Committed Burst Size 2265 -- token-bucket. The second set specifies the Excess Burst Size 2266 -- token-bucket. 2268 -- trTCM meters (RFC 2698) can be specified using two sets of 2269 -- diffServMeterEntry and diffServTBParamEntry. The first set specifies 2270 -- the Committed Information Rate and Committed Burst Size 2271 -- token-bucket. The second set specifies the Peak Information Rate 2272 -- and Peak Burst Size token-bucket. 2274 -- tswTCM meters (RFC 2859) can be specified using two sets of 2275 -- diffServMeterEntry and diffServTBParamEntry. The first set specifies 2276 -- the Committed Target Rate token-bucket. The second set specifies 2277 -- the Peak Target Rate token-bucket. diffServTBParamInterval in each 2278 -- token bucket reflects the Average Interval. 2279 -- 2281 diffServMeterNextFree OBJECT-TYPE 2282 SYNTAX IndexIntegerNextFree 2283 MAX-ACCESS read-only 2284 STATUS current 2285 DESCRIPTION 2286 "This object contains an unused value for diffServMeterId, or a 2287 zero to indicate that none exist." 2288 ::= { diffServMeter 1 } 2290 diffServMeterTable OBJECT-TYPE 2291 SYNTAX SEQUENCE OF DiffServMeterEntry 2292 MAX-ACCESS not-accessible 2293 STATUS current 2294 DESCRIPTION 2295 "This table enumerates specific meters that a system may use to 2296 police a stream of traffic. The traffic stream to be metered is 2297 determined by the Differentiated Services Functional Data Path 2298 Element(s) upstream of the meter i.e. by the object(s) that point 2299 to each entry in this table. This may include all traffic on an 2300 interface. 2302 Specific meter details are to be found in table entry referenced 2303 by diffServMeterSpecific." 2304 ::= { diffServMeter 2 } 2306 diffServMeterEntry OBJECT-TYPE 2307 SYNTAX DiffServMeterEntry 2308 MAX-ACCESS not-accessible 2309 STATUS current 2310 DESCRIPTION 2311 "An entry in the meter table describes a single conformance level 2312 of a meter." 2313 INDEX { diffServMeterId } 2314 ::= { diffServMeterTable 1 } 2316 DiffServMeterEntry ::= SEQUENCE { 2317 diffServMeterId IndexInteger, 2318 diffServMeterSucceedNext RowPointer, 2319 diffServMeterFailNext RowPointer, 2320 diffServMeterSpecific RowPointer, 2321 diffServMeterStorage StorageType, 2322 diffServMeterStatus RowStatus 2323 } 2325 diffServMeterId OBJECT-TYPE 2326 SYNTAX IndexInteger 2327 MAX-ACCESS not-accessible 2328 STATUS current 2329 DESCRIPTION 2330 "An index that enumerates the Meter entries. Managers obtain new 2331 values for row creation in this table by reading 2332 diffServMeterNextFree." 2333 ::= { diffServMeterEntry 1 } 2334 diffServMeterSucceedNext OBJECT-TYPE 2335 SYNTAX RowPointer 2336 MAX-ACCESS read-create 2337 STATUS current 2338 DESCRIPTION 2339 "If the traffic does conform, this selects the next 2340 Differentiated Services Functional Data Path element to handle 2341 traffic for this data path. This RowPointer should point to an 2342 instance of one of: 2343 diffServClfrEntry 2344 diffServMeterEntry 2345 diffServActionEntry 2346 diffServAlgDropEntry 2347 diffServQEntry 2349 A value of zeroDotZero in this attribute indicates that no 2350 further Differentiated Services treatment is performed on traffic 2351 of this data path. The use of zeroDotZero is the normal usage for 2352 the last functional data path element of the current data path. 2354 Setting this to point to a target that does not exist results in 2355 an inconsistentValue error. If the row pointed to is removed or 2356 becomes inactive by other means, the treatment is as if this 2357 attribute contains a value of zeroDotZero." 2358 DEFVAL { zeroDotZero } 2359 ::= { diffServMeterEntry 2 } 2361 diffServMeterFailNext OBJECT-TYPE 2362 SYNTAX RowPointer 2363 MAX-ACCESS read-create 2364 STATUS current 2365 DESCRIPTION 2366 "If the traffic does not conform, this selects the next 2367 Differentiated Services Functional Data Path element to handle 2368 traffic for this data path. This RowPointer should point to an 2369 instance of one of: 2370 diffServClfrEntry 2371 diffServMeterEntry 2372 diffServActionEntry 2373 diffServAlgDropEntry 2374 diffServQEntry 2376 A value of zeroDotZero in this attribute indicates no further 2377 Differentiated Services treatment is performed on traffic of this 2378 data path. The use of zeroDotZero is the normal usage for the 2379 last functional data path element of the current data path. 2381 Setting this to point to a target that does not exist results in 2382 an inconsistentValue error. If the row pointed to is removed or 2383 becomes inactive by other means, the treatment is as if this 2384 attribute contains a value of zeroDotZero." 2385 DEFVAL { zeroDotZero } 2386 ::= { diffServMeterEntry 3 } 2388 diffServMeterSpecific OBJECT-TYPE 2389 SYNTAX RowPointer 2390 MAX-ACCESS read-create 2391 STATUS current 2392 DESCRIPTION 2393 "This indicates the behavior of the meter by pointing to an entry 2394 containing detailed parameters. Note that entries in that 2395 specific table must be managed explicitly. 2397 For example, diffServMeterSpecific may point to an entry in 2398 diffServTBParamTable, which contains an instance of a single set 2399 of Token Bucket parameters. 2401 Setting this to point to a target that does not exist results in 2402 an inconsistentValue error. If the row pointed to is removed or 2403 becomes inactive by other means, the meter always succeeds." 2404 ::= { diffServMeterEntry 4 } 2406 diffServMeterStorage OBJECT-TYPE 2407 SYNTAX StorageType 2408 MAX-ACCESS read-create 2409 STATUS current 2410 DESCRIPTION 2411 "The storage type for this conceptual row. Conceptual rows 2412 having the value 'permanent' need not allow write-access to any 2413 columnar objects in the row." 2414 DEFVAL { nonVolatile } 2415 ::= { diffServMeterEntry 5 } 2417 diffServMeterStatus OBJECT-TYPE 2418 SYNTAX RowStatus 2419 MAX-ACCESS read-create 2420 STATUS current 2421 DESCRIPTION 2422 "The status of this conceptual row. All writable objects in this 2423 row may be modified at any time. Setting this variable to 2424 'destroy' when the MIB contains one or more RowPointers pointing 2425 to it results in destruction being delayed until the row is no 2426 longer used." 2427 ::= { diffServMeterEntry 6 } 2428 -- 2429 -- Token Bucket Parameter Table 2430 -- 2432 diffServTBParam OBJECT IDENTIFIER ::= { diffServMIBObjects 4 } 2434 -- Each entry in the Token Bucket Parameter Table parameterize a single 2435 -- token bucket. Multiple token buckets can be used together to 2436 -- parameterize multiple levels of conformance. 2438 -- Note that an entry in the Token Bucket Parameter Table can be shared 2439 -- by multiple diffServMeterTable entries. 2440 -- 2442 diffServTBParamNextFree OBJECT-TYPE 2443 SYNTAX IndexIntegerNextFree 2444 MAX-ACCESS read-only 2445 STATUS current 2446 DESCRIPTION 2447 "This object contains an unused value for diffServTBParamId, or a 2448 zero to indicate that none exist." 2449 ::= { diffServTBParam 1 } 2451 diffServTBParamTable OBJECT-TYPE 2452 SYNTAX SEQUENCE OF DiffServTBParamEntry 2453 MAX-ACCESS not-accessible 2454 STATUS current 2455 DESCRIPTION 2456 "This table enumerates a single set of token bucket meter 2457 parameters that a system may use to police a stream of traffic. 2458 Such meters are modeled here as having a single rate and a single 2459 burst size. Multiple entries are used when multiple rates/burst 2460 sizes are needed." 2461 ::= { diffServTBParam 2 } 2463 diffServTBParamEntry OBJECT-TYPE 2464 SYNTAX DiffServTBParamEntry 2465 MAX-ACCESS not-accessible 2466 STATUS current 2467 DESCRIPTION 2468 "An entry that describes a single set of token bucket 2469 parameters." 2470 INDEX { diffServTBParamId } 2471 ::= { diffServTBParamTable 1 } 2473 DiffServTBParamEntry ::= SEQUENCE { 2474 diffServTBParamId IndexInteger, 2475 diffServTBParamType AutonomousType, 2476 diffServTBParamRate Unsigned32, 2477 diffServTBParamBurstSize BurstSize, 2478 diffServTBParamInterval Unsigned32, 2479 diffServTBParamStorage StorageType, 2480 diffServTBParamStatus RowStatus 2481 } 2483 diffServTBParamId OBJECT-TYPE 2484 SYNTAX IndexInteger 2485 MAX-ACCESS not-accessible 2486 STATUS current 2487 DESCRIPTION 2488 "An index that enumerates the Token Bucket Parameter entries. 2489 Managers obtain new values for row creation in this table by 2490 reading diffServTBParamNextFree." 2491 ::= { diffServTBParamEntry 1 } 2493 diffServTBParamType OBJECT-TYPE 2494 SYNTAX AutonomousType 2495 MAX-ACCESS read-create 2496 STATUS current 2497 DESCRIPTION 2498 "The Metering algorithm associated with the Token Bucket 2499 parameters. zeroDotZero indicates this is unknown. 2501 Standard values for generic algorithms: 2502 diffServTBParamSimpleTokenBucket, diffServTBParamAvgRate, 2503 diffServTBParamSrTCMBlind, diffServTBParamSrTCMAware, 2504 diffServTBParamTrTCMBlind, diffServTBParamTrTCMAware, and 2505 diffServTBParamTswTCM are specified in this MIB as OBJECT- 2506 IDENTITYs; additional values may be further specified in other 2507 MIBs." 2508 ::= { diffServTBParamEntry 2 } 2510 diffServTBParamRate OBJECT-TYPE 2511 SYNTAX Unsigned32 (1..4294967295) 2512 UNITS "kilobits per second" 2513 MAX-ACCESS read-create 2514 STATUS current 2515 DESCRIPTION 2516 "The token-bucket rate, in kilobits per second (kbps). This 2517 attribute is used for: 2518 1. CIR in RFC 2697 for srTCM 2519 2. CIR and PIR in RFC 2698 for trTCM 2520 3. CTR and PTR in RFC 2859 for TSWTCM 2521 4. AverageRate in RFC XXXX." 2522 ::= { diffServTBParamEntry 3 } 2524 diffServTBParamBurstSize OBJECT-TYPE 2525 SYNTAX BurstSize 2526 UNITS "Bytes" 2527 MAX-ACCESS read-create 2528 STATUS current 2529 DESCRIPTION 2530 "The maximum number of bytes in a single transmission burst. This 2531 attribute is used for: 2532 1. CBS and EBS in RFC 2697 for srTCM 2533 2. CBS and PBS in RFC 2698 for trTCM 2534 3. Burst Size in RFC XXXX." 2535 ::= { diffServTBParamEntry 4 } 2537 diffServTBParamInterval OBJECT-TYPE 2538 SYNTAX Unsigned32 (1..4294967295) 2539 UNITS "microseconds" 2540 MAX-ACCESS read-create 2541 STATUS current 2542 DESCRIPTION 2543 "The time interval used with the token bucket. For: 2544 1. Average Rate Meter, the Informal Differentiated Services Model 2545 section 5.2.1, - Delta. 2546 2. Simple Token Bucket Meter, the Informal Differentiated 2547 Services Model section 5.1, - time interval t. 2548 3. RFC 2859 TSWTCM, - AVG_INTERVAL. 2549 4. RFC 2697 srTCM, RFC 2698 trTCM, - token bucket update time 2550 interval." 2551 ::= { diffServTBParamEntry 5 } 2553 diffServTBParamStorage OBJECT-TYPE 2554 SYNTAX StorageType 2555 MAX-ACCESS read-create 2556 STATUS current 2557 DESCRIPTION 2558 "The storage type for this conceptual row. Conceptual rows 2559 having the value 'permanent' need not allow write-access to any 2560 columnar objects in the row." 2561 DEFVAL { nonVolatile } 2562 ::= { diffServTBParamEntry 6 } 2564 diffServTBParamStatus OBJECT-TYPE 2565 SYNTAX RowStatus 2566 MAX-ACCESS read-create 2567 STATUS current 2568 DESCRIPTION 2569 "The status of this conceptual row. All writable objects in this 2570 row may be modified at any time. Setting this variable to 2571 'destroy' when the MIB contains one or more RowPointers pointing 2572 to it results in destruction being delayed until the row is no 2573 longer used." 2574 ::= { diffServTBParamEntry 7 } 2575 -- 2576 -- OIDs for diffServTBParamType definitions. 2577 -- 2579 diffServTBMeters OBJECT IDENTIFIER ::= { diffServMIBAdmin 1 } 2581 diffServTBParamSimpleTokenBucket OBJECT-IDENTITY 2582 STATUS current 2583 DESCRIPTION 2584 "Two Parameter Token Bucket Meter as described in the Informal 2585 Differentiated Services Model section 5.2.3." 2586 ::= { diffServTBMeters 1 } 2588 diffServTBParamAvgRate OBJECT-IDENTITY 2589 STATUS current 2590 DESCRIPTION 2591 "Average Rate Meter as described in the Informal Differentiated 2592 Services Model section 5.2.1." 2593 ::= { diffServTBMeters 2 } 2595 diffServTBParamSrTCMBlind OBJECT-IDENTITY 2596 STATUS current 2597 DESCRIPTION 2598 "Single Rate Three Color Marker Metering as defined by RFC 2697, 2599 in the `Color Blind' mode as described by the RFC." 2600 REFERENCE 2601 "RFC 2697" 2602 ::= { diffServTBMeters 3 } 2604 diffServTBParamSrTCMAware OBJECT-IDENTITY 2605 STATUS current 2606 DESCRIPTION 2607 "Single Rate Three Color Marker Metering as defined by RFC 2697, 2608 in the `Color Aware' mode as described by the RFC." 2609 REFERENCE 2610 "RFC 2697" 2611 ::= { diffServTBMeters 4 } 2613 diffServTBParamTrTCMBlind OBJECT-IDENTITY 2614 STATUS current 2615 DESCRIPTION 2616 "Two Rate Three Color Marker Metering as defined by RFC 2698, in 2617 the `Color Blind' mode as described by the RFC." 2618 REFERENCE 2619 "RFC 2698" 2620 ::= { diffServTBMeters 5 } 2621 diffServTBParamTrTCMAware OBJECT-IDENTITY 2622 STATUS current 2623 DESCRIPTION 2624 "Two Rate Three Color Marker Metering as defined by RFC 2698, in 2625 the `Color Aware' mode as described by the RFC." 2626 REFERENCE 2627 "RFC 2698" 2628 ::= { diffServTBMeters 6 } 2630 diffServTBParamTswTCM OBJECT-IDENTITY 2631 STATUS current 2632 DESCRIPTION 2633 "Time Sliding Window Three Color Marker Metering as defined by 2634 RFC 2859." 2635 REFERENCE 2636 "RFC 2859" 2637 ::= { diffServTBMeters 7 } 2638 -- 2639 -- Actions 2640 -- 2642 diffServAction OBJECT IDENTIFIER ::= { diffServMIBObjects 5 } 2644 -- 2645 -- The Action Table allows enumeration of the different types of 2646 -- actions to be applied to a traffic flow. 2647 -- 2649 diffServActionNextFree OBJECT-TYPE 2650 SYNTAX IndexIntegerNextFree 2651 MAX-ACCESS read-only 2652 STATUS current 2653 DESCRIPTION 2654 "This object contains an unused value for diffServActionId, or a 2655 zero to indicate that none exist." 2656 ::= { diffServAction 1 } 2658 diffServActionTable OBJECT-TYPE 2659 SYNTAX SEQUENCE OF DiffServActionEntry 2660 MAX-ACCESS not-accessible 2661 STATUS current 2662 DESCRIPTION 2663 "The Action Table enumerates actions that can be performed to a 2664 stream of traffic. Multiple actions can be concatenated. For 2665 example, traffic exiting from a meter may be counted, marked, and 2666 potentially dropped before entering a queue. 2668 Specific actions are indicated by diffServActionSpecific which 2669 points to an entry of a specific action type parameterizing the 2670 action in detail." 2671 ::= { diffServAction 2 } 2673 diffServActionEntry OBJECT-TYPE 2674 SYNTAX DiffServActionEntry 2675 MAX-ACCESS not-accessible 2676 STATUS current 2677 DESCRIPTION 2678 "Each entry in the action table allows description of one 2679 specific action to be applied to traffic." 2680 INDEX { diffServActionId } 2681 ::= { diffServActionTable 1 } 2683 DiffServActionEntry ::= SEQUENCE { 2684 diffServActionId IndexInteger, 2685 diffServActionInterface InterfaceIndexOrZero, 2686 diffServActionNext RowPointer, 2687 diffServActionSpecific RowPointer, 2688 diffServActionStorage StorageType, 2689 diffServActionStatus RowStatus 2690 } 2692 diffServActionId OBJECT-TYPE 2693 SYNTAX IndexInteger 2694 MAX-ACCESS not-accessible 2695 STATUS current 2696 DESCRIPTION 2697 "An index that enumerates the Action entries. Managers obtain 2698 new values for row creation in this table by reading 2699 diffServActionNextFree." 2700 ::= { diffServActionEntry 1 } 2702 diffServActionInterface OBJECT-TYPE 2703 SYNTAX InterfaceIndexOrZero 2704 MAX-ACCESS read-create 2705 STATUS current 2706 DESCRIPTION 2707 "The interface index (value of ifIndex) that this action occurs 2708 on. This may be derived from the diffServDataPathStartEntry's 2709 index by extension through the various RowPointers. However, as 2710 this may be difficult for a network management station, it is 2711 placed here as well. If this is indeterminate, the value is 2712 zero. 2714 This is of especial relevance when reporting the counters which 2715 may apply to traffic crossing an interface: 2716 diffServCountActOctets, 2717 diffServCountActPkts, 2718 diffServAlgDropOctets, 2719 diffServAlgDropPkts, 2720 diffServAlgRandomDropOctets, and 2721 diffServAlgRandomDropPkts. 2723 It is also especially relevant to the queue and scheduler which 2724 may be subsequently applied." 2725 ::= { diffServActionEntry 2 } 2727 diffServActionNext OBJECT-TYPE 2728 SYNTAX RowPointer 2729 MAX-ACCESS read-create 2730 STATUS current 2731 DESCRIPTION 2732 "This selects the next Differentiated Services Functional Data 2733 Path Element to handle traffic for this data path. This 2734 RowPointer should point to an instance of one of: 2735 diffServClfrEntry 2736 diffServMeterEntry 2737 diffServActionEntry 2738 diffServAlgDropEntry 2739 diffServQEntry 2741 A value of zeroDotZero in this attribute indicates no further 2742 Differentiated Services treatment is performed on traffic of this 2743 data path. The use of zeroDotZero is the normal usage for the 2744 last functional data path element of the current data path. 2746 Setting this to point to a target that does not exist results in 2747 an inconsistentValue error. If the row pointed to is removed or 2748 becomes inactive by other means, the treatment is as if this 2749 attribute contains a value of zeroDotZero." 2750 DEFVAL { zeroDotZero } 2751 ::= { diffServActionEntry 3 } 2753 diffServActionSpecific OBJECT-TYPE 2754 SYNTAX RowPointer 2755 MAX-ACCESS read-create 2756 STATUS current 2757 DESCRIPTION 2758 "A pointer to an object instance providing additional information 2759 for the type of action indicated by this action table entry. 2761 For the standard actions defined by this MIB module, this should 2762 point to either a diffServDscpMarkActEntry or a 2763 diffServCountActEntry. For other actions, it may point to an 2764 object instance defined in some other MIB. 2766 Setting this to point to a target that does not exist results in 2767 an inconsistentValue error. If the row pointed to is removed or 2768 becomes inactive by other means, the Meter should be treated as 2769 if it were not present. This may lead to incorrect policy 2770 behavior." 2771 ::= { diffServActionEntry 4 } 2773 diffServActionStorage OBJECT-TYPE 2774 SYNTAX StorageType 2775 MAX-ACCESS read-create 2776 STATUS current 2777 DESCRIPTION 2778 "The storage type for this conceptual row. Conceptual rows 2779 having the value 'permanent' need not allow write-access to any 2780 columnar objects in the row." 2781 DEFVAL { nonVolatile } 2782 ::= { diffServActionEntry 5 } 2784 diffServActionStatus OBJECT-TYPE 2785 SYNTAX RowStatus 2786 MAX-ACCESS read-create 2787 STATUS current 2788 DESCRIPTION 2789 "The status of this conceptual row. All writable objects in this 2790 row may be modified at any time. Setting this variable to 2791 'destroy' when the MIB contains one or more RowPointers pointing 2792 to it results in destruction being delayed until the row is no 2793 longer used." 2794 ::= { diffServActionEntry 6 } 2796 -- DSCP Mark Action Table 2797 -- 2798 -- Rows of this table are pointed to by diffServActionSpecific to 2799 -- provide detailed parameters specific to the DSCP Mark action. 2800 -- 2801 -- A single entry in this table can be shared by multiple 2802 -- diffServActionTable entries. 2803 -- 2805 diffServDscpMarkActTable OBJECT-TYPE 2806 SYNTAX SEQUENCE OF DiffServDscpMarkActEntry 2807 MAX-ACCESS not-accessible 2808 STATUS current 2809 DESCRIPTION 2810 "This table enumerates specific DSCPs used for marking or 2811 remarking the DSCP field of IP packets. The entries of this table 2812 may be referenced by a diffServActionSpecific attribute." 2813 ::= { diffServAction 3 } 2815 diffServDscpMarkActEntry OBJECT-TYPE 2816 SYNTAX DiffServDscpMarkActEntry 2817 MAX-ACCESS not-accessible 2818 STATUS current 2819 DESCRIPTION 2820 "An entry in the DSCP mark action table that describes a single 2821 DSCP used for marking." 2822 INDEX { diffServDscpMarkActDscp } 2823 ::= { diffServDscpMarkActTable 1 } 2825 DiffServDscpMarkActEntry ::= SEQUENCE { 2826 diffServDscpMarkActDscp Dscp 2827 } 2829 diffServDscpMarkActDscp OBJECT-TYPE 2830 SYNTAX Dscp 2831 MAX-ACCESS read-only 2832 STATUS current 2833 DESCRIPTION 2834 "The DSCP that this Action will store into the DSCP field of the 2835 subject. It is quite possible that the only packets subject to 2836 this Action are already marked with this DSCP. Note also that 2837 Differentiated Services processing may result in packet being 2838 marked on both ingress to a network and on egress from it, and 2839 that ingress and egress can occur in the same router." 2840 ::= { diffServDscpMarkActEntry 1 } 2841 -- 2842 -- Count Action Table 2843 -- 2844 -- Because the MIB structure allows multiple cascading 2845 -- diffServActionEntry be used to describe multiple actions for a data 2846 -- path, the counter became an optional action type. In normal 2847 -- implementation, either a data path has counters or it does not, as 2848 -- opposed to being configurable. The management entity may choose to 2849 -- read the counter or not. Hence it is recommended for implementation 2850 -- that have counters to always configure the count action as the first 2851 -- of multiple actions. 2852 -- 2854 diffServCountActNextFree OBJECT-TYPE 2855 SYNTAX IndexIntegerNextFree 2856 MAX-ACCESS read-only 2857 STATUS current 2858 DESCRIPTION 2859 "This object contains an unused value for 2860 diffServCountActId, or a zero to indicate that none exist." 2861 ::= { diffServAction 4 } 2863 diffServCountActTable OBJECT-TYPE 2864 SYNTAX SEQUENCE OF DiffServCountActEntry 2865 MAX-ACCESS not-accessible 2866 STATUS current 2867 DESCRIPTION 2868 "This table contains counters for all the traffic passing through 2869 an action element." 2870 ::= { diffServAction 5 } 2872 diffServCountActEntry OBJECT-TYPE 2873 SYNTAX DiffServCountActEntry 2874 MAX-ACCESS not-accessible 2875 STATUS current 2876 DESCRIPTION 2877 "An entry in the count action table describes a single set of 2878 traffic counters." 2879 INDEX { diffServCountActId } 2880 ::= { diffServCountActTable 1 } 2882 DiffServCountActEntry ::= SEQUENCE { 2883 diffServCountActId IndexInteger, 2884 diffServCountActOctets Counter64, 2885 diffServCountActPkts Counter64, 2886 diffServCountActStorage StorageType, 2887 diffServCountActStatus RowStatus 2888 } 2890 diffServCountActId OBJECT-TYPE 2891 SYNTAX IndexInteger 2892 MAX-ACCESS not-accessible 2893 STATUS current 2894 DESCRIPTION 2895 "An index that enumerates the Count Action entries. Managers 2896 obtain new values for row creation in this table by reading 2897 diffServCountActNextFree." 2898 ::= { diffServCountActEntry 1 } 2900 diffServCountActOctets OBJECT-TYPE 2901 SYNTAX Counter64 2902 MAX-ACCESS read-only 2903 STATUS current 2904 DESCRIPTION 2905 "The number of octets at the Action data path element. 2907 Discontinuities in the value of this counter can occur at re- 2908 initialization of the management system and at other times as 2909 indicated by the value of ifCounterDiscontinuityTime on the 2910 relevant interface." 2911 ::= { diffServCountActEntry 2 } 2913 diffServCountActPkts OBJECT-TYPE 2914 SYNTAX Counter64 2915 MAX-ACCESS read-only 2916 STATUS current 2917 DESCRIPTION 2918 "The number of packets at the Action data path element. 2920 Discontinuities in the value of this counter can occur at re- 2921 initialization of the management system and at other times as 2922 indicated by the value of ifCounterDiscontinuityTime on the 2923 relevant interface." 2924 ::= { diffServCountActEntry 3 } 2926 diffServCountActStorage OBJECT-TYPE 2927 SYNTAX StorageType 2928 MAX-ACCESS read-create 2929 STATUS current 2930 DESCRIPTION 2931 "The storage type for this conceptual row. Conceptual rows 2932 having the value 'permanent' need not allow write-access to any 2933 columnar objects in the row." 2934 DEFVAL { nonVolatile } 2935 ::= { diffServCountActEntry 4 } 2937 diffServCountActStatus OBJECT-TYPE 2938 SYNTAX RowStatus 2939 MAX-ACCESS read-create 2940 STATUS current 2941 DESCRIPTION 2942 "The status of this conceptual row. All writable objects in this 2943 row may be modified at any time. Setting this variable to 2944 'destroy' when the MIB contains one or more RowPointers pointing 2945 to it results in destruction being delayed until the row is no 2946 longer used." 2947 ::= { diffServCountActEntry 5 } 2948 -- 2949 -- Algorithmic Drop Table 2950 -- 2952 diffServAlgDrop OBJECT IDENTIFIER ::= { diffServMIBObjects 6 } 2954 diffServAlgDropNextFree OBJECT-TYPE 2955 SYNTAX IndexIntegerNextFree 2956 MAX-ACCESS read-only 2957 STATUS current 2958 DESCRIPTION 2959 "This object contains an unused value for diffServAlgDropId, or a 2960 zero to indicate that none exist." 2961 ::= { diffServAlgDrop 1 } 2963 diffServAlgDropTable OBJECT-TYPE 2964 SYNTAX SEQUENCE OF DiffServAlgDropEntry 2965 MAX-ACCESS not-accessible 2966 STATUS current 2967 DESCRIPTION 2968 "The algorithmic drop table contains entries describing an 2969 element that drops packets according to some algorithm." 2970 ::= { diffServAlgDrop 2 } 2972 diffServAlgDropEntry OBJECT-TYPE 2973 SYNTAX DiffServAlgDropEntry 2974 MAX-ACCESS not-accessible 2975 STATUS current 2976 DESCRIPTION 2977 "An entry describes a process that drops packets according to 2978 some algorithm. Further details of the algorithm type are to be 2979 found in diffServAlgDropType and with more detail parameter entry 2980 pointed to by diffServAlgDropSpecific when necessary." 2981 INDEX { diffServAlgDropId } 2982 ::= { diffServAlgDropTable 1 } 2984 DiffServAlgDropEntry ::= SEQUENCE { 2985 diffServAlgDropId IndexInteger, 2986 diffServAlgDropType INTEGER, 2987 diffServAlgDropNext RowPointer, 2988 diffServAlgDropQMeasure RowPointer, 2989 diffServAlgDropQThreshold Unsigned32, 2990 diffServAlgDropSpecific RowPointer, 2991 diffServAlgDropOctets Counter64, 2992 diffServAlgDropPkts Counter64, 2993 diffServAlgRandomDropOctets Counter64, 2994 diffServAlgRandomDropPkts Counter64, 2995 diffServAlgDropStorage StorageType, 2996 diffServAlgDropStatus RowStatus 2997 } 2999 diffServAlgDropId OBJECT-TYPE 3000 SYNTAX IndexInteger 3001 MAX-ACCESS not-accessible 3002 STATUS current 3003 DESCRIPTION 3004 "An index that enumerates the Algorithmic Dropper entries. 3005 Managers obtain new values for row creation in this table by 3006 reading diffServAlgDropNextFree." 3007 ::= { diffServAlgDropEntry 1 } 3009 diffServAlgDropType OBJECT-TYPE 3010 SYNTAX INTEGER { 3011 other(1), 3012 tailDrop(2), 3013 headDrop(3), 3014 randomDrop(4), 3015 alwaysDrop(5) 3016 } 3017 MAX-ACCESS read-create 3018 STATUS current 3019 DESCRIPTION 3020 "The type of algorithm used by this dropper. The value other(1) 3021 requires further specification in some other MIB module. 3023 In the tailDrop(2) algorithm, diffServAlgDropQThreshold 3024 represents the maximum depth of the queue, pointed to by 3025 diffServAlgDropQMeasure, beyond which all newly arriving packets 3026 will be dropped. 3028 In the headDrop(3) algorithm, if a packet arrives when the 3029 current depth of the queue, pointed to by 3030 diffServAlgDropQMeasure, is at diffServAlgDropQThreshold, packets 3031 currently at the head of the queue are dropped to make room for 3032 the new packet to be enqueued at the tail of the queue. 3034 In the randomDrop(4) algorithm, on packet arrival, an Active 3035 Queue Management algorithm is executed which may randomly drop a 3036 packet. This algorithm may be proprietary, and it may drop either 3037 the arriving packet or another packet in the queue. 3038 diffServAlgDropSpecific points to a diffServRandomDropEntry that 3039 describes the algorithm. For this algorithm, 3040 diffServAlgDropQThreshold is understood to be the absolute 3041 maximum size of the queue and additional parameters are described 3042 in diffServRandomDropTable. 3044 The alwaysDrop(5) algorithm is as its name specifies; always 3045 drop. In this case, the other configuration values in this Entry 3046 are not meaningful; There is no useful 'next' processing step, 3047 there is no queue, and parameters describing the queue are not 3048 useful. Therefore, diffServAlgDropNext, diffServAlgDropMeasure, 3049 and diffServAlgDropSpecific are all zeroDotZero." 3050 ::= { diffServAlgDropEntry 2 } 3052 diffServAlgDropNext OBJECT-TYPE 3053 SYNTAX RowPointer 3054 MAX-ACCESS read-create 3055 STATUS current 3056 DESCRIPTION 3057 "This selects the next Differentiated Services Functional Data 3058 Path Element to handle traffic for this data path. This 3059 RowPointer should point to an instance of one of: 3060 diffServClfrEntry 3061 diffServMeterEntry 3062 diffServActionEntry 3063 diffServQEntry 3065 A value of zeroDotZero in this attribute indicates no further 3066 Differentiated Services treatment is performed on traffic of this 3067 data path. The use of zeroDotZero is the normal usage for the 3068 last functional data path element of the current data path. 3070 When diffServAlgDropType is alwaysDrop(5), this object is 3071 ignored. 3073 Setting this to point to a target that does not exist results in 3074 an inconsistentValue error. If the row pointed to is removed or 3075 becomes inactive by other means, the treatment is as if this 3076 attribute contains a value of zeroDotZero." 3077 ::= { diffServAlgDropEntry 3 } 3079 diffServAlgDropQMeasure OBJECT-TYPE 3080 SYNTAX RowPointer 3081 MAX-ACCESS read-create 3082 STATUS current 3083 DESCRIPTION 3084 "Points to an entry in the diffServQTable to indicate the queue 3085 that a drop algorithm is to monitor when deciding whether to drop 3086 a packet. If the row pointed to does not exist, the algorithmic 3087 dropper element is considered inactive. 3089 Setting this to point to a target that does not exist results in 3090 an inconsistentValue error. If the row pointed to is removed or 3091 becomes inactive by other means, the treatment is as if this 3092 attribute contains a value of zeroDotZero." 3093 ::= { diffServAlgDropEntry 4 } 3095 diffServAlgDropQThreshold OBJECT-TYPE 3096 SYNTAX Unsigned32 (1..4294967295) 3097 UNITS "Bytes" 3098 MAX-ACCESS read-create 3099 STATUS current 3100 DESCRIPTION 3101 "A threshold on the depth in bytes of the queue being measured at 3102 which a trigger is generated to the dropping algorithm, unless 3103 diffServAlgDropType is alwaysDrop(5) where this object is 3104 ignored. 3106 For the tailDrop(2) or headDrop(3) algorithms, this represents 3107 the depth of the queue, pointed to by diffServAlgDropQMeasure, at 3108 which the drop action will take place. Other algorithms will need 3109 to define their own semantics for this threshold." 3110 ::= { diffServAlgDropEntry 5 } 3112 diffServAlgDropSpecific OBJECT-TYPE 3113 SYNTAX RowPointer 3114 MAX-ACCESS read-create 3115 STATUS current 3116 DESCRIPTION 3117 "Points to a table entry that provides further detail regarding a 3118 drop algorithm. 3120 Entries with diffServAlgDropType equal to other(1) may have this 3121 point to a table defined in another MIB module. 3123 Entries with diffServAlgDropType equal to randomDrop(4) must have 3124 this point to an entry in diffServRandomDropTable. 3126 For all other algorithms specified in this MIB, this should take 3127 the value zeroDotZero. 3129 The diffServAlgDropType is authoritative for the type of the drop 3130 algorithm and the specific parameters for the drop algorithm 3131 needs to be evaluated based on the diffServAlgDropType. 3133 Setting this to point to a target that does not exist results in 3134 an inconsistentValue error. If the row pointed to is removed or 3135 becomes inactive by other means, the treatment is as if this 3136 attribute contains a value of zeroDotZero." 3137 ::= { diffServAlgDropEntry 6 } 3139 diffServAlgDropOctets OBJECT-TYPE 3140 SYNTAX Counter64 3141 MAX-ACCESS read-only 3142 STATUS current 3143 DESCRIPTION 3144 "The number of octets that have been deterministically dropped by 3145 this drop process. 3147 Discontinuities in the value of this counter can occur at re- 3148 initialization of the management system and at other times as 3149 indicated by the value of ifCounterDiscontinuityTime on the 3150 relevant interface." 3151 ::= { diffServAlgDropEntry 7 } 3153 diffServAlgDropPkts OBJECT-TYPE 3154 SYNTAX Counter64 3155 MAX-ACCESS read-only 3156 STATUS current 3157 DESCRIPTION 3158 "The number of packets that have been deterministically dropped 3159 by this drop process. 3161 Discontinuities in the value of this counter can occur at re- 3162 initialization of the management system and at other times as 3163 indicated by the value of ifCounterDiscontinuityTime on the 3164 relevant interface." 3165 ::= { diffServAlgDropEntry 8 } 3167 diffServAlgRandomDropOctets OBJECT-TYPE 3168 SYNTAX Counter64 3169 MAX-ACCESS read-only 3170 STATUS current 3171 DESCRIPTION 3172 "The number of octets that have been randomly dropped by this 3173 drop process. This counter applies, therefore, only to random 3174 droppers. 3176 Discontinuities in the value of this counter can occur at re- 3177 initialization of the management system and at other times as 3178 indicated by the value of ifCounterDiscontinuityTime on the 3179 relevant interface." 3180 ::= { diffServAlgDropEntry 9 } 3182 diffServAlgRandomDropPkts OBJECT-TYPE 3183 SYNTAX Counter64 3184 MAX-ACCESS read-only 3185 STATUS current 3186 DESCRIPTION 3187 "The number of packets that have been randomly dropped by this 3188 drop process. This counter applies, therefore, only to random 3189 droppers. 3191 Discontinuities in the value of this counter can occur at re- 3192 initialization of the management system and at other times as 3193 indicated by the value of ifCounterDiscontinuityTime on the 3194 relevant interface." 3195 ::= { diffServAlgDropEntry 10 } 3197 diffServAlgDropStorage OBJECT-TYPE 3198 SYNTAX StorageType 3199 MAX-ACCESS read-create 3200 STATUS current 3201 DESCRIPTION 3202 "The storage type for this conceptual row. Conceptual rows 3203 having the value 'permanent' need not allow write-access to any 3204 columnar objects in the row." 3205 DEFVAL { nonVolatile } 3206 ::= { diffServAlgDropEntry 11 } 3208 diffServAlgDropStatus OBJECT-TYPE 3209 SYNTAX RowStatus 3210 MAX-ACCESS read-create 3211 STATUS current 3212 DESCRIPTION 3213 "The status of this conceptual row. All writable objects in this 3214 row may be modified at any time. Setting this variable to 3215 'destroy' when the MIB contains one or more RowPointers pointing 3216 to it results in destruction being delayed until the row is no 3217 longer used." 3218 ::= { diffServAlgDropEntry 12 } 3219 -- 3220 -- Random Drop Table 3221 -- 3223 diffServRandomDropNextFree OBJECT-TYPE 3224 SYNTAX IndexIntegerNextFree 3225 MAX-ACCESS read-only 3226 STATUS current 3227 DESCRIPTION 3228 "This object contains an unused value for diffServRandomDropId, 3229 or a zero to indicate that none exist." 3230 ::= { diffServAlgDrop 3 } 3232 diffServRandomDropTable OBJECT-TYPE 3233 SYNTAX SEQUENCE OF DiffServRandomDropEntry 3234 MAX-ACCESS not-accessible 3235 STATUS current 3236 DESCRIPTION 3237 "The random drop table contains entries describing a process that 3238 drops packets randomly. Entries in this table are pointed to by 3239 diffServAlgDropSpecific." 3240 ::= { diffServAlgDrop 4 } 3242 diffServRandomDropEntry OBJECT-TYPE 3243 SYNTAX DiffServRandomDropEntry 3244 MAX-ACCESS not-accessible 3245 STATUS current 3246 DESCRIPTION 3247 "An entry describes a process that drops packets according to a 3248 random algorithm." 3249 INDEX { diffServRandomDropId } 3250 ::= { diffServRandomDropTable 1 } 3252 DiffServRandomDropEntry ::= SEQUENCE { 3253 diffServRandomDropId IndexInteger, 3254 diffServRandomDropMinThreshBytes Unsigned32, 3255 diffServRandomDropMinThreshPkts Unsigned32, 3256 diffServRandomDropMaxThreshBytes Unsigned32, 3257 diffServRandomDropMaxThreshPkts Unsigned32, 3258 diffServRandomDropProbMax Unsigned32, 3259 diffServRandomDropWeight Unsigned32, 3260 diffServRandomDropSamplingRate Unsigned32, 3261 diffServRandomDropStorage StorageType, 3262 diffServRandomDropStatus RowStatus 3263 } 3265 diffServRandomDropId OBJECT-TYPE 3266 SYNTAX IndexInteger 3267 MAX-ACCESS not-accessible 3268 STATUS current 3269 DESCRIPTION 3270 "An index that enumerates the Random Drop entries. Managers 3271 obtain new values for row creation in this table by reading 3272 diffServRandomDropNextFree." 3273 ::= { diffServRandomDropEntry 1 } 3275 diffServRandomDropMinThreshBytes OBJECT-TYPE 3276 SYNTAX Unsigned32 (1..4294967295) 3277 UNITS "bytes" 3278 MAX-ACCESS read-create 3279 STATUS current 3280 DESCRIPTION 3281 "The average queue depth in bytes, beyond which traffic has a 3282 non-zero probability of being dropped. Changes in this variable 3283 may or may not be reflected in the reported value of 3284 diffServRandomDropMinThreshPkts." 3285 ::= { diffServRandomDropEntry 2 } 3287 diffServRandomDropMinThreshPkts OBJECT-TYPE 3288 SYNTAX Unsigned32 (1..4294967295) 3289 UNITS "packets" 3290 MAX-ACCESS read-create 3291 STATUS current 3292 DESCRIPTION 3293 "The average queue depth in packets, beyond which traffic has a 3294 non-zero probability of being dropped. Changes in this variable 3295 may or may not be reflected in the reported value of 3296 diffServRandomDropMinThreshBytes." 3297 ::= { diffServRandomDropEntry 3 } 3299 diffServRandomDropMaxThreshBytes OBJECT-TYPE 3300 SYNTAX Unsigned32 (1..4294967295) 3301 UNITS "bytes" 3302 MAX-ACCESS read-create 3303 STATUS current 3304 DESCRIPTION 3305 "The average queue depth beyond which traffic has a probability 3306 indicated by diffServRandomDropProbMax of being dropped or 3307 marked. Note that this differs from the physical queue limit, 3308 which is stored in diffServAlgDropQThreshold. Changes in this 3309 variable may or may not be reflected in the reported value of 3310 diffServRandomDropMaxThreshPkts." 3311 ::= { diffServRandomDropEntry 4 } 3312 diffServRandomDropMaxThreshPkts OBJECT-TYPE 3313 SYNTAX Unsigned32 (1..4294967295) 3314 UNITS "packets" 3315 MAX-ACCESS read-create 3316 STATUS current 3317 DESCRIPTION 3318 "The average queue depth beyond which traffic has a probability 3319 indicated by diffServRandomDropProbMax of being dropped or 3320 marked. Note that this differs from the physical queue limit, 3321 which is stored in diffServAlgDropQThreshold. Changes in this 3322 variable may or may not be reflected in the reported value of 3323 diffServRandomDropMaxThreshBytes." 3324 ::= { diffServRandomDropEntry 5 } 3326 diffServRandomDropProbMax OBJECT-TYPE 3327 SYNTAX Unsigned32 (0..1000) 3328 MAX-ACCESS read-create 3329 STATUS current 3330 DESCRIPTION 3331 "The worst case random drop probability, expressed in drops per 3332 thousand packets. 3334 For example, if in the worst case every arriving packet may be 3335 dropped (100%) for a period, this has the value 1000. 3336 Alternatively, if in the worst case only one percent (1%) of 3337 traffic may be dropped, it has the value 10." 3338 ::= { diffServRandomDropEntry 6 } 3340 diffServRandomDropWeight OBJECT-TYPE 3341 SYNTAX Unsigned32 (0..65536) 3342 MAX-ACCESS read-create 3343 STATUS current 3344 DESCRIPTION 3345 "The weighting of past history in affecting the Exponentially 3346 Weighted Moving Average function that calculates the current 3347 average queue depth. The equation uses 3348 diffServRandomDropWeight/65536 as the coefficient for the new 3349 sample in the equation, and (65536 - 3350 diffServRandomDropWeight)/65536 as the coefficient of the old 3351 value. 3353 Implementations may limit the values of diffServRandomDropWeight 3354 to a subset of the possible range of values, such as powers of 3355 two. Doing this would facilitate implementation of the 3356 Exponentially Weighted Moving Average using shift instructions or 3357 registers." 3358 ::= { diffServRandomDropEntry 7 } 3360 diffServRandomDropSamplingRate OBJECT-TYPE 3361 SYNTAX Unsigned32 (0..1000000) 3362 MAX-ACCESS read-create 3363 STATUS current 3364 DESCRIPTION 3365 "The number of times per second the queue is sampled for queue 3366 average calculation. A value of zero is used to mean that the 3367 queue is sampled approximately each time a packet is enqueued (or 3368 dequeued)." 3369 ::= { diffServRandomDropEntry 8 } 3371 diffServRandomDropStorage OBJECT-TYPE 3372 SYNTAX StorageType 3373 MAX-ACCESS read-create 3374 STATUS current 3375 DESCRIPTION 3376 "The storage type for this conceptual row. Conceptual rows 3377 having the value 'permanent' need not allow write-access to any 3378 columnar objects in the row." 3379 DEFVAL { nonVolatile } 3380 ::= { diffServRandomDropEntry 9 } 3382 diffServRandomDropStatus OBJECT-TYPE 3383 SYNTAX RowStatus 3384 MAX-ACCESS read-create 3385 STATUS current 3386 DESCRIPTION 3387 "The status of this conceptual row. All writable objects in this 3388 row may be modified at any time. Setting this variable to 3389 'destroy' when the MIB contains one or more RowPointers pointing 3390 to it results in destruction being delayed until the row is no 3391 longer used." 3392 ::= { diffServRandomDropEntry 10 } 3393 -- 3394 -- Queue Table 3395 -- 3397 diffServQueue OBJECT IDENTIFIER ::= { diffServMIBObjects 7 } 3399 -- 3400 -- An entry of diffServQTable represents a FIFO queue Differentiated 3401 -- Services Functional Data Path element as described in the Informal 3402 -- Differentiated Services Model section 7.1.1. Note that the 3403 -- specification of scheduling parameters for a queue as part of the 3404 -- input to a scheduler functional data path element as described in 3405 -- the Informal Differentiated Services Model section 7.1.2. This 3406 -- allows building of hierarchical queuing/scheduling. A queue 3407 -- therefore has these attributes: 3408 -- 3409 -- 1. Which scheduler will service this queue, diffServQNext. 3410 -- 2. How the scheduler will service this queue, with respect 3411 -- to all the other queues the same scheduler needs to service, 3412 -- diffServQMinRate. 3413 -- 3414 -- Note that upstream Differentiated Services Functional Data Path 3415 -- elements may point to a shared diffServQTable entry as described 3416 -- in the Informal Differentiated Services Model section 7.1.1. 3417 -- 3419 diffServQNextFree OBJECT-TYPE 3420 SYNTAX IndexIntegerNextFree 3421 MAX-ACCESS read-only 3422 STATUS current 3423 DESCRIPTION 3424 "This object contains an unused value for diffServQId, or a zero 3425 to indicate that none exist." 3426 ::= { diffServQueue 1 } 3428 diffServQTable OBJECT-TYPE 3429 SYNTAX SEQUENCE OF DiffServQEntry 3430 MAX-ACCESS not-accessible 3431 STATUS current 3432 DESCRIPTION 3433 "The Queue Table enumerates the individual queues. Note that the 3434 MIB models queuing systems as composed of individual queues, one 3435 per class of traffic, even though they may in fact be structured 3436 as classes of traffic scheduled using a common calendar queue, or 3437 in other ways." 3438 ::= { diffServQueue 2 } 3439 diffServQEntry OBJECT-TYPE 3440 SYNTAX DiffServQEntry 3441 MAX-ACCESS not-accessible 3442 STATUS current 3443 DESCRIPTION 3444 "An entry in the Queue Table describes a single queue or class of 3445 traffic." 3446 INDEX { diffServQId } 3447 ::= { diffServQTable 1 } 3449 DiffServQEntry ::= SEQUENCE { 3450 diffServQId IndexInteger, 3451 diffServQNext RowPointer, 3452 diffServQMinRate RowPointer, 3453 diffServQMaxRate RowPointer, 3454 diffServQStorage StorageType, 3455 diffServQStatus RowStatus 3456 } 3458 diffServQId OBJECT-TYPE 3459 SYNTAX IndexInteger 3460 MAX-ACCESS not-accessible 3461 STATUS current 3462 DESCRIPTION 3463 "An index that enumerates the Queue entries. Managers obtain new 3464 values for row creation in this table by reading 3465 diffServQNextFree." 3466 ::= { diffServQEntry 1 } 3468 diffServQNext OBJECT-TYPE 3469 SYNTAX RowPointer 3470 MAX-ACCESS read-create 3471 STATUS current 3472 DESCRIPTION 3473 "This selects the next Differentiated Services Scheduler. The 3474 RowPointer must point to a diffServSchedulerEntry. 3476 A value of zeroDotZero in this attribute indicates an incomplete 3477 diffServQEntry instance. In such a case, the entry has no 3478 operational effect, since it has no parameters to give it 3479 meaning. 3481 Setting this to point to a target that does not exist results in 3482 an inconsistentValue error. If the row pointed to is removed or 3483 becomes inactive by other means, the treatment is as if this 3484 attribute contains a value of zeroDotZero." 3485 ::= { diffServQEntry 2 } 3486 diffServQMinRate OBJECT-TYPE 3487 SYNTAX RowPointer 3488 MAX-ACCESS read-create 3489 STATUS current 3490 DESCRIPTION 3491 "This RowPointer indicates the diffServMinRateEntry that the 3492 scheduler, pointed to by diffServQNext, should use to service 3493 this queue. 3495 If the row pointed to is zeroDotZero, the minimum rate and 3496 priority is unspecified. 3498 Setting this to point to a target that does not exist results in 3499 an inconsistentValue error. If the row pointed to is removed or 3500 becomes inactive by other means, the treatment is as if this 3501 attribute contains a value of zeroDotZero." 3502 ::= { diffServQEntry 3 } 3504 diffServQMaxRate OBJECT-TYPE 3505 SYNTAX RowPointer 3506 MAX-ACCESS read-create 3507 STATUS current 3508 DESCRIPTION 3509 "This RowPointer indicates the diffServMaxRateEntry that the 3510 scheduler, pointed to by diffServQNext, should use to service 3511 this queue. 3513 If the row pointed to is zeroDotZero, the maximum rate is the 3514 line speed of the interface. 3516 Setting this to point to a target that does not exist results in 3517 an inconsistentValue error. If the row pointed to is removed or 3518 becomes inactive by other means, the treatment is as if this 3519 attribute contains a value of zeroDotZero." 3520 ::= { diffServQEntry 4 } 3522 diffServQStorage OBJECT-TYPE 3523 SYNTAX StorageType 3524 MAX-ACCESS read-create 3525 STATUS current 3526 DESCRIPTION 3527 "The storage type for this conceptual row. Conceptual rows 3528 having the value 'permanent' need not allow write-access to any 3529 columnar objects in the row." 3530 DEFVAL { nonVolatile } 3531 ::= { diffServQEntry 5 } 3532 diffServQStatus OBJECT-TYPE 3533 SYNTAX RowStatus 3534 MAX-ACCESS read-create 3535 STATUS current 3536 DESCRIPTION 3537 "The status of this conceptual row. All writable objects in this 3538 row may be modified at any time. Setting this variable to 3539 'destroy' when the MIB contains one or more RowPointers pointing 3540 to it results in destruction being delayed until the row is no 3541 longer used." 3542 ::= { diffServQEntry 6 } 3543 -- 3544 -- Scheduler Table 3545 -- 3547 diffServScheduler OBJECT IDENTIFIER ::= { diffServMIBObjects 8 } 3549 -- 3550 -- A Scheduler Entry represents a packet scheduler, such as a priority 3551 -- scheduler or a WFQ scheduler. It provides flexibility for multiple 3552 -- scheduling algorithms, each servicing multiple queues, to be used on 3553 -- the same logical/physical interface. 3554 -- 3555 -- Note that upstream queues or schedulers specify several of the 3556 -- scheduler's parameters. These must be properly specified if the 3557 -- scheduler is to behave as expected. 3558 -- 3559 -- The diffServSchedulerMaxRate attribute specifies the parameters when 3560 -- a scheduler's output is sent to another scheduler. This is used in 3561 -- building hierarchical queues or schedulers. 3562 -- 3563 -- More discussion of the scheduler functional data path element is in 3564 -- the Informal Differentiated Services Model section 7.1.2. 3565 -- 3567 diffServSchedulerNextFree OBJECT-TYPE 3568 SYNTAX IndexIntegerNextFree 3569 MAX-ACCESS read-only 3570 STATUS current 3571 DESCRIPTION 3572 "This object contains an unused value for diffServSchedulerId, or 3573 a zero to indicate that none exist." 3574 ::= { diffServScheduler 1 } 3576 diffServSchedulerTable OBJECT-TYPE 3577 SYNTAX SEQUENCE OF DiffServSchedulerEntry 3578 MAX-ACCESS not-accessible 3579 STATUS current 3580 DESCRIPTION 3581 "The Scheduler Table enumerates packet schedulers. Multiple 3582 scheduling algorithms can be used on a given data path, with each 3583 algorithm described by one diffServSchedulerEntry." 3584 ::= { diffServScheduler 2 } 3586 diffServSchedulerEntry OBJECT-TYPE 3587 SYNTAX DiffServSchedulerEntry 3588 MAX-ACCESS not-accessible 3589 STATUS current 3590 DESCRIPTION 3591 "An entry in the Scheduler Table describing a single instance of 3592 a scheduling algorithm." 3593 INDEX { diffServSchedulerId } 3594 ::= { diffServSchedulerTable 1 } 3596 DiffServSchedulerEntry ::= SEQUENCE { 3597 diffServSchedulerId IndexInteger, 3598 diffServSchedulerNext RowPointer, 3599 diffServSchedulerMethod AutonomousType, 3600 diffServSchedulerMinRate RowPointer, 3601 diffServSchedulerMaxRate RowPointer, 3602 diffServSchedulerStorage StorageType, 3603 diffServSchedulerStatus RowStatus 3604 } 3606 diffServSchedulerId OBJECT-TYPE 3607 SYNTAX IndexInteger 3608 MAX-ACCESS not-accessible 3609 STATUS current 3610 DESCRIPTION 3611 "An index that enumerates the Scheduler entries. Managers obtain 3612 new values for row creation in this table by reading 3613 diffServSchedulerNextFree." 3614 ::= { diffServSchedulerEntry 1 } 3616 diffServSchedulerNext OBJECT-TYPE 3617 SYNTAX RowPointer 3618 MAX-ACCESS read-create 3619 STATUS current 3620 DESCRIPTION 3621 "This selects the next Differentiated Services Functional Data 3622 Path Element to handle traffic for this data path. This normally 3623 is null (zeroDotZero), or points to a diffServSchedulerEntry or a 3624 diffServQEntry. 3626 However, this RowPointer may also point to an instance of: 3627 diffServClfrEntry, 3628 diffServMeterEntry, 3629 diffServActionEntry, 3630 diffServAlgDropEntry. 3632 It would point another diffServSchedulerEntry when implementing 3633 multiple scheduler methods for the same data path, such as having 3634 one set of queues scheduled by WRR and that group participating 3635 in a priority scheduling system in which other queues compete 3636 with it in that way. It might also point to a second scheduler 3637 in a hierarchical scheduling system. 3639 If the row pointed to is zeroDotZero, no further Differentiated 3640 Services treatment is performed on traffic of this data path. 3642 Setting this to point to a target that does not exist results in 3643 an inconsistentValue error. If the row pointed to is removed or 3644 becomes inactive by other means, the treatment is as if this 3645 attribute contains a value of zeroDotZero." 3646 DEFVAL { zeroDotZero } 3647 ::= { diffServSchedulerEntry 2 } 3649 diffServSchedulerMethod OBJECT-TYPE 3650 SYNTAX AutonomousType 3651 MAX-ACCESS read-create 3652 STATUS current 3653 DESCRIPTION 3654 "The scheduling algorithm used by this Scheduler. zeroDotZero 3655 indicates that this is unknown. Standard values for generic 3656 algorithms: diffServSchedulerPriority, diffServSchedulerWRR, and 3657 diffServSchedulerWFQ are specified in this MIB; additional values 3658 may be further specified in other MIBs." 3659 ::= { diffServSchedulerEntry 3 } 3661 diffServSchedulerMinRate OBJECT-TYPE 3662 SYNTAX RowPointer 3663 MAX-ACCESS read-create 3664 STATUS current 3665 DESCRIPTION 3666 "This RowPointer indicates the entry in diffServMinRateTable 3667 which indicates the priority or minimum output rate from this 3668 scheduler. This attribute is used only when there is more than 3669 one level of scheduler. 3671 When it has the value zeroDotZero, it indicates that no minimum 3672 rate or priority is imposed. 3674 Setting this to point to a target that does not exist results in 3675 an inconsistentValue error. If the row pointed to is removed or 3676 becomes inactive by other means, the treatment is as if this 3677 attribute contains a value of zeroDotZero." 3678 DEFVAL { zeroDotZero } 3679 ::= { diffServSchedulerEntry 4 } 3681 diffServSchedulerMaxRate OBJECT-TYPE 3682 SYNTAX RowPointer 3683 MAX-ACCESS read-create 3684 STATUS current 3685 DESCRIPTION 3686 "This RowPointer indicates the entry in diffServMaxRateTable 3687 which indicates the maximum output rate from this scheduler. 3688 When more than one maximum rate applies (eg, when a mulkti-rate 3689 shaper is in view), it points to the first of those rate entries. 3690 This attribute is used only when there is more than one level of 3691 scheduler. 3693 When it has the value zeroDotZero, it indicates that no maximum 3694 rate is imposed. 3696 Setting this to point to a target that does not exist results in 3697 an inconsistentValue error. If the row pointed to is removed or 3698 becomes inactive by other means, the treatment is as if this 3699 attribute contains a value of zeroDotZero." 3700 DEFVAL { zeroDotZero } 3701 ::= { diffServSchedulerEntry 5 } 3703 diffServSchedulerStorage OBJECT-TYPE 3704 SYNTAX StorageType 3705 MAX-ACCESS read-create 3706 STATUS current 3707 DESCRIPTION 3708 "The storage type for this conceptual row. Conceptual rows 3709 having the value 'permanent' need not allow write-access to any 3710 columnar objects in the row." 3711 DEFVAL { nonVolatile } 3712 ::= { diffServSchedulerEntry 6 } 3714 diffServSchedulerStatus OBJECT-TYPE 3715 SYNTAX RowStatus 3716 MAX-ACCESS read-create 3717 STATUS current 3718 DESCRIPTION 3719 "The status of this conceptual row. All writable objects in this 3720 row may be modified at any time. Setting this variable to 3721 'destroy' when the MIB contains one or more RowPointers pointing 3722 to it results in destruction being delayed until the row is no 3723 longer used." 3724 ::= { diffServSchedulerEntry 7 } 3725 -- 3726 -- OIDs for diffServTBParamType definitions. 3727 -- 3729 diffServSchedulers OBJECT IDENTIFIER ::= { diffServMIBAdmin 2 } 3731 diffServSchedulerPriority OBJECT-IDENTITY 3732 STATUS current 3733 DESCRIPTION 3734 "For use with diffServSchedulerMethod to indicate the Priority 3735 scheduling method. This is defined as an algorithm in which the 3736 presence of data in a queue or set of queues absolutely precludes 3737 dequeue from another queue or set of queues of lower priority. 3738 Note that attributes from diffServMinRateEntry of the 3739 queues/schedulers feeding this scheduler are used when 3740 determining the next packet to schedule." 3741 ::= { diffServSchedulers 1 } 3743 diffServSchedulerWRR OBJECT-IDENTITY 3744 STATUS current 3745 DESCRIPTION 3746 "For use with diffServSchedulerMethod to indicate the Weighted 3747 Round Robin scheduling method, defined as any algorithm in which 3748 a set of queues are visited in a fixed order, and varying amounts 3749 of traffic are removed from each queue in turn to implement an 3750 average output rate by class. Notice attributes from 3751 diffServMinRateEntry of the queues/schedulers feeding this 3752 scheduler are used when determining the next packet to schedule." 3753 ::= { diffServSchedulers 2 } 3755 diffServSchedulerWFQ OBJECT-IDENTITY 3756 STATUS current 3757 DESCRIPTION 3758 "For use with diffServSchedulerMethod to indicate the Weighted 3759 Fair Queuing scheduling method, defined as any algorithm in which 3760 a set of queues are conceptually visited in some order, to 3761 implement an average output rate by class. Notice attributes from 3762 diffServMinRateEntry of the queues/schedulers feeding this 3763 scheduler are used when determining the next packet to schedule." 3764 ::= { diffServSchedulers 3 } 3765 -- 3766 -- Minimum Rate Parameters Table 3767 -- 3768 -- The parameters used by a scheduler for its inputs or outputs are 3769 -- maintained separately from the Queue or Scheduler table entries for 3770 -- reusability reasons and so that they may be used by both queues and 3771 -- schedulers. This follows the approach for separation of data path 3772 -- elements from parameterization that is used throughout this MIB. 3773 -- Use of these Minimum Rate Parameter Table entries by Queues and 3774 -- Schedulers allows the modeling of hierarchical scheduling systems. 3775 -- 3776 -- Specifically, a Scheduler has one or more inputs and one output. 3777 -- Any queue feeding a scheduler, or any scheduler which feeds a second 3778 -- scheduler, might specify a minimum transfer rate by pointing to an 3779 -- Minimum Rate Parameter Table entry. 3780 -- 3781 -- The diffServMinRatePriority/Abs/Rel attributes are used as 3782 -- parameters to the work-conserving portion of a scheduler: 3783 -- "work-conserving" implies that the scheduler can continue to emit 3784 -- data as long as there is data available at its input(s). This has 3785 -- the effect of guaranteeing a certain priority relative to other 3786 -- scheduler inputs and/or a certain minimum proportion of the 3787 -- available output bandwidth. Properly configured, this means a 3788 -- certain minimum rate, which may be exceeded should traffic be 3789 -- available should there be spare bandwidth after all other classes 3790 -- have had opportunities to consume their own minimum rates. 3791 -- 3793 diffServMinRateNextFree OBJECT-TYPE 3794 SYNTAX IndexIntegerNextFree 3795 MAX-ACCESS read-only 3796 STATUS current 3797 DESCRIPTION 3798 "This object contains an unused value for diffServMinRateId, or a 3799 zero to indicate that none exist." 3800 ::= { diffServScheduler 3 } 3802 diffServMinRateTable OBJECT-TYPE 3803 SYNTAX SEQUENCE OF DiffServMinRateEntry 3804 MAX-ACCESS not-accessible 3805 STATUS current 3806 DESCRIPTION 3807 "The Minimum Rate Parameters Table enumerates individual sets of 3808 scheduling parameter that can be used/reused by Queues and 3809 Schedulers." 3810 ::= { diffServScheduler 4 } 3811 diffServMinRateEntry OBJECT-TYPE 3812 SYNTAX DiffServMinRateEntry 3813 MAX-ACCESS not-accessible 3814 STATUS current 3815 DESCRIPTION 3816 "An entry in the Minimum Rate Parameters Table describes a single 3817 set of scheduling parameters for use by one or more queues or 3818 schedulers." 3819 INDEX { diffServMinRateId } 3820 ::= { diffServMinRateTable 1 } 3822 DiffServMinRateEntry ::= SEQUENCE { 3823 diffServMinRateId IndexInteger, 3824 diffServMinRatePriority Unsigned32, 3825 diffServMinRateAbsolute Unsigned32, 3826 diffServMinRateRelative Unsigned32, 3827 diffServMinRateStorage StorageType, 3828 diffServMinRateStatus RowStatus 3829 } 3831 diffServMinRateId OBJECT-TYPE 3832 SYNTAX IndexInteger 3833 MAX-ACCESS not-accessible 3834 STATUS current 3835 DESCRIPTION 3836 "An index that enumerates the Scheduler Parameter entries. 3837 Managers obtain new values for row creation in this table by 3838 reading diffServMinRateNextFree." 3839 ::= { diffServMinRateEntry 1 } 3841 diffServMinRatePriority OBJECT-TYPE 3842 SYNTAX Unsigned32 (1..4294967295) 3843 MAX-ACCESS read-create 3844 STATUS current 3845 DESCRIPTION 3846 "The priority of this input to the associated scheduler, relative 3847 to the scheduler's other inputs. A queue or scheduler with a 3848 larger numeric value will be served before another with a smaller 3849 numeric value." 3850 ::= { diffServMinRateEntry 2 } 3852 diffServMinRateAbsolute OBJECT-TYPE 3853 SYNTAX Unsigned32 (1..4294967295) 3854 UNITS "kilobits per second" 3855 MAX-ACCESS read-create 3856 STATUS current 3857 DESCRIPTION 3858 "The minimum absolute rate, in kilobits/sec, that a downstream 3859 scheduler element should allocate to this queue. If the value is 3860 zero, then there is effectively no minimum rate guarantee. If the 3861 value is non-zero, the scheduler will assure the servicing of 3862 this queue to at least this rate. 3864 Note that this attribute value and that of 3865 diffServMinRateRelative are coupled: changes to one will affect 3866 the value of the other. They are linked by the following 3867 equation, in that setting one will change the other: 3869 diffServMinRateRelative = 3870 (diffServMinRateAbsolute*1000000)/ifSpeed 3872 or, if appropriate: 3874 diffServMinRateRelative = diffServMinRateAbsolute/ifHighSpeed" 3875 REFERENCE 3876 "ifSpeed, ifHighSpeed, Interface MIB, RFC 2863" 3877 ::= { diffServMinRateEntry 3 } 3879 diffServMinRateRelative OBJECT-TYPE 3880 SYNTAX Unsigned32 (1..4294967295) 3881 MAX-ACCESS read-create 3882 STATUS current 3883 DESCRIPTION 3884 "The minimum rate that a downstream scheduler element should 3885 allocate to this queue, relative to the maximum rate of the 3886 interface as reported by ifSpeed or ifHighSpeed, in units of 3887 1/1000 of 1. If the value is zero, then there is effectively no 3888 minimum rate guarantee. If the value is non-zero, the scheduler 3889 will assure the servicing of this queue to at least this rate. 3891 Note that this attribute value and that of 3892 diffServMinRateAbsolute are coupled: changes to one will affect 3893 the value of the other. They are linked by the following 3894 equation, in that setting one will change the other: 3896 diffServMinRateRelative = 3897 (diffServMinRateAbsolute*1000000)/ifSpeed 3899 or, if appropriate: 3901 diffServMinRateRelative = diffServMinRateAbsolute/ifHighSpeed" 3902 REFERENCE 3903 "ifSpeed, ifHighSpeed, Interface MIB, RFC 2863" 3904 ::= { diffServMinRateEntry 4 } 3905 diffServMinRateStorage OBJECT-TYPE 3906 SYNTAX StorageType 3907 MAX-ACCESS read-create 3908 STATUS current 3909 DESCRIPTION 3910 "The storage type for this conceptual row. Conceptual rows 3911 having the value 'permanent' need not allow write-access to any 3912 columnar objects in the row." 3913 DEFVAL { nonVolatile } 3914 ::= { diffServMinRateEntry 5 } 3916 diffServMinRateStatus OBJECT-TYPE 3917 SYNTAX RowStatus 3918 MAX-ACCESS read-create 3919 STATUS current 3920 DESCRIPTION 3921 "The status of this conceptual row. All writable objects in this 3922 row may be modified at any time. Setting this variable to 3923 'destroy' when the MIB contains one or more RowPointers pointing 3924 to it results in destruction being delayed until the row is no 3925 longer used." 3926 ::= { diffServMinRateEntry 6 } 3927 -- 3928 -- Maximum Rate Parameter Table 3929 -- 3930 -- The parameters used by a scheduler for its inputs or outputs are 3931 -- maintained separately from the Queue or Scheduler table entries for 3932 -- reusability reasons and so that they may be used by both queues and 3933 -- schedulers. This follows the approach for separation of data path 3934 -- elements from parameterization that is used throughout this MIB. 3935 -- Use of these Maximum Rate Parameter Table entries by Queues and 3936 -- Schedulers allows the modeling of hierarchical scheduling systems. 3937 -- 3938 -- Specifically, a Scheduler has one or more inputs and one output. 3939 -- Any queue feeding a scheduler, or any scheduler which feeds a second 3940 -- scheduler, might specify a maximum transfer rate by pointing to a 3941 -- Maximum Rate Parameter Table entry. Multi-rate shapers, such as a 3942 -- Dual Leaky Bucket algorithm, specify their rates using multiple 3943 -- Maximum Rate Parameter Entries with the same diffServMaxRateId but 3944 -- different diffServMaxRateLevels. 3945 -- 3946 -- The diffServMaxRateLevel/Abs/Rel attributes are used as 3947 -- parameters to the non-work-conserving portion of a scheduler: 3948 -- non-work-conserving implies that the scheduler may sometimes not 3949 -- emit a packet, even if there is data available at its input(s). 3950 -- This has the effect of limiting the servicing of the queue/scheduler 3951 -- input or output, in effect performing shaping of the packet stream 3952 -- passing through the queue/scheduler, as described in the Informal 3953 -- Differentiated Services Model section 7.2. 3954 -- 3956 diffServMaxRateNextFree OBJECT-TYPE 3957 SYNTAX IndexIntegerNextFree 3958 MAX-ACCESS read-only 3959 STATUS current 3960 DESCRIPTION 3961 "This object contains an unused value for diffServMaxRateId, or a 3962 zero to indicate that none exist." 3963 ::= { diffServScheduler 5 } 3965 diffServMaxRateTable OBJECT-TYPE 3966 SYNTAX SEQUENCE OF DiffServMaxRateEntry 3967 MAX-ACCESS not-accessible 3968 STATUS current 3969 DESCRIPTION 3970 "The Maximum Rate Parameter Table enumerates individual sets of 3971 scheduling parameter that can be used/reused by Queues and 3972 Schedulers." 3973 ::= { diffServScheduler 6 } 3974 diffServMaxRateEntry OBJECT-TYPE 3975 SYNTAX DiffServMaxRateEntry 3976 MAX-ACCESS not-accessible 3977 STATUS current 3978 DESCRIPTION 3979 "An entry in the Maximum Rate Parameter Table describes a single 3980 set of scheduling parameters for use by one or more queues or 3981 schedulers." 3982 INDEX { diffServMaxRateId, diffServMaxRateLevel } 3983 ::= { diffServMaxRateTable 1 } 3985 DiffServMaxRateEntry ::= SEQUENCE { 3986 diffServMaxRateId IndexInteger, 3987 diffServMaxRateLevel Unsigned32, 3988 diffServMaxRateAbsolute Unsigned32, 3989 diffServMaxRateRelative Unsigned32, 3990 diffServMaxRateThreshold BurstSize, 3991 diffServMaxRateStorage StorageType, 3992 diffServMaxRateStatus RowStatus 3993 } 3995 diffServMaxRateId OBJECT-TYPE 3996 SYNTAX IndexInteger 3997 MAX-ACCESS not-accessible 3998 STATUS current 3999 DESCRIPTION 4000 "An index that enumerates the Maximum Rate Parameter entries. 4001 Managers obtain new values for row creation in this table by 4002 reading diffServMaxRateNextFree." 4003 ::= { diffServMaxRateEntry 1 } 4005 diffServMaxRateLevel OBJECT-TYPE 4006 SYNTAX Unsigned32 (1..32) 4007 MAX-ACCESS not-accessible 4008 STATUS current 4009 DESCRIPTION 4010 "An index that indicates which level of a multi-rate shaper is 4011 being given its parameters. A multi-rate shaper has some number 4012 of rate levels. Frame Relay's dual rate specification refers to a 4013 'committed' and an 'excess' rate; ATM's dual rate specification 4014 refers to a 'mean' and a 'peak' rate. This table is generalized 4015 to support an arbitrary number of rates. The committed or mean 4016 rate is level 1, the peak rate (if any) is the highest level rate 4017 configured, and if there are other rates they are distributed in 4018 monotonically increasing order between them." 4019 ::= { diffServMaxRateEntry 2 } 4020 diffServMaxRateAbsolute OBJECT-TYPE 4021 SYNTAX Unsigned32 (1..4294967295) 4022 UNITS "kilobits per second" 4023 MAX-ACCESS read-create 4024 STATUS current 4025 DESCRIPTION 4026 "The maximum rate in kilobits/sec that a downstream scheduler 4027 element should allocate to this queue. If the value is zero, then 4028 there is effectively no maximum rate limit and that the scheduler 4029 should attempt to be work conserving for this queue. If the value 4030 is non-zero, the scheduler will limit the servicing of this queue 4031 to, at most, this rate in a non-work-conserving manner. 4033 Note that this attribute value and that of 4034 diffServMaxRateRelative are coupled: changes to one will affect 4035 the value of the other. They are linked by the following 4036 equation, in that setting one will change the other: 4038 diffServMaxRateRelative = 4039 (diffServMaxRateAbsolute*1000000)/ifSpeed 4041 or, if appropriate: 4043 diffServMaxRateRelative = diffServMaxRateAbsolute/ifHighSpeed" 4044 REFERENCE 4045 "ifSpeed, ifHighSpeed, Interface MIB, RFC 2863" 4046 ::= { diffServMaxRateEntry 3 } 4048 diffServMaxRateRelative OBJECT-TYPE 4049 SYNTAX Unsigned32 (1..4294967295) 4050 MAX-ACCESS read-create 4051 STATUS current 4052 DESCRIPTION 4053 "The maximum rate that a downstream scheduler element should 4054 allocate to this queue, relative to the maximum rate of the 4055 interface as reported by ifSpeed or ifHighSpeed, in units of 4056 1/1000 of 1. If the value is zero, then there is effectively no 4057 maximum rate limit and the scheduler should attempt to be work 4058 conserving for this queue. If the value is non-zero, the 4059 scheduler will limit the servicing of this queue to, at most, 4060 this rate in a non-work-conserving manner. 4062 Note that this attribute value and that of 4063 diffServMaxRateAbsolute are coupled: changes to one will affect 4064 the value of the other. They are linked by the following 4065 equation, in that setting one will change the other: 4067 diffServMaxRateRelative = 4068 (diffServMaxRateAbsolute*1000000)/ifSpeed 4070 or, if appropriate: 4072 diffServMaxRateRelative = diffServMaxRateAbsolute/ifHighSpeed" 4073 REFERENCE 4074 "ifSpeed, ifHighSpeed, Interface MIB, RFC 2863" 4075 ::= { diffServMaxRateEntry 4 } 4077 diffServMaxRateThreshold OBJECT-TYPE 4078 SYNTAX BurstSize 4079 UNITS "Bytes" 4080 MAX-ACCESS read-create 4081 STATUS current 4082 DESCRIPTION 4083 "The number of bytes of queue depth at which the rate of a 4084 multi-rate scheduler will increase to the next output rate. In 4085 the last conceptual row for such a shaper, this threshold is 4086 ignored and by convention is zero." 4087 REFERENCE 4088 "Adaptive rate Shaper, RFC 2963" 4089 ::= { diffServMaxRateEntry 5 } 4091 diffServMaxRateStorage OBJECT-TYPE 4092 SYNTAX StorageType 4093 MAX-ACCESS read-create 4094 STATUS current 4095 DESCRIPTION 4096 "The storage type for this conceptual row. Conceptual rows 4097 having the value 'permanent' need not allow write-access to any 4098 columnar objects in the row." 4099 DEFVAL { nonVolatile } 4100 ::= { diffServMaxRateEntry 6 } 4102 diffServMaxRateStatus OBJECT-TYPE 4103 SYNTAX RowStatus 4104 MAX-ACCESS read-create 4105 STATUS current 4106 DESCRIPTION 4107 "The status of this conceptual row. All writable objects in this 4108 row may be modified at any time. Setting this variable to 4109 'destroy' when the MIB contains one or more RowPointers pointing 4110 to it results in destruction being delayed until the row is no 4111 longer used." 4112 ::= { diffServMaxRateEntry 7 } 4113 -- 4114 -- MIB Compliance statements. 4115 -- 4117 diffServMIBCompliances OBJECT IDENTIFIER ::= { diffServMIBConformance 1 } 4118 diffServMIBGroups OBJECT IDENTIFIER ::= { diffServMIBConformance 2 } 4120 diffServMIBFullCompliance MODULE-COMPLIANCE 4121 STATUS current 4122 DESCRIPTION 4123 "When this MIB is implemented with support for read-create, then 4124 such an implementation can claim read/write compliance. Such 4125 devices can then be both monitored and configured with this MIB." 4127 MODULE IF-MIB -- The interfaces MIB, RFC2863 4128 MANDATORY-GROUPS { 4129 ifCounterDiscontinuityGroup 4130 } 4132 MODULE -- This Module 4133 MANDATORY-GROUPS { 4134 diffServMIBDataPathGroup, diffServMIBClfrGroup, 4135 diffServMIBClfrElementGroup, diffServMIBMultiFieldClfrGroup, 4136 diffServMIBActionGroup, diffServMIBAlgDropGroup, 4137 diffServMIBQGroup, diffServMIBSchedulerGroup, 4138 diffServMIBMaxRateGroup, diffServMIBMinRateGroup, 4139 diffServMIBCounterGroup 4140 } 4142 GROUP diffServMIBMeterGroup 4143 DESCRIPTION 4144 "This group is mandatory for devices that implement metering 4145 functions." 4147 GROUP diffServMIBTBParamGroup 4148 DESCRIPTION 4149 "This group is mandatory for devices that implement token-bucket 4150 metering functions." 4152 GROUP diffServMIBDscpMarkActGroup 4153 DESCRIPTION 4154 "This group is mandatory for devices that implement DSCP-Marking 4155 functions." 4157 GROUP diffServMIBRandomDropGroup 4158 DESCRIPTION 4159 "This group is mandatory for devices that implement Random Drop 4160 functions." 4162 OBJECT diffServDataPathStatus 4163 SYNTAX RowStatus { active(1) } 4164 WRITE-SYNTAX RowStatus { createAndGo(4), destroy(6) } 4165 DESCRIPTION 4166 "Support for createAndWait and notInService is not required." 4168 OBJECT diffServClfrStatus 4169 SYNTAX RowStatus { active(1) } 4170 WRITE-SYNTAX RowStatus { createAndGo(4), destroy(6) } 4171 DESCRIPTION 4172 "Support for createAndWait and notInService is not required." 4174 OBJECT diffServClfrElementStatus 4175 SYNTAX RowStatus { active(1) } 4176 WRITE-SYNTAX RowStatus { createAndGo(4), destroy(6) } 4177 DESCRIPTION 4178 "Support for createAndWait and notInService is not required." 4180 OBJECT diffServMultiFieldClfrAddrType 4181 SYNTAX InetAddressType { unknown(0), ipv4(1), ipv6(2) } 4182 DESCRIPTION 4183 "An implementation is only required to support IPv4 and IPv6 4184 addresses." 4186 OBJECT diffServMultiFieldClfrDstAddr 4187 SYNTAX InetAddress (SIZE(0|4|16)) 4188 DESCRIPTION 4189 "An implementation is only required to support IPv4 and globally 4190 unique IPv6 addresses." 4192 OBJECT diffServAlgDropStatus 4193 SYNTAX RowStatus { active(1) } 4194 WRITE-SYNTAX RowStatus { createAndGo(4), destroy(6) } 4195 DESCRIPTION 4196 "Support for createAndWait and notInService is not required." 4198 OBJECT diffServRandomDropStatus 4199 SYNTAX RowStatus { active(1) } 4200 WRITE-SYNTAX RowStatus { createAndGo(4), destroy(6) } 4201 DESCRIPTION 4202 "Support for createAndWait and notInService is not required." 4204 OBJECT diffServQStatus 4205 SYNTAX RowStatus { active(1) } 4206 WRITE-SYNTAX RowStatus { createAndGo(4), destroy(6) } 4207 DESCRIPTION 4208 "Support for createAndWait and notInService is not required." 4210 OBJECT diffServSchedulerStatus 4211 SYNTAX RowStatus { active(1) } 4212 WRITE-SYNTAX RowStatus { createAndGo(4), destroy(6) } 4213 DESCRIPTION 4214 "Support for createAndWait and notInService is not required." 4216 OBJECT diffServMinRateStatus 4217 SYNTAX RowStatus { active(1) } 4218 WRITE-SYNTAX RowStatus { createAndGo(4), destroy(6) } 4219 DESCRIPTION 4220 "Support for createAndWait and notInService is not required." 4222 OBJECT diffServMaxRateStatus 4223 SYNTAX RowStatus { active(1) } 4224 WRITE-SYNTAX RowStatus { createAndGo(4), destroy(6) } 4225 DESCRIPTION 4226 "Support for createAndWait and notInService is not required." 4228 ::= { diffServMIBCompliances 1 } 4229 -- 4230 -- Read-Only Compliance 4231 -- 4233 diffServMIBReadOnlyCompliance MODULE-COMPLIANCE 4234 STATUS current 4235 DESCRIPTION 4236 "When this MIB is implemented without support for read-create 4237 (i.e. in read-only mode), then such an implementation can claim 4238 read-only compliance. Such a device can then be monitored but can 4239 not be configured with this MIB." 4241 MODULE IF-MIB -- The interfaces MIB, RFC2863 4242 MANDATORY-GROUPS { 4243 ifCounterDiscontinuityGroup 4244 } 4246 MODULE -- This Module 4247 MANDATORY-GROUPS { 4248 diffServMIBDataPathGroup, diffServMIBClfrGroup, 4249 diffServMIBClfrElementGroup, diffServMIBMultiFieldClfrGroup, 4250 diffServMIBActionGroup, diffServMIBAlgDropGroup, 4251 diffServMIBQGroup, diffServMIBSchedulerGroup, 4252 diffServMIBMaxRateGroup, diffServMIBMinRateGroup, 4253 diffServMIBCounterGroup 4254 } 4256 GROUP diffServMIBMeterGroup 4257 DESCRIPTION 4258 "This group is mandatory for devices that implement metering 4259 functions." 4261 GROUP diffServMIBTBParamGroup 4262 DESCRIPTION 4263 "This group is mandatory for devices that implement token-bucket 4264 metering functions." 4266 GROUP diffServMIBDscpMarkActGroup 4267 DESCRIPTION 4268 "This group is mandatory for devices that implement DSCP-Marking 4269 functions." 4271 GROUP diffServMIBRandomDropGroup 4272 DESCRIPTION 4273 "This group is mandatory for devices that implement Random Drop 4274 functions." 4275 OBJECT diffServDataPathStart 4276 MIN-ACCESS read-only 4277 DESCRIPTION 4278 "Write access is not required." 4280 OBJECT diffServDataPathStorage 4281 MIN-ACCESS read-only 4282 DESCRIPTION 4283 "Write access is not required." 4285 OBJECT diffServDataPathStatus 4286 SYNTAX RowStatus { active(1) } 4287 MIN-ACCESS read-only 4288 DESCRIPTION 4289 "Write access is not required, and active is the only status that 4290 needs to be supported." 4292 OBJECT diffServClfrNextFree 4293 MIN-ACCESS not-accessible 4294 DESCRIPTION 4295 "Object not needed when diffServClfrTable is implemented read- 4296 only" 4298 OBJECT diffServClfrStorage 4299 MIN-ACCESS read-only 4300 DESCRIPTION 4301 "Write access is not required." 4303 OBJECT diffServClfrStatus 4304 SYNTAX RowStatus { active(1) } 4305 MIN-ACCESS read-only 4306 DESCRIPTION 4307 "Write access is not required, and active is the only status that 4308 needs to be supported." 4310 OBJECT diffServClfrElementNextFree 4311 MIN-ACCESS not-accessible 4312 DESCRIPTION 4313 "Object not needed when diffServClfrelementTable is implemented 4314 read-only" 4316 OBJECT diffServClfrElementPrecedence 4317 MIN-ACCESS read-only 4318 DESCRIPTION 4319 "Write access is not required." 4321 OBJECT diffServClfrElementNext 4322 MIN-ACCESS read-only 4323 DESCRIPTION 4324 "Write access is not required." 4326 OBJECT diffServClfrElementSpecific 4327 MIN-ACCESS read-only 4328 DESCRIPTION 4329 "Write access is not required." 4331 OBJECT diffServClfrElementStorage 4332 MIN-ACCESS read-only 4333 DESCRIPTION 4334 "Write access is not required." 4336 OBJECT diffServClfrElementStatus 4337 SYNTAX RowStatus { active(1) } 4338 MIN-ACCESS read-only 4339 DESCRIPTION 4340 "Write access is not required, and active is the only status that 4341 needs to be supported." 4343 OBJECT diffServMultiFieldClfrNextFree 4344 MIN-ACCESS not-accessible 4345 DESCRIPTION 4346 "Object is not needed when diffServMultiFieldClfrTable is 4347 implemented in read-only mode." 4349 OBJECT diffServMultiFieldClfrAddrType 4350 SYNTAX InetAddressType { unknown(0), ipv4(1), ipv6(2) } 4351 MIN-ACCESS read-only 4352 DESCRIPTION 4353 "Write access is not required. An implementation is only required 4354 to support IPv4 and IPv6 addresses." 4356 OBJECT diffServMultiFieldClfrDstAddr 4357 SYNTAX InetAddress (SIZE(0|4|16)) 4358 MIN-ACCESS read-only 4359 DESCRIPTION 4360 "Write access is not required. An implementation is only required 4361 to support IPv4 and globally unique IPv6 addresses." 4363 OBJECT diffServMultiFieldClfrDstPrefixLength 4364 MIN-ACCESS read-only 4365 DESCRIPTION 4366 "Write access is not required." 4368 OBJECT diffServMultiFieldClfrSrcAddr 4369 MIN-ACCESS read-only 4370 DESCRIPTION 4371 "Write access is not required. An implementation is only required 4372 to support IPv4 and globally unique IPv6 addresses." 4374 OBJECT diffServMultiFieldClfrSrcPrefixLength 4375 MIN-ACCESS read-only 4376 DESCRIPTION 4377 "Write access is not required." 4379 OBJECT diffServMultiFieldClfrDscp 4380 MIN-ACCESS read-only 4381 DESCRIPTION 4382 "Write access is not required." 4384 OBJECT diffServMultiFieldClfrFlowId 4385 MIN-ACCESS read-only 4386 DESCRIPTION 4387 "Write access is not required." 4389 OBJECT diffServMultiFieldClfrProtocol 4390 MIN-ACCESS read-only 4391 DESCRIPTION 4392 "Write access is not required." 4394 OBJECT diffServMultiFieldClfrDstL4PortMin 4395 MIN-ACCESS read-only 4396 DESCRIPTION 4397 "Write access is not required." 4399 OBJECT diffServMultiFieldClfrDstL4PortMax 4400 MIN-ACCESS read-only 4401 DESCRIPTION 4402 "Write access is not required." 4404 OBJECT diffServMultiFieldClfrSrcL4PortMin 4405 MIN-ACCESS read-only 4406 DESCRIPTION 4407 "Write access is not required." 4409 OBJECT diffServMultiFieldClfrSrcL4PortMax 4410 MIN-ACCESS read-only 4411 DESCRIPTION 4412 "Write access is not required." 4414 OBJECT diffServMultiFieldClfrStorage 4415 MIN-ACCESS read-only 4416 DESCRIPTION 4417 "Write access is not required." 4419 OBJECT diffServMultiFieldClfrStatus 4420 MIN-ACCESS read-only 4421 DESCRIPTION 4422 "Write access is not required, createAndWait and notInService 4423 support is not required." 4425 OBJECT diffServMeterNextFree 4426 MIN-ACCESS not-accessible 4427 DESCRIPTION 4428 "Object is not needed when diffServMultiFieldClfrTable is 4429 implemented in read-only mode." 4431 OBJECT diffServMeterSucceedNext 4432 MIN-ACCESS read-only 4433 DESCRIPTION 4434 "Write access is not required." 4436 OBJECT diffServMeterFailNext 4437 MIN-ACCESS read-only 4438 DESCRIPTION 4439 "Write access is not required." 4441 OBJECT diffServMeterSpecific 4442 MIN-ACCESS read-only 4443 DESCRIPTION 4444 "Write access is not required." 4446 OBJECT diffServMeterStorage 4447 MIN-ACCESS read-only 4448 DESCRIPTION 4449 "Write access is not required." 4451 OBJECT diffServMeterStatus 4452 SYNTAX RowStatus { active(1) } 4453 MIN-ACCESS read-only 4454 DESCRIPTION 4455 "Write access is not required, and active is the only status that 4456 needs to be supported." 4458 OBJECT diffServTBParamNextFree 4459 MIN-ACCESS not-accessible 4460 DESCRIPTION 4461 "Object is not needed when diffServTBParamTable is implemented in 4462 read-only mode." 4463 OBJECT diffServTBParamType 4464 MIN-ACCESS read-only 4465 DESCRIPTION 4466 "Write access is not required." 4468 OBJECT diffServTBParamRate 4469 MIN-ACCESS read-only 4470 DESCRIPTION 4471 "Write access is not required." 4473 OBJECT diffServTBParamBurstSize 4474 MIN-ACCESS read-only 4475 DESCRIPTION 4476 "Write access is not required." 4478 OBJECT diffServTBParamInterval 4479 MIN-ACCESS read-only 4480 DESCRIPTION 4481 "Write access is not required." 4483 OBJECT diffServTBParamStorage 4484 MIN-ACCESS read-only 4485 DESCRIPTION 4486 "Write access is not required." 4488 OBJECT diffServTBParamStatus 4489 SYNTAX RowStatus { active(1) } 4490 MIN-ACCESS read-only 4491 DESCRIPTION 4492 "Write access is not required, and active is the only status that 4493 needs to be supported." 4495 OBJECT diffServActionNextFree 4496 MIN-ACCESS not-accessible 4497 DESCRIPTION 4498 "Object is not needed when diffServActionTable is implemented in 4499 read-only mode." 4501 OBJECT diffServActionInterface 4502 MIN-ACCESS read-only 4503 DESCRIPTION 4504 "Write access is not required." 4506 OBJECT diffServActionNext 4507 MIN-ACCESS read-only 4508 DESCRIPTION 4509 "Write access is not required." 4510 OBJECT diffServActionSpecific 4511 MIN-ACCESS read-only 4512 DESCRIPTION 4513 "Write access is not required." 4515 OBJECT diffServActionStorage 4516 MIN-ACCESS read-only 4517 DESCRIPTION 4518 "Write access is not required." 4520 OBJECT diffServActionStatus 4521 SYNTAX RowStatus { active(1) } 4522 MIN-ACCESS read-only 4523 DESCRIPTION 4524 "Write access is not required, and active is the only status that 4525 needs to be supported." 4527 OBJECT diffServCountActNextFree 4528 MIN-ACCESS not-accessible 4529 DESCRIPTION 4530 "Object is not needed when diffServCountActTable is implemented 4531 in read-only mode." 4533 OBJECT diffServCountActStorage 4534 MIN-ACCESS read-only 4535 DESCRIPTION 4536 "Write access is not required." 4538 OBJECT diffServCountActStatus 4539 SYNTAX RowStatus { active(1) } 4540 MIN-ACCESS read-only 4541 DESCRIPTION 4542 "Write access is not required, and active is the only status that 4543 needs to be supported." 4545 OBJECT diffServAlgDropNextFree 4546 MIN-ACCESS not-accessible 4547 DESCRIPTION 4548 "Object is not needed when diffServAlgDropTable is implemented in 4549 read-only mode." 4551 OBJECT diffServAlgDropType 4552 MIN-ACCESS read-only 4553 DESCRIPTION 4554 "Write access is not required." 4556 OBJECT diffServAlgDropNext 4557 MIN-ACCESS read-only 4558 DESCRIPTION 4559 "Write access is not required." 4561 OBJECT diffServAlgDropQMeasure 4562 MIN-ACCESS read-only 4563 DESCRIPTION 4564 "Write access is not required." 4566 OBJECT diffServAlgDropQThreshold 4567 MIN-ACCESS read-only 4568 DESCRIPTION 4569 "Write access is not required." 4571 OBJECT diffServAlgDropSpecific 4572 MIN-ACCESS read-only 4573 DESCRIPTION 4574 "Write access is not required." 4576 OBJECT diffServAlgDropStorage 4577 MIN-ACCESS read-only 4578 DESCRIPTION 4579 "Write access is not required." 4581 OBJECT diffServAlgDropStatus 4582 SYNTAX RowStatus { active(1) } 4583 MIN-ACCESS read-only 4584 DESCRIPTION 4585 "Write access is not required, and active is the only status that 4586 needs to be supported." 4588 OBJECT diffServRandomDropNextFree 4589 MIN-ACCESS not-accessible 4590 DESCRIPTION 4591 "Object is not needed when diffServRandomDropTable is implemented 4592 in read-only mode." 4594 OBJECT diffServRandomDropMinThreshBytes 4595 MIN-ACCESS read-only 4596 DESCRIPTION 4597 "Write access is not required." 4599 OBJECT diffServRandomDropMinThreshPkts 4600 MIN-ACCESS read-only 4601 DESCRIPTION 4602 "Write access is not required." 4603 OBJECT diffServRandomDropMaxThreshBytes 4604 MIN-ACCESS read-only 4605 DESCRIPTION 4606 "Write access is not required." 4608 OBJECT diffServRandomDropMaxThreshPkts 4609 MIN-ACCESS read-only 4610 DESCRIPTION 4611 "Write access is not required." 4613 OBJECT diffServRandomDropProbMax 4614 MIN-ACCESS read-only 4615 DESCRIPTION 4616 "Write access is not required." 4618 OBJECT diffServRandomDropWeight 4619 MIN-ACCESS read-only 4620 DESCRIPTION 4621 "Write access is not required." 4623 OBJECT diffServRandomDropSamplingRate 4624 MIN-ACCESS read-only 4625 DESCRIPTION 4626 "Write access is not required." 4628 OBJECT diffServRandomDropStorage 4629 MIN-ACCESS read-only 4630 DESCRIPTION 4631 "Write access is not required." 4633 OBJECT diffServRandomDropStatus 4634 SYNTAX RowStatus { active(1) } 4635 MIN-ACCESS read-only 4636 DESCRIPTION 4637 "Write access is not required, and active is the only status that 4638 needs to be supported." 4640 OBJECT diffServQNextFree 4641 MIN-ACCESS not-accessible 4642 DESCRIPTION 4643 "Object is not needed when diffServQTable is implemented in 4644 read-only mode." 4646 OBJECT diffServQNext 4647 MIN-ACCESS read-only 4648 DESCRIPTION 4649 "Write access is not required." 4650 OBJECT diffServQMinRate 4651 MIN-ACCESS read-only 4652 DESCRIPTION 4653 "Write access is not required." 4655 OBJECT diffServQMaxRate 4656 MIN-ACCESS read-only 4657 DESCRIPTION 4658 "Write access is not required." 4660 OBJECT diffServQStorage 4661 MIN-ACCESS read-only 4662 DESCRIPTION 4663 "Write access is not required." 4665 OBJECT diffServQStatus 4666 SYNTAX RowStatus { active(1) } 4667 MIN-ACCESS read-only 4668 DESCRIPTION 4669 "Write access is not required, and active is the only status that 4670 needs to be supported." 4672 OBJECT diffServSchedulerNextFree 4673 MIN-ACCESS not-accessible 4674 DESCRIPTION 4675 "Object is not needed when diffServSchedulerTable is implemented 4676 in read-only mode." 4678 OBJECT diffServSchedulerNext 4679 MIN-ACCESS read-only 4680 DESCRIPTION 4681 "Write access is not required." 4683 OBJECT diffServSchedulerMethod 4684 MIN-ACCESS read-only 4685 DESCRIPTION 4686 "Write access is not required." 4688 OBJECT diffServSchedulerMinRate 4689 MIN-ACCESS read-only 4690 DESCRIPTION 4691 "Write access is not required." 4693 OBJECT diffServSchedulerMaxRate 4694 MIN-ACCESS read-only 4695 DESCRIPTION 4696 "Write access is not required." 4697 OBJECT diffServSchedulerStorage 4698 MIN-ACCESS read-only 4699 DESCRIPTION 4700 "Write access is not required." 4702 OBJECT diffServSchedulerStatus 4703 SYNTAX RowStatus { active(1) } 4704 MIN-ACCESS read-only 4705 DESCRIPTION 4706 "Write access is not required, and active is the only status that 4707 needs to be supported." 4709 OBJECT diffServMinRateNextFree 4710 MIN-ACCESS not-accessible 4711 DESCRIPTION 4712 "Object is not needed when diffServMinRateTable is implemented in 4713 read-only mode." 4715 OBJECT diffServMinRatePriority 4716 MIN-ACCESS read-only 4717 DESCRIPTION 4718 "Write access is not required." 4720 OBJECT diffServMinRateAbsolute 4721 MIN-ACCESS read-only 4722 DESCRIPTION 4723 "Write access is not required." 4725 OBJECT diffServMinRateRelative 4726 MIN-ACCESS read-only 4727 DESCRIPTION 4728 "Write access is not required." 4730 OBJECT diffServMinRateStorage 4731 MIN-ACCESS read-only 4732 DESCRIPTION 4733 "Write access is not required." 4735 OBJECT diffServMinRateStatus 4736 SYNTAX RowStatus { active(1) } 4737 MIN-ACCESS read-only 4738 DESCRIPTION 4739 "Write access is not required, and active is the only status that 4740 needs to be supported." 4742 OBJECT diffServMaxRateNextFree 4743 MIN-ACCESS not-accessible 4744 DESCRIPTION 4745 "Object is not needed when diffServMaxrateTable is implemented in 4746 read-only mode." 4748 OBJECT diffServMaxRateAbsolute 4749 MIN-ACCESS read-only 4750 DESCRIPTION 4751 "Write access is not required." 4753 OBJECT diffServMaxRateRelative 4754 MIN-ACCESS read-only 4755 DESCRIPTION 4756 "Write access is not required." 4758 OBJECT diffServMaxRateThreshold 4759 MIN-ACCESS read-only 4760 DESCRIPTION 4761 "Write access is not required." 4763 OBJECT diffServMaxRateStorage 4764 MIN-ACCESS read-only 4765 DESCRIPTION 4766 "Write access is not required." 4768 OBJECT diffServMaxRateStatus 4769 SYNTAX RowStatus { active(1) } 4770 MIN-ACCESS read-only 4771 DESCRIPTION 4772 "Write access is not required, and active is the only status that 4773 needs to be supported." 4775 ::= { diffServMIBCompliances 2 } 4777 diffServMIBDataPathGroup OBJECT-GROUP 4778 OBJECTS { 4779 diffServDataPathStart, diffServDataPathStorage, 4780 diffServDataPathStatus 4781 } 4782 STATUS current 4783 DESCRIPTION 4784 "The Data Path Group defines the MIB Objects that describe a 4785 functional data path." 4786 ::= { diffServMIBGroups 1 } 4788 diffServMIBClfrGroup OBJECT-GROUP 4789 OBJECTS { 4790 diffServClfrNextFree, diffServClfrStorage, 4791 diffServClfrStatus 4792 } 4793 STATUS current 4794 DESCRIPTION 4795 "The Classifier Group defines the MIB Objects that describe the 4796 list the starts of individual classifiers." 4797 ::= { diffServMIBGroups 2 } 4799 diffServMIBClfrElementGroup OBJECT-GROUP 4800 OBJECTS { 4801 diffServClfrElementNextFree, 4802 diffServClfrElementPrecedence, diffServClfrElementNext, 4803 diffServClfrElementSpecific, diffServClfrElementStorage, 4804 diffServClfrElementStatus 4805 } 4806 STATUS current 4807 DESCRIPTION 4808 "The Classifier Element Group defines the MIB Objects that 4809 describe the classifier elements that make up a generic 4810 classifier." 4811 ::= { diffServMIBGroups 3 } 4813 diffServMIBMultiFieldClfrGroup OBJECT-GROUP 4814 OBJECTS { 4815 diffServMultiFieldClfrNextFree, 4816 diffServMultiFieldClfrAddrType, 4817 diffServMultiFieldClfrDstAddr, 4818 diffServMultiFieldClfrDstPrefixLength, 4819 diffServMultiFieldClfrFlowId, 4820 diffServMultiFieldClfrSrcAddr, 4821 diffServMultiFieldClfrSrcPrefixLength, 4822 diffServMultiFieldClfrDscp, 4823 diffServMultiFieldClfrProtocol, 4824 diffServMultiFieldClfrDstL4PortMin, 4825 diffServMultiFieldClfrDstL4PortMax, 4826 diffServMultiFieldClfrSrcL4PortMin, 4827 diffServMultiFieldClfrSrcL4PortMax, 4828 diffServMultiFieldClfrStorage, 4829 diffServMultiFieldClfrStatus 4830 } 4831 STATUS current 4832 DESCRIPTION 4833 "The Multi-field Classifier Group defines the MIB Objects that 4834 describe a classifier element for matching on various fields of 4835 an IP and upper-layer protocol header." 4836 ::= { diffServMIBGroups 4 } 4837 diffServMIBMeterGroup OBJECT-GROUP 4838 OBJECTS { 4839 diffServMeterNextFree, diffServMeterSucceedNext, 4840 diffServMeterFailNext, diffServMeterSpecific, 4841 diffServMeterStorage, diffServMeterStatus 4842 } 4843 STATUS current 4844 DESCRIPTION 4845 "The Meter Group defines the objects used in describing a generic 4846 meter element." 4847 ::= { diffServMIBGroups 5 } 4849 diffServMIBTBParamGroup OBJECT-GROUP 4850 OBJECTS { 4851 diffServTBParamNextFree, diffServTBParamType, 4852 diffServTBParamRate, diffServTBParamBurstSize, 4853 diffServTBParamInterval, diffServTBParamStorage, 4854 diffServTBParamStatus 4855 } 4856 STATUS current 4857 DESCRIPTION 4858 "The Token-Bucket Meter Group defines the objects used in 4859 describing a token bucket meter element." 4860 ::= { diffServMIBGroups 6 } 4862 diffServMIBActionGroup OBJECT-GROUP 4863 OBJECTS { 4864 diffServActionNextFree, diffServActionNext, 4865 diffServActionSpecific, diffServActionStorage, 4866 diffServActionInterface, diffServActionStatus 4867 } 4868 STATUS current 4869 DESCRIPTION 4870 "The Action Group defines the objects used in describing a 4871 generic action element." 4872 ::= { diffServMIBGroups 7 } 4874 diffServMIBDscpMarkActGroup OBJECT-GROUP 4875 OBJECTS { 4876 diffServDscpMarkActDscp 4877 } 4878 STATUS current 4879 DESCRIPTION 4880 "The DSCP Mark Action Group defines the objects used in 4881 describing a DSCP Marking Action element." 4882 ::= { diffServMIBGroups 8 } 4883 diffServMIBCounterGroup OBJECT-GROUP 4884 OBJECTS { 4885 diffServCountActOctets, diffServCountActPkts, 4886 diffServAlgDropOctets, diffServAlgDropPkts, 4887 diffServAlgRandomDropOctets, diffServAlgRandomDropPkts, 4888 diffServCountActStorage, diffServCountActStatus, 4889 diffServCountActNextFree 4890 } 4891 STATUS current 4892 DESCRIPTION 4893 "A collection of objects providing information specific to 4894 packet-oriented network interfaces." 4895 ::= { diffServMIBGroups 9 } 4897 diffServMIBAlgDropGroup OBJECT-GROUP 4898 OBJECTS { 4899 diffServAlgDropNextFree, diffServAlgDropType, 4900 diffServAlgDropNext, diffServAlgDropQMeasure, 4901 diffServAlgDropQThreshold, diffServAlgDropSpecific, 4902 diffServAlgDropStorage, diffServAlgDropStatus 4903 } 4904 STATUS current 4905 DESCRIPTION 4906 "The Algorithmic Drop Group contains the objects that describe 4907 algorithmic dropper operation and configuration." 4908 ::= { diffServMIBGroups 10 } 4910 diffServMIBRandomDropGroup OBJECT-GROUP 4911 OBJECTS { 4912 diffServRandomDropNextFree, 4913 diffServRandomDropMinThreshBytes, 4914 diffServRandomDropMinThreshPkts, 4915 diffServRandomDropMaxThreshBytes, 4916 diffServRandomDropMaxThreshPkts, 4917 diffServRandomDropProbMax, 4918 diffServRandomDropWeight, 4919 diffServRandomDropSamplingRate, 4920 diffServRandomDropStorage, 4921 diffServRandomDropStatus 4922 } 4923 STATUS current 4924 DESCRIPTION 4925 "The Random Drop Group augments the Algorithmic Drop Group for 4926 random dropper operation and configuration." 4927 ::= { diffServMIBGroups 11 } 4929 diffServMIBQGroup OBJECT-GROUP 4930 OBJECTS { 4931 diffServQNextFree, diffServQNext, diffServQMinRate, 4932 diffServQMaxRate, diffServQStorage, diffServQStatus 4933 } 4934 STATUS current 4935 DESCRIPTION 4936 "The Queue Group contains the objects that describe an 4937 interface's queues." 4938 ::= { diffServMIBGroups 12 } 4940 diffServMIBSchedulerGroup OBJECT-GROUP 4941 OBJECTS { 4942 diffServSchedulerNextFree, diffServSchedulerNext, 4943 diffServSchedulerMethod, diffServSchedulerMinRate, 4944 diffServSchedulerMaxRate, diffServSchedulerStorage, 4945 diffServSchedulerStatus 4946 } 4947 STATUS current 4948 DESCRIPTION 4949 "The Scheduler Group contains the objects that describe packet 4950 schedulers on interfaces." 4951 ::= { diffServMIBGroups 13 } 4953 diffServMIBMinRateGroup OBJECT-GROUP 4954 OBJECTS { 4955 diffServMinRateNextFree, diffServMinRatePriority, 4956 diffServMinRateAbsolute, diffServMinRateRelative, 4957 diffServMinRateStorage, diffServMinRateStatus 4958 } 4959 STATUS current 4960 DESCRIPTION 4961 "The Minimum Rate Parameter Group contains the objects that 4962 describe packet schedulers' minimum rate or priority guarantees." 4963 ::= { diffServMIBGroups 14 } 4965 diffServMIBMaxRateGroup OBJECT-GROUP 4966 OBJECTS { 4967 diffServMaxRateNextFree, diffServMaxRateAbsolute, 4968 diffServMaxRateRelative, diffServMaxRateThreshold, 4969 diffServMaxRateStorage, diffServMaxRateStatus 4970 } 4971 STATUS current 4972 DESCRIPTION 4973 "The Maximum Rate Parameter Group contains the objects that 4974 describe packet schedulers' maximum rate guarantees." 4975 ::= { diffServMIBGroups 15 } 4976 END 4977 7. Acknowledgments 4979 This MIB builds on all the work that has gone into the Informal 4980 Management Model for Differentiated Services Routers, Differentiated 4981 Services PIB, and Differentiated Services Policy MIB (SNMPCONF WG). 4983 It has been developed with the active involvement of many people, but 4984 most notably Yoram Bernet, Steve Blake, Brian Carpenter, Dave Durham, 4985 Michael Fine, Victor Firoiu, Jeremy Greene, Dan Grossman, Roch Guerin, 4986 Scott Hahn, Joel Halpern, Van Jacobsen, Keith McCloghrie, Bob Moore, 4987 Kathleen Nichols, Ping Pan, Nabil Seddigh, John Seligson, and Walter 4988 Weiss. 4990 Juergen Schoenwaelder, Dave Perkins, Frank Strauss, Harrie Hazewinkel, 4991 and Bert Wijnen are especially to be noted for review comments on the 4992 structure and usage of the MIB for network management purposes, and its 4993 compliance with SMIv2. 4995 8. Security Considerations 4997 It is clear that this MIB is potentially useful for configuration. 4998 Anything that can be configured can be misconfigured, with potentially 4999 disastrous effect. 5001 At this writing, no security holes have been identified beyond those 5002 that SNMP Security is itself intended to address. These relate primarily 5003 to controlled access to sensitive information and the ability to 5004 configure a device - or which might result from operator error, which is 5005 beyond the scope of any security architecture. 5007 There are many read-write and read-create management objects defined in 5008 this MIB. Such objects are often sensitive or vulnerable in some network 5009 environments. The support for SET operations in a non-secure environment 5010 without proper protection can have a negative effect on network 5011 operations. The use of SNMP Version 3 is recommended over prior versions 5012 for configuration control as its security model is improved. 5014 There are a number of managed objects in this MIB that may contain 5015 information that may be sensitive from a business perspective, in that 5016 they may represent a customer's service contract or the filters that the 5017 service provider chooses to apply to a customer's ingress or egress 5018 traffic. There are no objects which are sensitive in their own right, 5019 such as passwords or monetary amounts. 5021 It may be important to control even GET access to these objects and 5022 possibly to even encrypt the values of these object when sending them 5023 over the network via SNMP. Not all versions of SNMP provide features for 5024 such a secure environment. 5026 SNMPv1 by itself is not a secure environment. Even if the network itself 5027 is secure (for example by using IPSec), even then, there is no control 5028 as to who on the secure network is allowed to access and GET/SET 5029 (read/change/create/delete) the objects in this MIB. 5031 It is recommended that the implementors consider the security features 5032 as provided by the SNMPv3 framework. Specifically, the use of the User- 5033 based Security Model [12] and the View-based Access Control Model [15] 5034 is recommended. 5036 It is then a customer/user responsibility to ensure that the SNMP entity 5037 giving access to an instance of this MIB, is properly configured to give 5038 access to the objects only to those principals (users) that have 5039 legitimate rights to indeed GET or SET (change/create/delete) them. 5041 9. References 5043 [1] Harrington, D., Presuhn, R., and B. Wijnen, "An Architecture for 5044 Describing SNMP Management Frameworks", RFC 2571, Cabletron 5045 Systems, Inc., BMC Software, Inc., IBM T. J. Watson Research, April 5046 1999 5048 [2] Rose, M., and K. McCloghrie, "Structure and Identification of 5049 Management Information for TCP/IP-based Internets", RFC 1155, STD 5050 16, Performance Systems International, Hughes LAN Systems, May 1990 5052 [3] Rose, M., and K. McCloghrie, "Concise MIB Definitions", RFC 1212, 5053 STD 16, Performance Systems International, Hughes LAN Systems, 5054 March 1991 5056 [4] M. Rose, "A Convention for Defining Traps for use with the SNMP", 5057 RFC 1215, Performance Systems International, March 1991 5059 [5] McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M., 5060 and S. Waldbusser, "Structure of Management Information Version 2 5061 (SMIv2)", RFC 2578, STD 58, Cisco Systems, SNMPinfo, TU 5062 Braunschweig, SNMP Research, First Virtual Holdings, International 5063 Network Services, April 1999 5065 [6] McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M., 5066 and S. Waldbusser, "Textual Conventions for SMIv2", RFC 2579, STD 5067 58, Cisco Systems, SNMPinfo, TU Braunschweig, SNMP Research, First 5068 Virtual Holdings, International Network Services, April 1999 5069 [7] McCloghrie, K., Perkins, D., Schoenwaelder, J., Case, J., Rose, M., 5070 and S. Waldbusser, "Conformance Statements for SMIv2", RFC 2580, 5071 STD 58, Cisco Systems, SNMPinfo, TU Braunschweig, SNMP Research, 5072 First Virtual Holdings, International Network Services, April 1999 5074 [8] Case, J., Fedor, M., Schoffstall, M., and J. Davin, "Simple Network 5075 Management Protocol", RFC 1157, STD 15, SNMP Research, Performance 5076 Systems International, Performance Systems International, MIT 5077 Laboratory for Computer Science, May 1990. 5079 [9] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, 5080 "Introduction to Community-based SNMPv2", RFC 1901, SNMP Research, 5081 Inc., Cisco Systems, Inc., Dover Beach Consulting, Inc., 5082 International Network Services, January 1996. 5084 [10] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Transport 5085 Mappings for Version 2 of the Simple Network Management Protocol 5086 (SNMPv2)", RFC 1906, SNMP Research, Inc., Cisco Systems, Inc., 5087 Dover Beach Consulting, Inc., International Network Services, 5088 January 1996. 5090 [11] Case, J., Harrington D., Presuhn R., and B. Wijnen, "Message 5091 Processing and Dispatching for the Simple Network Management 5092 Protocol (SNMP)", RFC 2572, SNMP Research, Inc., Cabletron Systems, 5093 Inc., BMC Software, Inc., IBM T. J. Watson Research, April 1999 5095 [12] Blumenthal, U., and B. Wijnen, "User-based Security Model (USM) for 5096 version 3 of the Simple Network Management Protocol (SNMPv3)", RFC 5097 2574, IBM T. J. Watson Research, April 1999 5099 [13] Case, J., McCloghrie, K., Rose, M., and S. Waldbusser, "Protocol 5100 Operations for Version 2 of the Simple Network Management Protocol 5101 (SNMPv2)", RFC 1905, SNMP Research, Inc., Cisco Systems, Inc., 5102 Dover Beach Consulting, Inc., International Network Services, 5103 January 1996. 5105 [14] Levi, D., Meyer, P., and B. Stewart, "SNMPv3 Applications", RFC 5106 2573, SNMP Research, Inc., Secure Computing Corporation, Cisco 5107 Systems, April 1999 5109 [15] Wijnen, B., Presuhn, R., and K. McCloghrie, "View-based Access 5110 Control Model (VACM) for the Simple Network Management Protocol 5111 (SNMP)", RFC 2575, IBM T. J. Watson Research, BMC Software, Inc., 5112 Cisco Systems, Inc., April 1999 5114 [16] Case, J., Mundy, R., Partain, D., and B. Stewart, "Introduction to 5115 Version 3 of the Internet-standard Network Management Framework", 5116 RFC 2570, SNMP Research, Inc., TIS Labs at Network Associates, 5117 Inc., Ericsson, Cisco Systems, April 1999 5119 [RFC2119] 5120 S. Bradner, "Key words to use in the RFCs", RFC 2119. Mar 1997. 5122 [ACTQMGMT] 5123 V. Firoiu, M. Borden "A Study of Active Queue Management for 5124 Congestion Control", March 2000, In IEEE Infocom 2000, 5125 http://www.ieee-infocom.org/2000/papers/405.pdf 5127 [AQMROUTER] 5128 V.Misra, W.Gong, D.Towsley "Fuid-based analysis of a network of AQM 5129 routers supporting TCP flows with an application to RED", In 5130 SIGCOMM 2000, 5131 http://www.acm.org/sigcomm/sigcomm2000/conf/paper/sigcomm2000-4- 5132 3.ps.gz 5134 [AF-PHB] 5135 J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, "Assured Forwarding 5136 PHB Group.", RFC 2597, June 1999. 5138 [DSARCH] 5139 S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, "An 5140 Architecture for Differentiated Service", RFC 2475, December 1998. 5142 [DSFIELD] 5143 K. Nichols, S. Blake, F. Baker, D. Black, "Definition of the 5144 Differentiated Services Field (DS Field) in the IPv4 and IPv6 5145 Headers", RFC 2474, December 1998. 5147 [DSPIB] 5148 M. Fine, K. McCloghrie, J. Seligson, K. Chan, S. Hahn, A. Smith, 5149 "Differentiated Services Quality of Service Policy Information 5150 Base", Internet Draft , 07/25/2001 5152 [DSTERMS] 5153 D. Grossman, "New Terminology for Differentiated Services", 5154 Internet Draft , 08/28/2001. 5156 [EF-PHB] 5157 V. Jacobson, K. Nichols, K. Poduri, "An Expedited Forwarding PHB." 5158 Internet Draft, , 5159 09/04/2001. 5161 [IF-MIB] 5162 K. McCloghrie, F. Kastenholz, "The Interfaces Group MIB using 5163 SMIv2", RFC 2863, June 2000. 5165 [INETADDRESS] 5166 Daniele, M., Haberman, B., Routhier, S., Schoenwaelder, J., 5167 "Textual Conventions for Internet Network Addresses.", draft-ietf- 5168 ops-rfc2851-update-02.txt. [PRIVATE NOTE TO RFC EDITOR: YES, THIS 5169 IS INDEED A NORMATIVE REFERENCE. JUERGEN TELLS ME THAT HE WILL 5170 PUBLISH IT POSTE HASTE]. 5172 [INTSERVMIB] 5173 F. Baker, J. Krawczyk, A. Sastry, "Integrated Services Management 5174 Information Base using SMIv2", RFC 2213, September 1997. 5176 [MODEL] 5177 Y. Bernet, S. Blake, A. Smith, D. Grossman, "An Informal Management 5178 Model for Differentiated Services Routers", Internet Draft , 5181 [RED93] 5182 "Random Early Detection", 1993. 5184 [srTCM] 5185 J. Heinanen, R. Guerin, "A Single Rate Three Color Marker", RFC 5186 2697, September 1999. 5188 [trTCM] 5189 J. Heinanen, R. Guerin, "A Two Rate Three Color Marker", RFC 2698, 5190 September 1999. 5192 [TSWTCM] 5193 W. Fang, N. Seddigh, B. Nandy "A Time Sliding Window Three Color 5194 Marker", RFC 2859, June 2000. 5196 [SHAPER] 5197 "A Rate Adaptive Shaper for Differentiated Services" FC 2963, 5198 October 2000. 5200 10. Authors' Addresses 5202 Fred Baker 5203 Cisco Systems 5204 519 Lado Drive 5205 Santa Barbara, California 93111 5206 fred@cisco.com 5207 Kwok Ho Chan 5208 Nortel Networks 5209 600 Technology Park Drive 5210 Billerica, MA 01821 5211 khchan@nortelnetworks.com 5213 Andrew Smith 5214 Allegro Networks 5215 6399 San Ignacio Ave 5216 San Jose, CA 95119 5217 andrew@allegronetworks.com 5219 Table of Contents 5221 1 The SNMP Management Framework ................................... 2 5222 2 Relationship to other working group documents ................... 4 5223 2.1 Relationship to the Informal Management Model for 5224 Differentiated Services Router ............................... 4 5225 2.2 Relationship to other MIBs and Policy Management .............. 5 5226 3 MIB Overview .................................................... 5 5227 3.1 Processing Path ............................................... 6 5228 3.1.1 diffServDataPathTable - The Data Path Table ................. 7 5229 3.2 Classifier .................................................... 7 5230 3.2.1 diffServClfrElementTable - The Classifier Element Table ..... 8 5231 3.2.2 diffServMultiFieldClfrTable - The Multi-field Classifier 5232 Table ........................................................ 9 5233 3.3 Metering Traffic .............................................. 9 5234 3.3.1 diffServMeterTable - The Meter Table ........................ 10 5235 3.3.2 diffServTBParamTable - The Token Bucket Parameters Table 5236 .............................................................. 11 5237 3.4 Actions applied to packets .................................... 11 5238 3.4.1 diffServActionTable - The Action Table ...................... 12 5239 3.4.2 diffServCountActTable - The Count Action Table .............. 12 5240 3.4.3 diffServDscpMarkActTable - The Mark Action Table ............ 13 5241 3.4.4 diffServAlgDropTable - The Algorithmic Drop Table ........... 13 5242 3.4.5 diffServRandomDropTable - The Random Drop Parameters Table 5243 .............................................................. 13 5244 3.5 Queuing and Scheduling of Packets ............................. 15 5245 3.5.1 diffServQTable - The Class or Queue Table ................... 15 5246 3.5.2 diffServSchedulerTable - The Scheduler Table ................ 16 5247 3.5.3 diffServMinRateTable - The Minimum Rate Table ............... 16 5248 3.5.4 diffServMaxRateTable - The Maximum Rate Table ............... 17 5249 3.5.5 Using queues and schedulers together ........................ 17 5250 3.6 Example configuration for AF and EF ........................... 20 5251 3.6.1 AF and EF Ingress Interface Configuration ................... 20 5252 3.6.1.1 Classification In The Example ............................. 21 5253 3.6.1.2 AF Implementation On an Ingress Edge Interface ............ 22 5254 3.6.1.2.1 AF Metering On an Ingress Edge Interface ................ 22 5255 3.6.1.2.2 AF Actions On an Ingress Edge Interface ................. 22 5256 3.6.1.3 EF Implementation On an Ingress Edge Interface ............ 23 5257 3.6.1.3.1 EF Metering On an Ingress Edge Interface ................ 23 5258 3.6.1.3.2 EF Actions On an Ingress Edge Interface ................. 23 5259 3.7 AF and EF Egress Edge Interface Configuration ................. 24 5260 3.7.1 Classification On an Egress Edge Interface .................. 24 5261 3.7.2 AF Implementation On an Egress Edge Interface ............... 25 5262 3.7.2.1 AF Metering On an Egress Edge Interface ................... 25 5263 3.7.2.2 AF Actions On an Egress Edge Interface .................... 28 5264 3.7.2.3 AF Rate-based Queuing On an Egress Edge Interface ......... 29 5265 3.7.3 EF Implementation On an Egress Edge Interface ............... 29 5266 3.7.3.1 EF Metering On an Egress Edge Interface ................... 29 5267 3.7.3.2 EF Actions On an Egress Edge Interface .................... 29 5268 3.7.3.3 EF Priority Queuing On an Egress Edge Interface ........... 31 5269 4 Conventions used in this MIB .................................... 32 5270 4.1 The use of RowPointer to indicate data path linkage ........... 32 5271 4.2 The use of RowPointer to indicate parameters .................. 33 5272 4.3 Conceptual row creation and deletion .......................... 33 5273 5 Extending this MIB .............................................. 34 5274 6 MIB Definition .................................................. 35 5275 7 Acknowledgments ................................................. 120 5276 8 Security Considerations ......................................... 120 5277 9 References ...................................................... 121 5278 10 Authors' Addresses ............................................. 124 5279 11. Full Copyright 5281 Copyright (C) The Internet Society (2001). All Rights Reserved. 5283 This document and translations of it may be copied and furnished to 5284 others, and derivative works that comment on or otherwise explain it 5285 or assist in its implementation may be prepared, copied, published 5286 and distributed, in whole or in part, without restriction of any 5287 kind, provided that the above copyright notice and this paragraph are 5288 included on all such copies and derivative works. However, this 5289 document itself may not be modified in any way, such as by removing 5290 the copyright notice or references to the Internet Society or other 5291 Internet organizations, except as needed for the purpose of 5292 developing Internet standards in which case the procedures for 5293 copyrights defined in the Internet Standards process must be 5294 followed, or as required to translate it into languages other than 5295 English. 5297 The limited permissions granted above are perpetual and will not be 5298 revoked by the Internet Society or its successors or assigns. 5300 This document and the information contained herein is provided on an 5301 "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING 5302 TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING 5303 BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION 5304 HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF 5305 MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.