A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
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
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
First response communication sandbox
Proceedings of the 11th communications and networking simulation symposium
PlanetSim: a new overlay network simulation framework
SEM'04 Proceedings of the 4th international conference on Software Engineering and Middleware
| Hi-index | 0.00 |
Hierarchically structured organizations have clear and relatively short communication paths. However, one does not take advantage of this fact in modern peer-to-peer overlays. We show how a command and control order can be imposed on a given peer-to-peer network. This allows fast hierarchical data storage and data access. Maintaining a hierarchical organization structure upon a given distributed hashtable overlay network scales with O(logN), where N is the number of peers in the network. This approach can be used to benefit from hierarchical structure in any communication system, especially in first response scenarios.