Packet Classification Algorithms From Theory to Practice Author

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 1

Related Work n n n RFC (SIGCOMM 1999) HSM (AINA 2005) Hi. Cuts (MICRO 2000) 2

RFC 3

HSM (AINA 2005) 4

Hi. Cuts (MICRO 2000) 5

HSM (In This Paper) 6

Hi. Cuts (In This Paper) 7

Proposed: Hyper. Split 8

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

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

Performance (Metric) n With PC n n Memory Access Memory Requirement Pre-Processing Time With Cavium OCTEON 3860 network processor n Throughput 11

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

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

Performance (Memory Requirement) 14

Performance (Pre-Processing Time) 15

Performance (Average Throughput) (Number of Cores) 16

Performance (Average Throughput) (Packet Size) 17