Aggregate Quality of Service Computation for Composite Services
Marlon Dumas, Luciano Garcia-Banuelos, Artem Polyvyanyy, Yong Yang, Liang Zhang, PP Maglio (ed.), M Weske (ed.), J Yang (ed.), M Fantinato (ed.)
SERVICE-ORIENTED COMPUTING - ICSOC 2010, PROCEEDINGS | SPRINGER-VERLAG BERLIN | Published : 2010
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 orches..View full abstract
Awarded by NSF of China
Awarded by Chinese National Basic Research Program (973)
Work supported by the NSF of China grant 60873115, the Chinese National Basic Research Program (973) grant 2005CB321905 and the Fudan Short-Term Visits Program for Doctoral Students. Work also supported by the ERDF via the Estonian Centre of Excellence in Computer Science.