BIO-INSPIRED DATA PLACEMENT IN PEER-TO-PEER NETWORKS - Benefits of using Multi-agents Systems

Hugo Pommier, Benoît Romito, François Bourdon

2010

Abstract

In this paper we present the benefits of using a multi-agents system to manage the data placement in a decentralized storage application. In our model, after a fragmentation step, each piece of data is associated to a mobile agent making its own decisions. To manage agents placement, we apply flocking rules in a peer-to-peer network called SCAMP. Each agent follows simple rules and the emerging behavior is a flock of fragments. To provide an efficient load-balancing, agents drop pheromones among network peers. We made some experiments to measure the cohesion degree of our flock and to measure the network coverage of a flock. We also discuss about availability and reliability of our approach.

References

  1. Bakkaloglu, M., Wylie, J. J., Wang, C., and Ganger, G. R. (2002). On correlated failures in survivable storage systems. Technical Report CMU-CS-02-129, Carnegie Mellon University.
  2. Douceur, J. and Wattenhofer, R. (2001). Competitive hillclimbing strategies for replica placement in a distributed file system. In Proceedings of the 15th International Conference on Distributed Computing, pages 48-62, London, UK. Springer-Verlag.
  3. Druschel, P. and Rowstron, A. (2001). PAST: A large-scale, persistent peer-to-peer storage utility. Workshop on Hot Topics in Operating Systems, pages 75-80.
  4. Duminuco, A. and Biersack, E. (2008). Hierarchical codes: How to make erasure codes attractive for peer-to-peer storage systems. IEEE International Conference on Peer-to-Peer Computing, pages 89-98.
  5. Erdo?s, P. and Rényi, A. (1959). On random graphs. I. In Publicationes Mathematicae Debrecen, pages 290- 297.
  6. Erdo?s, P. and Rényi, A. (1960). On the evolution of random graphs. In Publications of the Mathematical Institute of the Hungarian Academy of Sciences, pages 17-61.
  7. Ganesh, A. J., Kermarrec, A.-M., and Massoulié, L. (2001). Scamp: Peer-to-peer lightweight membership service for large-scale group communication. In Proceedings of the 3rd International Workshop Networked Group Communication, pages 44-55, London, UK.
  8. Ganesh, A. J., Kermarrec, A.-M., and Massoulié, L. (2003). Peer-to-peer membership management for gossipbased protocols. IEEE Transactions on Computers, 52(2):139-149.
  9. Ghemawat, S., Gobioffd, H., and Leung, S.-T. (2003). The google file system. In Proceedings of the 19th ACM Symposium on Operating Systems Principles, pages 29-43, New York, NY, USA.
  10. Giroire, F., Monteiro, J., and Pérennes, S. (2009). P2P storage systems: How much locality can they tolerate? In Proceedings of the 34th IEEE Conference on Local Computer Networks (LCN), pages 320-323.
  11. Haeberlen, A., Mislove, A., and Druschel, P. (2005). Glacier: highly durable, decentralized storage despite massive correlated failures. In Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation, pages 143-158, Berkeley, CA, USA. USENIX Association.
  12. Kermarrec, A.-M., Massoulié, L., and Ganesh, A. J. (2003). Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems, 14(3):248-258.
  13. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. (2000). Oceanstore: an architecture for globalscale persistent storage. ACM SIGPLAN Notices, 35(11):190-201.
  14. Lian, Q., Chen, W., and Zhang, Z. (2005). On the impact of replica placement to the reliability of distributed brick storage systems. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, pages 187-196, Washington, DC, USA. IEEE Computer Society.
  15. Lin, W. K., Chiu, D. M., and Lee, Y. B. (2004). Erasure code replication revisited. In Proceedings of the 4th International Conference on Peer-to-Peer Computing, pages 90-97, Washington, DC, USA. IEEE Computer Society.
  16. Plank, J. S. (1996). A tutorial on reed-solomon coding for fault-tolerance in raid-like systems. Technical Report CS-96-332, University of Tennessee.
  17. Reynolds, C. W. (1987). Flocks, herds and schools: A distributed behavioral model. In Proceedings of the 14th annual conference on Computer graphics and interactive techniques, pages 25-34. ACM.
  18. Weatherspoon, H. and Kubiatowicz, J. (2002). Erasure coding vs. replication: A quantitative comparison. In Proceedings of the 1st International Workshop on Peer-toPeer Systems, pages 328-338, London, UK. SpringerVerlag.
  19. Weatherspoon, H., Moscovitz, T., and Kubiatowicz, J. (2002). Introspective failure analysis: Avoiding correlated failures in peer-to-peer systems. In Proceedings of the 21st Symposium on Reliable Distributed Systems, pages 362-367, Los Alamitos, CA, USA. IEEE Computer Society.
Download


Paper Citation


in Harvard Style

Pommier H., Romito B. and Bourdon F. (2010). BIO-INSPIRED DATA PLACEMENT IN PEER-TO-PEER NETWORKS - Benefits of using Multi-agents Systems . In Proceedings of the 6th International Conference on Web Information Systems and Technology - Volume 1: WEBIST, ISBN 978-989-674-025-2, pages 319-324. DOI: 10.5220/0002854703190324


in Bibtex Style

@conference{webist10,
author={Hugo Pommier and Benoît Romito and François Bourdon},
title={BIO-INSPIRED DATA PLACEMENT IN PEER-TO-PEER NETWORKS - Benefits of using Multi-agents Systems},
booktitle={Proceedings of the 6th International Conference on Web Information Systems and Technology - Volume 1: WEBIST,},
year={2010},
pages={319-324},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002854703190324},
isbn={978-989-674-025-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Web Information Systems and Technology - Volume 1: WEBIST,
TI - BIO-INSPIRED DATA PLACEMENT IN PEER-TO-PEER NETWORKS - Benefits of using Multi-agents Systems
SN - 978-989-674-025-2
AU - Pommier H.
AU - Romito B.
AU - Bourdon F.
PY - 2010
SP - 319
EP - 324
DO - 10.5220/0002854703190324