QoS aware service composition with multiple quality constraints

Authors:
Bixin Liu;Quanyuan Wu;Yan Jia;Bin Zhou
Affiliations:
National University of Defense Technology, Changsha, China;National University of Defense Technology, Changsha, China;National University of Defense Technology, Changsha, China;National University of Defense Technology, Changsha, China
Venue:
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Year:
2005

Citing 7
Cited 2

QoS Issues in Web Services

IEEE Internet Computing
Workflow Quality of Service

ICEIMT '01 Proceedings of the IFIP TC5/WG5.12 International Conference on Enterprise Integration and Modeling Technique: Enterprise Inter- and Intra-Organizational Integration: Building International Consensus
Overview of some patterns for architecting and managing composite web services

ACM SIGecom Exchanges
QoS-Aware Middleware for Web Services Composition

IEEE Transactions on Software Engineering
QoS computation and policing in dynamic web service selection

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Service Selection Algorithms for Web Services with End-to-End QoS Constraints

CEC '04 Proceedings of the IEEE International Conference on E-Commerce Technology
Composing Web Services: A QoS View

IEEE Internet Computing

Challenges and solutions in enterprise computing

Enterprise Information Systems - Challenges and Solutions in Enterprise Computing - 11th International IEEE EDOC Conference (EDOC 2007)
GOS: a global optimal selection strategies for QoS-aware web services composition

Service Oriented Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Service composition has been recognized as a flexible way for resource sharing and application integration. Quality of service (QoS) is an important issue for composite services. In this paper, we address the issue of component services selection to ensures their composition satisfy given QoS constraints. We propose the concept of reduction tree as a general scheme to aggregate multi-dimensional quality. And then a heuristic algorithm MCSC_HEU is presented to find execution plans satisfying multiple QoS constrains, with the main idea of evaluating partial plans by a heuristic function during the course of reduction. The time complexity of MCSC_HEU is of polynomial level. Extensive evaluations show that MCSC_HEU succeeds in finding feasible plans with very high probability but demands much less time than exhausting search. So it is an efficient solution for QoS aware service selection with multiple constrains.