A relaxable service selection algorithm for QoS-based web service composition
Information and Software Technology
Adaptive scheduling for parallel tasks with QoS satisfaction for hybrid cloud environments
The Journal of Supercomputing
Hi-index | 0.00 |
Web Service Composition (WSC) has become core Service-Oriented Computing technology. It is important for business process to construct a complex one with multi-dimensional QoS assurance. But there exist some problems, such as evaluation for QoS properties of service is not full-scale and the criteria is not clear, the weight for each QoS metric doesn't consider both subjective sensations and objective facts. In this paper we propose a model to provide multi-dimensional QoS support in service selection and replacement. We define a utility function as the evaluation standard, which aggregates all QoS metrics after normalizing their values. Then we use Subjective-Objective Weight Mode (SOWM) to set the weight of each QoS metric. Also we propose a heuristic algorithm on the Multichoice, Multi-dimension 0-1 Knapsack Problem (MMKP) using the rule-library. Finally we test the efficiency of the algorithm and the results prove it is predominant compared with other algorithms.