DocumentCode
3213404
Title
Multi-dimensional packet classification based on bit-parallelism
Author
Wang Xue-Guang
Author_Institution
Sch. of Inf. Sci. & Technol., East China Univ. of Politics & Law, Shanghai, China
fYear
2006
fDate
7-11 Aug. 2006
Firstpage
1787
Lastpage
1791
Abstract
Bit-parallelism is a fast scheme for packet classification, but it scales poorly as the filter databases grow in size. In this paper, by taking the bit-parallelism scheme and adding the ideas of bitmap mapping and tuple space, we present a new algorithm. The new algorithm reduces the complexities of both the time and storage and it can scale well with the growth of the filter databases in size. At the end of this paper, we have realized the algorithm in a virtual environment and analyze the experimental data.
Keywords
computational complexity; database management systems; packet switching; bit-parallelism; bitmap mapping; fast scheme; filter databases; multidimensional packet classification; storage complexities; time complexities; tuple space; Data analysis; Databases; Finite impulse response filter; Information filtering; Information filters; Information science; Least squares approximation; Size control; Space technology; Virtual environment; bit-parallelism; bitmap mapping; packet classification; tuple space;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference, 2006. CCC 2006. Chinese
Conference_Location
Harbin
Print_ISBN
7-81077-802-1
Type
conf
DOI
10.1109/CHICC.2006.280855
Filename
4060403
Link To Document