A Semantic-based Grid Service Discovery and Composition
Nowadays, most grid service discovery use keyword matching and never describe the matching degree. Meantime, a users 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.
Tao Chen Xiang Zhou Nong Xiao
School of Computer, National University of Defense Technology, 410073 Changsha, China Industrial and Commercial Bank of China, Hunan Branch, Information Management Dept.
国际会议
2007年第三届语义和知识网格国际会议(Third International Conference on Semantics,Knowledge,and Grid)(SKG 2007)
西安
英文
2007-10-29(万方平台首次上网日期,不代表论文的发表时间)