Abstract
A manager requests a MIB value for a desired object to an agent by management policy defined in SNMP, and then it responds to the manager. So, it causes a lot of network traffic between them. Specially, repetitious occurrence of sending-receiving information is very inefficient for a same object when a trend analysis of traffic is performed. In this paper, an efficient SNMP is proposed to add new PDUs into the existing SNMP in order to accept time function. Utilizing this PDU, it minimizes unnecessary sending-receiving message and collects information for trend management of network efficiently. This proposed SNMP is tested for compatibility with the existing SNMP and decreases amount of network traffic largely.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Checkhrouhou, M.: J, Labetoulle, An Efficient polling Layer for SNMP. In: Proceedings of the 2000 IEEE/IFIP Network operations and Management System, pp. 447–490 (2000)
Kim, M.-w., Seung-kyun, P., Young-hwan, O.: A Study on the Polling Mechanism for Optimizing the SNMP Traffics. The jounal of the Korean institute of communication sciences 06 v.26(6A), 1051–1059 (2001)
Cheon, J.-y., Cheong, J.-h., Yoon, W.-o., Choi, S.-b.: Adaptive Network Monitoring Strategy for SNMP-Based Network Management. The Journal of the Korean Institute of Communication Sciences 27(12C), 1265–1275, 1226–4717 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Youn, C., Chung, I. (2004). Extension of SNMP Function for Improvement of Network Performance. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_123
Download citation
DOI: https://doi.org/10.1007/978-3-540-30208-7_123
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23564-4
Online ISBN: 978-3-540-30208-7
eBook Packages: Springer Book Archive