{'fraction_non_alphanumeric': 0.015414258188824663, 'fraction_numerical': 0.0, 'mean_word_length': 5.232, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Dynamic polling scheme based on time variation of network management information values

Network monitoring is one of the most significant functions in network management to understand the state of a network in real-time. In network management, such as 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 although we can understand the state of the network in real-time. Many schemes have been proposed for controlling the overheads of dynamic polling by throttling polling rates. Unfortunately, by only considering overheads, these schemes fail to take into account the rate at which information must be obtained in order to achieve management tasks. Examples of these tasks include checking for threshold violations and determining if additional capacity should be allocated dynamically. This paper proposes a new scheme for dynamic polling that considers both the overhead of polling traffic and the message rates required for management tasks. Our scheme examines polling traffic, applying the discrete Fourier transformation to extract the desired polling rate. We demonstrate the availability of this approach through simulations in which polling requests are varied dynamically. Our scheme adjusts polling rates to make them more consistent and to reduce resource overheads.