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

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 transactiona...

Full description

Saved in:
Bibliographic Details
Main Authors: Gabrel, V., Manouvrier, M., Megdiche, I., Murat, C.
Format: Conference Proceeding
Language:English
Subjects:
Aggregates
Approximation algorithms
Linear programming
Mathematical model
Quality of service
Reliability
Web services
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1530-1346
2642-7389
DOI:10.1109/ISCC.2012.6249407