Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The computational complexity of QoS measures for orchestrations

Autor
Gabarro, J.; Leon, S.; Serna, M.
Tipus d'activitat
Article en revista
Revista
Journal of combinatorial optimization
Data de publicació
2017-11-01
Volum
34
Número
4
Pàgina inicial
1265
Pàgina final
1301
DOI
https://doi.org/10.1007/s10878-017-0146-9 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/114792 Obrir en finestra nova
URL
https://link.springer.com/article/10.1007%2Fs10878-017-0146-9 Obrir en finestra nova
Resum
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, ...
Citació
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.
Paraules clau
Computational complexity, First response delay, Fully defined variables model, Number of outputs, Orchestration, QoS measures, Semantic models
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla

Participants

Arxius