1 / 12

TreeCAM: Decoupling Updates and Lookups in Packet Classification

TreeCAM: Decoupling Updates and Lookups in Packet Classification. Authors: Balajee Vamanan and T. N. Vijaykumar Conf. : ACM CoNEXT 2011 Presenter : JHAO-YAN JIAN Date : 2012/5/9. INTRODUCTION. Line rates increasing (40 Gbps now, 160 Gbps soon)

lucita
Download Presentation

TreeCAM: Decoupling Updates and Lookups in Packet Classification

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. TreeCAM: Decoupling Updates and Lookups in Packet Classification Authors:Balajee Vamanan and T. N. Vijaykumar Conf. :ACM CoNEXT 2011 Presenter : JHAO-YAN JIAN Date : 2012/5/9

  2. INTRODUCTION • Line rates increasing (40 Gbps now, 160 Gbps soon) • Classifier size (number of rules) increasing • Custom rules for VPNs, QoS • Rules are getting more dynamic too • Larger classifiers at faster lookup & update rates • Must perform well in lookups and updates at low power

  3. INTRODUCTION • TreeCAM: Three novel ideas • Dual tree versionsto decouple lookups and updates • coarse tree in TCAM  reduce lookup accesses • Tree/TCAM hybrid • fine tree in control memory  reduce update effort • Interleaved layoutof leaves to cut ordering effort • Performs well in lookups and updates • 6-8 TCAM accesses for lookups • Close to ideal TCAM for updates

  4. TreeCAM Coarse Tree • Idea: partition rules among TCAM subarrays using decision trees • 4k-entry subarrays  coarse tree with each leaf in a subarray • 2-deep tree  fast lookup • Packets traverse subarrays

  5. TreeCAM Fine Tree • Key observation: A packet cannot match multiple leaves  only rules within the same leaf need ordering • Reduce update effort  Tree with small binth – fine tree • One coarse-tree leaf contains some contiguous fine-tree leaves

  6. Updating - No Re-balancing

  7. Updating - Local Re-balancing

  8. Updating - Global Re-balancing

  9. EXPERIMENTAL

  10. EXPERIMENTAL

  11. EXPERIMENTAL

  12. EXPERIMENTAL

More Related