Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-likeSystems
A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-likeSystems
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Glacier: highly durable, decentralized storage despite massive correlated failures
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Reducing Correlated Failures Impact in Peer-to-Peer Storage Systems Using Mobile Agents Flocks
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
| Hi-index | 0.00 |
In this paper we consider the problem of reliable and robust data storage in peer-to-peer networks. The approach we follow builds a multi-agents system in which documents are split using a (m,n)-erasure code. Each generated fragment is embedded into an autonomous and mobile agent. This mobility gives them, for example, the ability to choose the network area where they want to be hosted. But this motion may have heavy consequences on the system robustness if the initial fragmentation parameters of a document are inappropriate. As a consequence, we focus on the problem of finding the suitable m and n values to apply to a document given the underlying peer-to-peer network properties.