A longest prefix match search engine for multi-gigabit IP processing

被引:0
|
作者
Kobayashi, M [1 ]
Murase, T [1 ]
Kuriyama, A [1 ]
机构
[1] NEC Corp Ltd, C&C Media Res Labs, Kawasaki, Kanagawa, Japan
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose an IP forwarding table search engine architecture, VLMP (Vertical Logical operation with Mask-encoded Prefix-length), for routers with multi-gigabit/sec speed links. We discuss the existing approaches and the requirements for search engines, and go on to propose VLMP search engine architecture that expands upon a Content Addressable Memory (CAM) and can perform wire-speed packet processing of an OC-192 (9.6 Gb/s) link. In this architecture, prefixes can be stored in arbitrary order, while existing ternary CAMs require prefixes to be stored in the order of their lengths. Also presented is a newly developed search LSI in which the architecture is implemented.
引用
收藏
页码:1360 / 1364
页数:5
相关论文
共 21 条
  • [1] Design of embedded TCAM based longest prefix match search engine
    Manikandan, P.
    Larsen, Bjorn B.
    Aas, Einar J.
    MICROPROCESSORS AND MICROSYSTEMS, 2011, 35 (08) : 659 - 667
  • [2] A processor based high-speed longest prefix match search engine
    Kobayashi, M
    Murase, T
    2001 IEEE WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, 2001, : 233 - 239
  • [3] A longest prefix first search tree for IP lookup
    Wuu, LC
    Chen, KM
    Liu, TJ
    ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, 2005, : 989 - 993
  • [4] A longest prefix first search tree for IP lookup
    Wuu, Lih-Chyau
    Liu, Tzong-Jye
    Chen, Kuo-Ming
    COMPUTER NETWORKS, 2007, 51 (12) : 3354 - 3367
  • [5] Architecture for internal communication in multi-gigabit IP routers
    Bang, YC
    Lee, WB
    Choo, H
    Rao, NSV
    COMPUTATIONAL SCIENCE - ICCS 2003, PT III, PROCEEDINGS, 2003, 2659 : 495 - 503
  • [6] Survey and Proposal on Binary Search Algorithms for Longest Prefix Match
    Lim, Hyesook
    Lee, Nara
    IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2012, 14 (03): : 681 - 697
  • [7] Binary Search on Trie Levels with a Bloom Filter for Longest Prefix Match
    Lee, Jungwon
    Lim, Hyesook
    2014 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), 2014, : 38 - 43
  • [8] A Hash Based Architecture of Longest Prefix Matching for Fast IP Processing
    Ghosh, Surajeet
    Baliyan, Maitraya
    PROCEEDINGS OF THE 2016 IEEE REGION 10 CONFERENCE (TENCON), 2016, : 228 - 231
  • [9] SRAM Based Longest Prefix Matching Approach for Multigigabit IP Processing
    Ray, Sanchita Saha
    Ghosh, Surajeet
    Sardar, Bhaskar
    2015 IEEE INTERNATIONAL CONFERENCE ON ADVANCED NETWORKS AND TELECOMMUNCATIONS SYSTEMS (ANTS), 2015,
  • [10] Low Power Fast and Dense Longest Prefix Match Content Addressable Memory for IP Routers
    Maurya, Satendra Kumar
    Clark, Lawrence T.
    ISLPED 09, 2009, : 389 - 394