wdiff draft-mealling-rfc3001bis-00.txt draft-mealling-rfc3001bis-01.txt

Network Working Group M. Mealling
Internet-Draft Network Solutions, Inc.
Expires: July 12, 2001 January 11, 2001
ObsoletesA new Request for Comments is now available in online RFC 3001 libraries.

RFC 3061

Title: A URN Namespace of Object Identifiers
draft-mealling-rfc3001bis-00.txt

Status of this Memo

This document is an Internet-Draft and is in full conformance with
all provisions of Section 10 of RFC2026.

Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as
Internet-Drafts.

Internet-Drafts are draft documents valid for a maximum of six
months and may be updated, replaced, or obsoleted by other documents
at any time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."

To view the entire list of Internet-Draft Shadow Directories, see
http://www.ietf.org/shadow.html.

This Internet-Draft will expire on July 12, 2001.

Abstract
Author(s): M. Mealling
Status: Informational
Date: February 2001
Mailbox: michaelm@netsol.com
Pages: 6
Characters: 8387
Obsoletes: 3001

I-D Tag: draft-mealling-rfc3001bis-01.txt

URL: ftp://ftp.rfc-editor.org/in-notes/rfc3061.txt

This document describes a URN Uniform Resource Name (URN) namespace that
contains Object Identifiers (OIDs). It obsoletes RFC 3001.

1. Introduction

An Object Identifier is a tree of nodes where each node is simply a
sequence of digits. The rules roughly state that once an entity is
assigned a node in the Object Identifier (OID) tree, it has sole
discretion to further sub-delegate sub-trees off of that node. Some
examples of OIDs include:

o 1.3.6.1 - the Internet OID
o 1.3.6.1.4.1 - IANA-assigned company OIDs, used for private MIBs
and such things
o 1.3.6.1.2.1.27 - The Applications MIB
o 0.9.2342.19200300.100.4 - Object ID's used in the directory pilot
project to identify X.500 Object Classes. Mostly defined in
RFC-1274.

This document specifies the "oid" URN namespace[2]. This namespace
is memo provides information for encoding the Internet community. It does
not specify an Object Identifier as specified in ASN.1[3] as a
URI. RFC 3001[1] is obsoleted by this specification.

The namespace specification is for a formal namespace.

2. Specification Template

Namespace ID:

"oid" requested.

Registration Information:

Registration Version Number: 1
Registration Date: 2000-04-30

Declared registrant Internet standard of the namespace:

The ISO/IEC Joint Technical Committee 1 - SubCommittee 6

The real authority any kind. Distribution of this
memo is the ASN.1 specification itself but SC6 unlimited.

This announcement is the committee that has the authority sent to interpret what that
means, thus that committee is listed as the registrant.

Declaration of structure:

The NSS portion of the identifier follows the string encoding
rules found in RFC 1778 Section 2.15[4]which specifies a series
of digits separated by a period with the most significant digit
being at the left IETF list and the least significant being at the right.
At no time shall the NSS portion of the URN contain the human
readable 'names' of a particular node in the OID tree. The NSS
portion of the name is strictly limited RFC-DIST list.
Requests to the digits 0-9 and the
'.' character. No other characters are permitted.

No changes are anticipated since Object Identifiers are fairly
simple and have been standardized with no changes for many years.

Relevant ancillary documentation:

Relevant documentation can be found in X.660/Amd 2 | ISO/IEC
9834-1/Amd 2[3].

Identifier uniqueness considerations:

The rules for assignment of OIDs requires that each OID be unique added to the OID space and that it cannot be reassigned or reused. By
reference this URN namespace inherits those rules.

Identifier persistence considerations:

The rules concerning deleted from the use of OIDs requires that they not IETF distribution list
should be
reused once assigned. By reference this URN namespace inherits
those rules.

Process of identifier assignment:

Once an OID is assigned sent to some entity, that entity can then
create and assign new OIDs below that particular OID. There are
multiple entities that assign new OIDs IETF-REQUEST@IETF.ORG. Requests to the general public. The
top three levels are pre-assigned as follows:
0 - ITU-T assigned
1 - ISO assigned
2 - Joint ISO/ITU-T assignment

several assigned OIDs that are of importance be
added to the Internet are:
1.3.6.1 - the Internet OID
1.3.6.1.4.1 - IANA-assigned company OIDs, used for private
MIBs and such things

Process of identifier resolution:

At this time no resolution mechanism is defined.

Rules for Lexical Equivalence:

OIDs are composed of multiple occurrences of digits and the "."
character. Lexical equivalence is achieved by exact string match.

Conformance with URN Syntax:

There are no additional characters reserved.

Validation mechanism:

None.

Scope:

Global

3. Examples

The following examples are taken from the example OIDs or deleted from the
Introduction:
urn:oid:1.3.6.1
urn:oid:1.3.6.1.4.1
urn:oid:1.3.6.1.2.1.27
URN:OID:0.9.2342.19200300.100.4

4. Security Considerations

None not already inherent to using unverifiable OIDs

5. Acknowledgments

The author would like to thank Harald Alvestrand for the use of his
OID database as a source for examples and references.

References

[1] Mealling, M., "A URN Namespace of Object Identifiers", RFC
3001, November 2000.

[2] Moats, R., "URN Syntax", RFC 2141, May 1997.

[3] CCITT, "Specification of Basic Encoding Rules for Abstract
Syntax Notation One (ASN.1)", CCITT Recommendation X.209,
January 1988.

[4] Howes, T., Kille, S., Yeong, W. and C. Robbins, "The String
Representation of Standard Attribute Syntaxes", RFC 1778, March
1995.

Author's Address

Michael Mealling
Network Solutions, Inc.
505 Huntmar Park Drive
Herndon, VA 22070
US

Phone: +1 770 935 5492
EMail: michaelm@netsol.com
URI: http://www.netsol.com

Full Copyright Statement

This document and translations of it may RFC-DIST distribution list should
be copied and furnished sent to
others, and derivative works that comment RFC-DIST-REQUEST@RFC-EDITOR.ORG.

Details on obtaining RFCs via FTP or otherwise explain it
or assist in its implementation may be prepared, copied, published
and distributed, in whole or in part, without restriction of any
kind, provided that the above copyright notice and this paragraph
are included on all such copies and derivative works. However, this
document itself EMAIL may not be modified in any way, such as obtained by removing
the copyright notice or references sending
an EMAIL message to rfc-info@RFC-EDITOR.ORG with the Internet Society or other
Internet organizations, except as needed for message body
help: ways_to_get_rfcs. For example:

To: rfc-info@RFC-EDITOR.ORG
Subject: getting rfcs

help: ways_to_get_rfcs

Requests for special distribution should be addressed to either the purpose
author of
developing Internet standards in which case the procedures for
copyrights defined RFC in the Internet Standards process must be
followed, question, or as required to translate it into languages other than
English.

The limited permissions granted above are perpetual and will not be
revoked by the Internet Society or its successors or assigns.

This document and the information contained herein is provided RFC-Manager@RFC-EDITOR.ORG. Unless
specifically noted otherwise on an
"AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING
TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING
BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION
HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.

Acknowledgment

Funding for the RFC editor function is currently provided by the
Internet Society. itself, all RFCs are for
unlimited distribution.echo
Submissions for Requests for Comments should be sent to
RFC-EDITOR@RFC-EDITOR.ORG. Please consult RFC 2223, Instructions to RFC
Authors, for further information.