ACM Home Page
Please provide us with feedback. Feedback
Scalable packet classification
Full text PdfPdf (243 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications table of contents
San Diego, California, United States
Pages: 199 - 210  
Year of Publication: 2001
ISBN:1-58113-411-8
Also published in ...
Authors
Florin Baboescu  Dept. of Computer Science and Engineering, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA
George Varghese  Dept. of Computer Science and Engineering, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 46,   Citation Count: 41
Additional Information:

abstract   references   cited by   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/383059.383075
What is a DOI?

ABSTRACT

Packet classification is important for applications such as firewalls, intrusion detection, and differentiated services. Existing algorithms for packet classification reported in the literature scale poorly in either time or space as filter databases grow in size. Hardware solutions such as TCAMs do not scale to large classifiers. However, even for large classifiers (say 100,000 rules), any packet is likely to match a few (say 10) rules. Our paper seeks to exploit this observation to produce a scalable packet classification scheme called Aggregated Bit Vector (ABV). Our paper takes the bit vector search algorithm (BV) described in [11] (which takes linear time) and adds two new ideas, recursive aggregation of bit maps and filter rearrangement, to create ABV (which can take logarithmic time for many databases). We show that ABV outperforms BV by an order of magnitude using simulations on both industrial firewall databases and synthetically generated databases.


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
IETF - Differentiated Services (di .serv)Working Group http://www.ietf.org/html.charters/diffservcharter.html.
 
2
Cisco - ArrowPoint Communications . http://www.arrowpoint.com,2000.
 
3
IPMA Statistics. MeritInc.- http://nic.merit.edu/ipma, 2000.
 
4
Memory-memory. http://www.memorymemory.com, 2000.
 
5
 
6
G.Banga,J.C.Mogul,and P.Druschel.A scalable and explicit event delivery echanism for UNIX.In Proc.USENIX Annual T chnical Conf.,June 1999.
 
7
 
8
A.Feldman and S.Muthukrishnan.Tradeoffs for packet classi .cation.In Proc.Infocom ,vol.1,pages 397 - 413,March 2000.
9
 
10
P.Gupta and N.McKeown.Packet classi .cation using hierarchical intelligent cuttings.In Proc.Hot Interconnects VII ,Aug.1999.
11
12
13
 
14
C.Partridge.Locality and route caches.In Proc.of NSF Workshop,Internet Statistics Measurement and Analysis ,Feb.1999.
15
16
 
17
J.Xu,M.Singhal,and J.Degroat.A novel cache architecture to support layer-four packet classi .cation at memory access speeds.In Proc.Infocom ,March 2000.

CITED BY  41

Collaborative Colleagues:
Florin Baboescu: colleagues
George Varghese: colleagues