TY - JOUR
T1 - Approximate Packet Classifiers with Controlled Accuracy
AU - Demianiuk, Vitalii
AU - Kogan, Kirill
AU - Nikolenko, Sergey
N1 - Publisher Copyright:
© 1993-2012 IEEE.
PY - 2021/6
Y1 - 2021/6
N2 - Performing exact computations can require significant resources. Approximate computing allows to alleviate resource constraints, sacrificing the accuracy of results. In this work, we consider a generalization of the classical packet classification problem. Our major contribution is to introduce representations of approximate packet classifiers with controlled accuracy and optimization techniques to reduce classifier sizes exploiting this new level of flexibility. In this work, we propose methods constructing efficient approximate representations for both LPM (longest prefix match) classifiers and classifiers with general ternary-bit filters. We validate our theoretical results with a comprehensive evaluation study showing that a small error in the actions of a classifier can lead to significant memory reductions, often comparable to the best possible theoretical reduction in the trivial case when all rules have the same action.
AB - Performing exact computations can require significant resources. Approximate computing allows to alleviate resource constraints, sacrificing the accuracy of results. In this work, we consider a generalization of the classical packet classification problem. Our major contribution is to introduce representations of approximate packet classifiers with controlled accuracy and optimization techniques to reduce classifier sizes exploiting this new level of flexibility. In this work, we propose methods constructing efficient approximate representations for both LPM (longest prefix match) classifiers and classifiers with general ternary-bit filters. We validate our theoretical results with a comprehensive evaluation study showing that a small error in the actions of a classifier can lead to significant memory reductions, often comparable to the best possible theoretical reduction in the trivial case when all rules have the same action.
KW - Software defined networking
KW - quality of service
UR - http://www.scopus.com/inward/record.url?scp=85100915700&partnerID=8YFLogxK
U2 - 10.1109/TNET.2021.3056948
DO - 10.1109/TNET.2021.3056948
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85100915700
SN - 1063-6692
VL - 29
SP - 1141
EP - 1154
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 3
M1 - 9354448
ER -