A QoS Pruning-Based Top-k Automatic Service Composition Method

Generally,in the situation of vast amount of Web services,it is often a challenge to automatically searching for Top-k QoS-optimal service composition plans.To address the challenge,service composition modeling is proposed firstly.Then,a forward service filtering algorithm is employed for reducing solution spaces.Lastly,a greedy-based pruning algorithm is designed for backward searching for Top-k QoS-optimal solutions efficiently.In addition,a platform is designed for implementing the proposed method,and its experiment results validate the effectiveness and efficiency of the method.