TY - GEN
T1 - SNMP GetPrev
T2 - 7th IEEE/IFIP International Symposium on Integrated Network Management, IM 2001
AU - Breitgand, D.
AU - Raz, D.
AU - Shavitt, Y.
N1 - Publisher Copyright:
© 2001 IEEE.
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
KW - Bandwidth
UR - http://www.scopus.com/inward/record.url?scp=84952308812&partnerID=8YFLogxK
U2 - 10.1109/INM.2001.918058
DO - 10.1109/INM.2001.918058
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84952308812
T3 - 2001 7th IEEE/IFIP International Symposium on Integrated Network Management Proceedings: Integrated Management Strategies for the New Millennium
SP - 437
EP - 452
BT - 2001 7th IEEE/IFIP International Symposium on Integrated Network Management Proceedings
A2 - Pavlou, George
A2 - Liotta, Antonio
A2 - Anerousis, Nikos
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 14 May 2001 through 18 May 2001
ER -