By Topic

GNSD: A Novel Service Discovery Mechanism for Grid Environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yongcai Tao ; Cluster & Grid Comput. Lab, Huazhong Univ. of Sci. & Technol., Wuhan ; Hai Jin ; Xuanhua Shi ; Li Qiz

Due to the highly distributed and dynamic features, service discovery is a key requirement in grid computing. The paper first introduces the existing service discovery mechanisms in distributed computing, and then points out the problems in MDS which is widely used in grid systems. In order to address these issues, GNSD, a novel service discovery mechanism is proposed, which is based on the OSPF (Open Shortest Path First) flooding mechanism and combines the advantages of tree architecture and flat architecture. The time and space complexity of both GNSD and MDS are also analyzed. Experimental results show that GNSD not only accelerates the service discovery but also relieves the burden of servers at the cost of little extra storage and communication traffic. Furthermore, it is more robust. As a conclusion, GNSD is an efficient service discovery mechanism

Published in:

Next Generation Web Services Practices, 2006. NWeSP 2006. International Conference on

Date of Conference:

25-28 Sept. 2006