Abstract
This paper focuses on how to model grid resource and locate grid resource using efficient and scaleable protocol under a grid environment. A mathematic model of grid physical resource space and logical resource space is built based concept of virtual organization. Then, a mathematical method based the binary equivalent relation is presented to divide grid physical resource space. Then, this paper proposes the concept of grid resource domain, and introduce a fully decentralized grid resource locating protocol based it from aspects of the overlay network of grid resource domains and query routing protocol among different grid resource domains. On the other hand, in order to propagate query among information nodes within given grid resource domain, this paper presents informed search protocol based bloom filters. Our resource locating protocol can enhance the query success rate and recall rate, and avoid too much unnecessary query messages.
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.
References
Li, W., Xu, Z.: A Model of Grid Address Space with Applications. Journal of Computer Research and Development 40(12), 756–1762 (2003) (in Chinese)
Zhuge, H.: Resource Space Grid: Model, Method and Platform. Concurrency and Computation: Practice and Experience 16(14), 1385–1413 (2004)
Li, X., Wu, J.: Searching Techniques in Peer-to-Peer Networks. In: Wu, J. (ed.) Handbook of Theoretical and Algorithmic Aspects of Ad Hoc, Sensor, and Peer-to-Peer Networks. CRC Press, Boca Raton (2005)
Ripeanu, M., Iamnitchi, A., Foster, I.: Mapping the gnutella network. IEEE Internet Computing 6(1), 50–57 (2002)
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Proc. of ICSI Workshop on Design Issues in Anonymity and Unobservability (2000)
Ratnasamy, S., Francis, P., Handley, M., Karp, R.M.: A scalable content-addressable network. In: Proc. ACM SIGCOMM 2001 (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnam, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM 2001 (2001)
Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proc. of the 22nd IEEE International Conference on Distributed Computing, pp. 5–14 (2002)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of the 16th ACM International Conference on Supercomputing, pp. 84–95 (2002)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of the 16th ACM International Conference on Supercomputing, pp. 84–95 (2002)
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. of the 22nd International Conference on Distributed Computing, pp. 23–32 (2002)
Sun, Q., Ganesan, P., Garcia-Molina, H.: The InfoMatrix: Distributed Indexing in a P2P Environment, http://wwwdb.stanford.edu/~qsun/research/infomat.pdf
Bloom, B.: Space/time tradeoffs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)
Kumar, A., Xu, J., Zegura, E.W.: Effcient and Scalable Query Routing for Unstructured Peer-to-Peer Networks. In: Proc. of Proceedings of Conference on Computer Communications, IEEE INFOCOM (2005)
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip Algorithms: Design, Analysis and Applications. In: Proc. of Proceedings of Conference on Computer Communications, IEEE INFOCOM (2005)
Caro, G.D., Ducatelle, F., Heegaard, P., Jelasity, M., Montemanni, R., Montresor, A.: Evaluation of basic services in AHN,P2P and Grid networks, http://www.cs.unibo.it/bison/deliverables/D07.pdf
Guo, D., Chen, H., Luo, X.: Resource information management of spatial information grid. LNCS, vol. 3032, pp. 240–243. Springer, Heidelberg (2003)
Yu, T., kaitao, H., nong, X., et al.: Study on System Framework and Key Issues of National Geological Application Grid. Journal of Computer Research and Development 40(12), 1682–1688 (2003) (in Chinese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, D., Chen, H., Xie, C., Lei, H., Chen, T., Luo, X. (2005). Decentralized Grid Resource Locating Protocol Based on Grid Resource Space Model. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_80
Download citation
DOI: https://doi.org/10.1007/11590354_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)