Service combination-oriented QoS constraint decomposition method for constraint intensity perceptio

Abstract

The invention provides a service combination-oriented global QoS (Quality of Service) constraint decomposition method for constraint intensity perception. A measurement method of user constraint strength is defined, a relaxation factor self-adaptive adjustment method based on a fuzzy inference rule is designed, and a QoS constraint decomposition model of constraint strength perception for servicecombination is constructed. By using the model, in a constraint decomposition stage, when the user constraint strength is relatively weak, candidate services of each task can be effectively eliminated, so that the size of a solution space when a global optimization method is adopted is reduced; when the user constraint strength is high, a certain number of candidate services can be reserved for each task, so that the probability that a feasible combination scheme can be found during service combination is increased.

Description

technical field [0001] The invention relates to the field of service combination optimization, in particular to a global QoS constraint decomposition method for service combination-oriented constraint strength perception, which can be used to solve the QoS-aware service combination optimization problem. Background technique [0002] The QoS (Quality of Service)-aware service composition problem is a hotspot of academic research, and its purpose is to efficiently select composite services that satisfy the user's global constraints and user preferences according to the service's QoS. [0003] Existing QoS-aware service composition methods can be divided into three categories: local optimization strategy, global optimization strategy and decomposition strategy based on global QoS constraints. The local optimization strategy is not easy to satisfy the user's global QoS constraints; the global optimization strategy often requires high time complexity; the service composition meth...

AI Technical Summary

Problems solved by technology

[0004] Existing global QoS constraint decomposition models can be divided into three categories: constraint decomposition models based on empirical formulas, which have poor adaptability; decomposition models that guarantee global QoS constraints, such models do not have to consider global QoS in the service optimization stage Constraints, so local optimization methods can be used to improve efficiency, but some feasible solutions will be lost. When the user's constraint intensity is high, it is easy to find no feasible combination scheme; the decomposition model that guarantees no loss of feasible solutions cannot guarantee the overall situation. Constraints, and when the user's constraint strength is low, the efficiency of eliminating candidate services and reducing the solution search space is poor

Images