一种基于最小覆盖的复杂Web服务组合方法  

Minimum Coverage Method for Complicated Web Service Composition

作　　者：朱正东[1] 伍卫国[1] 胡亚红[2] 李增智[1] 

机构地区：[1]西安交通大学计算机科学与技术系,西安710049 [2]浙江工业大学计算机系,杭州310032

出　　处：《西安交通大学学报》2008年第8期945-949,共5页Journal of Xi'an Jiaotong University

基　　金：国家自然科学基金资助项目(60673170);国家高技术研究发展计划资助项目(2006AA10A109)

摘　　要：针对复杂Web服务的组合问题,提出了基于最小覆盖的Web服务组合方法(CWSCM).该方法从需求目标出发,将逻辑理论中的逻辑函数化简的最小覆盖思想运用于基于本体的多层次服务匹配的过程之中,从而建立了最小服务匹配集合,同时构造了优化的有序服务组合图,并将该图的形式化表示保存于扩充的Web服务描述之中,以便复用.实验表明,CWSCM可成功地组合复杂的Web服务,保证服务组合的成功率和效率,当组合满意度接近70%时,组合服务的成功率最高,而满意度对组合效率的影响比较小.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 compose complicated Web services successfully, service composition can be ensured. When the for reuse. Experiments show that CWSCM can and that the success rate and efficiency of Web 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.

关 键 词：WEB服务 复杂Web服务 服务组合 最小覆盖 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]