Optimal Semijoins for Distributed Database Systems
IEEE Transactions on Software Engineering
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Geographical region summary service for geographical routing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
An architecture for secure wide-area service discovery
Wireless Networks - Selected Papers from Mobicom'99
IEEE/ACM Transactions on Networking (TON)
The Bloomier filter: an efficient data structure for static support lookup tables
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bringing Efficient Advanced Queries to Distributed Hash Tables
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Location Awareness in Unstructured Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
Self-organization in peer-to-peer systems
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Fast statistical spam filter by approximate classifications
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Approximately detecting duplicates for streaming data using stable bloom filters
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
On the Signature Tree Construction and Analysis
IEEE Transactions on Knowledge and Data Engineering
Beyond bloom filters: from approximate membership checks to approximate state machines
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Building high accuracy bloom filters using partitioned hashing
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Building a Scalable Bipartite P2P Overlay Network
IEEE Transactions on Parallel and Distributed Systems
A Two-Hop Solution to Solving Topology Mismatch
IEEE Transactions on Parallel and Distributed Systems
Nonthreshold-Based Event Detection for 3D Environment Monitoring in Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Underground coal mine monitoring with wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Virtual surrounding face geocasting in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
A Generalized Bloom Filter to Secure Distributed Network Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distance-aware bloom filters: Enabling collaborative search for efficient resource discovery
Future Generation Computer Systems
| Hi-index | 0.00 |
Bloom filter (BF) is a space-efficient data structure that represents a large set of items and supports efficient membership queries. It has been widely proposed to employ Bloom filters in the routing entries so as to facilitate data-centric routing in network applications. The existing designs of Bloom filters, however, cannot effectively support in-network queries. Given a query for a data item at a node in the network, the noise in unrelated routing entries very likely equals to the useful information of the item in the right routing entries. Consequently, the majority of queries are routed towards many wrong nodes besides those destinations, wasting large quantities of network traffic. To address this issue, we classified the existing designs as CUBF (Cumulative Bloom filters) and ABF (Aggregated Bloom filters), and then evaluate their performance in routing queries under the noisy environments. Based on the evaluation results, we propose a receiver-oriented design of Bloom filters to sufficiently restrict the probability of a wrong routing decision. Moreover, we significantly decrease the delay of a routing decision in the case of CUBF by using the bit slice approach, and reduce the transmission size of each BF in the case of ABF by using the compression approach. Both the theoretical analysis and experimental results demonstrate that our receiver-oriented design of Bloom filters apparently outperforms the existing approaches in terms of the success probability of routing and network traffic cost.