1 / 12

OC-3072 Packet Classification Using BDDs and Pipelined SRAMs

OC-3072 Packet Classification Using BDDs and Pipelined SRAMs. Author : Amit Prakash, Adnan Aziz Publisher: Hot Interconnects 9, 2001. Presenter: Hsin-Mao Chen Date: 2010/09/15. Outline. Introduction Background Classifier Architecture Reducing the Number of Levels Updates

ralph
Download Presentation

OC-3072 Packet Classification Using BDDs and Pipelined SRAMs

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. OC-3072 Packet Classification Using BDDs and Pipelined SRAMs Author: Amit Prakash, Adnan Aziz Publisher: Hot Interconnects 9, 2001. Presenter: Hsin-Mao Chen Date:2010/09/15

  2. Outline • Introduction • Background • Classifier • Architecture • Reducing the Number of Levels • Updates • Hardware implementation

  3. Introduction • Multiprotocol Label Switching (MPLS) Label lookup and label switching were faster than a routing table lookup because they could take place directly within the switched fabric.

  4. Introduction • Multiprotocol Label Switching (MPLS) The major goal of MPLS development - the increase of routing speed - is no longer relevant because of the usage of ASIC, TCAM and CAM-based switching.

  5. Background • Binary Decision Diagrams

  6. F = X0X1X2+X0X1X2+X0X1X2+X0X1X2 = X0X1+X0(X1X2+X1X2) Classifier Forwarding Table

  7. Classifier

  8. Architecture If we allocate 16K BDD nodes for each level, we can accommodate 60K prefixes with room to spare. Hence it suffices for each SRAM to be 32K x 14 bits in size.

  9. Reducing the Number of Levels • If we are allocating 16K nodes for each level, we do not need the first 14 SRAMs. • Almost prefixes are less than or equal to 24 bits. So in most cases we can get the result after the 24-th level.

  10. Updates • When a prefix is changed, the number of nodes in the original BDD that change is always less than equal to the number of levels.

  11. Hardware implementation • A forwarding table for MAE-WEST obtained from CAIDA 57668 prefixes and 62 output ports

  12. Hardware implementation

More Related