The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Pemantauan rangkaian adalah salah satu fungsi paling penting dalam pengurusan rangkaian untuk memahami keadaan rangkaian dalam masa nyata. Dalam SNMP (Simple Network Management Protocol), pengundian digunakan untuk tujuan ini. Jika selang masa untuk dua permintaan pengundian berturut-turut terlalu panjang, maka kami tidak dapat memahami keadaan rangkaian dalam masa nyata. Sebaliknya, jika ia terlalu pendek, maka trafik mesej pengundian meningkat dan mengenakan beban yang berat pada rangkaian. Banyak algoritma pengundian dinamik telah dicadangkan untuk mengawal peningkatan trafik mesej pengundian. Walau bagaimanapun, mereka tidak boleh menjejaki variasi masa bagi nilai maklumat pengurusan, kerana objektif utama mereka adalah untuk menyemak sama ada nod rangkaian aktif atau tidak dan selang pengundian seterusnya ditentukan sebagai bebas daripada variasi masa nilai. Algoritma pengundian sedia ada dengan itu tidak boleh digunakan untuk kes di mana pemantauan variasi masa nilai maklumat pengurusan adalah kritikal. Kertas kerja ini mencadangkan algoritma pengundian dinamik baharu yang, dengan menggunakan Transformasi Fourier Diskret, membolehkan bukan sahaja untuk mengawal peningkatan trafik mesej tinjauan tetapi juga untuk menjejak variasi masa nilai maklumat pengurusan rangkaian. Kami menunjukkan ketersediaan algoritma yang dicadangkan dengan menilainya melalui kedua-dua simulasi dan eksperimen dalam persekitaran rangkaian sebenar.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Kiyohito YOSHIHARA, Keizo SUGIYAMA, Hiroki HORIUCHI, Sadao OBANA, "Dynamic Polling Algorithm Based on Network Management Information Values" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 6, pp. 868-876, June 1999, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_6_868/_p
Salinan
@ARTICLE{e82-b_6_868,
author={Kiyohito YOSHIHARA, Keizo SUGIYAMA, Hiroki HORIUCHI, Sadao OBANA, },
journal={IEICE TRANSACTIONS on Communications},
title={Dynamic Polling Algorithm Based on Network Management Information Values},
year={1999},
volume={E82-B},
number={6},
pages={868-876},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={June},}
Salinan
TY - JOUR
TI - Dynamic Polling Algorithm Based on Network Management Information Values
T2 - IEICE TRANSACTIONS on Communications
SP - 868
EP - 876
AU - Kiyohito YOSHIHARA
AU - Keizo SUGIYAMA
AU - Hiroki HORIUCHI
AU - Sadao OBANA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 1999
AB - 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.
ER -