¡Nos trasladamos! E-Prints cerrará el 7 de junio.

En las próximas semanas vamos a migrar nuestro repositorio a una nueva plataforma con muchas funcionalidades nuevas. En esta migración las fechas clave del proceso son las siguientes:

Es muy importante que cualquier depósito se realice en E-Prints Complutense antes del 7 de junio. En caso de urgencia para realizar un depósito, se puede comunicar a docta@ucm.es.

Computing performance requirements for web service compositions



Downloads per month over past year

García Domínguez, Antonio and Palomo Lozano, Francisco and Medina Bulo, Inmaculada and Ibias, Alfredo and Núñez García, Manuel (2022) Computing performance requirements for web service compositions. Computer Standards & Interfaces, 83 . p. 103664. ISSN 0920-5489

[thumbnail of 1-s2.0-S0920548922000381-main.pdf]
Creative Commons Attribution.


Official URL: https://doi.org/10.1016/j.csi.2022.103664


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.

Item Type:Article
Additional Information:

CRUE-CSIC (Acuerdos Transformativos 2022)

Uncontrolled Keywords:Web service compositions, Workflow models, Non-functional requirements, Performance requirements
Subjects:Sciences > Computer science
Sciences > Computer science > Expert systems (Computer science)
ID Code:74109
Deposited On:08 Aug 2022 10:49
Last Modified:08 Aug 2022 10:50

Origin of downloads

Repository Staff Only: item control page