Based On Cluster Service Of Web Service Discovery Of Application And Research

Web service is a loosely coupled, platform independent, self-contained, callable Web application, which is the key technology to realize the computing of service orientation. Due to its good supports for heterogeneous environment, openness and cross-platform features, Web service has been widely used in many industries. With the rapid development of SOA (Service-Oriented Architecture), the number of Web services in the network has increased dramatically,. How to pick up the services that meet users’demands quickly and accurately from a large number of Web services has been a urgently needs to solve currently.Using the clustering technology to classify the Web services with similar functions together can effectively reduce the search space and improve the efficiency of service discovery. Currently, many literatures have paid attention to the analysis of Web service discovery methods based on service clusters, but most of the researches only focus on the analysis of clustering algorithm, rather than giving the specific service discovery method. What is more, it did not make full use of the highly similar characteristics of Web services after clustered.Taking use of clustering, grouping the Web services with similar functions together, and this paper is due to propose a method of service discovery by using the matching diagrams, which based on service clusters. Considering the present concept similarity calculation is diversified and one-sided, by studying the methods to calculate the concept similarity, the paper gives a comprehensive concept called semantic similarity computation, which considers the related factors that can influence the ontology concept similarity calculation. On this basis, we calculate the Web services function attribute similarity both from the Web service description and input and output parameters, as characteristics when use the AGENS to do hierarchical clustering of Web services,then,we can generate a service cluster. At the same time, analyzing the shortcomings of traditional Web service discovery method based on service clusters, this paper proposes a method of service discovery by using the matching diagrams, which based on service clusters. This method defines the matching relations of Web service in service clusters by using the matching conditions of Web service’s functional characteristics and analyzes the transfer characteristic of this relationship. Build the graphical model of the matching relation, that is, generate a service cluster matching diagram. Formally defines the service cluster model based on the matching diagram, and state the specific process of RGSD. When positioning the service request to a specific service clusters, by using RGSD, multiple Web services satisfied the needs can be found by using the matching relationship diagrams and the times of comparing can be reduce. From dimensions both of time efficiency and precision, the results of simulation experimental indicate that the proposed algorithm can keep the accuracy of the service discovery and greatly improve the efficiency of service discovery compared with the traditional Web service discovery method based on service clusters.