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
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Network Coding Fundamentals
DEUS: a discrete event universal simulator
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Malugo: A peer-to-peer storage system
International Journal of Ad Hoc and Ubiquitous Computing
Network coding for distributed storage systems
IEEE Transactions on Information Theory
High availability in DHTs: erasure coding vs. replication
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
IEEE Transactions on Information Theory
Decentralized erasure codes for distributed networked storage
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Incentives for large peer-to-peer systems
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we propose a novel decentralized resource maintenance strategy for peer-to-peer (P2P) distributed storage networks. Our strategy relies on the Wuala overlay network architecture, (The WUALA Project). While the latter is based, for the resource distribution among peers, on the use of erasure codes, e.g., Reed-Solomon codes, here we investigate the system behavior when a simple randomized network coding strategy is applied. We propose to replace the Wuala regular and centralized strategy for resource maintenance with a decentralized strategy, where users regenerate new fragments sporadically, namely every time a resource is retrieved. Both strategies are analyzed, analytically and through simulations, in the presence of either erasure and network coding. It will be shown that the novel sporadic maintenance strategy, when used with randomized network coding, leads to a fully decentralized solution with management complexity much lower than common centralized solutions.