DocumentCode
2078252
Title
Succinct Representation Of Static Packet Classifiers
Author
Lu, Wencheng ; Sahni, Sartaj
Author_Institution
Univ. of Florida, Gainesville
fYear
2007
fDate
1-4 July 2007
Firstpage
1119
Lastpage
1124
Abstract
We develop algorithms for the compact representation of the 2-dimensional tries that are used for Internet packet classification. Our compact representations are experimentally compared with competing compact representations for multi-dimensional packet classifiers and found to simultaneously reduce the number of memory accesses per lookup as well as the memory required to store the classifier.
Keywords
Internet; table lookup; telecommunication network routing; tree data structures; Internet packet classification; static packet classifiers; succinct representation; Binary trees; Data structures; Information filtering; Information filters; Information science; Internet; Matched filters; Partitioning algorithms; Protocols; Shape;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 2007. ISCC 2007. 12th IEEE Symposium on
Conference_Location
Aveiro
ISSN
1530-1346
Print_ISBN
978-1-4244-1520-5
Electronic_ISBN
1530-1346
Type
conf
DOI
10.1109/ISCC.2007.4381474
Filename
4381474
Link To Document