.png){kind=icon}
返回
QoS decomposition for service composition using genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2012.12.033.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, a lot of research has been dedicated to optimizing the QoS-aware service composition. This aims at selecting the optimal composed service from all possible service combinations regarding user's end-to-end quality requirements. Existing solutions often employ the global optimization approach, which does not show promising performance. Also, the complexity of such methods extensively depends on the number of available web-services, which continuously increase along with the growth of the Internet. Besides, the local optimization approaches have been rarely utilized, since they may violate the global constraints. In this paper, we propose a top-down structure, named quality constraints decomposition (QCD) here, to decompose the global constraints into the local constraints, using the genetic algorithm (GA). Then the best web service for each task is selected through a simple linear search. In contrast to existing methods, the QCD approach mainly depends on a limited set of tasks, which is considerably less complex, especially in the case of dynamically distributed service composition. Experimental results, based on a well-known data set of web services (QWSs), show the advantages of the QCD method in terms of computation time, considering the number of web services. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Service composition
Global optimization
Local optimization
Quality constraint decomposition
Genetic algorithm
Quality-degree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
分享收藏A framework for QoS-aware binding and re-binding of composite web services一种用于组合web服务的QoS感知绑定和重新绑定的框架
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容