Introduction to Algorithms
A survey on web services composition
International Journal of Web and Grid Services
On the Dynamic Ant Colony Algorithm Optimization Based on Multi-pheromones
ICIS '08 Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)
Quality-of-service oriented web service composition algorithm and planning architecture
Journal of Systems and Software
IFITA '09 Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01
An improved genetic algorithm for web services selection
DAIS'07 Proceedings of the 7th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
QoS-Based Dynamic Web Service Composition with Ant Colony Optimization
COMPSAC '10 Proceedings of the 2010 IEEE 34th Annual Computer Software and Applications Conference
A novel heuristic algorithm for QoS-aware end-to-end service composition
Computer Communications
Comparison of Bio-inspired Algorithms for Peer Selection in Services Composition
SCC '11 Proceedings of the 2011 IEEE International Conference on Services Computing
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
IEEE Computational Intelligence Magazine
Different Approaches for QoS-Aware Web Services Composition Focused on E-Commerce Systems
WSCAD-SSC '12 Proceedings of the 2012 13th Symposium on Computing Systems
Hi-index | 0.00 |
In this paper three optimization algorithms were used in order to solve the problem of dynamic composition of Web services with Quality of Service (QoS). This combinatorial optimization problem arises when multiple services, which provide subfunctions for a complete function, are aggregated in an execution flow and presented to the user as a single service. This problem has been modeled in the context of two deterministic and one stochastic algorithms, aiming to determine the best flow in terms of QoS. Besides, a performance evaluation was executed considering the composition algorithms in some scenarios and comparing them in terms of response time and quality of the obtained solution. The stochastic algorithm proved to be more advantageous for these scenarios due the deadline exploitation on the search for an optimal solution, although it does not provide guarantees of optimality.