IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i4d10.1007_s10878-017-0146-9.html
   My bibliography  Save this article

The computational complexity of QoS measures for orchestrations

Author

Listed:
  • Joaquim Gabarro

    (UPC Barcelona Tech)

  • Sergio Leon-Gaixas

    (UPC Barcelona Tech)

  • Maria Serna

    (UPC Barcelona Tech
    Barcelona Graduate School of Mathematics (BGSMath))

Abstract

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.

Suggested Citation

  • Joaquim Gabarro & Sergio Leon-Gaixas & Maria Serna, 2017. "The computational complexity of QoS measures for orchestrations," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1265-1301, November.
    • Handle: RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0146-9
    DOI: 10.1007/s10878-017-0146-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0146-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-017-0146-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sidney Rosario & Albert Benveniste & Claude Jard, 2010. "Flexible Probabilistic QoS Management of Orchestrations," International Journal of Web Services Research (IJWSR), IGI Global, vol. 7(2), pages 21-42, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0146-9. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.