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
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
The Essence of P2P: A Reference Architecture for Overlay Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
The hybrid chord protocol: a peer-to-peer lookup service for context-aware mobile applications
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Hi-index | 0.00 |
In this paper we present a hybrid design concept for Distributed Hash Tables (DHTs), in order to increase the performance of DHTs in scenarios with mobile participants. By defining two classes of nodes (static and temporary) and assigning critical overlay networking tasks to reliable static nodes, our concept allows the disburdening of resource-constrained temporary nodes such as PDAs or mobile phones. Further we present an implementation of our system design, based on the Chord protocol, in the Network Simulator 2 (NS-2) and in the overlay simulator L7Sim and show simulation results that prove the significant advantages of our extension in comparison to conventional DHTs.