ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification

ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification

Publisher : TRANSACTIONS ON NETWORKINGAuthor : Haoyu Song, Jonathan S. TurnerPresenter : Yu-Hsiang WangDate : 2012/05/09

1

Outline

ObservationsAlgorithm DescriptionAlgorithm OptimizationsPerformance Evaluation

2

Observations

• In HiCuts and HyperCuts, a global expansion factor may not be suitable for all nodes. Bucket Size cannot guarantee either throughput or storage.

• Our goal is to make the “optimal” decisions that consistently improve the throughput until the given storage is used up.

3

Algorithm Description

• DT : Decision Tree• CST : Cutting Shape Tree• CSB : Encode each CST with a Cutting Shape

Bitmap.

4

Algorithm Description

•ABC Variation I ▫The maximum number of cuttings is

constrained by the DT node size.

▫Choose one of the subregions produced so far and split it into two equal-sized subregions along a certain dimension until we run out of space in the DT node.

5

Algorithm Description

• preference value :

6

Algorithm Description

• If the current number of leaf nodes is less than k, we choose one leaf node to cut on a specific dimension.

• Our goal is to find the leaf node i and the dimension d that can minimize the preference value.

7

Algorithm Description

i : current index in CSBj: the current indexin CDV.

Next index i’ in CSB is

Next index j’ in CDV is

8

Algorithm Description

•ABC Variation II ▫Generate up to D separate CSTs, each for

one dimension.

9

Algorithm Description

•ABC Variation III▫Any bit can be chosen to split the filter set

•Assume DT size = 128 bits ▫ABC Variation I = 22 cuts▫ABC Variation III = 13 cuts

10

Algorithm Description

11

Algorithm Description

12

Algorithm Optimizations

•Reduce Filters Using a Hash Table.•Filter Partition on the Protocol Field.•Partitioning Filters Based on Duplication

Factor.•Holding Filters Internally and Reversing

Search Order.

13

Performance Evaluation

• Performance : bytes retrieved per lookup• Scalability on Filter Set Size

14

Performance Evaluation

15

Performance Evaluation

16

Performance Evaluation

17