Layered Interval Codes for TCAM-based Classi cation Interdisciplinary Center Herzliya Anat Bremler-Barr bremler@idc.ac.il davidhay@cs.bgu.ac.il Interdisciplinary Center Herzliya Ben-Gurion University David Hay hendlerd@cs.bgu.ac.il Ben-Gurion University Danny Hendler Boris Farber farber.boris@idc.ac.il Categories and Subject Descriptors: C.2.6 Internetworking: Routers General Terms: Algorithms Keywords: TCAM,Classi cation the layering of ranges is done by approximation algorithms for speci c variants of interval-graph coloring. In addition, in the full paper [1] we provide mechanisms for updating TCAM entries without interfering with ongoing TCAM searches (hot updates). We evaluate these algorithms by performing extensive comparative analysis on real-life classi cation databases. Our analysis establishes that our algorithms reduce the number of redundant TCAM entries caused by range rules by more than 60% as compared with best range-encoding prior art. On the theoretical side, we prove in the full paper that constructing a LIC that uses a minimum number of bits is NP hard. We also prove that a polynomial-time 2-approximation algorithm for the closely related chromatic sum problem is also a 2-approximation algorithm for the LIC construction problem. We then prove that the problem of constructing an optimal LIC given a a speci c budget of extra bits is also NP hard. 1. INTRODUCTION
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/layered-interval-codes-for-tcam-based-classification-20KD0ORm0D
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Layered interval codes for tcam-based classification
Bremler-Barr, Anat; Hay, David; Hendler, Danny; Farber, Boris
Follow ACM SIGMETRICS Performance Evaluation Review
, Volume 36 (1)
Association for Computing Machinery – Jun 12, 2008
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
