Multi-Stage TCAMs Architecture for IP Lookup

  • Weidong Wu
  • Wei Zhang
  • Liangliang Quan
  • Tao Yu
  • Tong Wu
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 113)


Ternary Content Addressable Memory (TCAM)-based forwarding engines are widely used in core routers to achieve high throughput. To increase the throughput and reduce the power consumption of TCAM we propose a pipeline forwarding engine with multiple TCAMs, called Multi-stage TCAMs. Multi-stage TCAMs can perform IP lookups in parallel. A stream of IP lookup requests can be issued into multi-stage TCAMs, one every cycle, to achieve high throughput and reduce the power consumption.


Routing table TCAM Pipeline IP lookup 


  1. 1.
    CYRESS. Oct 2010
  2. 2.
    Lin D, Zhang Y, Hu CC, Liu B, Zhang X, Pao D (2007) Route table partitioning and load balancing for parallel searching with TCAMs. In: Proceedings of IEEE international parallel and distributed processing symposium, 26–30 March pp 1–10Google Scholar
  3. 3.
    Ravikumar VC, Mahapatra RN (2004) TCAM architecture for IP lookup using prefixes properties. IEEE Micro (24)2:60–69Google Scholar
  4. 4.
    Zheng K, Hu CC, Lu H, Liu B (2006) A TCAM-based distributed parallel IP lookup scheme and performance analysis. IEEE/ACM Transactions on Networking 14(4):863–875CrossRefGoogle Scholar
  5. 5.
    Akhbarizadeh MJ, Nourani M, Cantrell CD (2005) Prefix segregation scheme for a TCAM-based IP forwarding engine. IEEE Micro 25(4):48–63CrossRefGoogle Scholar
  6. 6.
    Lu W, Sahni S (2010) Low-power TCAMs for very large forwarding tables. IEEE/ACM Transactions on Networking 18(3):948–959CrossRefGoogle Scholar
  7. 7.
    The University of Oregon Route Views Project (2010)
  8. 8.
  9. 9.
    Akhbarizadeh M, Nourani M (2004) Efficient prefix cache for network processors. In: Proceedings of IEEE Symposium on High Performance, Interconnects, pp 41–46Google Scholar
  10. 10.
    MacGregor MH (2003) Design algorithms for multi-zone IP address caches. In: Proceedings of high performance switching and routing, pp 281–285Google Scholar
  11. 11.
    Srinivasan V, Varghese G (1999) Faster IP lookups using controlled prefix expansion. ACM Trans Comput Syst 17(1):1–40CrossRefGoogle Scholar
  12. 12.
    Sahni S, Kim K (2004) Efficient dynamic lookup for bursty access patterns. Int J Found Comput Sci 15(4):567–592CrossRefMATHGoogle Scholar
  13. 13.
    Kleinberg J, Tardos E (2005) Algorithm design. Longman Publishing, USAGoogle Scholar
  14. 14.
    Jiang W, Wang Q, Prasanna VK, (2008) Beyond TCAMs: An SRAM based parallel multi-pipeline architecture for terabit IP lookup. In: Proceedings of 27th conference on computer communications (INFOCOM’08), pp 1786–1794Google Scholar
  15. 15.

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  • Weidong Wu
    • 1
  • Wei Zhang
    • 1
  • Liangliang Quan
    • 1
  • Tao Yu
    • 1
  • Tong Wu
    • 1
  1. 1.School of ComputerWuhan University of Science and TechnologyWuhanChina

Personalised recommendations