Minimum coverage method for complicated Web service composition

被引：0

作者：

Zhu, Zhengdong ^{[1
]}

Wu, Weiguo ^{[1
]}

Hu, Yahong ^{[2
]}

Li, Zengzhi ^{[1
]}

机构：

[1] Department of Computer Science and Technology, Xi'an Jiaotong University, Xi'an 710049, China

[2] Department of Computer, Zhejiang University of Technology, Hangzhou 310032, China

来源：

Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University | 2008年 / 42卷 / 08期

关键词：

Websites - Quality of service - Efficiency - Functions;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

A minimum coverage method called CWSCM is presented to deal with complicated Web service composition. According to desired objectives, the minimum coverage theory that simplifies logic functions in mathematical logic is applied to the multi-level services matching process to discover the desired Web services, and establish a minimum service matching set. At the same time, an optimal sequenced service composition graph is constructed, and its formal expression is saved into the extended Web service description for reuse. Experiments show that CWSCM can compose complicated Web services successfully, and that the success rate and efficiency of Web service composition can be ensured. When the satisfaction degree of the composition reaches about 70%, the algorithm can achieve the highest success rate. However, the satisfaction degree has little impact on the efficiency of the composition.

引用

页码：945 / 949