This table is a 'flattened' version of a hierarchical
class trees that specify the bandwidth allocation for
the CBQ interfaces of the system.
Each tree is rooted at an interface. A class may either
be a leaf, meaning it has no children, or it may be an
interior class which has children. As packets are
forwarded out an interface, they are compared to the
'flow definition' of each class down the tree until a
matching leaf is found or until all classes are
traversed. Once a matching class is found, the packet is
transmitted or not based on the constraints configured
for the class, most importantly the allocated bandwidth
as identified by stnPmClassRate. If no matching class is
found, the packet is dropped.
Parsed from file stn-pm.mib.txt
Company: None
Module: STN-POLICY-MIB
This table is a 'flattened' version of a hierarchical
class trees that specify the bandwidth allocation for
the CBQ interfaces of the system.
Each tree is rooted at an interface. A class may either
be a leaf, meaning it has no children, or it may be an
interior class which has children. As packets are
forwarded out an interface, they are compared to the
'flow definition' of each class down the tree until a
matching leaf is found or until all classes are
traversed. Once a matching class is found, the packet is
transmitted or not based on the constraints configured
for the class, most importantly the allocated bandwidth
as identified by stnPmClassRate. If no matching class is
found, the packet is dropped.
Parsed from file STN-POLICY-MIB.mib
Module: STN-POLICY-MIB
Vendor: Spring Tide Networks, Inc.
Module: STN-POLICY-MIB
[Automatically extracted from oidview.com]
stnPmClassTable OBJECT-TYPE SYNTAX SEQUENCE OF StnPmClassEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "This table is a 'flattened' version of a hierarchical class trees that specify the bandwidth allocation for the CBQ interfaces of the system. Each tree is rooted at an interface. A class may either be a leaf, meaning it has no children, or it may be an interior class which has children. As packets are forwarded out an interface, they are compared to the 'flow definition' of each class down the tree until a matching leaf is found or until all classes are traversed. Once a matching class is found, the packet is transmitted or not based on the constraints configured for the class, most importantly the allocated bandwidth as identified by stnPmClassRate. If no matching class is found, the packet is dropped." ::= { stnPmClass 1 }
stnPmClassTable OBJECT-TYPE SYNTAX SEQUENCE OF StnPmClassEntry MAX-ACCESS not-accessible STATUS current DESCRIPTION "This table is a 'flattened' version of a hierarchical class trees that specify the bandwidth allocation for the CBQ interfaces of the system. Each tree is rooted at an interface. A class may either be a leaf, meaning it has no children, or it may be an interior class which has children. As packets are forwarded out an interface, they are compared to the 'flow definition' of each class down the tree until a matching leaf is found or until all classes are traversed. Once a matching class is found, the packet is transmitted or not based on the constraints configured for the class, most importantly the allocated bandwidth as identified by stnPmClassRate. If no matching class is found, the packet is dropped." ::= { stnPmClass 1 }
| OID | Name | Sub children | Sub Nodes Total | Description |
|---|---|---|---|---|
| 1.3.6.1.4.1.3551.2.11.1.15.1.1 | stnPmClassEntry | 28 | 28 | Information about a single traffic class. Traffic classes are identified by their associated interface's ifIndex and their name. … |