RT Journal Article
T1 Computing performance requirements for web service compositions
A1 García Domínguez, Antonio
A1 Palomo Lozano, Francisco
A1 Medina Bulo, Inmaculada
A1 Ibias, Alfredo
A1 Núñez García, Manuel
AB In order to produce service compositions, modern web applications now combine both in-house and third-party web services. Therefore, their performance depends on the performance of the services that they integrate. At early stages, it may be hard to quantify the performance demanded from the services to meet the requirements of the application, as some services may not be available or may not provide performance guarantees. The authors present several algorithms that compute the required performance for each service from a model of a service composition at an early stage of development. This is also helpful when testing service compositions and selecting candidate web services, enabling performance-driven recommendation systems for web services that could be integrated into service discovery. Domain experts can annotate the model to include partial knowledge on the expected performance of the services. We develop a throughput computation algorithm and two time limit computation algorithms operating on such a model: a baseline algorithm, based on linear programming, and an optimised graph-based algorithm. We conduct theoretical and empirical evaluations of their performance and capabilities on a large sample of models of several classes. Results show that the algorithms can provide an estimation of the performance required by each service, and that the throughput computation algorithm and the graph-based time limit computation algorithm show good performance even in models with many paths.
PB Elsevier
SN 0920-5489
YR 2022
FD 2022-07-16
LK https://hdl.handle.net/20.500.14352/71881
UL https://hdl.handle.net/20.500.14352/71881
LA eng
NO CRUE-CSIC (Acuerdos Transformativos 2022)
NO Ministerio de Ciencia e Innovación (MICINN)/FEDER
NO Comunidad de Madrid/FEDER
DS Docta Complutense
RD 21 abr 2025