A Reinforcement Learning Method for Constraint-Satisfied Services Composition

作者：Ren, Lifang; Wang, Wenjian^*; Xu, Hang

来源：IEEE Transactions on Services Computing, 2020, 13(5): 786-800.

DOI：10.1109/TSC.2017.2727050

• Quality of service
• Internet
• Time factors
• Optimization
• Markov processes
• Uncertainty
• Learning (artificial intelligence)
• Web service composition
• constraint-satisfied
• uncertainty of service behaviors
• undetermined QoS
• Markov decision process (MDP)
• Q-learning algorithm

With increasing adoption and presence of Web services, service composition becomes an effective way to construct software applications. Composite services need to satisfy both the functional and the non-functional requirements. Traditional methods usually assume that the quality of service (QoS) and the behaviors of services are deterministic, and they execute the composite service after all the component services are selected. It is difficult to guarantee the satisfaction of user constraints and the successful execution of the composite service. This paper models the constraint-satisfied service composition (CSSC) problem as a Markov decision process (MDP), namely CSSC-MDP, and designs a Q-learning algorithm to solve the model. CSSC-MDP takes the uncertainty of QoS and service behavior into account, and selects a component service after the execution of previous services. Thus, CSSC-MDP can select the globally optimal service based on the constraints which need the following services to satisfy. In the case of selected service failure, CSSC-MDP can timely provide the optimal alternative service. Simulation experiments show that the proposed method can successfully solve the CSSC problem of different sizes. Comparing with three representative methods, CSSC-MDP has obvious advantages, especially in terms of the success rate of service composition.

• 出版日期2020-9-1
• 单位山西财经大学; 山西大学