网络与信息安全学报 ›› 2018, Vol. 4 ›› Issue (3): 35-41.doi: 10.11959/j.issn.2096-109x.2018024

• 论文 • 上一篇    下一篇

基于多维空间动态划分与RFC的包分类改进算法

陈小雨1,2(),陆月明1,2   

  1. 1 北京邮电大学信息与通信工程学院,北京 100876
    2 可信分布式计算与服务教育部重点实验室,北京 100876
  • 修回日期:2018-02-15 出版日期:2018-03-01 发布日期:2018-04-09
  • 作者简介:陈小雨(1993-),男,北京人,北京邮电大学硕士生,主要研究方向为分布式计算与信息安全。|陆月明(1969-),男,江苏苏州人,北京邮电大学教授、博士生导师,主要研究方向为分布式计算、信息安全。
  • 基金资助:
    国家重点研究计划基金资助项目(2016YFB0800302)

Improved packet classification algorithm based on multidimensional space dynamic division and RFC

Xiaoyu CHEN1,2(),Yueming LU1,2   

  1. 1 School of Information and Communication Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China
    2 Key Laboratory of Trustworthy Distributed Computing and Service,Ministry of Education,Beijing 100876,China
  • Revised:2018-02-15 Online:2018-03-01 Published:2018-04-09
  • Supported by:
    The National Key R&D Program of China(2016YFB0800302)

摘要:

针对 RFC 算法随着规则集规模的增加,占用的内存空间以近似指数规模骤然增大的问题,提出了一种改进型的包分类算法 HRFC(Hybrid-RFC)。该算法通过决策树完成规则集多维空间的动态划分,借助多阶段缩减树完成对每个子集的映射,从而实现包的快速高效分类。实验表明,该算法能够在保障分类速度的同时,有效地降低空间开销。

关键词: RFC, 包分类, 决策树, 划分

Abstract:

According to the existing problem that memory usage grows exponentially with the size increase of rule set in RFC (recursive flow classification) algorithm,an improved packet classification algorithm,HRFC (Hybrid-RFC) was put forward.The new algorithm completes the dynamic division of a multidimensional space rule set by a decision tree,accomplishes the mapping of each subset with multiple phase reduction trees,so as to realize fast and efficient packet classification.The simulation results show that the new algorithm can reduce the space usage effectively while guaranteeing the performance of classification speed.

Key words: RFC, packet classification, decision tree, division

中图分类号: 

No Suggested Reading articles found!