Efficient Identification of TOP-K Heavy Hitters over Sliding Windows

• Published in: Mobile networks and applications 2019-10, Vol.24 (5), p.1732-1741
• Main Authors: Tang, Haina, Wu, Yulei, Li, Tong, Han, Chunjing, Ge, Jingguo, Zhao, Xiangpeng
• Format: Article
• Language: English
• Subjects: Algorithms; Communications Engineering; Communications traffic; Computer Communication Networks; Data structures; Data transmission; Digital media; Electrical Engineering; Engineering; Identification; IP (Internet Protocol); IT in Business; Mouse devices; Networks; Windows (intervals)
• ISSN: 1383-469X; 1572-8153
• DOI: 10.1007/s11036-018-1051-x

Due to the increasing volume of network traffic and growing complexity of network environment, rapid identification of heavy hitters is quite challenging. To deal with the massive data streams in real-time, accurate and scalable solution is required. The traditional method to keep an individual counter for each host in the whole data streams is very resource-consuming. This paper presents a new data structure called FCM and its associated algorithms. FCM combines the count-min sketch with the stream-summary structure simultaneously for efficient TOP- K heavy hitter identification in one pass. The key point of this algorithm is that it introduces a novel filter-and-jump mechanism. Given that the Internet traffic has the property of being heavy-tailed and hosts of low frequencies account for the majority of the IP addresses, FCM periodically filters the mice from input streams to efficiently improve the accuracy of TOP- K heavy hitter identification. On the other hand, considering that abnormal events are always time sensitive, our algorithm works by adjusting its measurement window to the newly arrived elements in the data streams automatically. Our experimental results demonstrate that the performance of FCM is superior to the previous related algorithm. Additionally this solution has a good prospect of application in advanced network environment.