QoS Aggregation for Web Service Composition using Workflow Patterns
EDOC '04 Proceedings of the Enterprise Distributed Object Computing Conference, Eighth IEEE International
Composing Web Services: A QoS View
IEEE Internet Computing
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
A QoS Broker Based Architecture for Dynamic Web Service Selection
AMS '08 Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS)
A dynamic web service composite platform based on qos of services
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Assessing fault occurrence likelihood for service-oriented systems
ICWE'11 Proceedings of the 11th international conference on Web engineering
| Hi-index | 0.00 |
The composition of Web services is gaining a considerable momentum as an approach to the effective integration of distributed, heterogeneous and autonomous applications to build more sophisticated and value added services. Algorithms are needed to select the best services for the individual tasks of the composition. QoS is an important criterion to select the best service for the tasks of composition. The objective of selection algorithm is to maximize the QoS of the composition based on the composite service provider's (CSP) QoS requirements. In this paper, we define the various business offers (service offers) of Web services. We classify the CSP's requirements defined on the QoS and service offers based on its structure. We propose a tree structure to represent the CSP's requirements defined on the multiple QoS properties and service offers involving AND and OR operators with varied preferences.