作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (16): 27-30. doi: 10.3969/j.issn.1000-3428.2012.16.007

• 专栏 • 上一篇    下一篇

基于服务质量信息的服务组装算法

白 宇 a,b,张尧学 a,b,周悦芝 a,b   

  1. (清华大学 a. 信息科学与技术国家实验室;b. 计算机科学与技术系,北京 100084)
  • 收稿日期:2012-02-06 修回日期:2012-03-21 出版日期:2012-08-20 发布日期:2012-08-17
  • 作者简介:白 宇(1985-),男,博士研究生,主研方向:服务描述,服务组装;张尧学,教授、博士生导师;周悦芝,副教授
  • 基金资助:

    国家“863”计划基金资助项目(2011AA01A203)

Service Composition Algorithm Based on Service Quality Information

BAI Yu a,b, ZHANG Yao-xue a,b, ZHOU Yue-zhi a,b   

  1. (a. National Laboratory of Information Science and Technology; b. Department of Computer Science and Technology,Tsinghua University, Beijing 100084, China)
  • Received:2012-02-06 Revised:2012-03-21 Online:2012-08-20 Published:2012-08-17

摘要:

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

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

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

中图分类号: