Dynamic Polling Algorithm Based on Line Utilization Prediction 


Vol. 9,  No. 4, pp. 489-496, Aug.  2002
10.3745/KIPSTC.2002.9.4.489


PDF
  Abstract

This study proposes a new polling algorithm allowing dynamic change in polling period based on line utilization prediction. Polling is the most important function in network monitoring, but excessive polling data causes rather serious congestion conditions of network when network is in congestion. Therefore, existing multiple polling algorithms decided network congestion or load of agent with previously performed polling Round Trip Time or line utilization, changed polling period, and controlled polling traffic. But, this algorithm is to change the polling period based on the previous polling and does not reflect network conditions in the current time to be polled. A algorithm proposed in this study is to predict whether polling traffic exceeds threshold of line utilization on polling path based on the past data and to change the polling period with the prediction. In this study, utilization of each line configuring network was predicted with AR model and violation of threshold was presented in probability. In addition, suitability was evaluated by applying the proposed dynamic polling algorithm based on line utilization prediction to the actual network, reasonable level of threshold for line utilization and the violation probability of threshold were decided by experiment. Performance of this algorithm was maximized with these processes.

  Statistics


  Cite this article

[IEEE Style]

K. H. Cho, S. J. Ahn, J. W. Chung, "Dynamic Polling Algorithm Based on Line Utilization Prediction," The KIPS Transactions:PartC, vol. 9, no. 4, pp. 489-496, 2002. DOI: 10.3745/KIPSTC.2002.9.4.489.

[ACM Style]

Kang Hong Cho, Seong Jin Ahn, and Jin Wook Chung. 2002. Dynamic Polling Algorithm Based on Line Utilization Prediction. The KIPS Transactions:PartC, 9, 4, (2002), 489-496. DOI: 10.3745/KIPSTC.2002.9.4.489.