On the Complexity of QoS-Aware Service Selection Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

On the Complexity of QoS-Aware Service Selection Problem

Résumé

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.

Dates et versions

hal-01505504 , version 1 (11-04-2017)

Identifiants

Citer

Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora. On the Complexity of QoS-Aware Service Selection Problem. 13th International Conference on Service-Oriented Computing, ICSOC 2015, Nov 2015, Goa, India. pp.345-352, ⟨10.1007/978-3-662-48616-0_23⟩. ⟨hal-01505504⟩
60 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More