ACM DL

SIGN IN SIGN UP

Longest prefix matching using bloom filters

Full Text:

Pdf

Pdf

Buy this Article

Buy this Article

Authors:	Sarang Dharmapurikar	Department of Computer Science and Engineering, Washington University, St. Louis, MO
	Praveen Krishnamurthy	Department of Computer Science and Engineering, Washington University, St. Louis, MO
	David E. Taylor	Department of Computer Science and Engineering, Washington University, St. Louis, MO

Published in:

· Journal

IEEE/ACM Transactions on Networking (TON) archive

Volume 14 Issue 2, April 2006
IEEE Press Piscataway, NJ, USA
table of contents doi>10.1109/TNET.2006.872576

	2006 Article
Bibliometrics
· Downloads (6 Weeks): 10 · Downloads (12 Months): 31 · Citation Count: 5

Tools and Resources

Buy this Article
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms bloom filter computer networking design design studies ip ip lookup longest prefix matching pattern matching performance performance attributes routing protocols

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Windows Media Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder