Heuristic approaches for QoS-based service selection

26Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In a Service Oriented Architecture (SOA) business processes are commonly implemented as orchestrations of web services, using the Web Services Business Process Execution Language (WS-BPEL). Business processes not only have to provide the required functionality, they also need to comply with certain Quality-of-Service (QoS) constraints which are part of a service-level agreement between the service provider and the client. Different service providers may offer services with the same functionality but different QoS properties, and clients can select from a large number of service offerings. However, choosing an optimal collection of services for the composition is known to be an NP-hard problem. We present two different approaches for the selection of services within orchestrations required to satisfy certain QoS requirements. We developed two algorithms, OPTIM-HWeight and OPTIM-PRO, which perform a heuristic search on the candidate services. The OPTIM-HWeight algorithm is based on weight factors and the OPTIM-PRO algorithm is based on priority factors. We evaluate and compare the two algorithms with each other and also with a genetic algorithm. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Comes, D., Baraki, H., Reichle, R., Zapf, M., & Geihs, K. (2010). Heuristic approaches for QoS-based service selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6470 LNCS, pp. 441–455). https://doi.org/10.1007/978-3-642-17358-5_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free