A performance comparison of QoS-driven service selection approaches

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Service selection has been widely investigated as an effective adaptation mechanism that allows a service broker, offering a composite service, to bind each task of the abstract composition to a corresponding implementation, selecting it from a set of candidates. The selection aims typically to fulfill the Quality of Service (QoS) requirements of the composite service, considering several QoS parameters in the decision. We compare the performance of two representative examples of the per-request and per-flow approaches that address the service selection issue at a different granularity level. We present experimental results obtained with a prototype implementation of a service broker. Our results show the ability of the per-flow approach in sustaining an increasing traffic of requests, while the per-request approach appears more suitable to offer a finer customizable service selection in a lightly loaded system. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Cardellini, V., Di Valerio, V., Grassi, V., Iannucci, S., & Lo Presti, F. (2011). A performance comparison of QoS-driven service selection approaches. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6994 LNCS, pp. 167–178). https://doi.org/10.1007/978-3-642-24755-2_16

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