.png){kind=icon}
返回
QoS-aware automatic syntactic service composition problem: Complexity and resolution
.png){kind=icon}
OA
AI
DOI：10.1016/j.future.2017.04.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Automatic syntactic service composition problem consists in automatically selecting services, from a registry, by matching their input and output data. The composite service, resulting from this selection, allows producing a set of output data, needed by a user, from a set of input data, given by the user. Adding Quality-Of-Service (QoS) values for each service (for example execution time and cost values), this selection problem becomes an optimization one called the QoS-aware automatic syntactic service composition problem. Depending on the QoS criterion used, many models and algorithms resolving the aforementioned problem are proposed in the literature. The aim of this article is twofold. Firstly, we provide a unified understanding of the wide variety of existing approaches and we analyse and compare the theoretical complexity induced by each QoS criterion. We state that optimal solution for execution time or throughput QoS criteria can be determined in polynomial time but optimality is no more guaranteed in polynomial time for QoS criteria like cost or reliability. Indeed, we show that the composition problem becomes NP-hard when optimizing such QoS criteria. Secondly, we propose a novel approach for solving more efficiently polynomial cases. This approach is based on a scheduling formulation with AND/OR constraints, using a directed graph structure. For the Web Service Challenge-09 benchmark (considering execution time and throughput QoS criteria), our exact algorithm outperforms the related work. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Service composition
Web Service Challenge
AND/OR constraints
QoS optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
引用论文
Scalable and efficient web services composition based on a relational database基于关系数据库的可扩展的高效web服务组合
PREAI
分享收藏Co-Occurrence of Two Allelic Variants of CYP51 in Erysiphe necator and Their Correlation with Over-Expression for DMI Resistance.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏Powdery mildew of Chrysanthemum × morifolium: phylogeny and taxonomy in the context of Golovinomyces species on Asteraceae hostsMycologia
MycologiaIF0
PREAI
分享收藏
查看更多内容