Two-phase graph search algorithm for QoS-aware automatic service composition

Automatic service composition has been an active research area in the field of service computing. Service engineers demand algorithms that not only synthesize the correct work plans but also meet the need of the overall qualities like response time, throughput, fee, etc. In this paper, we present a novel QoS-aware approach which adopts a two-phase graph search algorithm. This approach effectively reduces the search space and significantly improves the accuracy of the search results.