ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2019, Vol. 56 ›› Issue (2): 349-362.doi: 10.7544/issn1000-1239.2019.20170732

• 网络技术 • 上一篇    下一篇

低速率流淘汰与d-Left散列相结合的大流检测算法

李春强1,董永强1,2,吴国新1,2   

  1. 1(东南大学计算机科学与工程学院 南京 211189); 2(计算机网络和信息集成教育部重点实验室(东南大学) 南京 211189) (Lcq9432@163.com)
  • 出版日期: 2019-02-01
  • 基金资助: 
    国家“八六三”高技术研究发展计划基金项目(2013AA013503);国家自然科学基金项目(61272532);赛尔网络下一代互联网技术创新项目(NGII20160407)

Elephant Flow Detection Algorithm Based on Lowest Rate Eviction Integrated with d-Left Hash

Li Chunqiang1, Dong Yongqiang1,2, Wu Guoxin1,2   

  1. 1(School of Computer Science and Engineering, Southeast University, Nanjing 211189); 2(Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education, Nanjing 211189)
  • Online: 2019-02-01

摘要: 网络中少量较高速率和较大数据量的流生成了网络的大部分流量;利用有限的存储空间有效地识别出这些数据流,对实施流量工程、缓解网络拥塞、改善网络传输具有非常重要的意义.随着网络技术的发展,传输链路的带宽容量和数据流的传输速率越来越高.具有高速报文转发能力的网络设备对数据流检测算法的处理提出了高的性能要求.将超过一定的数据量和传输速率的数据流定义为大流,提出了将低速流淘汰与d-Left散列表存储结构相结合的大流检测算法.为了满足高速网络传输的性能需求,使用d-Left散列表存储流检测的数据结构,将d-Left散列表的存储结构与流缓存替换相结合以实现高效的大流检测.通过低速率的淘汰,提高了检测算法的准确性.基于真实网络数据的测试结果表明:所提算法在相近的存储开销下保持了高的处理性能,其准确性优于LRU派生算法S-LRU和L-LRU以及CSS和WCSS检测算法.

关键词: 大流检测, d-Left 散列, 传输速率, 缓存替换, 高速网络

Abstract: A small percentage of high rate large-sized flows consume most of the network bandwidth. It is of great significance to efficiently identify these flows for traffic engineering, so as to alleviate network congestion and improve network transport performance. With the development of network technology, the capacity of transmission links and the transfer rate of data flows become higher and higher. So the network equipment with high-speed packets forwarding capability put forward high performance requirements for flows identifying algorithms. The flows whose size and transmission rate both exceed certain thresholds are usually defined as elephant flows. In this paper, a novel algorithm is proposed for elephant flow detection, in which the data structure of flow entries is indexed by d-Left Hash table to meet the performance requirements of high speed packet processing. The proposed detection algorithm combines the d-Left Hash data structure with the eviction of low-rate flows’ entries in order to identify elephant flows efficiently. The accuracy of the proposed detection algorithm is improved by the eviction of low rate flows’ entries. Theoretical analysis is conducted to demonstrate the accuracy, performance and memory overhead of the proposed detection algorithm. Experimental results on real data sets show that the proposed algorithm outperforms CSS, WCSS, S-LRU and L-LRU algorithms in terms of accuracy and performance at comparable memory overhead.

Key words: elephant flow detection, d-Left Hash, transmission rate, cache eviction, high speed networks

中图分类号: