The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Theory and Practice of Bloom Filters for Distributed Systems
Abstract
Many network solutions and overlay networks utilize probabilistic techniques to reduce information processing and networking costs. This survey article presents a number of frequently used and useful probabilistic techniques. Bloom filters and their variants are of prime importance, and they are heavily used in various distributed systems. This has been reflected in recent research and many new algorithms have been proposed for distributed systems that are either directly or indirectly based on Bloom filters. In this survey, we give an overview of the basic and advanced techniques, reviewing over 20 variants and discussing their application in distributed systems, in particular for caching, peer-to-peer systems, routing and forwarding, and measurement data summarization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
(1999) · Cited by 3,186
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
Bigtable: a distributed storage system for structured data
Chang, F. W., Dean, J. B., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2006) · doi:10.5555/1298455.1298475 · Cited by 1,928
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.851975 · Cited by 1,811
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437 · cited 1×
“The DSBF is implemented using locality-sensitive hash functions [53], [54] and allows false positives and false”
MethodPagh, R., & Rodler, F. F. (2004) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.12.002 · Cited by 1,045
Issues in data stream management
Golab, L., & ÖZSU, M. T. (2003) · ACM SIGMOD Record · doi:10.1145/776985.776986 · Cited by 964
The BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576 · cited 1×
“Then if the minimum counter exceeds some threshold value, the flow is marked as a heavy flow [100].”
BackgroundSnoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Schwartz, B., Kent, S. T., & Strayer, W. T. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.804827 · Cited by 450
Deep packet inspection using parallel bloom filters
Dharmapurikar, S., Krishnamurthy, P., Sproull, T. S., & Lockwood, J. W. (2004) · IEEE Micro · doi:10.1109/mm.2004.1268997 · Cited by 435
LIPSIN: line speed publish/subscribe inter-networking
Jokela, P., Zahemszky, A., Esteve Rothenberg, C., Arianfar, S., & Nikander, P. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592592 · Cited by 434
Efficient Peer-to-Peer Keyword Searching
Reynolds, P., & Vahdat, A. M. (2007) · Cited by 386
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
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
Universal classes of hash functions (Extended Abstract)
Carter, J. L., & Wegman, M. N. (1977) · Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 · doi:10.1145/800105.803400 · Cited by 350
Approximate counts and quantiles over sliding windows
Arasu, A., & Manku, G. S. (2004) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1055558.1055598 · Cited by 346
T RIBLER: a social‐based peer‐to‐peer system
Pouwelse, J. A., Garbacki, P., Wang, J., Bakker, A., Yang, J., Iosup, A., Epema, D. H. J., Reinders, M., van Steen, M. R., & Sips, H. J. (2008) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.1189 · Cited by 343
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
The Bloomier filter: an efficient data structure for static support lookup tables
Chazelle, B., Kilian, J., Rubinfeld, R., & Tal, A. (2004) · doi:10.5555/982792.982797 · Cited by 327
Informed content delivery across adaptive overlay networks
Byers, J. W., Considine, J., Mitzenmacher, M., & Rost, S. (2002) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/633025.633031 · Cited by 261
Efficient Peer-to-Peer Keyword Searching
Reynolds, P., & Vahdat, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-44892-6_2 · Cited by 219
Longest prefix matching using bloom filters
Dharmapurikar, S., Krishnamurthy, P., & Taylor, D. E. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863979 · Cited by 215
Counter braids: a novel counter architecture for per-flow measurement
Lu, Y., Montanari, A., Prabhakar, B., Dharmapurikar, S., & Kabbani, A. (2008) · Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/1375457.1375472 · Cited by 206
Mitzenmacher, M. (2001) · Proceedings of the twentieth annual ACM symposium on Principles of distributed computing · doi:10.1145/383962.384004 · Cited by 200
Less Hashing, Same Performance: Building a Better Bloom Filter
Kirsch, A., & Mitzenmacher, M. (2006) · Lecture notes in computer science · doi:10.1007/11841036_42 · Cited by 185
Beyond bloom filters: from approximate membership checks to approximate state machines
Bonomi, F., Mitzenmacher, M., Panigrah, R., Singh, S., & Varghese, G. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159950 · Cited by 183
OPUS: Preventing weak password choices
Spafford, E. H. (1992) · Computers & Security · doi:10.1016/0167-4048(92)90207-8 · Cited by 162
Some Difficult-to-Pass Tests of Randomness
Marsaglia, G., & Tsang, W. W. (2002) · Journal of Statistical Software · doi:10.18637/jss.v007.i03 · Cited by 156
Efficient and scalable query routing for unstructured peer-to-peer networks
Kumar, A., Xu, J. J., & Zegara, E. W. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498343 · Cited by 150
Why simple hash functions work: exploiting the entropy in a data stream
Mitzenmacher, M., & Vadhan, S. (2008) · Symposium on Discrete Algorithms · Cited by 149
An optimal Bloom filter replacement
Pagh, A., Pagh, R., & Satti, S. R. (2005) · Symposium on Discrete Algorithms · doi:10.5555/1070432.1070548 · Cited by 147
Cohen, S., & Matias, Y. (2003) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/872785.872787 · Cited by 136
Yu, M., Fabrikant, A., & Rexford, J. (2009) · ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) · doi:10.1145/1658939.1658975 · Cited by 109
Subscription summarization: a new paradigm for efficient publish/subscribe systems
Triantafillou, P., & Economides, A. A. (2004) · International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2004.1281623 · Cited by 99
Practical performance of Bloom filters and parallel free-text searching
Ramakrishna, M. V. (1989) · Communications of the ACM · doi:10.1145/67933.67941 · Cited by 93
Dinh, T. L., Hu, W. S., Sikka, P., Corke, P., Overs, L., & Brosnan, S. (2007) · Conference on Local Computer Networks · doi:10.1109/lcn.2007.39 · Cited by 89
Payload attribution via hierarchical bloom filters
Shanmugasundaram, K., Brönnimann, H., & Memon, N. D. (2004) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1030083.1030089 · Cited by 86
Kubiatowicz, J. D., Bindel, D., Chen, Y., Czerwinski, S. E., Eaton, P. R., Geels, D., Gummadi, R., Rhea, S. C., Weatherspoon, H., Weimer, W. R., et al. (2000) · ACM SIGARCH Computer Architecture News · doi:10.1145/378995.379239 · Cited by 82
Starobinski, D., Trachtenberg, A., & Agarwal, S. (2003) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2003.1195150 · Cited by 80
Cache-, Hash- and Space-Efficient Bloom Filters
Putze, F., Sanders, P. W., & Singler, J. (2007) · Springer eBooks · doi:10.1007/978-3-540-72845-0_9 · Cited by 80
Phalanx: withstanding multimillion-node botnets
Dixon, C., Anderson, T. E., & Krishnamurthy, A. (2008) · Cited by 79
Multi-user Broadcast Authentication in Wireless Sensor Networks
Ren, K., Lou, W., & Zhang, Y. (2007) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2007.4292834 · Cited by 77
Empirical evaluation of hash functions for multipoint measurements
Henke, C., Schmoll, C., & Zseby, T. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1384609.1384614 · Cited by 69
Bonomi, F., Mitzenmacher, M., Panigrah, R., et al. (2006) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/1159913.1159950 · Cited by 69
Sung, M., Xu, J. E., Li, J., & Li, L. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.911427 · Cited by 61
Flow classification by histograms: or how to go on safari in the internet
Soule, A., Salamatia, K., Taft, N., Emilion, R., & Papagiannaki, K. (2004) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1005686.1005696 · Cited by 61
Aging Bloom Filter with Two Active Buffers for Dynamic Sets
Yoon, M. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.136 · Cited by 51
Towards Stateless Single-Packet IP Traceback
Laufer, R. P., Velloso, P. B., Cunha, D. D. O., Moraes, I. M., Bicudo, M. D. D., Moreira, M., & Duarte, O. C. M. B. (2007) · Conference on Local Computer Networks · doi:10.1109/lcn.2007.15 · Cited by 49
Wong, E. L., Balasubramanian, P., Alvisi, L., Gouda, M. G., & Shmatikov, V. (2007) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1281100.1281123 · Cited by 38
Varghese, G. (2022) · Cited by 26
A stateless approach to connection-oriented protocols
Shieh, A., Myers, A. C., & Sirer, E. G. (2008) · ACM Transactions on Computer Systems · doi:10.1145/1394441.1394444 · Cited by 17
Cited by
Software-Defined Networking: A Comprehensive Survey
Kreutz, D., Ramos, F. M. V., Esteves Verissimo, P., Esteve Rothenberg, C., Azodolmolky, S., & Uhlig, S. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2371999 · Cited by 5,050
Named 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
Lighter: fast and memory-efficient sequencing error correction without counting
Song, L., Florea, L., & Langmead, B. (2014) · Genome Biology · doi:10.1186/preaccept-9663167051308943 · Cited by 258
Kleyko, D., Rachkovskij, D., Osipov, E., & Rahimi, A. (2023) · ACM Computing Surveys · doi:10.1145/3558000 · Cited by 141
Preventing generation of verbatim memorization in language models gives a false sense of privacy
Ippolito, D., Tramer, F., Nasr, M., Zhang, C., Jagielski, M., Lee, K., Choquette Choo, C., & Carlini, N. (2023) · Proceedings of the 16th International Natural Language Generation Conference · doi:10.18653/v1/2023.inlg-main.3 · Cited by 28
“See Tarkoma et al. (2011) for the full calculations, which the ones listed here are taken from.”
Background
Metadata
- Authors
- Tarkoma, S., Rothenberg, C. E., & Lagerspetz, E.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2012
- Volume
- 14
- Issue
- 1
- Pages
- 131-155
- ISSN
- 1553-877X (ISSN-L)
- OpenAlex
- W2074633331
- Cited by
- 518
- References
- 53
- FWCI
- 23.65
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.