《计算机应用》唯一官方网站 ›› 2022, Vol. 42 ›› Issue (10): 3162-3169.DOI: 10.11772/j.issn.1001-9081.2021091556

• 计算机软件技术 • 上一篇    

基于优化的灰狼算法的大规模Web服务组合

徐雪敏, 张秀国, 肖媛元, 曹志英   

  1. 大连海事大学 信息科学技术学院,辽宁 大连 116026
  • 收稿日期:2021-09-02 修回日期:2021-12-13 接受日期:2021-12-23 发布日期:2022-04-15 出版日期:2022-10-10
  • 通讯作者: 张秀国
  • 作者简介:第一联系人:徐雪敏(1996—),女,山东淄博人,硕士研究生,主要研究方向:服务计算
    张秀国(1971—),女,山东聊城人,教授,博士,主要研究方向:服务计算、软件服务工程; zhangxg@dlmu.edu.cn
    肖媛元(1998—),女,吉林松原人,硕士研究生,主要研究方向:服务计算
    曹志英(1970—),女,山东烟台人,副教授,硕士,主要研究方向:Web服务、软件工程。
  • 基金资助:
    国家重点研发计划项目(2018YFB1601502)

Large-scale Web service composition based on optimized grey wolf optimizer

Xuemin XU, Xiuguo ZHANG, Yuanyuan XIAO, Zhiying CAO   

  1. Information Science and Technology College,Dalian Maritime University,Dalian Liaoning 116026,China
  • Received:2021-09-02 Revised:2021-12-13 Accepted:2021-12-23 Online:2022-04-15 Published:2022-10-10
  • Contact: Xiuguo ZHANG
  • About author:XU Xuemin, born in 1996, M. S. candidate. Her research interests include service computing.
    ZHANG Xiuguo, born in 1971, Ph. D. , professor. Her research interests include service computing, software service engineering.
    XIAO Yuanyuan, born in 1998, M. S. candidate. Her research interests include service computing.
    CAO Zhiying, born in 1970, M. S. , associate professor. Her research interests include Web service, software engineering.
  • Supported by:
    National Key Research and Development Program of China(2018YFB1601502)

摘要:

针对大规模Web服务环境中难以获得整体性能高的组合服务的问题,提出了一种大规模Web服务组合方法。首先,采用文档对象模型(DOM)对XML格式的用户需求描述文档进行解析,以生成抽象Web服务组合序列;然后,采用服务主题模型进行服务筛选,并为每个抽象Web服务选取Top-k个具体Web服务从而缩减组合空间;接着,为提高服务组合质量和组合效率,提出了一种基于Logistic混沌映射和非线性收敛因子的优化的灰狼算法(OGWO/LN)来进行最优服务组合方案选择;该算法采用混沌映射来生成初始种群以增加服务组合方案的多样性,并避免了多次局部寻优;同时,提出一种非线性收敛因子来调节算法的搜索能力以提高算法的寻优性能;最后,采用MapReduce框架对OGWO/LN进行了并行实现。在真实数据集上的实验结果表明,所提算法与IFOA4WSC、MR-IDPSO、MR-GA等算法相比,平均适应度值分别提高了8.69%、7.94%和12.25%,在解决大规模Web服务组合问题时具有更好的寻优性能和稳定性。

关键词: 主题模型, 服务组合, 灰狼算法, 服务质量, MapReduce

Abstract:

In order to solve the problem that it is difficult to obtain a composite service with high overall performance in a large-scale Web service environment, a large-scale Web service composition method was proposed. Firstly, Document Object Model (DOM) was used to parse the user demand document in XML format to generate an abstract Web service composition sequence. Secondly, the service topic model was used for service filtering, and Top-k specific Web services were selected for each abstract Web service to reduce the composition space. Thirdly, in order to improve the quality and efficiency of service composition, an Optimized Grey Wolf Optimizer based on Logistic chaotic map and Nonlinear convergence factor (OGWO/LN) was proposed to select the optimal service composition plan. In this algorithm, chaotic map was used to generate the initial population for increasing the diversity of service composition plans and avoiding multiple local optimizations. At the same time, a nonlinear convergence factor was proposed to improve the optimization performance of the algorithm by adjusting the algorithm search ability. Finally, OGWO/LN was realized in a parallel way by MapReduce framework. Experimental results on real datasets show that compared with algorithms such as IFOA4WSC (Improved Fruit Fly Optimization Algorithm for Web Service Composition), MR-IDPSO (MapReduce based on Improved Discrete Particle Swarm Optimization) and MR-GA (MapReduce based on Genetic Algorithm), the proposed algorithm has the average fitness value increased by 8.69%, 7.94% and 12.25% respectively, and has better optimization performance and stability in solving the problem of large-scale Web service composition.

Key words: topic model, service composition, Grey Wolf Optimizer (GWO), Quality of Service (QoS), MapReduce

中图分类号: