High-speed packet processing by non-collision hash functions based on middle-point partition

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 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 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 achieving 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.