节点文献

一种基于哈希和跳转表的IP分类算法

Study on a Hash and Jumping Table Classification Algorithms

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 尚凤军王海霞

【Author】 Shang Fengjun 1,2 Wang Haixia 11 (College of Computer Science and Technology,Chongqing University of Posts and Telecommunications,Chongqing400065) 2 (Key Laboratory of Opto-electronic Technology and System of Ministry of Education,College of Opto-electronic Engineering,Chongqing University,Chongqing400044)

【机构】 重庆邮电学院计算机科学与技术学院,重庆邮电学院计算机科学与技术学院 重庆400065重庆大学光电工程学院光电技术及系统教育部重点实验室,重庆400044,重庆400065

【摘要】 文章介绍了IP分类技术研究的最新成果,以及IP分类的典型算法。提出了一种基于哈希(Hash)和跳转表Trie树JTTT(JumpingTableTrie-Tree)的IP分类算法,该算法和核心有两点:一是将源/目的端口和协议三域构造成一个哈希函数,因为该三域的交叉组合较少;二是将源/目的IP地址分割为两块构成跳转表和Trie树。通过分析比较,文章提出的算法无论是时间性能还是空间性能均优于GridofTries算法,文中通过仿真给出了最终的分类效果。最后该文对提出的算法在虚拟环境下做了评判。

【Abstract】 This article surveies the recent advances in the research of IP classification and introduces some of the typ-ical algorithms.It describes a combination scheme that combines the advantages of both schemes.At last,a novel IP clas-sification is proposed based on the jumping table Trie-tree algorithm.The core of algorithm has two parts:One is the structure of hash function,which is constructed mainly based on destination/source port and protocol type field,because the crossproducting of three fields;Two is that it transforms Grid of Tries for the true Trie-tree and jumping table in order to reduce space complexity.The new algorithm not only eliminates in the case of multiple fields but also shows performance in regard to both time and space.It has better overall performance than the Grid of Tries algorithms.

【关键词】 IP分类查找算法Trie树
【Key words】 IP classificationlookup algorithmTrie-tree
【基金】 重庆邮电学院青年教师基金资助
  • 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2004年28期
  • 【分类号】TP393.02
  • 【被引频次】2
  • 【下载频次】124
节点文献中: 

本文链接的文献网络图示:

本文的引文网络