Distributed Resource Discovery in Wide Area Grid Environments

  • T. N. Ellahi
  • M. T. Kechadi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3038)


Multitude of resources pooled in grid environments require a scalable, efficient, low-cost and self-organizing resource discovery mechanisms. P2P networks possess overlapping characteristics like large scale resource sharing and dynamic nature of participation. P2P style resource discovery approaches have been employed in the grid environments. We propose a P2P based resource discovery approach with modified features like customized neighbourhood defined according to the user preferences and distributed search using directed flow of requests contrary to the blind propagation of P2P systems.


  1. 1.
    Foster, I.: The anatomy of the Grid: Enabling scalable virtual organizations. LNCS, pp. 1–? (2001)Google Scholar
  2. 2.
    Czajkowski, K., Fitzgerald, S., Foster, I., Kesselman, C.: Grid information services for distributed resource sharing. In: Proc. 10th IEEE Symp. On High Performance Distributed Computing (2001)Google Scholar
  3. 3.
    Chapin, S.J., Katramatos, D., Karpovich, J., Grimshaw, A.: Resource management in Legion. Future Generation Computer Systems, pp. 583–594 (1999)Google Scholar
  4. 4.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of the 16th Int’l conference on Supercomputing (2002)Google Scholar
  5. 5.
    Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proc. of the 22nd Int’l. Conference on Distributed Computing Systems (2002)Google Scholar
  6. 6.
    Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer networks. In: Proc. of the 22nd Int’l. Conference on Distributed Computing Systems (2002)Google Scholar
  7. 7.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. LNCS, pp. 329–350 (2001)Google Scholar
  8. 8.
    Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, UC Berkeley (2001)Google Scholar
  9. 9.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. of ACM SIGCOMM (2001)Google Scholar
  10. 10.
    Stoica, I., Morris, R., Karger, D., Francs Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM, pp. 149–160 (2001)Google Scholar
  11. 11.
    Iamnitchi, A., Foster, I.: On fully decentralized resource discovery in grid environments. In: Int’l. Workshop on Grid Computing (2001)Google Scholar
  12. 12.
    Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: Proc. of the 2nd IEEE Int’l. Conference on P2P Computing (2002)Google Scholar
  13. 13.
    Schmidt, C., Parashar, M.: Flexible information discovery in decentralized distributed systems. In: 12th IEEE Int’l Symp. on High Performance Distributed Computing (2003)Google Scholar
  14. 14.
    Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. In: INFOCOM (2003)Google Scholar
  15. 15.
    Lee, O.-K., Benford, S.: An explorative model for federated trading in distributed computing environments. In: Proc. of the Int’l Conference on Open Distributed Processing (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • T. N. Ellahi
    • 1
  • M. T. Kechadi
    • 1
  1. 1.Parallel Computational Research Group, Department of Computer ScienceUniversity College DublinBelfield, Dublin 4Ireland

Personalised recommendations