首页> 外文会议>International conference on information technology and software engineering >A Ranking-Based Approach for Service Composition with Multiple QoS Constraints
【24h】

A Ranking-Based Approach for Service Composition with Multiple QoS Constraints

机译:一种基于排名的服务组合方法,具有多个QoS限制

获取原文

摘要

In Web Service Composition (WSC) field, service composition aims at selecting a set of existing services with different Quality of Services (QoS) attributes then compositing them to accomplish a complex task to meet the given user requirements. A grand research challenge of service composition is to select proper service candidates to maximize Quality of Service (QoS). In this paper, we propose a Ranking-Based algorithm of service composition. Specifically we employ the QoS-based model to evaluate QoS parameters, and then select the nearly-optimal execution path of service composition with high-level QoS performance. We evaluated our algorithm using simulation-based comprehensive experiments. The experimental results demonstrate that our approach is more efficient compared to other existing approaches.
机译:在Web服务组合(WSC)字段中,服务组合旨在选择具有不同质量的服务(QoS)属性的一组现有服务(QoS)属性,然后将它们组合以完成复杂的任务以满足给定的用户要求。服务组成的盛大研究挑战是选择适当的服务候选人来最大限度地提高服务质量(QoS)。在本文中,我们提出了一种基于排名的服务组合方法。具体而言,我们采用基于QoS的模型来评估QoS参数,然后选择具有高级QoS性能的服务组合的近最优执行路径。我们使用基于仿真的综合实验评估了我们的算法。实验结果表明,与其他现有方法相比,我们的方法更有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号