Constructing Efficient and Fault-Tolerant Unstructured Peer-To-Peer Networks
Explore this paper's citation graph
Summary
It is shown that a well-connected overlay for unstructured P2P systems can be fault tolerant and support efficient searches, and that a realistic hybrid algorithm generates overlays that have low communication costs as well as have the high expansion and connectivity required to support efficient search.
- Type
- article
- Published
- 2005-04-20
- Cited by
- 0
- References
- 38
- Access
- Open access
- OpenAlex
- https://openalex.org/W2561097
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:14634224
Keywords
Computer science, Peer-to-peer, Computer security, Distributed computing
References
- Algebraic connectivity of graphs
- Eigenvalues and expanders
- Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design
- Edge-disjoint paths in expander graphs
- Optimal construction of edge-disjoint paths in random regular graphs
- Search and replication in unstructured peer-to-peer networks
- Epidemic algorithms for replicated database maintenance
- Isoperimetric Inequalities and Eigenvalues
- Eigenvalues and expansion of regular graphs
- Generating Random Regular Graphs
- On the second eigenvalue and random walks in randomd-regular graphs
- Spectral Analysis of (Sequences of) Graph Matrices
- The impact of DHT routing geometry on resilience and proximity
- OceanStore: an architecture for global-scale persistent storage
- Mean-field theory for scale-free random networks
- Space/time trade-offs in hash coding with allowable errors
- Distributed construction of random expander networks
- SplitStream: high-bandwidth multicast in cooperative environments
- Exploiting epidemic data dissemination for consistent lookup operations in mobile applications
- The power of epidemics: robust communication for large-scale distributed systems
Cited by
No citing papers recorded for this paper.
Related papers
- EFFICIENT SEARCH ALGORITHM DESIGN FOR UNSTRUCTURED PEER-TO-PEER NETWORKS
- An Efficient Topology Search Mechanism for Unstructured Peer- To-Peer Networks
- Storage Algorithm for Unstructured Peer-to-Peer Networks
- A Scalable Search Algorithm for Unstructured Peer-to-Peer Networks
- ISE02-2: Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
- Dynamic Search Algorithm used in Unstructured Peer-to-Peer Networks
- Reliable and Fault-Tolerant Peer-to-Peer Block Storage
- Proximity aware overlays in peer-to-peer networks