基于与或图的Sub Web服务组合方法研究  

ON AND/OR GRAPH-BASED SUB WEB SERVICES COMPOSITION APPROACH

作　　者：陈立水[1,2] 王静[1] 王俊芳[1] 郭庆[3] 

机构地区：[1]中国电子科技集团公司第54研究所,河北石家庄050081 [2]哈尔滨工业大学博士后流动站,黑龙江哈尔滨150090 [3]哈尔滨工业大学通信技术研究所,黑龙江哈尔滨150001

出　　处：《计算机应用与软件》2014年第12期21-24,共4页Computer Applications and Software

基　　金：国防基础科研计划项目(B112011xxxx)

摘　　要：随着互联网技术的迅速发展,出现了大量优秀的Web服务,然而,单个Web服务难以满足用户需求,需对单个Web服务进行组合。针对上述问题,提出一种基于与或图的Sub Web服务组合方法。首先运用Web服务分解器将Web服务分解为Sub Web服务,并为其建立输出倒排索引表。其次通过SCAOG算法生成服务组合与或图,并为每一个与或图中节点赋权值。最后利用SCG算法对与或图进行求解,生成服务组合图。仿真实验表明,该方法提高了服务组合的效率和成功率。With the rapid development of internet technology, lots of excellent Web services （ WSs） have been emerging.However, single Web service may not be able to meet user’ s demand, and there is the need to combine them.In light of the above issue, we propose in this paper an and/or graph-based Sub Web services composition approach.First, we use Web service decomposer to decompose the Web service into Sub Web services, and create an inverted output index table for them.Then we generate the service composition and/or graph with SCAOG algorithm, and assign the weight value to every node in and/or graph.Finally, we seek the solution of the and/or graph through SCG （ service composition graph） algorithm to form the service composition graph.Simulation experiments show that the method improves the efficiency and success rate of Web services.

关 键 词：WEB服务组合 SUB WEB服务 与或图 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]