Abstract
Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic selection policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Papazoglou, M.P., Traverso, P., Dustdar, S., Leymann, F., Kramer, B.J.: Service-oriented computing: A research roadmap. In: Service Oriented Computing (SOC). Dagstuhl Seminar Proceedings (2006)
O’Sullivan, J., Edmond, D., Ter Hofstede, A.: What’s in a Service? Distributed and Parallel Databases 12(2–3), 117–133 (2002)
Chen, K., Xu, J., Reiff-Marganiec, S.: Markov-HTN Planning Approach to Enhance Flexibility of Automatic Web Service Composition. In: ICWS 2009: IEEE International Conference on Web Services, pp. 9–16 (2009)
OASIS Committee Draft: Web Service - Business Process Execution Language (WS BPEL), Version 2.0 (2006)
Zeng, L., Benatallah, B., Dumas, M., Kalagnanam, J., Sheng, Q.Z.: Quality Driven Web Services Composition. In: WWW 2003: Proceedings of the 12th International Conference on World Wide Web, pp. 411–421 (2003)
Yu, T., Zhang, Y., Lin, K.-J.: Efficient algorithms for Web services selection with end-to-end QoS constraints. ACM Transactions on the Web 1(1), 6 (2007)
Pisinger, D.: Algorithms for Knapsack Problems. PhD thesis, University of Copenhagen, Dept. of Computer Science (1995)
Menascé, D.A., Casalicchio, E., Dubey, V.: On optimal service selection in Service Oriented Architectures. Performance Evaluation 67(8), 659–675 (2009)
Lecue, F., Mehandjiev, N.: Towards Scalability of Quality Driven SemanticWeb Service Composition. In: ICWS 2009: IEEE International Conference on Web Services, pp. 469–476 (2009)
Canfora, G., Di Penta, M., Esposito, R., Villani, M.L.: An approach for QoS-aware service composition based on genetic algorithms. In: GECCO 2005: Proceedings of the 2005 onference on Genetic and volutionary Computation, pp. 1069–1075 (2005)
Alrifai, M., Risse, T.: Combining global optimization with local selection for efficient QoS-aware service composition. In: WWW 2009: Proceedings of the 18th International Conference on World Wide Web, pp. 881–890 (2009)
Alrifai, M., Skoutas, D., Risse, T.: Selecting Skyline Services for QoS-based Web Service Composition. In: WWW 2010: Proceedings of the 19th International Conference on World Wide Web, pp. 11–20 (2010)
Stein, S., Payne, T.R., Jennings, N.R.: Flexible provisioning of web service workflows. ACM Transactions on Internet Technology 9(1), 1–45 (2009)
Klein, A., Ishikawa, F., Bauer, B.: A Probabilistic Approach to Service Selection with Conditional Contracts and Usage Patterns. In: Baresi, L., Chi, C.-H., Suzuki, J. (eds.) ICSOC-ServiceWave 2009. LNCS, vol. 5900, pp. 253–268. Springer, Heidelberg (2009)
Jaeger, M.C., Rojec-Goldmann, G., Muhl, G.: QoS Aggregation for Web Service Composition using Workflow Patterns. In: EDOC 2004: Proceedings of the Eighth IEEE International Enterprise Distributed Object Computing Conference, pp. 149–159 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klein, A., Ishikawa, F., Honiden, S. (2010). Efficient QoS-Aware Service Composition with a Probabilistic Service Selection Policy. In: Maglio, P.P., Weske, M., Yang, J., Fantinato, M. (eds) Service-Oriented Computing. ICSOC 2010. Lecture Notes in Computer Science, vol 6470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17358-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-17358-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17357-8
Online ISBN: 978-3-642-17358-5
eBook Packages: Computer ScienceComputer Science (R0)