Design of embedded TCAM based longest prefix match search engine

被引:4
|
作者
Manikandan, P. [1 ]
Larsen, Bjorn B. [1 ]
Aas, Einar J. [1 ]
机构
[1] Norwegian Univ Sci & Technol, Inst E&T, N-7034 Trondheim, Norway
关键词
Content addressable memory; Prefix match; NAND Pseudo CMOS; CAM;
D O I
10.1016/j.micpro.2011.08.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The content addressable memory (CAM) based solutions are very useful in network applications due to its high speed parallel search mechanism. This paper presents a novel Ternary CAM (TCAM) based NAND Pseudo CMOS-Longest Prefix Match (NPC-LPM) search engine. The proposed system provides a simple hardware based solution using novel 11T TCAM cell structures and NPC word line technique, for network routers. The experiments were performed on 256 x 128 NPC-LPM system under 0.13 mu m technology. The simulation result shows that the proposed design provides low power dissipation of 5.78 mW and high search speed of 315 MSearches/s under 1.3 V supply voltage. The presented NPC-LPM system meets the speed requirement of Optical Carrier (OC) 3072 with line-rate of 160 Gb/s in Ethernet networking and IPv6 protocol. The experimental results also show that the proposed system improves power-performance by 65%. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:659 / 667
页数:9
相关论文
共 50 条
  • [1] A processor based high-speed longest prefix match search engine
    Kobayashi, M
    Murase, T
    [J]. 2001 IEEE WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, 2001, : 233 - 239
  • [2] A longest prefix match search engine for multi-gigabit IP processing
    Kobayashi, M
    Murase, T
    Kuriyama, A
    [J]. ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS, 2000, : 1360 - 1364
  • [3] Survey and Proposal on Binary Search Algorithms for Longest Prefix Match
    Lim, Hyesook
    Lee, Nara
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2012, 14 (03): : 681 - 697
  • [4] Multi-region SRAM-Based TCAM for Longest Prefix
    Zou, Qian
    Zhang, Ning
    Guo, Feng
    Kong, Qingshan
    Lv, Zhiqiang
    [J]. SCIENCE OF CYBER SECURITY, SCISEC 2022, 2022, 13580 : 437 - 452
  • [5] Binary Search on Trie Levels with a Bloom Filter for Longest Prefix Match
    Lee, Jungwon
    Lim, Hyesook
    [J]. 2014 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), 2014, : 38 - 43
  • [6] Statistical Optimal Hash-based Longest Prefix Match
    Wang, Yi
    Qi, Zhuyun
    Dai, Huichen
    Wu, Hao
    Lei, Kai
    Liu, Bin
    [J]. 2017 ACM/IEEE SYMPOSIUM ON ARCHITECTURES FOR NETWORKING AND COMMUNICATIONS SYSTEMS (ANCS), 2017, : 153 - 164
  • [7] Longest Prefix Match and Updates in Range Tries
    Sourdis, Ioannis
    Katamaneni, Harsha
    [J]. ASAP 2011 - 22ND IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS (ASAP 2011), 2011, : 51 - 58
  • [8] Prefix segregation scheme for a TCAM-based IP forwarding engine
    Akhbarizadeh, MJ
    Nourani, M
    Cantrell, CD
    [J]. IEEE MICRO, 2005, 25 (04) : 48 - 63
  • [9] High-speed table lookup engine for IPv6 longest prefix match
    Hayashi, T
    Miyazaki, T
    [J]. GLOBECOM'99: SEAMLESS INTERCONNECTION FOR UNIVERSAL SERVICES, VOL 1-5, 1999, : 1576 - 1581
  • [10] TCAM-based High Speed Longest Prefix Matching with Fast Incremental Table Updates
    Rasmussen, A.
    Kragelund, A.
    Berger, M.
    Wessing, H.
    Ruepp, S.
    [J]. 2013 IEEE 14TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), 2013, : 43 - 48