Loading...
Loading...

Go to the content (press return)

The computational complexity of QoS measures for orchestrations

Author
Gabarro, J.; Leon, S.; Serna, M.
Type of activity
Journal article
Journal
Journal of combinatorial optimization
Date of publication
2017-11-01
Volume
34
Number
4
First page
1265
Last page
1301
DOI
https://doi.org/10.1007/s10878-017-0146-9 Open in new window
Repository
http://hdl.handle.net/2117/114792 Open in new window
URL
https://link.springer.com/article/10.1007%2Fs10878-017-0146-9 Open in new window
Abstract
The final publication is available at link.springer.com 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, ...
Citation
Gabarro, J., Leon, S., Serna, M. The computational complexity of QoS measures for orchestrations. "Journal of combinatorial optimization", 1 Novembre 2017, vol. 34, núm. 4, p. 1265-1301.
Keywords
Computational complexity, First response delay, Fully defined variables model, Number of outputs, Orchestration, QoS measures, Semantic models
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods
CBA - Communications and Broadband Architectures Lab

Participants

Attachments