Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Distributed Pagerank for P2P Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Sampling regular graphs and a peer-to-peer network
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Proof: A DHT-Based Peer-to-Peer Search Engine
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Practical summation via gossip
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Expansion properties of a random regular graph after random vertex deletions
European Journal of Combinatorics
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Practical summation via gossip
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Efficiency of random walks for search in different network structures
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast track article: Enabling opportunistic storage for mobile DTNs
Pervasive and Mobile Computing
HRS: A Hybrid Replication Strategy for Exhaustive P2P Search
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Efficiency of Search Methods in Dynamic Wireless Networks
Wireless Systems and Mobility in Next Generation Internet
Maintaining replicas in unstructured P2P systems
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
PUB-2-SUB: A Content-Based Publish/Subscribe Framework for Cooperative P2P Networks
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
BloomCast: Efficient Full-Text Retrieval over Unstructured P2Ps with Guaranteed Recall
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
ROAR: increasing the flexibility and performance of distributed search
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Probably Approximately Correct Search
ICTIR '09 Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory
Proactive Uniform Data Replication by Density Estimation in Apollonian P2P Networks
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
Challenges for Routing and Search in Dynamic and Self-organizing Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimally efficient multicast in structured peer-to-peer networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Enabling content-based publish/subscribe services in cooperative P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Channel-based unidirectional stream protocol (CUSP)
INFOCOM'10 Proceedings of the 29th conference on Information communications
A content-guided publish/subscribe mechanism for sensor networks without location information
Computer Communications
Zone indexing: Optimizing the balance between searching and indexing in a loosely structured overlay
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quasar: a probabilistic publish-subscribe system for social networks
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
SplitQuest: controlled and exhaustive search in peer-to-peer networks
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
PathFinder: efficient lookups and efficient search in peer-to-peer networks
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Weak state routing for large-scale dynamic networks
IEEE/ACM Transactions on Networking (TON)
Peer-to-peer web search: euphoria, achievements, disillusionment, and future opportunities
From active data management to event-based systems and more
Distributed SQL queries with BubbleStorm
From active data management to event-based systems and more
Designing a testbed for large-scale distributed systems
Proceedings of the ACM SIGCOMM 2011 conference
An online gaming testbed for peer-to-peer architectures
Proceedings of the ACM SIGCOMM 2011 conference
Cooperation in static and mobile sensor-based platforms for situation, activity and goal awareness
Proceedings of the 2011 international workshop on Situation activity & goal awareness
On the feasibility of unstructured peer-to-peer information retrieval
ICTIR'11 Proceedings of the Third international conference on Advances in information retrieval theory
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
STAIRS: Towards efficient full-text filtering and dissemination in DHT environments
The VLDB Journal — The International Journal on Very Large Data Bases
Rendezvous based trust propagation to enhance distributed network security
International Journal of Security and Networks
Improving query correctness using centralized probably approximately correct (PAC) search
ECIR'2010 Proceedings of the 32nd European conference on Advances in Information Retrieval
iTrust: trustworthy information publication, search and retrieval
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Publish-subscribe systems via gossip: a study based on complex networks
Proceedings of the Fourth Annual Workshop on Simplifying Complex Networks for Practitioners
A mathematical model for human flesh search engine
APWeb'12 Proceedings of the 14th international conference on Web Technologies and Applications
A hierarchical approach to improve performance of unstructured peer-to-peer system
International Journal of Communication Networks and Distributed Systems
Distance-aware bloom filters: Enabling collaborative search for efficient resource discovery
Future Generation Computer Systems
Gossiping for resource discovering: An analysis based on complex network theory
Future Generation Computer Systems
Generation of synthetic workloads for multiplayer online gaming benchmarks
Proceedings of the 11th Annual Workshop on Network and Systems Support for Games
The state of peer-to-peer network simulators
ACM Computing Surveys (CSUR)
Decentralized monitoring in peer-to-peer systems
Benchmarking Peer-to-Peer Systems
As-Soon-As-Possible top-k query processing in p2p systems
Transactions on Large-Scale Data- and Knowledge-centered systems IX
Cooperation as a service in VANET: Implementation and simulation results
Mobile Information Systems
| Hi-index | 0.00 |
Peer-to-peer systems promise inexpensive scalability, adaptability, and robustness. Thus, they are an attractive platform for file sharing, distributed wikis, and search engines. These applications often store weakly structured data, requiring sophisticated search algorithms. To simplify the search problem, most scalable algorithms introduce structure to the network. However, churn or violent disruption may break this structure, compromising search guarantees. This paper proposes a simple probabilistic search system, BubbleStorm, built on random multigraphs. Our primary contribution is a flexible and reliable strategy for performing exhaustive search. BubbleStorm also exploits the heterogeneous bandwidth of peers. However, we sacrifice some of this bandwidth for high parallelism and low latency. The provided search guarantees are tunable, with success probability adjustable well into the realm of reliable systems. For validation, we simulate a network with one million low-end peers and show BubbleStorm handles up to 90% simultaneous peer departure and 50% simultaneous crash.