Abstract
Scalability and routing efficiency are two crucial aspects of resource discovery in grid environments. SDRD, a novel approach to resource discovery in grid environments, is proposed in this paper. Basic model of resource discovery is proposed. Based on the basic model, formal description of SDRD is given. Sophisticated routing strategies are implemented in SDRD to improve the scalabilities and routing efficiencies of existing peer-to-peer based discovery approaches to grid resource. Improved Distributed Hash Tables (DHTs) are adopted within virtual organizations (VOs) to achieve better local routing efficiency. SuperNodes are only in charge of forwarding requests to other SuperNodes in different VOs when the desired resources are not present in local VO, which enhances the scalability due to the lower load on SuperNodes. SDRD could be applied to other resource management models to offer excellent scalability and high routing efficiency. Results of analysis and simulations show that SDRD scales well and could offer an efficient decentralized discovery service in grid.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wang, Y., Dong, X., He, X., et al.: A Constellation Model for Grid Resource Management. In: Cao, J., Nejdl, W., Xu, M. (eds.) APPT 2005. LNCS, vol. 3756, pp. 263–272. Springer, Heidelberg (2005)
Iamnitchi, A., Foster, I.: On Fully Decentralized Resource Discovery in Grid Environments. In: Lee, C.A. (ed.) GRID 2001. LNCS, vol. 2242, pp. 51–62. Springer, Heidelberg (2001)
Androutsellis-Theotokis, S., Spinellis, D.: A Survey of Peer-to-Peer Content Distribution Technologies. ACM Computing Surveys 36(4), 335–371 (2004)
Talia, D., Trunfio, P.: Toward a Synergy Between P2P and Grids. IEEE Internet Computing, pp. 96, 94–95 (July/August 2003)
Abdullah, A., Othman, M., Sulaiman, M.N., et al.: Data Discovery Mechanism for a Large Peer-to-Peer Based Scientific Data Grid Environment. In: Laganà, A., Gavrilova, M., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3044, pp. 146–157. Springer, Heidelberg (2004)
Foster, I.: Globus Toolkit Version 4: Software for Service-Oriented Systems. J. Comput. Sci & Technol. 21(4), 513–520 (2006)
Mastroianni, C., Talia, D., Verta, O.: A Super-Peer Model for Building Resource Discovery Services in Grids: Design and Simulation Analysis. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds.) EGC 2005. LNCS, vol. 3470, pp. 132–143. Springer, Heidelberg (2005)
Ranjan, R., Harwood, A., Buyya, R.: A Study on Peer-to-Peer Based Discovery of Grid Resource Information, http://www.gridbus.org/reports/pgrid.pdf
Ganesan, P., Yang, B., Garcia-Molina, H.: One Torus to Rule them All: Multi-dimensional Queries in P2P Systems. In: WebDB 2004, pp. 19–24. ACM Press, New York (2004)
Cai, M., Frank, M., Chen, J., et al.: MAAN: A Multi-Attribute Addressable Network for Grid Information Services. Journal of Grid Computing 2(1), 3–14 (2004)
Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: IEEE P2P 2002, pp. 33–40. IEEE Press, Los Alamitos (2002)
Schmidt, C., Parashar, M.: A Peer-to-Peer Approach to Web Service Discovery. World Wide Web: Internet and Web Information Systems 7(2), 211–229 (2004)
Tam, D., Azimi, R., Jacobsen, H.A.: Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) Databases, Information Systems, and Peer-to-Peer Computing. LNCS, vol. 2944, pp. 138–152. Springer, Heidelberg (2004)
Crainiceanu, A., Linga, P., Gehrke, J., Shanmugasundaram, J.: Querying Peer-to-Peer Networks Using P-Trees. In: WebDB 2004, pp. 25–30. ACM Press, New York (2004)
Puppin, D., Moncelli, S., Baraglia, R., et al.: A Grid Information Service Based on Peer-to-Peer. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 454–464. Springer, Heidelberg (2005)
Rhea, S., Geels, D., Roscoe, T., et al.: Handling Churn in a DHT. In: USENIX Annual Technical Conference, Boston, MA, USA, pp. 127–140 (2004)
Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Math Japonica 24, 573–577 (1980)
Liu, Y., Xiao, L., Liu, X., et al.: Location Awareness in Unstructured Peer-to-Peer Systems. IEEE Transactions on Parallel and Distributed Systems (TPDS) 16(2), 163–174 (2005)
Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison Wesley/Pearson Press, London (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mei, Y., Dong, X., Wu, W., Guan, S., Li, J. (2007). SDRD: A Novel Approach to Resource Discovery in Grid Environments. In: Xu, M., Zhan, Y., Cao, J., Liu, Y. (eds) Advanced Parallel Processing Technologies. APPT 2007. Lecture Notes in Computer Science, vol 4847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76837-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-76837-1_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76836-4
Online ISBN: 978-3-540-76837-1
eBook Packages: Computer ScienceComputer Science (R0)