基于大象流检测的流表使用缩减算法的边界
Boundaries of Flow Table Usage Reduction Algorithms Based on Elephant Flow Detection
摘要:
大多数互联网流量是由相对较少的流量(所谓的大象流量)引起的。这种现象可以被利用来促进流量工程:资源昂贵的个人流转发条目可以只为大象创建,而在最短路径上为老鼠服务。虽然这个想法已经出现在拟议的TE系统中,但它本身并没有得到检验。流表占用和操作数量减少的程度可以达到什么程度,或者如何选择阈值或采样率来覆盖所需的流量部分,这仍然是未知的。在本文中,我们使用可重复的流量模型,从一个30天的校园跟踪覆盖40亿流量,回答这些问题。我们建立了理论边界的流表使用减少算法,从第一个数据包,达到预定义的计数器阈值或检测大象采样后,流进行分类。一个重要的发现是,简单的数据包采样在实际流量上表现得非常好,将流条目的数量减少了400倍,仍然覆盖了80%的流量。我们还提供了一个开源的软件包,允许复制我们的实验或执行类似的评估其他算法或流量分布。
英文摘要:
The majority of Internet traffic is caused by a relatively small number of flows (so-called elephant flows). This phenomenon can be exploited to facilitate traffic engineering: resource-costly individual flow forwarding entries can be created only for elephants while serving mice over the shortest paths. Although this idea already appeared in proposed TE systems, it was not examined by itself. It remains unknown what extent of flow table occupancy and operations number reduction can be achieved or how to select thresholds or sampling rates to cover the desired fraction of traffic. In this paper, we use reproducible traffic models obtained from a 30-day-long campus trace covering 4 billion flows, to answer these questions. We establish theoretical boundaries for flow table usage reduction algorithms that classify flows since the first packet, after reaching a predefined counter threshold or detect elephants by sampling. An important finding is that simple packet sampling performs surprisingly well on realistic traffic, reducing the number of flow entries by a factor up to 400, still covering 80% of the traffic. We also provide an open-source software package allowing the replication of our experiments or the performing of similar evaluations for other algorithms or flow distributions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。