首页> 外文期刊>International Journal of Innovative Computing Information and Control >DECOMPOSITION OF GLOBAL CONSTRAINTS FOR QOS-AWARE WEB SERVICE COMPOSITION
【24h】

DECOMPOSITION OF GLOBAL CONSTRAINTS FOR QOS-AWARE WEB SERVICE COMPOSITION

机译:QOS-AWARE Web服务组成的全局约束的分解

获取原文
获取原文并翻译 | 示例
           

摘要

Web service composition is a key technology required for the implementation of Service-Oriented Architecture (SOA). Since there are many web services with the same functionalities and different Quality of Service (QoS), there is significant interest in QoS-aware web service composition. This paper proposes a novel Global QoS Constraint Decomposition (GCD) approach for QoS-aware web service composition that includes global decomposition and local optimal selection. The GCD model and greedy algorithm have a weak connection with the QoS values of the candidate web services. Hence, the proposed approach can be adopted for dynamic scenarios. Finally, experiments were performed to compare this approach to previous work. The results indicate that our approach shows improved utility and time complexity.
机译:Web服务组合是实现面向服务的体系结构(SOA)所需的关键技术。由于存在许多具有相同功能和不同服务质量(QoS)的Web服务,因此人们对QoS感知Web服务的组合非常感兴趣。本文提出了一种新的全局QoS约束分解(GCD)方法,用于支持QoS的Web服务组合,其中包括全局分解和局部最优选择。 GCD模型和贪婪算法与候选Web服务的QoS值之间的联系较弱。因此,所提出的方法可以用于动态场景。最后,进行了实验以将该方法与以前的工作进行比较。结果表明,我们的方法显示出改进的效用和时间复杂性。

著录项

  • 来源
  • 作者单位

    College of Electrical Engineering Guangxi University No. 100, Daxue Street, Xixiangtang District, Nanning 530004, P. R. China,College of Information Science and Engineering Guilin University of Technology No. 12, Jiangan Street, Qixing District, Guilin 541000, P. R. China;

    School of Information and Engineering Guangxi University No. 100, Daxue Street, Xixiangtang District, Nanning 530004, P. R. China;

    College of Information Science and Engineering Guilin University of Technology No. 12, Jiangan Street, Qixing District, Guilin 541000, P. R. China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Web service composition; QoS-aware; Global QoS constraints decomposition; Greedy algorithm;

    机译:Web服务组成;QoS感知;全局QoS约束分解;贪心算法;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号