This paper addresses the problem of computing the aggregate QoS of a composite service given the QoS of the services participating in the composition. Previous solutions to this problem are restricted to composite services with well-structured orchestration models. Yet, in existing languages such as WS-BPEL and BPMN, orchestration models may be unstructured. This paper lifts this limitation by providing equations to compute the aggregate QoS for general types of irreducible unstructured regions in orchestration models. In conjunction with existing algorithms for decomposing business process models into single-entry-single-exit regions, these functions allow us to cover a larger set of orchestration models than existing QoS aggregation techniques. © 2010 Springer-Verlag.
CITATION STYLE
Dumas, M., García-Bañuelos, L., Polyvyanyy, A., Yang, Y., & Zhang, L. (2010). Aggregate quality of service computation for composite services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6470 LNCS, pp. 213–227). https://doi.org/10.1007/978-3-642-17358-5_15
Mendeley helps you to discover research relevant for your work.