DocumentCode :
3055138
Title :
SNMP GetPrev: an efficient way to browse large MIB tables
Author :
Breitgand, David ; Raz, D. ; Shavitt, Yuval
Author_Institution :
Hebrew Univ., Jerusalem, Israel
fYear :
2001
fDate :
2001
Firstpage :
437
Lastpage :
452
Abstract :
For some important network management applications, e.g., MIB browsing, there is a need to traverse portions of an MIB tree, especially tables, in both directions. While the GetNext request defined by the SNMP standard allows an easy and fast access to the next columnar object instance or the next scalar object, there is no corresponding operator in the SNMP framework for retrieving the previous MIB object instance. This allows an efficient MIB traversal only in one direction and makes the search in the reverse direction problematic. This paper presents SNMP GetPrev a tool that substantially optimizes retrieval of the previous instances of a columnar objects or scalar MIB objects. Our GetPrev application uses only standard SNMP GetNext and Get requests to carry on a fast and bandwidth efficient search for the required object instance. As we show, our application is two orders of magnitude faster and two to three orders of magnitude less bandwidth consuming when compared to the more traditional approaches
Keywords :
database management systems; protocols; query processing; telecommunication computing; telecommunication network management; GetNext; MIB tree; SNMP GetPrev; SNMP standard; bandwidth efficient search; columnar objects retrieval; fast search; large MIB tables browsing; network management applications; object instance; scalar MIB objects retrieval; Bandwidth;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Integrated Network Management Proceedings, 2001 IEEE/IFIP International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-6719-7
Type :
conf
DOI :
10.1109/INM.2001.918058
Filename :
918058
Link To Document :
بازگشت