OID repository - 1.3.6.1.4.1.6486.800.1.3.2.13.1.0.3 = {iso(1) identified-organization(3) dod(6) internet(1) private(4) enterprise(1) 6486 alcatelIND1BaseMIB(800) alcatelIND1Management(1) managementIND1Notifications(3) notificationIND1Traps(2) groupmobilityTraps(13) groupmobilityTrapsDesc(1) 0 gmHwMixModeSubnetRuleTableOverloadAlert(3)}

iso(1) identified-organization(3) dod(6) internet(1) private(4) enterprise(1) 6486 alcatelIND1BaseMIB(800) alcatelIND1Management(1) managementIND1Notifications(3) notificationIND1Traps(2) groupmobilityTraps(13) groupmobilityTrapsDesc(1) 0?
gmHwMixModeSubnetRuleTableOverloadAlert(3)

Warning:

OID {iso(1) identified-organization(3) dod(6) internet(1) private(4) enterprise(1) 6486 alcatelIND1BaseMIB(800) alcatelIND1Management(1) managementIND1Notifications(3) notificationIND1Traps(2) groupmobilityTraps(13) groupmobilityTrapsDesc(1) 0?} is not described in the OID repository; you can create it if you know how to describe it

Note: A question mark '?' follows an orphan OID, i.e. an OID arc that is not yet described in the OID repository.

OID description

OID:	{iso(1) identified-organization(3) dod(6) internet(1) private(4) enterprise(1) 6486 alcatelIND1BaseMIB(800) alcatelIND1Management(1) managementIND1Notifications(3) notificationIND1Traps(2) groupmobilityTraps(13) groupmobilityTrapsDesc(1) 0 gmHwMixModeSubnetRuleTableOverloadAlert(3)}	(ASN.1 notation)
	1.3.6.1.4.1.6486.800.1.3.2.13.1.0.3	(dot notation)
	/ISO/Identified-Organization/6/1/4/1/6486/800/1/3/2/13/1/0/3	(OID-IRI notation)

Description:

gmHwMixModeSubnetRuleTableOverloadAlert NOTIFICATION-TYPE
OBJECTS {
gmSubnetRuleTable, gmOverloadRuleSlice
}
STATUS current
DESCRIPTION
"An subnet overload trap occurs in mixed mode whenever
a new entry to the HW subnet rule table gets dropped
in OS6800 due to the overload of the table."

Classification:

MIB object for network management

See classes of OIDs

Short link:
Disclaimer: The owner of this site does not warrant or assume any liability or responsibility for the accuracy, completeness, or usefulness of any information available on this page (for more information, please read the complete disclaimer). All rights reserved © 2007-2025