摘要
针对当前Web服务组合方法在动态性和算法时间复杂度方面存在的不足,提出一种基于邻接矩阵的服务组合方法,使用邻接矩阵表示服务间的顺序及并发关系,在构建抽象服务基础上由领域专家初步建立抽象服务的组合关系,利用Warshall算法计算传递闭包来判定服务请求是否可满足,同时构建动态服务组合流程。方法操作简单,Warshall算法时间复杂度为O(n3),在服务组合中有较好的实用性。
Aiming at the disadvantages in dynamics and algorithm time complexity in the existing web service composition methods, we propose an adjacency matrix-based web service composition approach. Sequential and parallel relationship among web services is represented by adjacency matrix. Abstract services are created by clustering, and the composition relationship among abstract services is estab- lished by domain experts. The Warshall algorithm is utilized to calculate the transitive closure of the ad- jacency matrix so that we can judge whether the the service request is met or not. Meanwhile the dynam- ic service composition flow is constructed. The proposed method applies well in service composition due to its simple operation and the O（n3） time complexity of the Warshall algorithm.
出处
《计算机工程与科学》
CSCD
北大核心
2015年第9期1627-1631,共5页
Computer Engineering & Science
基金
安徽农业大学2014年学科骨干培育项目(编号2014XKPY-61)
安徽省科技攻关计划项目(1501031082)
国家自然科学基金资助项目(31271615)
