Abstract:

Existing research methods cannot fulfill the service selection or service composition according to user’s individual requirements. Aiming at this problem, this paper proposes a service composition algorithm based on service quality information. Through defining the matching degree of service interfaces and considering service quality information, it converts the degree of service composition into the weight of the edge in directed graph. The service composition problem converts into the shortest path problem. Analysis result of example is given to demonstrate the effectiveness of the algorithm.

Key words: Web service, service composition, shortest path problem, service quality information, directed graph

摘要：

现有的服务组装方法不能根据用户的实际需求对服务构件进行选择和组装。针对该问题，提出一种基于服务质量信息的服务组装算法。定义服务接口间的匹配度，引入服务质量信息，把服务间的匹配度转变为有向图中边的权重，从而将服务构件的组装问题转化为寻找有向图中的最短路径问题。实例分析结果证明了该算法的有效性。

关键词: Web服务, 服务组装, 最短路径问题, 服务质量信息, 有向图

CLC Number: 

• TP 311