NDLI: Boundary cutting for packet classification

Content Provider	ACM Digital Library
Author	Lim, Hyesook Choi, Youngju Yim, Changhoon Lee, Nara Jin, Geumdan Lee, Jungwon
Copyright Year	2014
Abstract	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 results in a huge storage requirement. A new efficient packet classification algorithm using boundary cutting is proposed in this paper. The proposed algorithm finds out the space that each rule covers and performs the cutting according to the space boundary. Hence, the cutting in the proposed algorithm is deterministic rather than involving the complicated heuristics, and it is more effective in providing improved search performance and more efficient in memory requirement. For rule sets with 1000-100 000 rules, simulation results show that the proposed boundary cutting algorithm provides a packet classification through 10-23 on-chip memory accesses and 1-4 off-chip memory accesses in average.
Starting Page	443
Ending Page	456
Page Count	14
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2013.2254124
Volume Number	22
Issue Number	2
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-04-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	HiCuts Binary search Boundary cutting Decision tree algorithms Packet classification
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Boundary Cutting for Packet Classification

ABC: adaptive binary cuttings for multidimensional packet classification

ABC: Adaptive Binary Cuttings for Multidimensional Packet Classification

O(logW) multidimensional packet classification

Packet classification using binary content addressable memory

A Quad-Trie Conditionally Merged with a Decision Tree for Packet Classification

$O(log W)$ Multidimensional Packet Classification

Scalable packet classification

Hierarchical Binary Search Tree for Packet Classification

Boundary cutting for packet classification

Similar Documents

Boundary Cutting for Packet Classification

ABC: adaptive binary cuttings for multidimensional packet classification

ABC: Adaptive Binary Cuttings for Multidimensional Packet Classification

O(logW) multidimensional packet classification

Packet classification using binary content addressable memory

A Quad-Trie Conditionally Merged with a Decision Tree for Packet Classification

$O(log W)$ Multidimensional Packet Classification

Scalable packet classification

Hierarchical Binary Search Tree for Packet Classification

Boundary cutting for packet classification