Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
IEEE Internet 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
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tailoring service discovery to embedded P2P systems
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
Behavioral modeling and formal verification of a resource discovery approach in Grid computing
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In this paper, we present a new model for a peer-to-peer system based on Chord, called Hybrid-Chord, to improve the routing performance and data availability of Chord Our main focus is on reducing the number of hops that is needed to locate a data item Through simulations, we demonstrate the improvement of the routing performance and fault tolerance capabilities of the proposed system and compare that with the original Chord system The hybrid system can reduce the number of lookup hops significantly by up to 50% compared to Chord, is robust and handles node failures better than Chord, can always find the desired data with high probability and has better data availability than Chord Above all, the hybrid system has same complexity as Chord.