Fast Flow Table Lookup for High Concurrency Network

WANG Peng; ZHANG Liang; ZHOU Zhou; LIU Qing-yun; FANG Bin-xing

doi:10.3969/j.issn.0372-2112.2017.04.029

您当前的位置：

首页 >

文章列表页 >

Fast Flow Table Lookup for High Concurrency Network

更新时间：2025-07-16

- Fast Flow Table Lookup for High Concurrency Network
- Acta Electronica Sinica Vol. 45, Issue 4, Pages: 974-981(2017)
- 作者机构：
  
  1. 中国科学院信息工程研究所,北京,100093
  2. 信息内容安全技术国家工程实验室,北京,100093
  3. 中国科学院大学,北京,100049
  4. 国家计算机网络应急技术处理协调中心,北京,100029
  5. 东莞电子科技大学电子信息工程研究院,广东,东莞,523808
  6. 中国科学院信息工程研究所,北京,100093
  7. 信息内容安全技术国家工程实验室,北京,100093
  8. 中国科学院大学,北京,100049
  9. 国家计算机网络应急技术处理协调中心,北京,100029
  10. 东莞电子科技大学电子信息工程研究院,广东,东莞,523808
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2017.04.029
  CLC： TP393
- Published Online：25 April 2017，
  
  Published：2017
- 稿件说明：
移动端阅览
WANG Peng, ZHANG Liang, ZHOU Zhou, et al. Fast Flow Table Lookup for High Concurrency Network[J]. Acta Electronica Sinica, 2017, 45(4): 974-981.
DOI：

WANG Peng, ZHANG Liang, ZHOU Zhou, et al. Fast Flow Table Lookup for High Concurrency Network[J]. Acta Electronica Sinica, 2017, 45(4): 974-981. DOI： 10.3969/j.issn.0372-2112.2017.04.029.

摘要

为了改进高速网络环境下连接表的查找速度，本文首先分析了OC-192骨干链路上的流量特征.研究表明，骨干链路不仅具有高并发和高到达速率的特点，而且在适当的缓存窗口下，具有较好的网络局部性特征.基于这些特征和局部性原理，本文在朴素的哈希表结构基础之上增加常量开销的辅助空间，实现了一种快速流表查找方法.理论分析和真实网络数据集上的实验表明，该方法相比现有方法可以降低流表查找长度20.2%，减少流表访问时间17.1%.

Abstract

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.

关键词

Keywords

references

Views

354

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

An Efficient Memory Built-in Self-Repair Method Based on Hash Table

Related Author

FONT face

Verdana

XIE Kun

ZHAO Jiao-jiao

ZHANG Da-fang

BI Xia-an

FONT

GUO Xu-feng

Related Institution

College of Computer and Communication,Hunan University

2.College of Software,Hunan University

Institute of Microelectronics of Chinese Academy of Sciences

⁰