Packet Classification Using Pipelined Two-Dimensional Multibit Tries

Cagliari, Sardinia, Italy June 26-June 29

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.118

11th IEEE Symposium on Computers and ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Wencheng Lu Articles by Sartaj Sahni

	ASCII Text	x
	Wencheng Lu, Sartaj Sahni, "Packet Classification Using Pipelined Two-Dimensional Multibit Tries," Computers and Communications, IEEE Symposium on, pp. 808-813, 11th IEEE Symposium on Computers and Communications (ISCC'06), 2006.

	BibTex	x
	@article{ 10.1109/ISCC.2006.118, author = {Wencheng Lu and Sartaj Sahni}, title = {Packet Classification Using Pipelined Two-Dimensional Multibit Tries}, journal ={Computers and Communications, IEEE Symposium on}, volume = {0}, year = {2006}, issn = {1530-1346}, pages = {808-813}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.118}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computers and Communications, IEEE Symposium on TI - Packet Classification Using Pipelined Two-Dimensional Multibit Tries SN - 1530-1346 SP808 EP813 A1 - Wencheng Lu, A1 - Sartaj Sahni, PY - 2006 KW - Packet classification KW - longest matching prefix KW - controlled prefix expansion KW - fixed-stride tries KW - variable-stride tries KW - two-dimensional tries KW - dynamic programming. VL - 0 JA - Computers and Communications, IEEE Symposium on ER -

Wencheng Lu, University of Florida, USA

Sartaj Sahni, University of Florida, USA

We propose heuristics for the construction of fixedand variable-stride two-dimensional multibit tries. These multibit tries are suitable for the classification of Internet packets using a pipelined architecture. The pipelined two-dimensional multibit tries constructed by our proposed heuristics are superior, for pipelined architectures, to twodimensional multibit tries constructed by the best algorithms proposed for non-pipelined architectures.

Index Terms:

Packet classification, longest matching prefix, controlled prefix expansion, fixed-stride tries, variable-stride tries, two-dimensional tries, dynamic programming.

Citation:

Wencheng Lu, Sartaj Sahni, "Packet Classification Using Pipelined Two-Dimensional Multibit Tries," iscc, pp.808-813, 11th IEEE Symposium on Computers and Communications (ISCC'06), 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.