OID repository - 1.3.61.4.1.2879.2.10.2.319.1.222 = {iso(1) identified-organization(3) 61 4 1 2879 2 10 2 319 1 sonusAddressContextCallDetailStatusDetailIngressTrunkName(222)}

iso(1) identified-organization(3) 61 4? 1? 2879? 2? 10? 2? 319? 1?
sonusAddressContextCallDetailStatusDetailIngressTrunkName(222)

Warnings:

OID {iso(1) identified-organization(3) 61 4?} is not described in the OID repository; you can create it if you know how to describe it
OID {iso(1) identified-organization(3) 61 4? 1?} is not described in the OID repository; you can create it if you know how to describe it
OID {iso(1) identified-organization(3) 61 4? 1? 2879?} is not described in the OID repository; you can create it if you know how to describe it
OID {iso(1) identified-organization(3) 61 4? 1? 2879? 2?} is not described in the OID repository; you can create it if you know how to describe it
OID {iso(1) identified-organization(3) 61 4? 1? 2879? 2? 10?} is not described in the OID repository; you can create it if you know how to describe it
OID {iso(1) identified-organization(3) 61 4? 1? 2879? 2? 10? 2?} is not described in the OID repository; you can create it if you know how to describe it
OID {iso(1) identified-organization(3) 61 4? 1? 2879? 2? 10? 2? 319?} is not described in the OID repository; you can create it if you know how to describe it
OID {iso(1) identified-organization(3) 61 4? 1? 2879? 2? 10? 2? 319? 1?} 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) 61 4 1 2879 2 10 2 319 1 sonusAddressContextCallDetailStatusDetailIngressTrunkName(222)}	(ASN.1 notation)
	1.3.61.4.1.2879.2.10.2.319.1.222	(dot notation)
	/ISO/Identified-Organization/61/4/1/2879/2/10/2/319/1/222	(OID-IRI notation)

Description:

Ingress Trunk Name

Short URL for this page:
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