ACM Home Page
Please provide us with feedback. Feedback
Topological transformation approaches to optimizing TCAM-based packet classification systems
Full text PdfPdf (737 KB)
Source
Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems table of contents
Seattle, WA, USA
SESSION: Computing and switching table of contents
Pages 73-84  
Year of Publication: 2009
ISBN:978-1-60558-511-6
Authors
Chad R. Meiners  Michigan State University, East Lansing, MI, USA
Alex X. Liu  Michigan State University, East Lansing, MI, USA
Eric Torng  Michigan State University, East Lansing, MI, USA
Sponsors
ACM: Association for Computing Machinery
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 25,   Downloads (12 Months): 78,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1555349.1555359
What is a DOI?

ABSTRACT

Several range reencoding schemes have been proposed to mitigate the effect of range expansion and the limitations of small capacity, large power consumption, and high heat generation of TCAM-based packet classification systems. However, they all disregard the semantics of classifiers and therefore miss significant opportunities for space compression.

In this paper, we propose new approaches to range reencoding by taking into account classifier semantics. Fundamentally different from prior work, we view reencoding as a topological transformation process from one colored hyperrectangle to another where the color is the decision associated with a given packet. We present two orthogonal, yet composable, reencoding approaches, domain compression and prefix alignment. Our techniques significantly outperform all previous reencoding techniques. In comparison with the state-of-the-art results, our experimental results show that our techniques achieve at least 7 times more space reduction in terms of TCAM space for an encoded classifier and at least 3 times more space reduction in terms of TCAM space for a reencoded classifier and its transformers.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Cypress semiconductor. http://www.cypress.com/.
 
2
Integrated device technology. http://www.idt.com/.
 
3
 
4
J. Bolaria and L. Gwennap. A guide to search engines and networking memory. http://www.linleygroup.com, 2004.
 
5
A. Bremler-Barr and D. Hendler. Space-efficient TCAM-based classification using gray coding. In proc 26th Annual IEEE Conf on Computer Communications (Infocom), May 2007.
 
6
7
 
8
R. Draves, C. King, S. Venkatachary, and B. Zill. Constructing optimal IP routing tables. In proc IEEE INFOCOM, pages 88--97, 1999.
 
9
10
 
11
P. Gupta and N. McKeown. Algorithms for packet classification. IEEE Network, 15(2):24--32, 2001.
12
13
 
14
 
15
 
16
A.X. Liu and M.G. Gouda. Complete redundancy detection in firewalls. In proc 19th Annual IFIP Conf on Data and Applications Security, LNCS 3654, pages 196--209, August 2005.
 
17
A.X. Liu and M.G. Gouda. Complete redundancy removal for packet classifiers in tcams. IEEE Transactions on Parallel and Distributed Systems (TPDS), to appear. The conference version was published in the 19th Annual IFIP Conf on Data and Applications Security (DBSec), LNCS 3654, 2005.
 
18
A.X. Liu, C.R. Meiners, and Y. Zhou. All-match based complete redundancy removal for packet classifiers in TCAMs. In proc 27th Infocom, 2008.
 
19
 
20
C.R. Meiners, A.X. Liu, and E. Torng. TCAM Razor: A systematic approach towards minimizing packet classifiers in TCAMs. In proc ICNP, 2007.
 
21
C.R. Meiners, A.X. Liu, and E. Torng. Bit weaving: A non-prefix approach to compressing packet classifiers in tcams. Technical Report MSU-CSE-09-1, Department of Computer Science and Engineering, Michigan State University, January 2009.
 
22
 
23
D. Pao, P. Zhou, B. Liu, and X. Zhang. Enhanced prefix inclusion coding filter-encoding algorithm for packet classification with ternary content addressable memory. IET Computers & Digital Techniques, 1(5):572--580, September 2007.
24
 
25
26
 
27
S. Suri, T. Sandholm, and P. Warkhede. Compressing two-dimensional routing tables. Algorithmica, 35:287--300, 2003.
28
 
29
D.E. Taylor and J.S. Turner. Classbench: A packet classification benchmark. In proc Infocom, 2005.
 
30
J. van Lunteren and T. Engbersen. Fast and scalable packet classification. IEEE Journals on Selected Areas in Communications, 21(4):560--571, 2003.
31
 
32

Collaborative Colleagues:
Chad R. Meiners: colleagues
Alex X. Liu: colleagues
Eric Torng: colleagues