Thumbnail - Request a copy

A new 0–1 linear program for QoS and transactional-aware web service composition

Gabrel, Virginie; Manouvrier, Maude; Murat, Cécile; Megdiche, Imene (2012), A new 0–1 linear program for QoS and transactional-aware web service composition, 2012 IEEE Symposium on Computers and Communications (ISCC), IEEE, p. 845-850. 10.1109/ISCC.2012.6249407

Type
Communication / Conférence
Date
2012
Conference title
2012 IEEE Symposium on Computers and Communications (ISCC)
Conference date
2012-07
Conference city
Cappadoce
Conference country
Turkey
Book title
2012 IEEE Symposium on Computers and Communications (ISCC)
Publisher
IEEE
ISBN
978-1-4673-2712-1
Pages
845-850
Publication identifier
Metadata
Show full item record
Author(s)
Gabrel, Virginie
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Manouvrier, Maude cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Murat, Cécile
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Megdiche, Imene
Abstract (EN)
In this article, we propose a new model based on 0–1 linear programming for determining a composite web service (structured by a workflow) maximizing a QoS aggregate measure and satisfying transactional properties. The QoS measure is a classical weighted sum of five QoS criteria and the transactional properties are a set of rules that ensures a reliable execution of the composite web service. The proposed 0–1 linear program is solved using a standard solver (CPLEX) and our experiments show that big-size instances can be exactly solved. At our knowledge, it is the first time that a linear program with a polynomial number of variables and constraints is proposed for QoS-driven and transactional-driven web service composition.
Subjects / Keywords
linear programming