In the service oriented paradigm applications are created as a composition of independently developed Web services. Since the same service may be offered by different providers with different non-functional Quality of Service (QoS) attributes, a selection process is needed to identify the constituent services for a given composite service that best meet the users QoS requirements. In this paper, we consider a broker that offers a composite service with multiple QoS classes to several users each generating a flow of requests over time. We propose a service selection scheme which optimizes the end-to-end aggregated QoS of all incoming flows of requests by means of a simple linear programming problem which scales as the number of users, request volumes and/or services grows. This approach differs from most of the current proposals which may not scale well since: a) requests, even from the same user, are handled independently from one another; and b) the selection process often requires the solution of an NP-hard problem.
Cardellini, V., Casalicchio, E., Grassi, V., LO PRESTI, F. (2007). Flow-based service selection for Web service composition supporting multiple QoS classes. In Proceedings of 2007 IEEE International Conference on Web Services (ICWS 2007) (pp.743-750). Los Alamitos : IEEE Computer Society [10.1109/ICWS.2007.91].
Flow-based service selection for Web service composition supporting multiple QoS classes
CARDELLINI, VALERIA;CASALICCHIO, EMILIANO;GRASSI, VINCENZO;LO PRESTI, FRANCESCO
2007-01-01
Abstract
In the service oriented paradigm applications are created as a composition of independently developed Web services. Since the same service may be offered by different providers with different non-functional Quality of Service (QoS) attributes, a selection process is needed to identify the constituent services for a given composite service that best meet the users QoS requirements. In this paper, we consider a broker that offers a composite service with multiple QoS classes to several users each generating a flow of requests over time. We propose a service selection scheme which optimizes the end-to-end aggregated QoS of all incoming flows of requests by means of a simple linear programming problem which scales as the number of users, request volumes and/or services grows. This approach differs from most of the current proposals which may not scale well since: a) requests, even from the same user, are handled independently from one another; and b) the selection process often requires the solution of an NP-hard problem.File | Dimensione | Formato | |
---|---|---|---|
icws2007.pdf
solo utenti autorizzati
Dimensione
258.17 kB
Formato
Adobe PDF
|
258.17 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.