Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
IEEE Internet Computing
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Hint-based Routing in WSNs using Scope Decay Bloom Filters
IWNAS '06 Proceedings of the 2006 International Workshop on Networking, Architecture, and Storages
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
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
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Skyline-based Peer-to-Peer Top-k Query Processing
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Accelerating Lookups in P2P Systems using Peer Caching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
False Negative Problem of Counting Bloom Filter
IEEE Transactions on Knowledge and Data Engineering
Scalable DHT- and ontology-based information service for large-scale grids
Future Generation Computer Systems
FRDT: Footprint Resource Discovery Tree for grids
Future Generation Computer Systems
A new distributed and hierarchical mechanism for service discovery in a grid environment
Future Generation Computer Systems
Network-aware summarisation for resource discovery in P2P-content networks
Future Generation Computer Systems
QoS enhancements for global replication management in peer to peer networks
Future Generation Computer Systems
A DHT-based semantic overlay network for service discovery
Future Generation Computer Systems
A novel data replication mechanism in P2P VoD system
Future Generation Computer Systems
Capacity and load-aware service discovery with service selection in peer-to-peer grids
Future Generation Computer Systems
Overlay network resource allocation using a decentralized market-based approach
Future Generation Computer Systems
Scheduling efficiency of resource information aggregation in grid networks
Future Generation Computer Systems
Overlay network resource allocation using a decentralized market-based approach
Future Generation Computer Systems
| Hi-index | 0.00 |
Resource discovery in large-scale Peer-to-Peer (P2P) networks is challenging due to lack of effective methods for guiding queries. Based on the observation that the effectiveness of P2P resource discovery is determined by the utilization of hints, i.e., a summary of where the resources are, scattered in the network, in this paper we propose the distance-aware bloom filters (DABF) that disseminate hint information to faraway nodes by decaying BFs with different deterministic masks. Based on DABF, we design a novel Collaborative P2P Search (CPS) mechanism, which supports intelligent message behaviors including suspend, resume, terminate, move, reside, dispatch, notify and order. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations, in which we observed a remarkable reduction in search latency over previous approaches.