Skip to main content
Log in

Fault-tolerant Resource Discovery in Peer-to-peer Grids

  • Published:
Journal of Grid Computing Aims and scope Submit manuscript

Abstract

Peer-to-peer overlay technologies offer several advantages over centralized solutions to managing desktop Grids. We present a new hybrid approach to resource discovery in P2P Grids, i.e. desktop Grids based on peer-to-peer overlays. This approach combines the advantages of information propagation based on spanning trees in chord-like structured overlays and epidemic algorithms. We provide a mathematical model for predicting the process of information dissemination and verify its prediction quality in various evaluations. Moreover, we show the failure resistance of the proposed approach in several scenarios. In particular, we demonstrate the efficiency of our approach even in scenarios where 50% of the peers in the overlay fail in short time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Anderson, D.P.: BOINC: A system for public-resource computing and storage. In: Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing. Pittsburgh, USA (2004)

  2. Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@home: An experiment in public-resource computing. Commun. ACM 45(11) (2002)

  3. Andrade, N., Cirne, W., Brasileiro, F., Roisenberg, P.: OurGrid: An approach to easily assemble Grids with equitable resource sharing. In: Proceedings of the 9th Workshop on Job Scheduling Strategies for Parallel Processing, the 12th IEEE International Symposium on High Performance Distributed Computing. Seattle, USA (2003)

  4. Castro, M., Jones, M.B., Kermarrec, A.-M., Antony Rowstron, M.T., Wang, H., Wolman, A.: An Evaluation of Scalable Application-level Multicast Built Using Peer-to-Peer Overlays. Infocom 2003, San Francisco, CA (2003)

  5. Chakravarti, A.J., Baumgartner, G., Lauria, M.: The organic Grid: Self-organizing computation on a peer-to-peer network. In: Proceedings of the International Conference on Autonomic Computing (ICAC ’04). New York, NY (2004)

  6. Chien, A., Calder, B., Elbert, S., Bhatia, K.: Entropia: Architecture and performance of an enterprise desktop Grid system. J. Parallel Distrib. Comput. 63(5), 597–610 (2003)

    Article  Google Scholar 

  7. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Scott, S., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database management. In: 6th Annual ACM Symposium on Principles of Distributed Computing (PODC’87). ACM, New York (1987)

    Google Scholar 

  8. distributed.net: The distributed.net Project. http://www.distributed.net. (1997)

  9. El-Ansary, S., Alima, L., Brand, P., Haridi, S.: Efficient broadcast in structured peer-to-peer networks. In: International Workshop on Peer-to-Peer Systems (IPTPS). Berkeley, CA (2003)

  10. Escalante, O., Perez, T., Solano, J., Stojmenovic, I.: RNG-based searching and broadcasting over internet graphs and peer-to-peer computing systems. Technical report, Universidad Nacional Autónoma de México, IIMAS (2002)

  11. Eugster, P.T., Guerraoui, R., Kermarrec, A.-M., Massoulie, L.: From epidemics to distributed computing. IEEE Comput. 37(5), 60–67 (2004)

    Google Scholar 

  12. Fedak, G., Germain, C., Néri, V., Cappello, F.: XtremWeb: A generic global computing system. In: Proceedings of the IEEE International Symposium on Cluster Computing and the Grid (CCGRID). IEEE Press, Piscataway, NJ (2001)

    Google Scholar 

  13. Folding@Home: Folding Home Project Homepage. http://folding.stanford.edu. (2000)

  14. GIMPS: The Great Internet Mersenne Prime Search Project. http://www.mersenne.org/prime.htm. (1996)

  15. Gnutella: Gnutella Protocol v. 0.4. http://www.clip2.com/. (2000)

  16. Gupta, A., Liskov, B., Rodrigues, R.: One hop lookups for peer-to-peer overlays. In: Ninth Workshop on Hot Topics in Operating Systems (HotOS) (2003)

  17. Gupta, I., Kermarrec, A., Ganesh, A.: Efficient epidemic-style protocols for reliable and scalable multicast. In: IEEE International Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society, Washington, DC (2002)

    Google Scholar 

  18. Gupta, R., Somani, A.K.: CompuP2P: An architecture for sharing of computing resources in peer-to-peer networks with selfish nodes. In: Proceedings of the Second Workshop on the Economics of P2P Systems. Harvard University (2004)

  19. Halepovic, E., Deters, R.: The costs of using JXTA. In: P2P ’03: Proceedings of the 3rd International Conference on Peer-to-Peer Computing, p. 160. Washington, DC, USA. IEEE Computer Society, Los Alamitos, CA (2003)

    Google Scholar 

  20. Hauswirth, M., Schmidt, R.: An overlay network for resource discovery in Grids. In: Second International Workshop on Grid and Peer-to-Peer Computing Impacts on Large Scale Heterogeneous Distributed Database Systems (GLOBE’05), in conjunction with the 16th International Conference on Database and Expert Systems Applications (DEXA 2005). Copenhagen, Denmark (2005)

  21. Jelasity, M., Preuss, M., Paechter, B.: A scalable and robust framework for distributed applications. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC) (2002)

  22. JXTA: Project JXTA Community Homepage. http://www.jxta.org/. (2001)

  23. Lin, Marzullo, Masini: Gossip versus deterministically constrained flooding on small networks. In: DISC: International Symposium on Distributed Computing. LNCS (2000)

  24. Oliveira, L., Lopes, L., Silva, F.: P3 : Parallel peer to peer: An internet parallel programming environment. In: Proceedings of the International Workshop on Peer-to-Peer Computing; A workshop co-located with Networking 2002. CNR Research Area, Pisa, Italy (2002)

  25. Oppenheimer, D., Albrecht, J., Patterson, D., Vahdat, A.: Design and implementation tradeoffs for wide-area resource discovery. In: Proceedings of the 14th IEEE Symposium on High Performance Distributed Computing (HPDC-14) (2005)

  26. Portmann, M., Seneviratne, A.: Cost-effective broadcast for fully decentralized peer-to-peer networks. Comput. Commun. 26(11), 1159–1167 (2003)

    Article  Google Scholar 

  27. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. Tech. Report TR-00-010, Berkeley, CA (2000)

  28. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: 18th IFIP/ACM International Conference on Distributed Systems Platforms (2001)

  29. Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: HyperCuP - hypercubes, ontologies and P2P networks. In: Agents and Peer-to-Peer Computing, First International Workshop, AP2PC 2002, vol. 2530 of Lecture Notes in Computer Science, pp. 112–124. Springer, Berlin Heidelberg New York (2002)

    Google Scholar 

  30. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Guerin, R. (ed.) Proceedings of the ACM SIGCOMM 2001 Conference (SIGCOMM-01), vol. 31, 4 of Computer Communication Review, pp. 149–160. ACM, New York (2001)

    Google Scholar 

  31. Taylor, I., Shields, M., Wang, I.: Resource management of triana P2P services. In: Nabrzyski, J., Schopf, J.M., Wȩglarz, J. (eds.) Grid Resource Management, pp. 451–462. Kluwer, Boston, MA (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Merz.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Merz, P., Gorunova, K. Fault-tolerant Resource Discovery in Peer-to-peer Grids. J Grid Computing 5, 319–335 (2007). https://doi.org/10.1007/s10723-006-9057-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10723-006-9057-1

Key words

Navigation