A Novel Selection Approach for Transactional Web Services Composition

QoS-aware services selection as a key step for web services composition has been studied widely. It could select optimal candidate services to non-functional properties for each task in abstract web service composition (WSC). Nowadays, there are lots of research work in this aspect. However, few work considers transactional constraints of WSC. We propose a novel approach which not only resolves the near optimal QoS utility within polynomial time but also satisfies the business transactional requirements. This approach firstly classifies those candidate services of each task belonging to a specific abstract composition web services (CWS) into four classes according to transactional properties of Web Services. Secondly, the solution problem of QoS optimal utility for WSC with transaction constraints can be modeled a directed graph model, which belongs to the problem of single-source shortest path. Finally, we propose the algorithm based on the graph model. Experiments conducted prove effectiveness and feasibility for our method.