Data Mobility in Peer-to-Peer Systems to Improve Robustness

  • Hugo Pommier
  • François Bourdon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6573)

Abstract

In this paper, we present the design of a robust decentralized peer-to-peer (P2P) platform for data storage. We use Fragmentation Redundancy and Scattering (FRS) mechanism on a file to provide fault tolerance capability, and information availability. To build a fully decentralized system, we consider each fragment of information as an autonomous bio-inspired agent capable to choose his own place of storage (to move from a peer to another peer). To reconstruct a file we have to gather a subset of fragments (defined by a minimal threshold to reconstruct the entire document), thus we have implemented flocking rules to maintain a swarm of fragments. These simple local rules allows us to find just one fragment to steer the whole flock towards a peer in the network. Another issue is the use of all network capabilities. We show in this paper how the flock mobility (based on pheromones) can provide the load distribution, while avoiding suspicious peers.

Keywords

Load Balance Mobile Agent Data Mobility Trust Level Trust Establishment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rowstron, A., Druschel, P.: Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proc. of the 18th ACM Symposium on Operating System Principles (2001)Google Scholar
  2. 2.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Druschel, P., Rowstron, A.: PAST: A large-scale, persistent peer-to-peer storage utility. In: HotOS VIII, Schloss Elmau, Germany, pp. 75–80 (2001)Google Scholar
  4. 4.
    Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., Kubiatowicz, J.: Pond: The oceanstore prototype. In: Proceedings of the Conference on File and Storage Technologies. USENIX (2003)Google Scholar
  5. 5.
    Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proceedings of ACM ASPLOS. ACM (2000)Google Scholar
  6. 6.
    Blomer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., Zuckerman, D.: An xor-based erasure-resilient coding scheme. Technical report, International Computer Science Institute, Berkeley, California (1995)Google Scholar
  7. 7.
    Zhao, B., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley (2001)Google Scholar
  8. 8.
    Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Federrath, H. (ed.) Anonymity 2000. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001)Google Scholar
  9. 9.
    Babaoglu, O., Meling, H., Montresor, A.: Anthill: A framework for the development of agent-based peer-to-peer systems. In: The 22th Int. Conf. on Distributed Computing Systems, Vienna, Austria (2002)Google Scholar
  10. 10.
    Deswarte, Y., Blain, L., Fabre, J.C.: Intrusion tolerance in distributed computing systems. In: IEEE Symposium on Security and Privacy, pp. 110–121 (1991)Google Scholar
  11. 11.
    Fabre, J.C., Deswarte, Y., Randell, B.: Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach. In: Echtle, K., Powell, D.R., Hammer, D. (eds.) EDCC 1994. LNCS, vol. 852, pp. 21–38. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  12. 12.
    Reynolds, C.W.: Flocks, herds and schools: A distributed behavioral model. In: SIGGRAPH 1987: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, pp. 25–34. ACM, New York (1987)CrossRefGoogle Scholar
  13. 13.
    Lindhé, M., Ögren, P., Johansson, K.H.: Flocking with obstacle avoidance: A new distributed coordination algorithm based on voronoi partitions. In: ICRA, pp. 1785–1790 (2005)Google Scholar
  14. 14.
    Gervasi, V., Prencipe, G.: Coordination without communication: the case of the flocking problem. Discrete Applied Mathematics 144, 324–344 (2004)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Wagner, L.: Byzantine agreements in secure communication. In: 5th Operations Research Conference on Secure Communication, ASOR (2003)Google Scholar
  16. 16.
    Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 382–401 (1982)MATHCrossRefGoogle Scholar
  17. 17.
    Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979)MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  19. 19.
    Keeney, R.L., Raiffa, H.: Decisions with multiple objectives: Preferences and value tradeoffs. J. Wiley, New York (1976)Google Scholar
  20. 20.
    Galand, L., Perny, P.: Search for compromise solutions in multiobjective state space graphs. In: ECAI, pp. 93–97 (2006)Google Scholar
  21. 21.
    Harrouet, F., Tisseau, J., Reignier, P., Chevaillier, P.: oris: un environnement de simulation interactive multi-agents. Technique et Science Informatiques 21, 499–524 (2002)Google Scholar
  22. 22.
    Jelasity, M., Babaoglu, O.: T-Man: Gossip-Based Overlay Topology Management. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS (LNAI), vol. 3910, pp. 1–15. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Hugo Pommier
    • 1
  • François Bourdon
    • 1
  1. 1.GREYC Laboratory - UMR 6072University of Caen Basse-NormandieCaen CEDEXFrance

Personalised recommendations