Elsevier

Information Sciences

Volume 519, May 2020, Pages 141-160
Information Sciences

Integrating reinforcement learning and skyline computing for adaptive service composition

https://doi.org/10.1016/j.ins.2020.01.039Get rights and content

Abstract

In service computing, combining multiple services through service composition to address complex user requirements has become a popular research topic. QoS-aware service composition aims to find the optimal composition scheme with the QoS attributes that best match user requirements. However, certain QoS attributes may continuously change in a dynamic service environment, so service composition methods need to be adaptive. Furthermore, the large number of candidate services poses a key challenge for service composition, where existing service composition approaches based on reinforcement learning (RL) suffer from low efficiency. To deal with the problems above, in this paper, a new service composition approach is proposed which combines RL with skyline computing where the latter is used for reducing the search space and computational complexity. A WSC-MDP model is proposed to solve the large-scale service composition within a dynamically changing environment. To verify the proposed method, a series of comparative experiments are conducted, and the experimental results demonstrate the effectiveness, scalability and adaptability of the proposed approach.

Introduction

Service composition is a widely used software engineering paradigm to build complex and value-added software [1], [2]. Due to its inter-operability, reusability, deployability, service composition has become one of the key technological choices to deal with complex user requirements by combining multiple atomic services [3]. Services provided by multiple service providers usually have different Quality of Service (QoS), such as price, reliability, reputation, throughput, and response time. In service composition, corresponding QoS constraints need to be considered, leading to QoS-aware service composition, which aims to generate optimal or near-optimal composite services that meet user requirements.

In a dynamic service environment, certain QoS attributes may continuously evolve. As a result, service composition method needs to adapt to the changing environment. Moreover, things may become more complicated if a service composition involves complex service workflows (e.g., WSC-MDP in Fig. 2) and a large number of candidate services, which becomes common for enterprise applications [4]. Nowadays, there are a large number of services on the Internet. For example, programmableweb.com1 has documented over 22,770 APIs by September 2019, and the number of APIs is growing at an alarming rate every year. Thus, efficiency is an important and urgent aspect that must be taken into account. To solve large-scale problems, there are some existing methods like multi-agent in [5], multi-level index technology in [6]. In [5], multiple agents work together and speed up the convergence rate of the algorithm; In [6], authors propose a multi-level index model to expedite Web service discovery and composition. In general, these two methods do not reduce the number of candidate services, so there will be some unnecessary explorations in the process of learning. In this paper, we utilize skyline computing [7], [8] to address the above limitations. Because the skyline chooses high-quality services from a large candidate pool, it can significantly reduce the search space, leading to efficient computation.

To deal with a dynamic environment, we leverage the advantage of reinforcement learning (RL), which learns by trial-and-error interactions with the dynamic environment and thus has good adaptability. Thus, introducing the RL into the process of service composition can optimize the service composition solution and adapt to the dynamic environment. RL is a major type of machine learning method that has become a useful technique to solve sequential decision making problems [9]. In an RL system, a learning agent learns an optimal policy via interactions with an uncertain environment. In each step, the learning agent chooses and executes the optimal action to maximize the long-term reward, instead of being told which action to take. Afterwards, the agent receives a scalar reward and the current state transits to its successive state. Finally, the agent evaluates the effect of this state transition.

In the context of service composition, on the one hand, the environment is constantly changing and certain QoS may continuously evolve. On the other hand, there exist increasing complex composition flows and a huge number of candidate services. Hence, how to adapt to dynamic environment and how to achieve high efficiency are nontrivial. In order to cope with the above two challenges, we combine reinforcement learning and skyline computing in this paper. RL is to respond to dynamic environment and achieve good adaptability. Skyline computing is used to reduce the search space and improve efficiency. More specifically, skyline computing extracts data points which are not dominated by any other point on all QoS dimensions.

