2019/09/05 by Xilai Liu, Liu, Xilai, Zhang, Xinyi +7
Computer Science · #FOS: Computer and information sciences #Internet Traffic Analysis and Secure E-voting #Network Packet Processing and Optimization #Network Security and Intrusion Detection #Networking and Internet Architecture (cs.NI)
paper · pdf · doi:10.48550/arxiv.1909.02203
openalex publication_date 2019/09/05 · openalex created_date 2019/09/12 · openalex updated_date 2026/07/28
Detecting heavy hitters, which are flows exceeding a specified threshold, is crucial for network measurement, but it faces challenges due to increasing throughput and memory constraints. Existing sketch-based solutions, particularly those using Comparative Counter Voting, have limitations in efficiently identifying heavy hitters. This paper introduces the Two-Factor Armor (2FA) Sketch, a novel data structure designed to enhance heavy hitter detection in data streams. 2FA Sketch implements dual-layer protection through an improved \mathttArbitration strategy for in-bucket competition and a cross-bucket conflict \mathttAvoidance hashing scheme. By theoretically deriving an optimal λ parameter and redesigning vote+new as a conflict indicator, it optimizes the Comparative Counter Voting strategy. Experimental results show that 2FA Sketch outperforms the standard Elastic Sketch, reducing error rates by 2.5 to 19.7 times and increasing processing speed by 1.03 times.