abc : adaptive binary cuttings for multidimensional packet classification
DESCRIPTION
ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification. Publisher : TRANSACTIONS ON NETWORKING Author : Haoyu Song, Jonathan S. Turner Presenter : Yu-Hsiang Wang Date : 2012/05/09. Outline. Observations Algorithm Description Algorithm Optimizations - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/1.jpg)
ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification
Publisher : TRANSACTIONS ON NETWORKINGAuthor : Haoyu Song, Jonathan S. TurnerPresenter : Yu-Hsiang WangDate : 2012/05/09
1
![Page 2: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/2.jpg)
Outline
ObservationsAlgorithm DescriptionAlgorithm OptimizationsPerformance Evaluation
2
![Page 3: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/3.jpg)
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
![Page 4: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/4.jpg)
Algorithm Description
• DT : Decision Tree• CST : Cutting Shape Tree• CSB : Encode each CST with a Cutting Shape
Bitmap.
4
![Page 5: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/5.jpg)
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
![Page 6: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/6.jpg)
Algorithm Description
• preference value :
6
![Page 7: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/7.jpg)
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
![Page 8: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/8.jpg)
Algorithm Description
i : current index in CSBj: the current indexin CDV.
Next index i’ in CSB is
Next index j’ in CDV is
8
![Page 9: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/9.jpg)
Algorithm Description
•ABC Variation II ▫Generate up to D separate CSTs, each for
one dimension.
9
![Page 10: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/10.jpg)
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
![Page 11: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/11.jpg)
Algorithm Description
11
![Page 12: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/12.jpg)
Algorithm Description
12
![Page 13: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/13.jpg)
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
![Page 14: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/14.jpg)
Performance Evaluation
• Performance : bytes retrieved per lookup• Scalability on Filter Set Size
14
![Page 15: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/15.jpg)
Performance Evaluation
15
![Page 16: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/16.jpg)
Performance Evaluation
16
![Page 17: ABC : Adaptive Binary Cuttings for Multidimensional Packet Classification](https://reader036.vdocuments.site/reader036/viewer/2022070400/568134c2550346895d9be6a3/html5/thumbnails/17.jpg)
Performance Evaluation
17