A Penalty-Based Genetic Algorithm for QoS-Aware Web Service Composition with Inter-service Dependencies and Conflicts

In Web service based systems, new value-added Web services can be constructed by integrating existing Web services. A Web service may have many implementations, which are functionally identical, but have different quality of service (QoS) attributes, such as response time, price, reputation, reliabi...

Full description

Saved in:
Bibliographic Details
Main Authors: Lifeng Ai, Maolin Tang
Format: Conference Proceeding
Language:English
Subjects:
Australia
Availability
Collaboration
Delay
genetic algorithm
Genetic algorithms
QoS
Quality of service
Scalability
Simple object access protocol
Web service composition
Web services
XML
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In Web service based systems, new value-added Web services can be constructed by integrating existing Web services. A Web service may have many implementations, which are functionally identical, but have different quality of service (QoS) attributes, such as response time, price, reputation, reliability, availability and so on. Thus, a significant research problem in Web service composition is how to select an implementation for each of the component Web services so that the overall QoS of the composite Web service is optimal. This is so called QoS-aware Web service composition problem. In some composite Web services there are some dependencies and conflicts between the Web service implementations. However, existing approaches cannot handle the constraints. This paper tackles the QoS-aware Web service composition problem with inter-service dependencies and conflicts using a penalty-based genetic algorithm (GA). Experimental results demonstrate the effectiveness and the scalability of the penalty-based GA.
DOI:10.1109/CIMCA.2008.104