In this paper, we develop a service composition approach that combines RL with skyline computing. The main contributions are summarized as follows:

  • In the process of service composition, we present a new method to reduce the search space and computational complexity by exploiting skyline computing.

  • A WSC-MDP model is designed to solve the large-scale service composition problems, which can also deal with a dynamically changing environment.

  • We conduct a series of experiments to demonstrate the effectiveness, scalability and adaptability of the proposed approach.

Table 1 summarizes the main notations used in the rest of the paper. The remainder of this paper is organized as follows. Section 2 gives an overview of related work. Section 3 presents the preliminaries that lay the foundation of the proposed approach. Section 4 introduces the Web Service Composition Markov Decision Process (WSC-MDP) model and service composition algorithm. Section 5 details the experimental evaluation and comparison with other related works. Finally, Section 6 draws our conclusions and identifies some future directions.

Section snippets

Related work

Adaptive service composition has received significant attention. A large number of adaptive service composition methods have been proposed in recent years.

In service computing, the dynamic and uncertain environment is a big challenge for Web service composition. Cao et al. [10] proposed a concept of context service that is able to perceive and adapt to changes in the environment. They also presented a framework that can detect the changes of the environment and adjust dynamically the execution

Preliminaries

We present some preliminaries in this section, focusing on Reinforcement Learning, Skyline Computing, and Web service composition MDP. We also summarize the mathematical notations in Table 2.

Model and algorithm

Firstly, we give a problem description with respect to our service composition scenario. The model in [33], referred to as WSC-MDP, will be used to describe the scenario. Fig. 2 shows a transition graph to illustrate this model. The notes in Fig. 2 will be explained after Definition 3.

The main task is to select proper services for every state node (hollow circle in Fig. 2) and combine them to form an optimal service composition. In this paper, we use RL to find the optimal service composition.

Experiments and analysis

In this section, we conduct a series of experiments to verify the effectiveness of the model and the solution method. We mainly focus on evaluating (1) the effectiveness of skyline; (2) the effectiveness of Q-learning with skyline method; (3) the adaptability of the algorithm; (4) the scalability of the algorithm, in terms of the number of candidate services and the number of state nodes; (5) the statistical significance tests of different algorithms.

Conclusion and future work

In this section, we first summarize the paper and describe some ongoing works that try to improve the proposed framework. Then we identify some future directions.

CRediT authorship contribution statement

Hongbing Wang: Conceptualization, Formal analysis, Writing - original draft, Writing - review & editing. Xingguo Hu: Investigation, Writing - original draft. Qi Yu: Writing - review & editing. Mingzhu Gu: Investigation. Wei Zhao: Investigation. Jia Yan: Investigation. Tianjing Hong: Investigation.

Declaration of Competing Interest

We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.

Acknowledgments

This work was partially supported by National Key Research and Development Program (no. 2018YFB1003800) and NSFC Projects (nos. 61672152, 61232007, 61532013), and Collaborative Innovation Centers of Novel Software Technology and Industrialization and Wireless Communications Technology. Qi Yu was supported in part by an NSF IIS award IIS-1814450 and an ONR award N00014-18-1-2875. The views and conclusions contained in this paper are those of the authors and should not be interpreted as

