1 / 20

Low-Power TCAMs for Very Large Forwarding Tables

Low-Power TCAMs for Very Large Forwarding Tables. Authors: Wencheng Lu and Sartaj Sahni , Fellow, IEEE Conf. : IEEE/ACM Transactions on networking, 2010 Presenter : JHAO-YAN JIAN Date : 2011/3/15. The simplest TCAM solution.

jocelyn-zimmerman
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, Fellow, IEEE Conf. :IEEE/ACM Transactions on networking, 2010 Presenter : JHAO-YAN JIAN Date : 2011/3/15

  2. The simplest TCAM solution • The simplest TCAM solution to packet forwarding requires one TCAM search and one SRAM access to forward a packet. • The power consumption is that for a TCAM of this size.

  3. SUBTREE SPLIT(CoolCAM)

  4. POSTORDER SPLIT(CoolCAM)

  5. SUBTREE SPLIT

  6. SUBTREE SPLIT

  7. POSTORDER SPLIT • The DTCAM buckets are filled using as many rounds of feasible tree carving and packing as needed to completely carve out . • In each round, we select the bucket B with the fewest forwarding-table prefixes. • The preorder traversal.

  8. POSTORDER SPLIT(SP1)

  9. POSTORDER SPLIT(SP2)

  10. SIMPLE TCAM WITH WIDE SRAM

  11. SIMPLE TCAM WITH WIDE SRAM • 25 (50) is a rather crude estimate of the number of instructions needed to process a 72-bit (144-bit) suffix node. • We can make 100 M SRAM accesses per second using a 10-ns SRAM and perform about 20 G instruction per second using a 3.2-GHz dual-core processor. • Therefore, about 200 instructions can be executed in the time it takes to make an SRAM access. • The time to process a 72-bit (144-bit) suffix node is only about 1/8 (1/4) that of an SRAM access.

  12. EXPERIMENTAL RESULTS(1)

  13. EXPERIMENTAL RESULTS(2)

  14. EXPERIMENTAL RESULTS(3)

  15. EXPERIMENTAL RESULTS(4)

  16. EXPERIMENTAL RESULTS(5)

More Related