• DocumentCode
    1677041
  • Title

    Multi-Way Pipelining for Power-Efficient IP Lookup

  • Author

    Jiang, Weirong ; Prasanna, Viktor K.

  • Author_Institution
    Hsieh Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA
  • fYear
    2008
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Ternary Content Addressable Memories (TCAMs) have been widely adopted for IP lookup engines in today´s routers. However, due to the massive parallelism inherent in their architectures, TCAMs do not scale well in terms of power consumption. On the other hand, SRAM-based pipelined algorithmic solutions become attractive alternatives. This paper proposes a partitioning-based multi-way linear pipeline architecture for power-efficient trie-based IP lookup. We develop a hybrid partitioning scheme to map a routing table onto multiple linear pipelines, ensuring each pipeline uses equal amounts of memory. Within each pipeline, a memory-efficient fine-grained node-to-stage mapping scheme is employed to achieve evenly distributed memory across the stages. Simulation experiments using real-life traces show that our 8-way architecture, storing a backbone routing table with over 200 K prefixes, achieves a 27-fold reduction in power consumption over state-of-the-art TCAM-based solutions, while sustaining a throughput of 590 Gbps for minimum size (40 bytes) packets.
  • Keywords
    IP networks; parallel algorithms; parallel architectures; pipeline processing; storage management; telecommunication network routing; SRAM-based pipelined algorithm; massive parallelism; memory-efficient fine-grained node-to-stage mapping scheme; multiway linear pipeline architecture; power-efficient IP lookup; routing table; Associative memory; Clocks; Energy consumption; Engines; Partitioning algorithms; Pipeline processing; Random access memory; Routing; Spine; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE
  • Conference_Location
    New Orleans, LO
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-2324-8
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2008.ECP.450
  • Filename
    4698225