一种新的启发式Web服务组合算法  

New Heuristic Algorithm Based on Web Service Composition

作　　者：孙占志[1] 朱怡安[1,2] 车鸣[1] 

机构地区：[1]西北工业大学计算机学院,西安710129 [2]西北工业大学软件与微电子学院,西安710129

出　　处：《计算机科学》2011年第5期116-118,共3页Computer Science

摘　　要：作为推动SOA和Web服务向纵深化发展的重要支撑技术,Web服务组合一直在领域研究中占据着重要地位。提出了一种新的启发式Web服务组合算法——HASC算法,该算法分为遍历搜索和回溯组合两个过程。前者以Web服务输出集合基数为启发函数,确定到达每个目标本体所需调用的Web服务;在此基础上,后者采用输出集合与目标集合交集的基数为启发函数,逐步建立输出集合到输入集合的回溯路径,进而获取最优组合方案。最后,以公共测试集EEE05和ICEBE05为测试对象,对该算法的性能进行深入分析。实验结果表明,该算法在组合效率和寻求最短组合路径方面较同类算法有较大提升。Web service composition is often considered to be one of the most important and vital building blocks for Service Oriented Architecture.Toward that,we presented a new heuristic algorithm named HASC.The algorithm obtains the solution through two steps which were traverse searching and regression.Both of the steps used heuristic method to select optimal Web services.In the process of traverse searching,the number of input parameters the Web service needed was considered as the heuristic function.In the process of regression,the heuristic function was the cardinality of the intersection generated by the output parameter set and the object ontology set.We evaluated the efficiency and effectiveness of HASC with two publicly available test sets—EEE05 and ICEBE05.Compared with other similar algorithms,HASC can provide higher efficiency and shorter solution path for the requests.

关 键 词：面向服务架构 WEB服务组合 启发式搜索 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]