1 / 17

Packet Classification Algorithms: From Theory to Practice

Packet Classification Algorithms: From Theory to Practice. Author : Yaxuan Qi, Lianghong Xu, Baohua Yang, Yibo Xue, and Jun Li Publisher: IEEE INFOCOM 2009 Presenter: Fang-Chen Kuo Date: 2009/10/28. Related Work. RFC (SIGCOMM 1999) HSM (AINA 2005) HiCuts (MICRO 2000). RFC.

eilis
Télécharger la présentation

Packet Classification Algorithms: From Theory to Practice

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. Packet Classification Algorithms:From Theory to Practice Author: Yaxuan Qi, Lianghong Xu, Baohua Yang, Yibo Xue, and Jun Li Publisher: IEEE INFOCOM 2009 Presenter: Fang-Chen Kuo Date: 2009/10/28

  2. Related Work • RFC (SIGCOMM 1999) • HSM (AINA 2005) • HiCuts (MICRO 2000)

  3. RFC

  4. HSM (AINA 2005)

  5. HiCuts(MICRO 2000)

  6. HSM(In This Paper)

  7. HiCuts(In This Paper)

  8. Proposed: HyperSplit

  9. Strategies(Segment for Partition) • Heuristic-1: • Segment-Balanced decomposition • Heuristic-2: • Rule-Balanced decomposition • Heuristic-3: • Weighted Segment-Balanced decomposition

  10. Strategies(Dimension for Partition) • Heuristic-1 & Heuristic-2: • select the field with the largest (number of end-points) to apply space decomposition at each stage. • Heuristic-3: • select the field with minimum • 􀡿􀢘􁈾􀢐􁈿

  11. Performance(Metric) • With PC • Memory Access • Memory Requirement • Pre-Processing Time • With Cavium OCTEON3860 network processor • Throughput

  12. Performance(Memory Access) (Bucket Size= 1)

  13. Performance(Memory Access) (Bucket Size= 8)

  14. Performance(Memory Requirement)

  15. Performance(Pre-Processing Time)

  16. Performance(Average Throughput)(Number of Cores)

  17. Performance(Average Throughput)(Packet Size)

More Related