Quality driven web services composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
Composing Web services on the Semantic Web
The VLDB Journal — The International Journal on Very Large Data Bases
Logic in Computer Science: Modelling and Reasoning about Systems
Logic in Computer Science: Modelling and Reasoning about Systems
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
An approach for QoS-aware service composition based on genetic algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Preference-based selection of highly configurable web services
Proceedings of the 16th international conference on World Wide Web
Service selection algorithms for composing complex services with multiple qos constraints
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
QoS-based routing of multimedia streams in computer networks
IEEE Journal on Selected Areas in Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
Service Oriented Computing and Applications
Reactive service selection in dynamic service environments
ESOCC'12 Proceedings of the First European conference on Service-Oriented and Cloud Computing
Insurance-Based Business Web Services Composition
International Journal of Organizational and Collective Intelligence
A Survey of Web Services Provision
International Journal of Systems and Service-Oriented Engineering
Hi-index | 0.00 |
In general, multi-QoS constrained Web Services composition, with or without optimization, is a NP-complete problem on computational complexity that cannot be exactly solved in polynomial time. A lot of heuristics and approximation algorithms with polynomial- and pseudo-polynomial-time complexities have been designed to deal with this problem. However, they suffer from excessive computational complexities that cannot be used for service composition in runtime. In this paper, we propose a high performance approach for multi-QoS constrained Web Services selection. Firstly, a correlation model of candidate services are established in order to reduce the search space efficiently. Based on the correlation model, a heuristic algorithm is then proposed to find a feasible solution for multi-QoS constrained Web Services selection with high performance and high precision. The experimental results show that the proposed approach can achieve the expecting goal.