A multi-attribute data structure with parallel bloom filters for network services
DOI: 10.1007/11945918_30
关键词:
摘要: A Bloom filter has been widely utilized to represent a set of items because it is simple space-efficient randomized data structure. In this paper, we propose new structure support the representation with multiple attributes based on filters. The composed Parallel Filters (PBF) and hash table accurate efficient query items. PBF counter-based matrix consists submatrixes. Each submatrix can store one attribute an item. as auxiliary captures verification value item, which reflect inherent dependency all for Because correct item becomes complicated, use two-step process ensure presence particular reduce false positive probability.
springer.com
core.ac.uk
sci-hub.st 参考文章(18)
A. Kumar, Jun Xu, E.W. Zegara, Efficient and scalable query routing for unstructured peer-to-peer networks international conference on computer communications. ,vol. 2, pp. 1162- 1173 ,(2005) , 10.1109/INFCOM.2005.1498343
Andrei Broder, Michael Mitzenmacher, Network Applications of Bloom Filters: A Survey Internet Mathematics. ,vol. 1, pp. 485- 509 ,(2004) , 10.1080/15427951.2004.10129096
Abhishek Kumar, Jun Xu, Li Li, Jia Wang, None, Space-code bloom filter for efficient traffic flow measurement internet measurement conference. pp. 167- 172 ,(2003) , 10.1145/948205.948226
Saar Cohen, Yossi Matias, Spectral bloom filters international conference on management of data. pp. 241- 252 ,(2003) , 10.1145/872757.872787
Bin Xiao, Wei Chen, Yanxiang He, E.H.-M. Sha, An active detecting method against SYN flooding attack international conference on parallel and distributed systems. ,vol. 1, pp. 709- 715 ,(2005) , 10.1109/ICPADS.2005.67
F.M. Cuenca-Acuna, C. Peery, R.P. Martin, T.D. Nguyen, PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities high performance distributed computing. pp. 236- 246 ,(2003) , 10.1109/HPDC.2003.1210033
Florin Baboescu, George Varghese, Scalable packet classification Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '01. ,vol. 31, pp. 199- 210 ,(2001) , 10.1145/383059.383075
A. Broder, M. Mitzenmacher, Using multiple hash functions to improve IP lookups international conference on computer communications. ,vol. 3, pp. 1454- 1463 ,(2001) , 10.1109/INFCOM.2001.916641
Wu-Chang Feng, D.D. Kandlur, D. Saha, K.G. Shin, Stochastic fair blue: a queue management algorithm for enforcing fairness international conference on computer communications. ,vol. 3, pp. 1520- 1529 ,(2001) , 10.1109/INFCOM.2001.916648
Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors Communications of the ACM. ,vol. 13, pp. 422- 426 ,(1970) , 10.1145/362686.362692