Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
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
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
Introspective Failure Analysis: Avoiding Correlated Failures in Peer-to-Peer Systems
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed 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
Farsite: federated, available, and reliable storage for an incompletely trusted environment
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
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
Subtleties in tolerating correlated failures in wide-area storage systems
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
On correlated availability in Internet-distributed systems
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Pond: the oceanstore prototype
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
Repairing Flocks in Peer-to-Peer Networks
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper introduces MinCor (Minimum of Correlations), a decentralized simulated annealing algorithm designed for the data placement in peer-to-peer networks. Its goal is to reduce the correlated failures impact in such data storage systems. This data placement is realized using a multi-agent system which turns the documents into mobile agents flocks. After a network clustering step where highly correlated peers are regrouped together, the flocks executing MinCor are able to find a placement minimizing the number of agents on the same clusters. This placement is obtained in a decentralized way thanks to the environment exploration capabilities of the flocks. A set of experiments are performed on this system in presence of correlated failures. They show that, in practice, the expected placement is well obtained. They also show that, flocks using the MinCor algorithm suffer less simultaneous losses in presence of correlated failures than a mere random placement.