Boundary Cutting for Packet Classification

@article{Lim2014BoundaryCF,
  title={Boundary Cutting for Packet Classification},
  author={Hyesook Lim and Nara Lee and Geumdan Jin and Jungwon Lee and Youngju Choi and Changhoon Yim},
  journal={IEEE/ACM Transactions on Networking},
  year={2014},
  volume={22},
  pages={443-456}
}
Decision-tree-based packet classification algorithms such as HiCuts, HyperCuts, and EffiCuts show excellent search performance by exploiting the geometrical representation of rules in a classifier and searching for a geometric subspace to which each input packet belongs. However, decision tree algorithms involve complicated heuristics for determining the field and number of cuts. Moreover, fixed interval-based cutting not relating to the actual space that each rule covers is ineffective and… CONTINUE READING