The DOI matches its Crossref record.
Longest prefix matching using bloom filters
Open accessAbstract
We introduce the first algorithm that we are aware of to employ Bloom filters for Longest Prefix Matching (LPM). The algorithm performs parallel queries on Bloom filters, an efficient data structure for membership queries, in order to determine address prefix membership in sets of prefixes sorted by prefix length. We show that use of this algorithm for Internet Protocol (IP) routing lookups results in a search engine providing better performance and scalability than TCAM-based approaches. The key feature of our technique is that the performance, as determined by the number of dependent memory accesses per lookup, can be held constant for longer address lengths or additional unique address prefix lengths in the forwarding table given that memory resources scale linearly with the number of prefixes in the forwarding table.Our approach is equally attractive for Internet Protocol Version 6 (IPv6) which uses 128-bit destination addresses, four times longer than IPv4. We present a basic version of our approach along with optimizations leveraging previous advances in LPM algorithms. We also report results of performance simulations of our system using snapshots of IPv4 BGP tables and extend the results to IPv6. Using less than 2Mb of embedded RAM and a commodity SRAM device, our technique achieves average performance of one hash probe per lookup and a worst case of two hash probes and one array access per lookup.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Cuckoo Filter: Practically Better Than Bloom
Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D. (2014) · Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies · doi:10.1145/2674005.2674994 · Cited by 737
Theory and Practice of Bloom Filters for Distributed Systems
Tarkoma, S., Rothenberg, C. E., & Lagerspetz, E. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.031611.00024 · Cited by 518
An Improved Construction for Counting Bloom Filters
Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., & Varghese, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11841036_61 · Cited by 383
Fast hash table lookup using extended bloom filter: an aid to network processing
Song, H., Dharmapurikar, S., Turner, J., & Lockwood, J. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080114 · Cited by 328
Self-citationNamed Data Networking: A survey
Saxena, D., Raychoudhury, V., Suri, N., Becker, C., & Cao, J. (2016) · Computer Science Review · doi:10.1016/j.cosrev.2016.01.001 · Cited by 291
Metadata
- Authors
- Dharmapurikar, S., Krishnamurthy, P., & Taylor, D. E.
- Venue
- Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2003-08-25
- Pages
- 201-212
- OpenAlex
- W2142808699
- Cited by
- 215
- References
- 0
- FWCI
- 10.53
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Longest prefix matching using bloom filters. https://app.cochat.ai/papers/10.1145/863955.863979
- The paper
- Dharmapurikar, S., Krishnamurthy, P., & Taylor, D. E. (2003). Longest prefix matching using bloom filters. Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. https://doi.org/10.1145/863955.863979
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.