Advanced Search
Volume 33 Issue 2
Mar.  2011
Turn off MathJax
Article Contents
Wan Cheng-Wei, Wu Jiang-Xing, Li Yu-Feng, Lan Ju-Long. Analysis on Lookup of CAM Aided Hash Table[J]. Journal of Electronics & Information Technology, 2011, 33(2): 272-277. doi: 10.3724/SP.J.1146.2010.00162
Citation: Wan Cheng-Wei, Wu Jiang-Xing, Li Yu-Feng, Lan Ju-Long. Analysis on Lookup of CAM Aided Hash Table[J]. Journal of Electronics & Information Technology, 2011, 33(2): 272-277. doi: 10.3724/SP.J.1146.2010.00162

Analysis on Lookup of CAM Aided Hash Table

doi: 10.3724/SP.J.1146.2010.00162 cstr: 32379.14.SP.J.1146.2010.00162
  • Received Date: 2010-02-26
  • Rev Recd Date: 2010-11-15
  • Publish Date: 2011-02-19
  • 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.
  • loading
  • [1] Yan H.[J].Maltz D A, and Eugene Ng T S, et al.. Tesseract: a 4D network control plane [C]. 4th USENIX Symposium on Networked Systems Design Implementation (NSDI), Cambridge, MA, USA, April 11-1.2007,:- [2] Casado M, Freedman M J, and Pettit J, et al.. Ethane: taking control of the enterprise [J].ACM SIGCOMM Computer Communication Review.2007, 37(4):1-12 [3] McKeown N, Anderson T, and Balakrishnan H. OpenFlow: enabling innovation in campus networks [J]. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 69-74. [4] Azar Y, Broder A Z, and Karlin A R, et al.. Balanced allocation [J].SIAM Journal on Computing.1999, 29(1):180-200 [5] Kirsch A and Mitzenmacher M. The power of one move: hashing schemes for hardware [C]. the 27th IEEE International Conference on Computer Communications (INFOCOM), Phoenix, AZ, USA, April 15-17, 2008: 565-573. [6] Fotakis D, Pagh R, and Sanders P, et al.. Space efficient hash tables with worst case constant access time [C]. the 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27-March 1, 2003: 271-282. [7] Kanizo Y, Hay D, and Keslassy I. Optimal fast hashing [C]. the 28th IEEE International Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil, April 19-25, 2009: 2500-2508. [8] Bremler-Barr A, Hay D, and Hendler D, et al.. Layered interval codes for tcam-based classification [C]. the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Annapolis, MD, USA, June 2-6, 2008: 445-446. [9] Steele M J. Le Cams inequality and Poisson approximations [J].American Mathematical Monthly.1994, 101(1):48-54 [10] Kurtz T G. Solutions of ordinary differential equations as limits of pure jump Markov processes [J].Journal of Applied Probability.1970, 7(1):49-58 [11] 程光, 龚俭, 丁伟等. 面向IP流测量的哈希算法研究[J].软件学报.2005, 16(5):652-658 Cheng Guang, Gong Jian, and Ding Wei, et al.. A hash algorithm for IP flow measurement [J].Journal of Software.2005, 16(5):652-658
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3204) PDF downloads(1134) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return