Count-Less:高速交换机数据平面的计数示意图
Count-Less: A Counting Sketch for the Data Plane of High Speed Switches
摘要:
在高速交换机的数据平面中测量每个流统计的需求正在增加。由于处理和内存限制,使用精确计数测量流是不可行的,但草图是在数据平面中实时收集近似每个流统计信息的有希望的候选者。其中,Count-Min sketch是一个多功能的工具,可以使用少量的内存和低处理开销来测量大量数据的谱密度。由于其简单性和多功能性,Count-Min草图及其变体已在许多作品中作为独立的测量工具甚至作为支持测量工具被采用。然而,Count-Min的估计精度是有限的,这是由于其数据结构不完全容纳齐普菲分布和无差别更新算法,而不考虑计数器值。这反过来又降低了heavy hitter、heavy changer、基数和熵的准确性。为了提高Count-Min的测量精度,已经进行了许多各种尝试。最值得注意的方法之一是以顺序方式级联多个草图,以便过滤鼠标或大象流,以将大象从鼠标流中分离出来,例如Elastic sketch(利用TCAM + Count-Min的大象过滤器)和FCM sketch(基于Count-Min的分层鼠标过滤器)。在本文中,我们首先表明,这些级联滤波方法采用金字塔形的数据结构(分配更多的计数器鼠标流)仍然遭受内存利用率不足,这给了我们一个更好的估计空间。为此,我们面临着两个挑战:一个是(a)如何使Count-Min的数据结构更有效地适应Zipfian分布,另一个是(b)如何使更新和查询工作,而不会延迟交换机的数据平面中的分组处理。Count-Less采用了不同的组合...
英文摘要:
Demands are increasing to measure per-flow statistics in the data plane of high-speed switches. Measuring flows with exact counting is infeasible due to processing and memory constraints, but a sketch is a promising candidate for collecting approximately per-flow statistics in data plane in real-time. Among them, Count-Min sketch is a versatile tool to measure spectral density of high volume data using a small amount of memory and low processing overhead. Due to its simplicity and versatility, Count-Min sketch and its variants have been adopted in many works as a stand alone or even as a supporting measurement tool. However, Count-Min's estimation accuracy is limited owing to its data structure not fully accommodating Zipfian distribution and the indiscriminate update algorithm without considering a counter value. This in turn degrades the accuracy of heavy hitter, heavy changer, cardinality, and entropy. To enhance measurement accuracy of Count-Min, there have been many and various attempts. One of the most notable approaches is to cascade multiple sketches in a sequential manner so that either mouse or elephant flows should be filtered to separate elephants from mouse flows such as Elastic sketch (an elephant filter leveraging TCAM + Count-Min) and FCM sketch (Count-Min-based layered mouse filters). In this paper, we first show that these cascaded filtering approaches adopting a Pyramid-shaped data structure (allocating more counters for mouse flows) still suffer from under-utilization of memory, which gives us a room for better estimation. To this end, we are facing two challenges: one is (a) how to make Count-Min's data structure accommodate more effectively Zipfian distribution, and the other is (b) how to make update and query work without delaying packet processing in the switch's data plane. Count-Less adopts a different combination ...
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。