Wan Cheng-wei① Wu Jiang-xing① Li Yu-feng①② Lan Ju-long①
①(National Digital Switching System Engineering and Technological R&D Center, Zhengzhou 450002, China) ②(Department of Information and Control, Air Defense Command College, Zhengzhou 450002, China)
Abstract：Hashing is popularly adopted when it comes to a large scale of IP flows. High throughout is available with minimized average memory access number. This paper mainly focused on the lookup performance of CAM (Content Addressable Memory) Aided Hash Table (CAHT). By rational approximation, the paper provides the lower bound on average memory access number over lookup of CASHT; based on the analysis of CASHT, the paper also proposes the condition when to get the lower bound on average memory access number over lookup of CAMHT; Finally, simulation of actual network data shows its consistency to the theory model, which gives essential theory support to design and evaluate the hashing scheme in the actual applications.
2011, Vol. 33 
