Abstract
An algorithm named Reconstruction based on Semantically Enhanced Counting Bloom Filter (RSECBF) was proposed to disclose the distribution of original element from semantically enhanced Counting Bloom Filter’s hash space. The algorithm deploys DBSM, which directly selects some bits from original string as the reversible hash function. The overlapping of hash bit strings in this paper brings the ability to confirm the homogenetic hash strings. The efficiency of RSECBF in the principal component analysis was verified by the DDoS detection in a published trace.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Burton, H.B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Andrei, B., Michael, M.: Network Applications of Bloom Filters: A Survey. Internet Math. (4), 485–509 (2003)
Robert, S., Ashish, G., Elliot, P., Yan, C.: Reversible Sketches for Efficient and Accurate Change Detection over Network Data Streams. In: IMC 2004, Taormina, Sicily, Italy, pp. 207–212 (2004)
Eddie, K., Jinyang, L., Vern, P., Scott, S.: Observed Structure of Addresses in IP Traffic. In: Internet Measurement Workshop (2002)
Fabrizio, A., Clara, P.: Outlier Mining in Large High-Dimensional Data Sets. IEEE Transactions on Knowledge and Data Engineering 17(2), 203–215 (2005)
http://www.caida.org/data/passive/backscatter_tocs_dataset.xml
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, Y., Gong, J., Yang, W., Liu, W. (2006). Disclosing the Element Distribution of Bloom Filter. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758501_163
Download citation
DOI: https://doi.org/10.1007/11758501_163
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34379-0
Online ISBN: 978-3-540-34380-6
eBook Packages: Computer ScienceComputer Science (R0)