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
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Looking up data in P2P systems
Communications of the ACM
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
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Kademlia for data storage and retrieval in enterprise networks
COLCOM '07 Proceedings of the 2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing
OverCite: a cooperative digital research library
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Distributed Hash Tables (DHTs) provide a flexible and reliable infrastructure for data storage and retrieval in peer-to-peer communities. We propose to apply Kademlia DHT to organize data management and cooperation between users participating in different work-groups. Particularly, in this paper we propose a mechanism for increasing the resilience and the overall performance of a Kademlia-based distributed work-sharing system, taking into account frequent joins and leaves of network nodes. To achieve this goal we propose a new flexible scheme for resource management that provides more resilience and fault tolerance than other mechanisms used by existent cooperative storage systems with a collaborative nature. In this work we try to extend and generalize our solution to fit several application contexts of collaborative computing, thereby addressing some common problems about resilience of existent distributed collaborative systems.