Beyond TCAMs: An SRAM-based parallel multi-pipeline architecture for terabit IP lookup

被引:0
|
作者
Jiang, Weirong [1 ]
Wang, Qingbo [1 ]
Prasanna, Viktor K. [1 ]
机构
[1] Univ So Calif, Ming Hsieh Dept Elect Engn, Los Angeles, CA 90089 USA
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Continuous growth in network link rates poses a strong demand on high speed IP lookup engines. While Ternary Content Addressable Memory (TCAM) based solutions serve most of today's high-end routers, they do not scale well for the next-generation [1]. On the other hand, pipelined SRAM-based algorithmic solutions become attractive. Intuitively multiple pipelines can be utilized in parallel to have a multiplicative effect on the throughput. However, several challenges must be addressed for such solutions to realize high throughput. First, the memory distribution across different stages of each pipeline as well as across different pipelines must be balanced. Second, the traffic on various pipelines should be balanced. In this paper, we propose a parallel SRAM-based multi-pipeline architecture for terabit IP lookup. To balance the memory requirement over the stages, a two-level mapping scheme is presented. By trie partitioning and subtrie-to-pipeline mapping, we ensure that each pipeline contains approximately equal number of trie nodes. Then, within each pipeline, a fine-grained node-to-stage mapping is used to achieve evenly distributed memory across the stages. To balance the traffic on different pipelines, both pipelined prefix caching and dynamic subtrie-to-pipeline remapping are employed. Simulation using real-life data shows that the proposed architecture with 8 pipelines can store a core routing table with over 200K unique routing prefixes using 3.5 MB of memory. It achieves a throughput of up to 3.2 billion packets per second, i.e. 1 Tbps for minimum size (40 bytes) packets.
引用
收藏
页码:2458 / 2466
页数:9
相关论文
共 16 条
  • [11] MIPS Extension for a TCAM Based Parallel Architecture for Fast IP Lookup
    Erdem, Oguzhan
    Bazlamacci, Cueneyt F.
    [J]. 2009 24TH INTERNATIONAL SYMPOSIUM ON COMPUTER AND INFORMATION SCIENCES, 2009, : 309 - 314
  • [12] A memory-balanced linear pipeline architecture for trie-based IP lookup
    Jiang, Weirong
    Prasanna, Viktor K.
    [J]. 15TH ANNUAL IEEE SYMPOSIUM ON HIGH-PERFORMANCE INTERCONNECTS, PROCEEDINGS, 2007, : 83 - +
  • [13] A dynamic IP lookup architecture using parallel multiple hash in GPU-based software router
    [J]. Lin, Y. (yplin@hnu.edu.cn), 2013, Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States (09):
  • [14] A fast IP routing lookup architecture for multi-gigabit switching routers based on reconfigurable systems
    Fadishei, Hamid
    Saeedi, Mehdi
    Zamani, Morteza Saheb
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 2008, 32 (04) : 223 - 233
  • [15] An efficient parallel prefix matching architecture using Bloom filter for multi-bit trie IP Lookup algorithm in FPGA
    Saravanan, K.
    Senthilkumar, A.
    [J]. OPTOELECTRONICS AND ADVANCED MATERIALS-RAPID COMMUNICATIONS, 2015, 9 (5-6): : 803 - 807
  • [16] Architecture design of area-efficient SRAM-based multi-symbol arithmetic encoder in H.264/AVC
    Chen, Yu-Jen
    Tsai, Chen-Han
    Chen, Liang-Gee
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, PROCEEDINGS, 2006, : 2621 - +