Benoît Romito

  • Citations Per Year
Learn More
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(More)
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.(More)
  • 1