A relaxable service selection algorithm for QoS-based web service composition

  • Authors:

  • Chia-Feng Lin;Ruey-Kai Sheu;Yue-Shan Chang;Shyan-Ming Yuan

  • Affiliations:

  • Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan;Department of Computer Science, Tunghai University, Taichung, Taiwan;Department of Computer Science and Information Engineering, National Taipei University, Taipei, Taiwan;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan

  • Venue:
  • Information and Software Technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Context: Web Services are emerging technologies that enable application to application communication and reuse of autonomous services over Web. Composition of web services is a concept of integrating individual web services to conduct complex business transactions based on functionality and performance constraints Objective: To satisfy user requirements, technologies of Quality of service (QoS)-based web service composition (QWSC) are widely used to build complex applications by discovering the best-fit web services in term of QoS. Method: In this paper, a QoS-based service selection (RQSS) algorithm is proposed to help composite web application development by discovering feasible web services based on functionalities and QoS criteria of user requirements. The RQSS recommends prospective service candidates to users by relaxing QoS constraints if no suitable or available web service could exactly fulfill user requirements. Results: A generic framework is implemented to demonstrate the feasibility and performance of RQSS by adapting WS-BPEL standards, and can be reused for QoS-based web composition applications. Conclusion: The experimental results show that the RQSS algorithm indeed performs well and increases the system availability and reliability.