Abstract
In this paper, an efficient decentralized Grid service discovery approach is proposed, which utilizes service taxonomy to address both scalability and efficiency. Grid information nodes are organized into different community overlays according to the types of the services registered, and a DHT (Distributed Hash Table) P2P based upper layer network is constructed to facilitate the organization of community overlays and provide efficient navigation between different communities. As a result, service discovery will be limited into related communities, which improves efficiency. A simple and lightweight greedy search based service location (GSBSL) method is also introduced to identify service providers with high QoS efficiently within the same community. Simulation results show that, the efficiency is improved compared with existing decentralized solutions, and the overhead is acceptable and controllable.
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
Ratnasamy, S., Stoica, I., Shenker, S.: Routing Algorithms for DHTs: Some Open Questions. In: Proceedings of 1st International Workshop on Peer-to-Peer Systems, pp. 45–52 (2002)
Iamnitchi, A., Foster, I.: On Fully Decentralized Resource Discovery in Grid Environments. In: Lee, C.A. (ed.) Proceedings of 2nd IEEE/ACM International Workshop on Grid Computing (2001)
Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: Proceedings of 2nd IEEE International Conference on Peer-to-Peer Computing, pp. 33–40 (2002)
Huang, L., Wu, Z., Pan, Y.: Virtual and Dynamic Hierarchical Architecture for e-Science Grid. In: Proceedings of International Conference on Computational Science, pp. 316–329 (2003)
Chander, A., Dawson, S., Lincoln, P., et al.: NEVRLATE: Scalable Resource Discovery. In: Proceedings of IEEE/ACM CCGrid, pp. 382–388 (2002)
Stoica, I., Morris, R., Karger, D., et al.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proceedings of ACM SIGCOMM, pp. 149–160 (2001)
Saroiu, S., Gummadi, P., Gribble, S.: A Measurement Study of Peer-to-Peer File sharing Systems. In: Proceedings of SPIE Conference on Multimedia Computing and Networking, pp. 156–170 (2002)
Jelasity, M., Preusb, M., Steen, M.: Maintaining Connectivity in a Scalable and Robust Distributed Environment. In: Proceedings of 2nd IEEE/ACM CCGrid, pp. 389–394 (2002)
Byers, J., Considine, J., Mitzenmacher, M.: Simple Load Balancing in Distributed Hashing Tables. In: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems, pp. 80–87 (2003)
Rao, A., Lakshminarayanan, K., Suranaet, S., et al.: Load Balancing in Structured P2P Systems. In: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems, pp. 68–79 (2003)
Zhu, C., Liu, Z., Zhang, W., et al.: Load Balance based on Rumor Mongering in Structured P2P Networks. Journal of China Institute of Communications 25(4), 31–41 (2004)
Lv, Q., Cao, P., Cohen, E.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of ACM SIGMETRICS 2002 (2002)
Zhu, C., Liu, Z., Zhang, W.M., et al.: Analysis on Greedy Search based Service Location in P2P Service Grid. In: Proceedings of 3rd IEEE International Conference on Peer-to-Peer Computing, pp. 110–117 (2003)
Palmer, C., Steffan, J.: Generating Network Topologies that Obey Power Laws. In: Proceedings of the IEEE Globecom (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, C., Liu, Z., Zhang, W., Xu, Z., Yang, D. (2004). Using Service Taxonomy to Facilitate Efficient Decentralized Grid Service Discovery. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30208-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23564-4
Online ISBN: 978-3-540-30208-7
eBook Packages: Springer Book Archive