Memory Optimization for Packet Classification Algorithms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F63839172%3A_____%2F09%3A00006681" target="_blank" >RIV/63839172:_____/09:00006681 - isvavai.cz</a>
Alternative codes found
RIV/00216305:26230/09:PU86226
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Memory Optimization for Packet Classification Algorithms
Original language description
We propose novel method how to reduce data structure size for the family of packet classification algorithms at the cost of additional pipelined processing with only small amount of logic resources. The reduction significantly decreases overhead given bythe crossproduct nature of classification rules. Therefore the data structure can be compressed to 10 % on average. As high compression ratio is achieved, fast on-chip memory can be used to store data structures and hardware architectures can process network traffic at significantly higher speed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
ISBN
978-1-60558-630-4
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
—
Publisher name
—
Place of publication
New York
Event location
Princeton
Event date
Oct 19, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—