Abstract
This paper presents a topological-order based dynamic polling scheme that effectively controls the overhead on polling traffic, by creating a network topology that follows the actual routing path for network monitoring. While the existing schemes use the polled roundtrip time or line usage to change polling rate for controlling the polling overhead, they were not capable of considering the topological order on polling nodes, which result in an inaccurate reflection of the current state of the network. Therefore, the scheme presented in this paper understands the relationship among nodes through the routing paths of network nodes within a management domain, uses this to determine the polling order, and carries out a dynamic polling to minimize the overhead on polling. Also, this paper proves that the scheme is more efficient in reducing polling time and number of messages compared to the polling scheme that does not consider topological-order.
This is a preview of subscription content, log in via an institution to check access.
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
J. Case, M. Fedor, M. Schoffstall, J. Davin: Simple Network Management Protocol(SNMP), RFC 1157, Network Working Group, IETF, 1990.
P. Dini and R. Boutaba: Deriving variable polling frequency policies for proactive management in networks and distributed systems, In Proc. of IFIP/IEEE IM’97, pp.553–564, 1997.
P. Dini, G. Bochmann, T. Koch, and B. Kramar: Agent based management of distributed systems with variable polling frequency policies, In Proc. of IFIP/IEEE IM’97, pp.553–564, 1997.
K. Ohta, N. Sun, G. Mansfield, and Y. Nemeto: Effiective polling control for network management using SNMP, IEICE Technical Reports on Information Network, IN94-135:91–96, Nov. 1994.
P. Moghe and M. Evangelista: Rap-rate adaptive polling for network management application, In Proc. of IEEE NOMS’98, pp.395–399, 1998.
B. Bondi: A nonblocking mechanism for regulating the transmission of network management polls, In Proc. of IFIP/IEEE IM’97, pp.565–580, 1997.
M.A. Weiss: Data Structures and Algorithm Analysis in C++, Addison-Wesley, Reading, MA, 1999.
Pranay Chaudhuri: An optimal distributed algorithm for finding articulation points in a network, Computer Communications, Volume 21, Issue 18, 15 December 1998, pp.1707–1715.
Pranay Chaudhuri: An optimal distributed algorithm for finding articulation points in a network, Computer Communications, Volume 21, Issue 18, 15 December 1998, pp.1707–1715.
Woo, J. Sahni, S.: Computing biconnected components on a hypercube, Distributed Computing Systems, 1990. Proceedings., Second IEEE Workshop on Future Trends of 1990, pp.277–283.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoon, B., Ahn, S., Chung, J. (2003). Topological-Order Based Dynamic Polling Scheme Using Routing Path for Network Monitoring. In: Chung, CW., Kim, CK., Kim, W., Ling, TW., Song, KH. (eds) Web and Communication Technologies and Internet-Related Social Issues — HSI 2003. HSI 2003. Lecture Notes in Computer Science, vol 2713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45036-X_30
Download citation
DOI: https://doi.org/10.1007/3-540-45036-X_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40456-9
Online ISBN: 978-3-540-45036-8
eBook Packages: Springer Book Archive