English

应用科学学报 >

2017 , Vol. 35 >Issue 5: 570 - 584

DOI: https://doi.org/10.3969/j.issn.0255-8297.2017.05.004

2016中国计算机应用大会遴选论文

一种基于改进模拟退火算法的QoS动态服务组合方法

展开
  • 1. 上海大学 计算机工程与科学学院, 上海 200444;
    2. 上海大学 计算中心, 上海 200444;
    3. 上海上大海润信息系统有限公司, 上海 200444

收稿日期: 2016-10-06

  修回日期: 2017-01-02

  网络出版日期: 2017-09-30

基金资助

国家自然科学基金（No.61502294）；上海市自然科学基金（No.15ZR1415200）；上海市科委重点项目基金（No.14590500500）；教育科研网-赛尔网络下一代互联网技术创新项目基金（No.NGⅡ2150609，No.NGⅡ201602010，No.NGⅡ20160614，No.NGⅡ20160325）资助

收起

QoS Dynamic Web Services Composition Method Based on Improved Simulated Annealing Algorithm

Expand
  • 1. School of Computer Engineering and Science, Shanghai University, Shanghai 200444, China;
    2. Computing Center, Shanghai University, Shanghai 200444, China;
    3. Shanghai Shangda Hairun Information System Co., Ltd, Shanghai 200444, China

Received date: 2016-10-06

  Revised date: 2017-01-02

  Online published: 2017-09-30

Fold

摘要

提出了一种基于改进模拟退火算法的QoS动态服务组合方法.根据用户功能需求进行服务筛选，构造服务组合所需的候选服务集，再对候选服务进行分类产生同类服务集合.根据改进的模拟退火算法从候选服务集中选取满足用户QoS需求的组合服务.当组合服务或构件服务接近QoS临界值时，综合使用局部贪心算法和改进模拟退火算法进行服务重组.案例分析表明，该方法在动态服务组合方面是可行而有效的.

关键词： 贪心算法; 动态服务组合; 服务选择; 模拟退火算法; 服务质量

本文引用格式

张康, 高洪皓, 朱永华, 许华虎 . 一种基于改进模拟退火算法的QoS动态服务组合方法[J]. 应用科学学报, 2017 , 35(5) : 570 -584 . DOI: 10.3969/j.issn.0255-8297.2017.05.004

Abstract

This paper proposes a QoS dynamic services composition based on an improved simulated annealing algorithm. First, classifcation services builds a set of candidate services from the service repository according to user's functional requirements. Optimal composite services are computed using an improved simulated annealing (ISA) algorithm, and then recommended to the user. When the quality of composite service is close to a critical value of QoS, a local greedy algorithm and global ISA algorithm are used to re-implement service composition. Feasibility and effectiveness of the proposed method is shown by a case study.

Key words： simulated annealing algorithm greedy algorithm; service selection; quality of service (Qos); dynamic service composition

参考文献

[1] Deng S G, Huang L T, Tan W, Wu Z H. Top-k automatic service composition:a parallel method for large-scale service sets[J]. IEEE Transactions on Automation Science & Engineering, 2014, 11(3):891-905.
[2] Tan W, Fan Y, Zhou M C. A Petri net-based method for compatibility analysis and composition of Web services in business process execution language[J]. IEEE Transactions on Automation Science & Engineering, 2009, 6(1):94-106.
[3] Huang L T, Deng S G, Li Y, Li G X. A trust evaluation mechanism for collaboration of data-intensive services in cloud[J]. Applied Mathematics & Information Sciences, 2013, 7(2):121-129.
[4] Jiang W, Hu S L, Lee D W, Gong S, Liu Z Y. Continuous query for QoS-aware automatic service composition[C]//2013 IEEE 20th International Conference on Web Services, 2012:50-57.
[5] Deng S G, Huang L T, Xu G D. Social network-based service recommendation with trust enhancement[J]. Expert Systems with Applications, 2014, 41(18):8075-8084.
[6] Deng S G, Wu H Y, Hu D N, Zhap J L. Service selection for composition with QoS correlations[J]. IEEE Transactions on Services Computing, 1939, 9(2):291-303.
[7] 佟萍. 模拟退火算法在Web服务合成中的应用[J]. 计算机技术与发展,2006, 16(3):220-222. Tong P. Application of simulated annealing algorithm in Web services composition[J]. Computer Technology & Development, 2006, 16(3):220-222. (in Chinese)
[8] Liu Q, Zhang S L, Yang R, Lian X J. Web services composition with QoS bound based on simulated annealing algorithm[J]. Journal of Southeast University (English Edition), 2008, 24(3):308-311.
[9] Zhou B, Llewellyn-Jones D, Shi Q, David L. Secure service composition adaptation based on simulated annealing[J]. Jones, 2012, 6:49-55.
[10] Giedrimas V, Saklauskas L. Simulated annealing and variable neighborhood search algorithm for automated software services composition[C]//Mipro, 2012 Proceedings of the International Convention. IEEE, 2012:395-399.
[11] Liu Z Z, Xue X, Shen J Q. Web service dynamic composition based on decomposition of global QoS constraints[J]. The International Journal of Advanced Manufacturing Technology, 2013, 69(9):2247-2260.
[12] Wang S G, Sun Q B, Yang F C. Web service dynamic selection by the decomposition of global QoS constraints[J]. Journal of Software, 2011, 22(7):1426-1439.
[13] Liu Q, Lian X J. Context-based dynamic Web service composition[J]. Microelectronics & Computer, 2008, 25(9):50-52.
[14] Pahlebvan A, Duprat J L, Thoma A, Hausi A M. Dynamis:effective context-aware Web service selection using dynamic attributes[J]. Future Internet, 2015, 7(2):110-139.
[15] Du Y, Hu H, Song W, Ding J H, Lü J. Efcient computing composite service skyline with QoS correlations[C]//IEEE International Conference on Services Computing, 2015:41-48.
[16] Khakhkhar S, Kumar V, Chaudhary S. Dynamic service composition[J]. International Journal of Computer Science & Artifcial Intelligence, 2012, 3(3):32-42.
[17] Jr Fgao O, Oliveira J M P D. QoS-based approach for dynamic Web service composition[J]. Journal of Universal Computer Science, 2011, 17:712-741.
[18] Alamri A, Eid M, Saddik A E. Classifcation of the state-of-the-art dynamic Web services composition techniques[J]. International Journal of Web & Grid Services, 2006, 2(2):148-166.
[19] 邓水光,黄龙涛,吴斌,尹健伟,李革新. 一种QoS最优的语义Web服务自动组合方法[J]. 计算机学报,2013, 36(5):1015-1030. Deng S G, Huang L T, Wu B, Yin Y J, Li G X. QoS optimal automatic composition of semantic Web services[J]. Chinese Journal of Computers, 2013, 36(5):1015-1030. (in Chinese)
[20] Podili P, Pattanaik K K, Rana P S. BAT and hybrid BAT meta-heuristic for quality of service-based Web service selection[J]. Journal of Intelligent Systems, Journal of Intelligent Systems, 2017, 26(1):123-137.
[21] Zeng L Z, Benatallah B, Ngu A H H, Marlon D, Jayant K, Henry C. QoS-aware middleware for Web services composition[C]//IEEE Transactions on Software Engineering, 2004:311-327.
[22] Zhou J M, Deng Y C, Huang Y. A kind of simulated annealing algorithm with memory solving traveling salesman problem[J]. Journal of Hunan University of Arts & Science, 2010, 2:70-73

Options
文章导航

/

〈 〉