The computational complexity of QoS measures for orchestrations: The computational complexity of QoS measures

We consider Web services defined by orchestrations in the Orc language and two natural quality of services measures, the number of outputs and a discrete version of the first response time . We analyse first those subfamilies of finite orchestrations in which the measures are well defined and consid...

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial optimization 2017-11, Vol.34 (4), p.1265-1301
Main Authors: Gabarro, Joaquim, Leon-Gaixas, Sergio, Serna, Maria
Format: Article
Language:English
Subjects:
Combinatorics
Convex and Discrete Geometry
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Theory of Computation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider Web services defined by orchestrations in the Orc language and two natural quality of services measures, the number of outputs and a discrete version of the first response time . We analyse first those subfamilies of finite orchestrations in which the measures are well defined and consider their evaluation in both reliable and probabilistic unreliable environments. On those subfamilies in which the QoS measures are well defined, we consider a set of natural related problems and analyse its computational complexity. In general our results show a clear picture of the difficulty of computing the proposed QoS measures with respect to the expressiveness of the subfamilies of Orc. Only in few cases the problems are solvable in polynomial time pointing out the computational difficulty of evaluating QoS measures even in simplified models.
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-017-0146-9