Disclosing the Element Distribution of Bloom Filter
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.
KeywordsHash Function Bloom Filter Short String Original Element Original String
- 2.Andrei, B., Michael, M.: Network Applications of Bloom Filters: A Survey. Internet Math. (4), 485–509 (2003)Google Scholar
- 3.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)Google Scholar
- 4.Eddie, K., Jinyang, L., Vern, P., Scott, S.: Observed Structure of Addresses in IP Traffic. In: Internet Measurement Workshop (2002)Google Scholar