一种高并发网络环境下快速流表查找方法

摘要

In order to improve flow table lookup speed,flow characteristics of the OC-192 backbone links was explored.It proves that the backbone traffic not only has high concurrency and high arrival rate,but also has good network locality characteristics in an appropriate cached window.Based on these characteristics and the principle of locality,a fast flow table lookup method was implemented by using a naive Hash table structure with constant increase of auxiliary space.The theoretical analysis and experiments on real-life data traces show that the proposed method can reduce the length and the time of flow table lookup by 20.2% and 17.1% compared with the existing method,respectively.%为了改进高速网络环境下连接表的查找速度,本文首先分析了OC-192骨干链路上的流量特征.研究表明,骨干链路不仅具有高并发和高到达速率的特点,而且在适当的缓存窗口下,具有较好的网络局部性特征.基于这些特征和局部性原理,本文在朴素的哈希表结构基础之上增加常量开销的辅助空间,实现了一种快速流表查找方法.理论分析和真实网络数据集上的实验表明,该方法相比现有方法可以降低流表查找长度20.2%,减少流表访问时间17.1%.