Web services composition with QoS bound based on simulated annealing algorithm

作     者：刘青 张世龙 杨锐 连祥鉴 Liu Qing;Zhang Shilong;Yang Rui;Lian Xiangjian

作者机构：中国人民大学信息学院北京100872 

出 版 物：《Journal of Southeast University(English Edition)》 (东南大学学报（英文版）)

年 卷 期：2008年第24卷第3期

页      面：308-311页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：The National Natural Science Foundation of China(No.60773217) Free Exploration Project(985 Project of Renmin University of China)(No.21361231) 

主　　题：web services quality of service(QoS) service composition simulated annealing 

摘      要：In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the *** results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service *** algorithm produces near optimum solution with much less computation cost.