%0 Journal Article
%T Analysis on Lookup of CAM Aided Hash Table<br>CAM辅助的哈希表查找性能分析
%A Wan Cheng-wei Wu Jiang-xing Li Yu-feng Lan Ju-long
%A <br>万成威
%A 邬江兴
%A 李玉峰
%A 兰巨龙
%J 电子与信息学报
%D 2011
%I 
%X 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.
%K CAM (Content Addressable Memory) Aided Hash Table (CAHT)
%K Lookup
%K Lower bound of average memory access
%K Poisson distribution<br>CAM(Content
%K Addressable
%K Memory)辅助的哈希表(CAHT)
%K 查找
%K 平均访存次数下限
%K 泊松分布
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=19E108785753D113F4DEE5E21B0A4282&yid=9377ED8094509821&vid=27746BCEEE58E9DC&iid=0B39A22176CE99FB&sid=4E6F5C60B72D9B1C&eid=CAA7BAE04CB631A1&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=11