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
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Estimating network size from local information
Information Processing Letters
Canon in G Major: Designing DHTs with Hierarchical Structure
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A Robust Protocol for Building Superpeer Overlay Topologies
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Cyclone: A Novel Design Schema for Hierarchical DHTs
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Cost-Based Analysis of Hierarchical DHT Design
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Debunking some myths about structured and unstructured overlays
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
On hierarchical DHT systems - An analytical approach for optimal designs
Computer Communications
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Load balancing in a hierarchical DHT-based P2P system
COLCOM '07 Proceedings of the 2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing
Discovery of stable peers in a self-organising peer-to-peer gradient topology
DAIS'06 Proceedings of the 6th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Providing administrative control and autonomy in structured peer-to-peer overlays
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Performance impacts of node failures on a chord-based hierarchical peer-to-peer network
EUNICE'10 Proceedings of the 16th EUNICE/IFIP WG 6.6 conference on Networked services and applications: engineering, control and management
Resource discovery service while minimizing maintenance overhead in hierarchical DHT systems
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
| Hi-index | 0.00 |
Although hierarchical P2P systems have been found to outperform flat systems in many respects, current P2P research does not focus on strategies to build and maintain such systems. Available solutions assume either no or little coordination between peers, that could lead the system toward satisfying a globally defined goal (e.g., minimizing traffic). In this paper we focus on hierarchical DHTs and provide a full set of algorithms to build and maintain such systems, that mitigate this problem. In particular, given the goal state of minimizing the total traffic without overloading any peer, our algorithms dynamically adjust the system state as to keep the goal met at any time. The algorithms are fully decentralized and probabilistic, all decisions taken by the peers are based on their partial view on a set of system wide parameters. Thus, they demonstrate the main principle of self-organization - the system behavior emerges from local interactions. Our simulations, run in a range of realistic settings, confirm a good performance of the algorithms.