Topk Service Composition Algorithm Based on Optimal QoS

The existing QoS-based Topk service composition algorithm can not guarantee the accuracy and time performance of the service composition. This paper proposes a QoS optimal Topk service composition algorithm based on service dependency graph. The algorithm aims to construct the relationship between services by applying the service dependency graph model and to reduce the traversal space through effective filtering strategies. On the basis of a combined path traversal sequence, the generated service composition is represented directly to avoid retrospective searching. Meanwhile, the process removes the redundant service from the service composition with the idea of dynamic programming. Experiments show that the algorithm has better time performance and higher service composition accuracy for large data sets.