Quality driven web services composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
QoS-Aware Replanning of Composite Web Services
ICWS '05 Proceedings of the IEEE International Conference on Web Services
WS-replication: a framework for highly available web services
Proceedings of the 15th international conference on World Wide Web
Adaptation inWeb Service Composition and Execution
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
An Adaptive Service Selection Approach to Service Composition
ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
Dynamic Web Service Selection for Reliable Web Service Composition
IEEE Transactions on Services Computing
Complexity results for planning
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
QoS-Based service selection and ranking with trust and reputation management
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Web service composition using markov decision processes
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Hi-index | 0.00 |
With the development of Internet and Web service technology, Web service composition has been an effective way to construct software applications; service selection is the crucial element in the composition process. However, the existing selection methods mostly generate static plans since they neglect the inherent stochastic and dynamic nature of Web services. As a result, Web service composition often inevitably terminates with failure. An indeterminacy-aware service selection algorithmbased on an improved Markov decision process (IMDP) has been designed for reliable service composition, but it suffers from higher computation complexity. Therefore, an efficient method is proposed, which can reduce the computation cost by converting the service selection problem based on IMDP into solving a nonhomogeneous linear equation set. Experimental results demonstrate the success rate of service composition has been improved greatly, whilst also reducing computation cost.