MIB Discovery
1930 modules enregistrés
Chemin
MIX : 1 (iso). 3 (org). 6 (dod). 1 (internet). 2 (mgmt). 1 (mib-2). 16 (rmon). 22 (switchRMON). 1 (smonMIBObjects). 2 (smonStats). 4 (smonPrioStatsTable)
OID : 1.3.6.1.2.1.16.22.1.2.4
TXT : iso. org. dod. internet. mgmt. mib-2. rmon. switchRMON. smonMIBObjects. smonStats. smonPrioStatsTable
Enfants
Détails
OID1.3.6.1.2.1.16.22.1.2.4
Module SMON-MIB (CISCO)
NomsmonPrioStatsTable
Statuscurrent
DescriptionContains the priority statistics. The collections are based on the value of the 3-bit user priority field encoded in the Tag Control Information (TCI) field according to [19], [20]. Note that this table merely reports priority as encoded in the VLAN headers, not the priority (if any) given to the frame for the actual switching purposes. No garbage collection is designed for this table, as there always are at most eight rows per statistical set, and the low memory requirements do not justify the implementation of such a mechanism.
Module SMON-MIB (DELL)
NomsmonPrioStatsTable
Statuscurrent
DescriptionContains the priority statistics. The collections are based on the value of the 3-bit user priority field encoded in the Tag Control Information (TCI) field according to [19], [20]. Note that this table merely reports priority as encoded in the VLAN headers, not the priority (if any) given to the frame for the actual switching purposes. No garbage collection is designed for this table, as there always are at most eight rows per statistical set, and the low memory requirements do not justify the implementation of such a mechanism.
Module SMON-MIB (ietf)
NomsmonPrioStatsTable
Statuscurrent
DescriptionContains the priority statistics. The collections are based on the value of the 3-bit user priority field encoded in the Tag Control Information (TCI) field according to [19], [20]. Note that this table merely reports priority as encoded in the VLAN headers, not the priority (if any) given to the frame for the actual switching purposes. No garbage collection is designed for this table, as there always are at most eight rows per statistical set, and the low memory requirements do not justify the implementation of such a mechanism.