摘要
提出了一种基于改进模拟退火算法的Qo S动态服务组合方法.根据用户功能需求进行服务筛选,构造服务组合所需的候选服务集,再对候选服务进行分类产生同类服务集合.根据改进的模拟退火算法从候选服务集中选取满足用户Qo S需求的组合服务.当组合服务或构件服务接近Qo S临界值时,综合使用局部贪心算法和改进模拟退火算法进行服务重组.案例分析表明,该方法在动态服务组合方面是可行而有效的.
This paper proposes a QoS dynamic services composition based on an improved simulated annealing algorithm. First, classification services builds a set of candidate ser- vices 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.
作者
张康
高洪皓
朱永华
许华虎
ZHANG Kang GAO Hong-hao ZHU Yong-hua XU Hua-hu(School of Computer Engineering and Science, Shanghai University, Shanghai 200444, China Computing Center, Shanghai University, Shanghai 200444, China Shanghai Shangda Hairun Information System Co., Ltd, Shanghai 200444, China)
出处
《应用科学学报》
CSCD
北大核心
2017年第5期570-584,共15页
Journal of Applied Sciences
基金
国家自然科学基金(No.61502294)
上海市自然科学基金(No.15ZR1415200)
上海市科委重点项目基金(No.14590500500)
教育科研网-赛尔网络下一代互联网技术创新项目基金(No.NGII2150609
No.NG II201602010
No.NGII20160614
No.NGII20160325)资助
关键词
服务选择
服务质量
模拟退火算法
贪心算法
动态服务组合
service selection, quality of service（Qos）, simulated annealing algorithm greedy algorithm, dynamic service composition
