|Table of Contents|

[1] Liu Qing, Zhang Shilong, Yang Rui, Lian Xiangjian, et al. Web services composition with QoS boundbased on simulated annealing algorithm [J]. Journal of Southeast University (English Edition), 2008, 24 (3): 308-311. [doi:10.3969/j.issn.1003-7985.2008.03.013]
Copy

Web services composition with QoS boundbased on simulated annealing algorithm()
基于模拟退火算法的QoS约束web服务组合
Share:

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
24
Issue:
2008 3
Page:
308-311
Research Field:
Computer Science and Engineering
Publishing date:
2008-09-30

Info

Title:
Web services composition with QoS boundbased on simulated annealing algorithm
基于模拟退火算法的QoS约束web服务组合
Author(s):
Liu Qing Zhang Shilong Yang Rui Lian Xiangjian
School of Information, Renmin University of China, Beijing 100872, China
刘青 张世龙 杨锐 连祥鉴
中国人民大学信息学院, 北京 100872
Keywords:
web services quality of service(QoS) service composition simulated annealing
web服务 服务质量 服务组合 模拟退火
PACS:
TP311
DOI:
10.3969/j.issn.1003-7985.2008.03.013
Abstract:
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 algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.
针对web服务组合中选择服务需感知服务的QoS属性问题, 采用向量表示法描述原子服务及组合服务的QoS属性和用户提出的多项全局约束, 把寻求满足多项非功能属性约束的最优服务组合问题转化为在有向图中搜索最优多约束路径问题, 采用有向图对组合服务建模.设计了多QoS属性约束的服务组合模拟退火算法, 进行组合服务QoS属性的归一化处理和二次寻优.实验结果表明该方法可求得满足各项QoS约束的可行解, 模拟过程显示该算法以多项式时间复杂度选出近似最优解.

References:

[1] Curbera F, Roller R, Mukhi N, et al.The next step in web services[J].Communication of the ACM, 2003, 46(10):29-34.
[2] Menasce Daniel A.Composing web services:a QoS view[J].IEEE Internet Computing, 2004, 8(6):88-90.
[3] Zeng Liangzhao, Benatallah B, Dumas M, et al.Quality driven web services composition[C]//Proceedings of the 12th International Conference on World Wide Web.Budapest, Hungary, 2003:411-421.
[4] Liu Yutu, Ngu Anne H H, Zeng Liangzhao.QoS computation and policing in dynamic web service selection[C]//Proceedings of the 13th International Conference on World Wide Web.New York, USA, 2004:66-73.
[5] Canfora G, Penta M D, Esposito R, et al.An approach for QoS-aware service composition based on genetic algorithms[C]//Proceedings of the 2005 Conference on Genetic and Evolutionary Computation.Washington, DC, USA, 2005:1069-1075.
[6] Tian M, Gramm A, Ritter H, et al.Efficient selection and monitoring of QoS-aware web services with the WS-QoS framework[C]//Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence. Beijing, China, 2004:152-158.
[7] Kirkpatrick S, Gelatt C D, Vecchi M P.Optimization by simulated annealing[J].Science, 1983, 220(4598):671-680.

Memo

Memo:
Biography: Liu Qing(1967—), female, associate professor, qliu@ruc.edu.cn.
Foundation items: The National Natural Science Foundation of China(No.60773217), Free Exploration Project(985 Project of Renmin University of China)(No.21361231).
Citation: Liu Qing, Zhang Shilong, Yang Rui, et al.Web services composition with QoS bound based on simulated annealing algorithm[J].Journal of Southeast University(English Edition), 2008, 24(3):308-311.
Last Update: 2008-09-20