2FA Sketch:用于数据流中准确且高效的重流检测的双因子装甲草图
2FA Sketch: Two-Factor Armor Sketch for Accurate and Efficient Heavy Hitter Detection in Data Streams
AI总结:
针对高吞吐量下重流检测的内存限制问题,提出2FA草图,通过双层保护机制和优化比较计数器投票策略,显著降低了错误率并提升了处理速度。
摘要:
检测重流(即超过指定阈值的流)对网络测量至关重要,但由于吞吐量增加和内存限制而面临挑战。现有的基于草图的解决方案,特别是使用比较计数器投票的方案,在高效识别重流方面存在局限。本文提出了双因子装甲(2FA)草图,这是一种旨在增强数据流中重流检测的新型数据结构。2FA草图通过改进的$\mathtt{Arbitration}$策略(用于桶内竞争)和跨桶冲突$\mathtt{Avoidance}$哈希方案实现了双层保护。通过理论推导最优$λ$参数并将$vote^+_{new}$重新设计为冲突指示器,它优化了比较计数器投票策略。实验结果表明,2FA草图优于标准Elastic Sketch,将错误率降低了2.5至19.7倍,并将处理速度提高了1.03倍。
英文摘要:
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 $\mathtt{Arbitration}$ strategy for in-bucket competition and a cross-bucket conflict $\mathtt{Avoidance}$ 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。