A Semantic-based Grid Service Discovery and Composition

Nowadays, most grid service discovery use keyword matching and never describe the matching degree. Meantime, a user´s request cannot be satisfied by any available service, whereas a composite service obtained by combining available services can be used. When each grid service matches a request best, the service composition may not the best process. In order to solve the two problems, this paper presents a quantification standard for semantic service matching and modifies the classical flexible matching algorithm based on OWL-S. Based upon the quantification standard of service matching and OWL-WS, the service composition algorithm finds the process that best satisfies customer need by constructing a mathematical model and converting the problem to the shortest path problem.