📄 rfc1449.txt
字号:
Network Working Group J. Case Request for Comments: 1449 SNMP Research, Inc. K. McCloghrie Hughes LAN Systems M. Rose Dover Beach Consulting, Inc. S. Waldbusser Carnegie Mellon University April 1993 Transport Mappings for version 2 of the Simple Network Management Protocol (SNMPv2) Status of this Memo This RFC specifes an IAB standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "IAB Official Protocol Standards" for the standardization state and status of this protocol. Distribution of this memo is unlimited. Table of Contents 1 Introduction .......................................... 2 1.1 A Note on Terminology ............................... 2 2 Definitions ........................................... 3 3 SNMPv2 over UDP ....................................... 7 3.1 Serialization ....................................... 7 3.2 Well-known Values ................................... 7 4 SNMPv2 over OSI ....................................... 8 4.1 Serialization ....................................... 8 4.2 Well-known Values ................................... 8 5 SNMPv2 over DDP ....................................... 9 5.1 Serialization ....................................... 9 5.2 Well-known Values ................................... 9 5.3 Discussion of AppleTalk Addressing .................. 9 5.3.1 How to Acquire NBP names .......................... 10 5.3.2 When to Turn NBP names into DDP addresses ......... 11 5.3.3 How to Turn NBP names into DDP addresses .......... 11 5.3.4 What if NBP is broken ............................. 12 6 SNMPv2 over IPX ....................................... 13 6.1 Serialization ....................................... 13 6.2 Well-known Values ................................... 13 7 Proxy to SNMPv1 ....................................... 14 7.1 Transport Domain: rfc1157Domain ..................... 14 7.2 Authentication Algorithm: rfc1157noAuth ............. 14 Case, McCloghrie, Rose & Waldbusser [Page i] RFC 1449 Transport Mappings for SNMPv2 April 1993 8 Serialization using the Basic Encoding Rules .......... 16 8.1 Usage Example ....................................... 17 9 Acknowledgements ...................................... 18 10 References ........................................... 22 11 Security Considerations .............................. 24 12 Authors' Addresses ................................... 24 13 Security Considerations .............................. 25 14 Authors' Addresses ................................... 25 Case, McCloghrie, Rose & Waldbusser [Page 1] RFC 1449 Transport Mappings for SNMPv2 April 1993 1. Introduction A network management system contains: several (potentially many) nodes, each with a processing entity, termed an agent, which has access to management instrumentation; at least one management station; and, a management protocol, used to convey management information between the agents and management stations. Operations of the protocol are carried out under an administrative framework which defines both authentication and authorization policies. Network management stations execute management applications which monitor and control network elements. Network elements are devices such as hosts, routers, terminal servers, etc., which are monitored and controlled through access to their management information. The management protocol, version 2 of the Simple Network Management Protocol [1], may be used over a variety of protocol suites. It is the purpose of this document to define how the SNMPv2 maps onto an initial set of transport domains. Other mappings may be defined in the future. Although several mappings are defined, the mapping onto UDP is the preferred mapping. As such, to provide for the greatest level of interoperability, systems which choose to deploy other mappings should also provide for proxy service to the UDP mapping. 1.1. A Note on Terminology For the purpose of exposition, the original Internet-standard Network Management Framework, as described in RFCs 1155, 1157, and 1212, is termed the SNMP version 1 framework (SNMPv1). The current framework is termed the SNMP version 2 framework (SNMPv2). Case, McCloghrie, Rose & Waldbusser [Page 2] RFC 1449 Transport Mappings for SNMPv2 April 1993 2. Definitions SNMPv2-TM DEFINITIONS ::= BEGIN IMPORTS snmpDomains, snmpProxys FROM SNMPv2-SMI TEXTUAL-CONVENTION FROM SNMPv2-TC; -- SNMPv2 over UDP snmpUDPDomain OBJECT IDENTIFIER ::= { snmpDomains 1 } -- for a SnmpUDPAddress of length 6: -- -- octets contents encoding -- 1-4 IP-address network-byte order -- 5-6 UDP-port network-byte order -- SnmpUDPAddress ::= TEXTUAL-CONVENTION DISPLAY-HINT "1d.1d.1d.1d/2d" STATUS current DESCRIPTION "Represents a UDP address." SYNTAX OCTET STRING (SIZE (6)) Case, McCloghrie, Rose & Waldbusser [Page 3] RFC 1449 Transport Mappings for SNMPv2 April 1993 -- SNMPv2 over OSI snmpCLNSDomain OBJECT IDENTIFIER ::= { snmpDomains 2 } snmpCONSDomain OBJECT IDENTIFIER ::= { snmpDomains 3 } -- for a SnmpOSIAddress of length m: -- -- octets contents encoding -- 1 length of NSAP "n" as an unsigned-integer -- (either 0 or from 3 to 20) -- 2..(n+1) NSAP concrete binary representation -- (n+2)..m TSEL string of (up to 64) octets -- SnmpOSIAddress ::= TEXTUAL-CONVENTION DISPLAY-HINT "*1x:/1x:" STATUS current DESCRIPTION "Represents an OSI transport-address." SYNTAX OCTET STRING (SIZE (1 | 4..85)) Case, McCloghrie, Rose & Waldbusser [Page 4] RFC 1449 Transport Mappings for SNMPv2 April 1993 -- SNMPv2 over DDP snmpDDPDomain OBJECT IDENTIFIER ::= { snmpDomains 4 } -- for a SnmpNBPAddress of length m: -- -- octets contents encoding -- 1 length of object "n" as an unsigned integer -- 2..(n+1) object string of (up to 32) octets -- n+2 length of type "p" as an unsigned integer -- (n+3)..(n+2+p) type string of (up to 32) octets -- n+3+p length of zone "q" as an unsigned integer -- (n+4+p)..m zone string of (up to 32) octets -- -- for comparison purposes, strings are case-insensitive -- -- all strings may contain any octet other than 255 (hex ff) -- SnmpNBPAddress ::= TEXTUAL-CONVENTION STATUS current DESCRIPTION "Represents an NBP name." SYNTAX OCTET STRING (SIZE (3..99)) -- SNMPv2 over IPX snmpIPXDomain OBJECT IDENTIFIER ::= { snmpDomains 5 } -- for a SnmpIPXAddress of length 12: -- -- octets contents encoding -- 1-4 network-number network-byte order -- 5-10 physical-address network-byte order -- 11-12 socket-number network-byte order -- SnmpIPXAddress ::= TEXTUAL-CONVENTION DISPLAY-HINT "4x.1x:1x:1x:1x:1x:1x.2d" STATUS current DESCRIPTION "Represents an IPX address." SYNTAX OCTET STRING (SIZE (12)) Case, McCloghrie, Rose & Waldbusser [Page 5] RFC 1449 Transport Mappings for SNMPv2 April 1993 -- for proxy to community-based SNMPv1 (RFC 1157) rfc1157Proxy OBJECT IDENTIFIER ::= { snmpProxys 1 } -- uses SnmpUDPAddress rfc1157Domain OBJECT IDENTIFIER ::= { rfc1157Proxy 1 } -- the community-based noAuth rfc1157noAuth OBJECT IDENTIFIER ::= { rfc1157Proxy 2 } END Case, McCloghrie, Rose & Waldbusser [Page 6] RFC 1449 Transport Mappings for SNMPv2 April 1993 3. SNMPv2 over UDP This is the preferred transport mapping. 3.1. Serialization Each instance of a message is serialized onto a single UDP[2] datagram, using the algorithm specified in Section 8. 3.2. Well-known Values Although the partyTable gives transport addressing information for an SNMPv2 party, it is suggested that administrators configure their SNMPv2 entities acting in an agent role to listen on UDP port 161. Further, it is suggested that notification sinks be configured to listen on UDP port 162. The partyTable also lists the maximum message size which a SNMPv2 party is willing to accept. This value must be at least 484 octets. Implementation of larger values is encouraged whenever possible. Case, McCloghrie, Rose & Waldbusser [Page 7] RFC 1449 Transport Mappings for SNMPv2 April 1993 4. SNMPv2 over OSI This is an optional transport mapping. 4.1. Serialization Each instance of a message is serialized onto a single TSDU [3,4] for the OSI Connectionless-mode Transport Service (CLTS), using the algorithm specified in Section 8. 4.2. Well-known Values
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -