Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Observations on the Dynamic Evolution of Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Canon in G Major: Designing DHTs with Hierarchical Structure
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Computer Networks: The International Journal of Computer and Telecommunications Networking
ML-Chord: A multi-layered P2P resource sharing model
Journal of Network and Computer Applications
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Probabilistic file indexing and searching in unstructured peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hybrid overlay structure based on random walks
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
The case for a hybrid p2p search infrastructure
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A construction of locality-aware overlay network: mOverlay and its performance
IEEE Journal on Selected Areas in Communications
Journal of Network and Computer Applications
A hierarchical overlay with cluster-based reputation tree for dynamic peer-to-peer systems
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Decentralized peer-to-peer (P2P) systems can be classified into unstructured and structured. The former is easy to implement, and often simply uses flooding for search, which can be effective only when target objects are popular or nearby. The latter requires peers to cooperate closely to maintain an overlay topology so as to ensure an efficient routing path between any two nodes. Recently, a hybrid use of both paradigms has gained its popularity in several popular file sharing tools to take advantage of each. What is lacking, and thus the purpose of the paper, is a fully decentralized algorithm to build such hybrid systems, as existing methods often require human intervention and some centralized gateway to select peers and guide them to build the structured overlay. The challenges include how to ensure that only one connected overlay is constructed in the lack of any global knowledge, and that only stable peers are selected for the structured overlay so as to reduce its maintenance cost. In addition, the construction must be efficient, scalable, robust, and easy to implement in a highly dynamic environment.