NDLI: CubeCuts: A Novel Cutting Scheme for Packet Classification

Content Provider	IEEE Xplore Digital Library
Author	Yeim-Kuan Chang Yu-Hsiang Wang
Copyright Year	2012
Abstract	Packet Classification is one of the most important services provided by Internet routers nowadays. Decision-tree based schemes, such as HiCuts and Hyper Cuts, are the most well-known algorithms. These schemes separate search space into many equal-sized sub-spaces. But both schemes have the same rule replication problem, which might cause large memory overhead. Although another decision-tree based solution, Hyper splits, was proposed to cut space according to end-points for reducing the memory requirement, we still observe that its rule replication problem doesn¡¦t be solved well and the memory requirement can still be improved. In this paper, we propose a scheme called Cube Cuts to build a binary decision tree that does not generate any duplicated rule. By using the hybrid scheme that combines the Cube Cuts and constrained HiCuts, we can have a memory-efficient data structure such that the entire rule table of up to10K rules can be fit into the on-chip memory of FPGA device. Our design is very suitable to be implemented with parallelism and pipeline. The experimental results show that the rule replication ratio is very low in all rule tables (ACL, FW, and IPC). The proposed parallel and pipelined architecture based on the hybrid scheme can achieve a throughput of 118 Gbps, which is enough to deal with the Internet traffic that is growing rapidly in recent years.
Starting Page	274
Ending Page	279
File Size	210774
Page Count	6
File Format	PDF
ISBN	9781467308670
DOI	10.1109/WAINA.2012.110
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-03-26
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	pipeline packet classification Memory management Pipelines FPGA Logic gates Hardware Classification algorithms Decision trees Field programmable gate arrays decision-tree based algorithms
Content Type	Text
Resource Type	Article

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