{'fraction_non_alphanumeric': 0.02312925170068027, 'fraction_numerical': 0.010884353741496598, 'mean_word_length': 5.4, '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}}
Accurate Heavy Hitter Detection with Sliding Window Approach

Network measurement is essential to many network applications. Heavy Hitter detection is a significant function within the network measurement algorithms. However, the interval method in traditional Heavy Hitter detection is not as accurate as of the sliding window method which can detect the Heavy Hitter that appears on the boundaries of different intervals. Accordingly, this paper proposes accurate Heavy Hitter detection, which combines the sliding window approach with sketch algorithms. Compared with the interval method, our experiments show that the sliding window improves the accuracy by 121.8x, 2.8x, and 3.5x on average for CM, CU, and Hashpipe, respectively.