An HMM-based Method for Adapting Service-based Applications to Users’ Quality Preferences

Service-based application (SBA) is composed of software services, and those services may be owned by the developing organization or third parties. To provide functionalities based on the user’s preferences, SBA’s constitute services should be selected dynamically at runtime. For each distinct user’s request, we aim at finding a sequence of services which mostly satisfies user's preferences. Furthermore, we aim at reporting in a systematic manner the list of relevant contributions similar to our work focusing on the adaptation mechanisms. We applied Hidden Markov Model (HMM) to propose a QoS-based service selection method. The method is presented in three steps: Modelling, Learning, and QoS-based Selection. We used real-world QoS dataset to investigate the fitness and the execution time of the method. We compared this work with GSA-based and PSO-based service selection methods. We built and trained an HMM for selecting services for a given sequence of tasks in which the selected services are mostly aligned with user's preferences. Experimental results showed that our method achieves the maximum fitness in a reasonable time. Since service-oriented environments are ever changing, unsupervised learning approaches like Maximum Likelihood Estimation or Viterbi Training should be used to modify the elements and the probabilities of HMM.

Keywords:

Web Service Selection , Quality of Service , Hidden Markov Model , Service-Based Applications , Software Adaptation