• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

On the Complexity of QoS-Aware Service Selection Problem

Thumbnail
View/Open
icsoc15.pdf (415.1Kb)
Date
2015
Dewey
Informatique générale
Sujet
Complexity; Quality of Service; Service selection; Optimization; Complex workflows
DOI
http://dx.doi.org/10.1007/978-3-662-48616-0_23
Conference name
13th International Conference on Service-Oriented Computing, ICSOC 2015
Conference date
11-2015
Conference city
Goa
Conference country
India
Book title
Service-Oriented Computing. 13th International Conference, ICSOC 2015, Goa, India, November 16-19, 2015, Proceedings
Author
Barros, Alistair; Grigori, Daniela; Narendra, Nanjangud C.; Dam, Hoa Khanh
Publisher
Springer
Publisher city
Berlin
Year
2015
ISBN
978-3-662-48615-3
Book URL
10.1007/978-3-662-48616-0
URI
https://basepub.dauphine.fr/handle/123456789/15638
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Abu-Khzam, Faisal N.
status unknown
Bazgan, Cristina
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
El Haddad, Joyce
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Sikora, Florian
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Communication / Conférence
Item number of pages
345-352
Abstract (EN)
This paper addresses the QoS-aware service selection problem considering complex workflow patterns. More specifically, it focuses on the complexity issues of the problem. The NP-hardness of the problem, under various settings, has been open for many years and has never been addressed thoroughly. We study the problem complexity depending on the workflow structure, the number of workflow tasks, the number of alternative services per task and the categories of quality of service criterion associated to services. We provide for the first time the NP-hardness proof of the problem. Additionally, we show that the problem is polynomial in case of only one criterion per task and pseudo-polynomial if there is a fixed number of criteria.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.