Journal of Grid Computing

, Volume 5, Issue 3, pp 337–360 | Cite as

Enhancing Computational Grids with Peer-to-Peer Technology for Large Scale Service Discovery

  • Eddy Caron
  • Frédéric Desprez
  • Cédric TedeschiEmail author


Within computational Grids, some services (typically software components, e.g., linear algebra libraries) are made available by some servers to some clients. In spite of the growing popularity of such Grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. Whereas merging peer-to-peer technology and Grid infrastructures has been widely suggested, very few implementations are available. The contribution of this paper is twofold. First, we present the design, the implementation and the experimentation of the first architecture, to our knowledge, extending traditional Network-Enabled Servers (NES) systems with an unstructured peer-to-peer network. This extension allows to dynamically connect distributed agents thus providing to clients an entry point to servers geographically distributed. Our implementation is based on the Diet middleware and the JXTA toolbox and experimentation have been conducted on a high speed network. Then, we study the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the peer-to-peer service discovery service, supporting range queries while providing fault-tolerance and taking into account the topology of the underlying network. We validate this approach both by analysis and simulation.

Key words

computational Grids peer-to-peer systems service discovery network-enabled servers JXTA 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andrzejak, A., Xu, Z.: Scalable, efficient range queries for Grid information services. In: Proceedings of 2nd IEEE International Conference on Peer-to-Peer Computing, Linköping, Sweden, pp. 33–40 (2002)Google Scholar
  2. 2.
    Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 384–393, January 2003Google Scholar
  3. 3.
    Balazinska, M., Balakrishnan, H., Karger, D.: INS/Twine: a scalable peer-to-peer architecture for intentional resource discovery. In: International Conference on Pervasive Computing, August 2002Google Scholar
  4. 4.
    Basu, S., Banerjee, S., Sharma, P., Lee, S.: NodeWiz: peer-to-peer resource discovery for Grids. In: 5th International Workshop on Global and Peer-to-Peer Computing (GP2PC) in conjunction with CCGrid, Cardiff, UK, May 2005Google Scholar
  5. 5.
    Cai, M., Frank M., Chen J., Szekely, P.: MAAN: a multi-attribute addressable network for Grid information services. In: Proceedings of the Fourth International Workshop on Grid Computing, GRID’03, Phoenix, Arizona (2003)Google Scholar
  6. 6.
    Caron, E., Desprez, F., Lombard, F., Nicod, J.-M., Quinson, M., Suter, F.: A scalable approach to network enabled servers. In: Proceedings of EuroPar, Paderborn, Germany (2002)Google Scholar
  7. 7.
    Caron, E., Desprez, F., Petit, F., Villain, V.: A hierarchical resource reservation algorithm for network enabled servers. In: IPDPS’03. The 17th International Parallel and Distributed Processing Symposium (2003)Google Scholar
  8. 8.
    Chang, E.J.H.: Echo Algorithms: depth parallel operations on general graphs. IEEE Trans. Softw. Eng. 8, 391–401 (1982)CrossRefGoogle Scholar
  9. 9.
    Datta, A., Hauswirth, M., John, R., Schmidt, R., Aberer, K.: Range queries in trie-structured overlays. In: The Fifth IEEE International Conference on Peer-to-Peer Computing (2005)Google Scholar
  10. 10.
    Dongarra, J.J., Du Croz, J., Hammarling, S., Duff, I.S.: A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Software 16(1), 1–17 (1990)zbMATHCrossRefGoogle Scholar
  11. 11.
    Foster, I., Iamnitchi, A.: On death, taxes, and the convergence of peer-to-peer and Grid computing. In: Second International Workshop on Peer-to-Peer Systems, pp. 118–128. Berkeley, CA, 21-22, February 2003Google Scholar
  12. 12.
    Garces-Erice, L., Biersack, E.W., Ross, K.W., Felber, P.A., Urvoy-Keller, G.: Hierarchical peer-to-peer systems. Parallel Process. Lett. 13(4), 643–657 (2003)CrossRefGoogle Scholar
  13. 13.
    Garces-Erice, L., Felber, P.A., Ross, K.W., Urvoy-Keller, G.: Data indexing in peer-to-peer DHT networks. In: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS-24), Tokyo, Japan, March 2004Google Scholar
  14. 14.
    Godfrey, B., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in dynamic structured P2P systems. In: Proceedings Twenty-third Annual Joint Conference of the IEEE Computer and Communications (INFOCOM), Hong Kong (2004)Google Scholar
  15. 15.
    Harren, M., Hellerstein, J., Huebsch, R., Loo, B., Shenker, S., Stoica, I.: Complex queries in DHT-based peer-to-peer networks. In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York (2002)Google Scholar
  16. 16.
    Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: 3rd International Workshop on Peer-to-Peer Systems (IPTPS), pp. 131–140 (2004)Google Scholar
  17. 17.
    Ledlie, J., Seltzer, M.: Distributed, secure load balancing with skew, heterogeneity, and churn. In: Proceedings IEEE INFOCOM. Miami, FL (2005)Google Scholar
  18. 18.
    Oppenheimer, D., Albrecht, J., Patterson, D., Vahdat, A.: Distributed resource discovery on planetLab with SWORD. In: Proceedings of the ACM/USENIX Workshop on Real, Large Distributed Systems (WORLDS), December 2004Google Scholar
  19. 19.
    Ramabhadran, S., Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Prefix hash tree an indexing data structure over distributed hash tables. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing. St. John’s, Newfoundland, Canada (2004)Google Scholar
  20. 20.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-adressable network. In: Proceedings of ACM SIGCOMM, San Diego, CA (2001)Google Scholar
  21. 21.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: International Conference on Distributed Systems Platforms (Middleware), November 2001Google Scholar
  22. 22.
    Schmidt, C., Parashar, M.: Flexible information discovery in decentralized distributed systems. In: Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing (HPDC’03), pp. 226–235, 22–24 June 2003Google Scholar
  23. 23.
    Segall, A.: Distributed network protocols. IEEE Trans. Inform. Theory 29, 23–35 (1983)zbMATHCrossRefGoogle Scholar
  24. 24.
    Seymour, K., Lee, C., Desprez, F., Nakada, H., Tanaka, Y.: The end-user and middleware APIs for GridRPC. In: Workshop on Grid Application Programming Interfaces, In conjunction with GGF12, Brussels, Belgium, September 2004Google Scholar
  25. 25.
    Spence, D., Harris, T.: XenoSearch: distributed resource discovery in the XenoServer Open Platform. In: Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing (HPDC’03), pp. 216–225, 22–24 June 2003Google Scholar
  26. 26.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: a scalable peer-to-peer look- up service for internet applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 149-160, San Diego, CA, August 2001Google Scholar
  27. 27.
    Talia, D., Trunfio, P.: Peer-to-peer protocols and Grid services for resource discovery on Grids. In: Grandinetti, L. (ed.) Grid Computing: The New Frontier of High Performance Computing, vol 14, Advances in Parallel Computing. Elsevier, Amsterdam, The Netherlands ISBN 0-444-51999-8 (2005)Google Scholar
  28. 28.
    The JXTA project.
  29. 29.
    Traversat, B., Abdelaziz, M., Pouyoul, E.: A loosely-consistent DHT rendezvous walker. Technical report, Sun Microsystems, Inc, March 2003Google Scholar
  30. 30.
    Triantafillou, P., Pitoura, T.: Towards a unifying framework for complex query processing over structured peer-to-peer data networks. In: First International Workshop on Databases, Information Systems and Peer-to-Peer Computing, DBISP2P 03, pp. 169–183, September 2003Google Scholar
  31. 31.
    Xu, Z., Mahalingam, M., Karlsson, M.: Turning heterogeneity into an advantage in overlay routing. In: Proceedings on IEEE INFOCOM, vol. 2, pp. 1499–1509, San Francisco, CA, March 2003Google Scholar
  32. 32.
    Xu, Z., Min, R., Hu, Y.: HIERAS: a DHT based hierarchical P2P routing algorithm. In: Proceedings of the 3rd International Conference on Parallel Processing, pp. 187–194, 2003Google Scholar
  33. 33.
    Xu, Z., Zhang, Z.: Building low-maintenance expressways for P2P systems. Technical Report 2002-41, Hewlett-Packard Labs, April 2002Google Scholar
  34. 34.
    Zhao, B.Y., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: landmark routing on overlay networks. In: Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS ’02), Cambridge, MA, March 2002Google Scholar
  35. 35.
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D: Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. 22(1), 41–53 January (2004)CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media B.V. 2006

Authors and Affiliations

  • Eddy Caron
    • 1
  • Frédéric Desprez
    • 1
  • Cédric Tedeschi
    • 1
    Email author
  1. 1.LIP Laboratory / GRAAL projectUMR CNRS-ENS Lyon-INRIA-UCBL 5668Lyon Cedex 07France

Personalised recommendations