An approach for QoS-aware service composition based on genetic algorithms

An approach for QoS-aware service composition based on genetic algorithms
复制标题

DOI:
10.1145/1068009.1068189
复制
发表时间:
2005-06
期刊:
--
影响因子:
--
通讯作者:
G. Canfora;M. D. Penta;Raffaele Esposito;M. Villani
G. Canfora;M. D. Penta;Raffaele Esposito;M. Villani
中科院分区:
其他
文献类型:
--
作者:
G. Canfora;M. D. Penta;Raffaele Esposito;M. Villani

文献摘要

被引文献

相似文献

Web服务正在迅速改变软件工程的面貌。Web服务引入的最有趣的挑战之一是服务质量(QoS)感知组合和后期绑定。这允许在运行时将面向服务的系统与一组服务绑定,这些服务在提供所需功能的服务中满足一些非功能性约束,并优化诸如总成本或响应时间之类的标准。换句话说,QoS感知的合成可以建模为一个优化问题,我们建议采用遗传算法来实现这个目标。遗传算法虽然比整数规划慢,但代表了更可扩展的选择,并且更适合处理通用QoS属性。本文介绍了我们的方法和它的适用性,优点和缺点,讨论了一些数值模拟的结果。
Web services are rapidly changing the landscape of software engineering. One of the most interesting challenges introduced by web services is represented by Quality Of Service (QoS)--aware composition and late--binding. This allows to bind, at run--time, a service--oriented system with a set of services that, among those providing the required features, meet some non--functional constraints, and optimize criteria such as the overall cost or response time. In other words, QoS--aware composition can be modeled as an optimization problem.We propose to adopt Genetic Algorithms to this aim. Genetic Algorithms, while being slower than integer programming, represent a more scalable choice, and are more suitable to handle generic QoS attributes. The paper describes our approach and its applicability, advantages and weaknesses, discussing results of some numerical simulations.