By Topic

Reducing Correlated Failures Impact in Peer-to-Peer Storage Systems Using Mobile Agents Flocks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Benoît Romito ; GREYC Lab., Univ. de Caen Basse-Normandie, Caen, France ; François Bourdon

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.

Published in:

Web Intelligence and Intelligent Agent Technology (WI-IAT), 2012 IEEE/WIC/ACM International Conferences on  (Volume:2 )

Date of Conference:

4-7 Dec. 2012