1 / 19

Low Power TCAMs For Very Large Forwarding Tables

Low Power TCAMs For Very Large Forwarding Tables. Authors: Wencheng Lu and Sartaj Sahni Presenter: Yi-Sheng, Lin ( 林意勝 ) Date: May. 13, 2008 Publisher/Conf. : INFOCOM 2008. Dept. of Computer Science and Information Engineering National Cheng Kung University,

atalo
Download Presentation

Low Power TCAMs For Very Large Forwarding Tables

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Low Power TCAMs For Very Large Forwarding Tables Authors: Wencheng Lu and Sartaj Sahni Presenter: Yi-Sheng, Lin (林意勝) Date: May. 13, 2008 Publisher/Conf. : INFOCOM 2008 Dept. of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C.

  2. Outline • Introduction • Background and Related Work • Subtree Split • Postorder Split • Simple TCAM with Wide SRAM • Experimental Results • Conclusion

  3. Introduction • Several strategies have been proposed to reduce TCAM power significantly by selecting a portion of TCAM entire for search. • Improving upon the router-table partitioning algorithms of [1] and [6]. • Showing how to couple TCAMs and wide SRAMs so as to search forwarding tables whose size is much larger than the TCAM size with no loss in time and with power reduction. [1] G. N. F. Zane and A. Basu, “CoolCAMs: Power-Efficient TCAMs for Forwarding Engines,” in INFOCOM, 2003. [6] H. Lu, “Improved Trie Partitioning for Cooler TCAMs,” in IASTED International Conference on Advances in Computer Science and Technology, 2004.

  4. Background and Related Work(1/3)

  5. Background and Related Work(2/3) 5 Subtree split (1-1) 2 2 1 1

  6. Background and Related Work(3/3) Postorder split (many-1) 5 2 2 1 1

  7. Subtree Split(1/2) • We need to partition a 1-bit trie into the smallest number of subtrees

  8. Subtree Split(2/2) • count(x) : the number of prefixes stored in the subtree

  9. Postorder Split • Let the number of forwarding-table prefixes in B be s. • Carving from the remaining T a feasible subtree of as large a size as possible but not exceeding b − s and pack this feasible subtree into B.

  10. Simple TCAM with Wide SRAM(1/4) • In the simple TCAM organization, each word of the SRAM is used to store only a next hop. • Since a next hop requires only a small number of bits (e.g., 10 bits)

  11. Simple TCAM with Wide SRAM(2/4) suffix count length next hop

  12. Simple TCAM with Wide SRAM(3/4) • ST(x).numP : the number of prefixes in ST(x). • ST(x).numB : the number of bits needed to store the suffix lengths, suffixes and next hops for these prefixes of ST(x). • l and r : x’s two children.

  13. Simple TCAM with Wide SRAM(4/4) • u be the number of bits allocated to the suffix count field. • v be the sum of the number of bits allocated to a length field and a next-hop field.

  14. 2-Level TCAM with Wide SRAM(1/3) fixed Recording the number of prefixes in bucket. variant Inefficient DTCAM space utilization

  15. 2-Level TCAM with Wide SRAM(2/3)

  16. 2-Level TCAM with Wide SRAM(3/3)

  17. Experimental Results(1/2)

  18. Experimental Results(2/2)

  19. Conclusion • Improving upon existing trie partitioning algorithms for TCAMs. • A novel way to combine TCAMs and SRAMs so as to achieve a significant reduction in power and TCAM size. • This is done without any increase in the number of TCAM searches and SRAM accesses required by a table lookup!

More Related