References (39)

  • H. Wang et al.

    A multi-agent reinforcement learning approach to dynamic service composition

    Inf. Sci. (Ny)

    (2016)
  • L. Baresi et al.

    Self-supervising bpel processes

    IEEE Trans. Software Eng.

    (2011)
  • C. Ye et al.

    Whitening soa testing via event exposure

    IEEE Trans. Software Eng.

    (2013)
  • S. Dustdar et al.

    A survey on web services composition

    Int. J. Web Grid Serv.

    (2005)
  • H. Wang et al.

    Effective bigdata-space service selection over trust and heterogeneous qos preferences

    IEEE Trans. Serv. Comput.

    (2018)
  • H. Wang et al.

    A novel approach to large-scale services composition

    Asia-Pacific Web Conference

    (2013)
  • Y. Wu et al.

    A multilevel index model to expedite web service discovery and composition in large-scale service repositories

    IEEE Trans. Serv. Comput.

    (2016)
  • D. Papadias et al.

    An optimal and progressive algorithm for skyline queries

    Proceedings of the 2003 ACM SIGMOD international conference on Management of data

    (2003)
  • S. Borzsony et al.

    The skyline operator

    Proceedings of the 17th international conference on data engineering

    (2001)
  • R.S. Sutton et al.

    Introduction to reinforcement learning

    (1998)
  • Z. Cao et al.

    A context-aware adaptive web service composition framework

    2015 IEEE International Conference on Computational Intelligence & Communication Technology

    (2015)
  • B. Wang et al.

    Designing a self-adaptive and context-aware service composition system

    2014 IEEE Computers, Communications and IT Applications Conference

    (2014)
  • B. Cheng et al.

    Situation-aware dynamic service coordination in an iot environment

    IEEE/ACM Trans. Netw. (TON)

    (2017)
  • E. Khanfir et al.

    Self-adaptive goal-driven web service composition based on context and qos

    2017 IEEE 14th International Conference on e-Business Engineering (ICEBE)

    (2017)
  • Y. Yan et al.

    Repairing Service Compositions in a Changing World

    Software Engineering Research, Management and Applications 2010

    (2010)
  • K. Chen et al.

    Markov-htn planning approach to enhance flexibility of automatic web service composition

    2009 IEEE International Conference on Web Services

    (2009)
  • V. Uc-Cetina et al.

    Composition of web services using markov decision processes and dynamic programming

    Scientif. World J.

    (2015)
  • B. Cheng et al.

    Adaptive video transmission control system based on reinforcement learning approach over heterogeneous networks

    IEEE Trans. Autom. Sci. Eng.

    (2015)
  • D. Xu et al.

    Robust control of uncertain linear systems based on reinforcement learning principles

    IEEE Access

    (2019)
  • Cited by (32)

    • Energy-aware service composition in multi-Cloud

      2022, Journal of King Saud University - Computer and Information Sciences
    • A variable-length encoding genetic algorithm for incremental service composition in uncertain environments for cloud manufacturing

      2022, Applied Soft Computing
      Citation Excerpt :

      While it mainly focuses on the appropriate allocation of services to fulfill subtasks for multi-tasks problems which are always in sequent mode, and finding the appropriate process structure for tasks when the original one is invalid or not optimal yet due to the dynamic environment or user requests is not considered. In the work [43], skyline computing is used to improve the efficiency of the composition scheme, and RL is adopted to deal with the dynamic uncertain environment. Therefore, in this paper, we proposed an improved variable-length encoding genetic algorithm for structure-varying incremental service composition (ISC-GA) for service composition in uncertain environment.

    • Tackling temporal-dynamic service composition in cloud manufacturing systems: A tensor factorization-based two-stage approach

      2022, Journal of Manufacturing Systems
      Citation Excerpt :

      Besides, the dynamic SC is also feasible to be formulated as an online algorithm or Markov Decision Process. Thus, designing online algorithms [31] and reinforcement learning algorithms [41,40,38] could be our future research direction. Further, publishing real-world CMfg MS QoS dataset is in urgent demand for academia.

    • Efficient computation of G-Skyline groups on massive data

      2022, Information Sciences
      Citation Excerpt :

      The skyline algorithms, aiming to find the best individual tuples, can be classified into three types: indexing-based algorithms [11,13,19,25,32], generic algorithms [1,7,8,39] and lattice-based algorithms [12,24]. Due to its practical importance, skyline is widely used in many applications, such as incomplete data [22], probabilistic data [23], encrypted data [3,40], road networks [21], social networks [27,30], service composition [15,35], feature selection [9] and cohort intelligence [26], just to name a few. Instead of the best individual tuples, the group-based skyline algorithms return the optimal tuple groups.

    View all citing articles on Scopus
    View full text