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
Service-Oriented Architecture: Concepts, Technology, and Design
Service-Oriented Architecture: Concepts, Technology, and Design
ComposingWeb Services with Nondeterministic Behavior
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)
Discovering the best web service
Proceedings of the 16th international conference on World Wide Web
Investigating web services on the world wide web
Proceedings of the 17th international conference on World Wide Web
Quality-of-service oriented web service composition algorithm and planning architecture
Journal of Systems and Software
Multiobjective Optimization of SLA-Aware Service Composition
SERVICES '08 Proceedings of the 2008 IEEE Congress on Services - Part I
Techniques to Produce Optimal Web Service Compositions
SERVICES '08 Proceedings of the 2008 IEEE Congress on Services - Part I
Automatic Web Service Composition Considering User Non-functional Preferences
NWESP '08 Proceedings of the 2008 4th International Conference on Next Generation Web Services Practices
Directed Unfolding of Petri Nets
Transactions on Petri Nets and Other Models of Concurrency I
Web services provision: solutions, challenges and opportunities (invited paper)
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Composition of ConGolog programs
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Web Service QoS Prediction Based on Multi Agents
ICCTD '09 Proceedings of the 2009 International Conference on Computer Technology and Development - Volume 01
Semantic Web Service Composition in Social Environments
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Optimizing QoS-Aware Semantic Web Service Composition
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Optimizing Web Service Composition While Enforcing Regulations
ISWC '09 Proceedings of the 8th International Semantic Web Conference
QoS-Aware composition of web services: an evaluation of selection algorithms
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Composition-Oriented service discovery
SC'05 Proceedings of the 4th international conference on Software Composition
ANAPSID: an adaptive query processing engine for SPARQL endpoints
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Hi-index | 0.00 |
QoS parameters are used to describe services in terms of their behavior and can be used to rank services according to non-functional criteria. To provide an accurate characterization of the quality of a service, we propose a sampling-based technique. The proposed technique uses Adaptive and Sequential Sampling strategies to estimate the QoS parameters that satisfy the required confidence levels while the size of the sample remains small. QoS estimates are used by a hybrid composer, named PT-SAM, to identify the service compositions that satisfy a functional condition and best meet non-functional criteria of a user query. PT-SAM adapts a Petri-Net unfolding algorithm to find a desired marking from an initial state by using a utility function defined on QoS estimates and functional properties of the available services. PT-SAM uses a QoS-based utility function to guide the search into portions of good quality service compositions; thus, PT-SAM is able to scale up to large-scale search spaces of services. We report on the quality of the sampling techniques and the performance of the composer. First, we show correlation between the estimates and the real values of the QoS parameters; then, we report on the benefits of using these estimates to traverse large search spaces of service compositions (e.g., in the range of 1,000 to 100,000 services). Our experiments show that the quality of the compositions identified by our algorithm is close to the optimal solution produced by the exhaustive algorithm.