Browse Prior Art Database

Bulk Table Retrieval with the SNMP (RFC1187)

IP.com Disclosure Number: IPCOM000002000D
Original Publication Date: 1990-Oct-01
Included in the Prior Art Database: 2000-Sep-12
Document File: 11 page(s) / 25K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

M.T. Rose: AUTHOR [+3]

Abstract

This memo reports an interesting family of algorithms for bulk table retrieval using the Simple Network Management Protocol (RFC 1157) [1].

This text was extracted from a ASCII Text document.
This is the abbreviated version, containing approximately 12% of the total text.

Network Working Group M. Rose

Request for Comments: 1187 Performance Systems International, Inc.

K. McCloghrie

Hughes LAN Systems

J. Davin

MIT Laboratory for Computer Science

October 1990

Bulk Table Retrieval with the SNMP

1. Status of this Memo

This memo reports an interesting family of algorithms for bulk table

retrieval using the Simple Network Management Protocol (SNMP). This

memo describes an Experimental Protocol for the Internet community,

and requests discussion and suggestions for improvements. This memo

does not specify a standard for the Internet community. 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. Status of this Memo .................................. 1

2. Abstract ............................................. 1

3. Bulk Table Retrieval with the SNMP ................... 2

4. The Pipelined Algorithm .............................. 3

4.1 The Maximum Number of Active Threads ................ 4

4.2 Retransmissions ..................................... 4

4.3 Some Definitions .................................... 4

4.4 Top-Level ........................................... 5

4.5 Wait for Events ..................................... 6

4.6 Finding the Median between two OIDs ................. 8

4.7 Experience with the Pipelined Algorithm ............. 10

4.8 Dynamic Range of Timeout Values ..................... 10

4.9 Incorrect Agent Implementations ..................... 10

5. The Parallel Algorithm ............................... 11

5.1 Experience with the Parallel Algorithm .............. 11

6. Acknowledgements ..................................... 11

7. References ........................................... 12

Security Considerations.................................. 12

Authors' Addresses....................................... 12

2. Abstract

This memo reports an interesting family of algorithms for bulk table

retrieval using the Simple Network Management Protocol (RFC 1157) [1].

The reader is expected to be familiar with both the Simple Network

Management Protocol and SNMP's powerful get-next operator. Please

send comments to: Marshall T. Rose .

3. Bulk Table Retrieval with the SNMP

Empirical evidence has shown that SNMP's powerful get-next operator is

effective for table traversal, particularly when the management

station is interested in well-defined subsets of a particular table.

There has been some concern that bulk table ...