For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Dynamic Polling Algorithm Based on Network Management Information Values
Kiyohito YOSHIHARA Keizo SUGIYAMA Hiroki HORIUCHI Sadao OBANA
IEICE TRANSACTIONS on Communications
Publication Date: 1999/06/25
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Distributed Processing for Controlling Telecommunications Systems)
monitoring, polling, SNMP, discrete Fourier transformation,
Full Text: PDF(1MB)>>
Network monitoring is one of the most significant functions in network management to understand the state of a network in real-time. In SNMP (Simple Network Management Protocol), polling is used for this purpose. If the time interval for two consecutive polling requests is too long, then we cannot understand the state of the network in real-time. Conversely, if it is too short, then the polling message traffic increases and imposes a heavy load on the network. Many dynamic polling algorithms have been proposed for controlling the increase in the polling message traffic. However, they cannot keep track of the time variations of management information values, since their main objectives are to check whether or not a network node is active and the next polling interval is determined being independent of the time variations of the values. The existing polling algorithms are thereby not applicable to the case where monitoring the time variation of management information values is critical. This paper proposes a new dynamic polling algorithm which, by making use of Discrete Fourier Transformation, enables not only to control the increase in the polling message traffic but also to keep track of the time variations of network management information values. We show the availability of the proposed algorithm by evaluating it through both simulations and experiments in actual network environment.