基于中间点划分无冲突哈希及高速包处理.docVIP

基于中间点划分无冲突哈希的高速包处理 摘要:通过在高速片上存储器上存储所有的攻击特征，实现对数据包的高速检测。针对有限的片上存储器空间，提出一种新的基于中间点划分无冲突哈希函数的trie树结构，将攻击特征串平均分配到trie树每层的多个组中，实现对片上存储器有效的控制。通过在同一个芯片中采用流水并行方式执行查询操作，获得更高的吞吐量。存储中间点的空间复杂度为o(n)，哈希表的构建时间随攻击特征数量线性增长。实验结果表明：该方法降低了片上存储空间需求，在片上存储器只需执行一次即可完成特征匹配操作。 关键词:高速包处理;无冲突哈希;中间点划分;trie树;片上存储  high.speed packet processing by non.collision hash functions based on middle.point partition  zhang mo.hua1*, li ge2 1.school of computer and information engineering, henan university of economics and laws, zhengzhou henan 450000, china ; 2.department of information engineer, conservancy vocational institute of north china institute of water conservancy and hydroelectric power, zhengzhou henan 450000, china abstract: high.speed packet inspection can be achieved through storing attack signatures on the high.speed on.chip memory. concerning the limited on.chip memory, this paper proposes a new trie structure with non.collision hash functions based on middle.point partition. the algorithm evenly partitiones attack signatures into mutiple groups at each layer in trie tree to achieve the effective control of memory. the trie.tree structure can be implemented on a single chip and perform query operations by pipelining and parallelism,thus achieves higher throughput. the space complex of storing middle.point is o(n) and the construction time of hash table is linearly growing with the number of attack signatures the experimental results show that the new structure decreases the demand of on.chip memory and can facilitate access to the attack signature on the on.chip memory while allowing to perform the signatures matching operations only once. high.speed packet inspection can be achieved through storing attack signatures on the high.speed on.chip memory. concerning the limited on.chip memory, this paper proposed a new trie structure with non.collision hash functions based on middle.point partition. the algorithm evenly partitioned attack signatures into multiple groups at each laye