Bi-objective web service composition problem in multi-cloud environment: a bi-objective time-varying particle swarm optimisation algorithm

摘要

Cloud computing became an inevitable information technology industry. Despite its several plus points such as economy of scale and rapid elasticity, it suffers from vendor lock-in, resource limitation and cybersecurity attacks in which it leads business discontinuity or even business failure. Multi-cloud, on the other hand, can be trustable paradigm to obviate obstacles such as aforesaid unpleasant features of a single cloud. One of the biggest challenges is to know which cloud is commensurate with user's business process with regards to security objectives. To this end, the new method is presented to quantify the amount of cloud security risk (CSR) in regards to user's business process. Therefore, in this paper, the web service composition problem is formulated to bi-objective optimisation problem with service cost and multi-cloud risk viewpoints in ever-increasing multi-cloud environment (MCE) in which each provider has its variable pricing policy and different security level. It is obviously an NP-Hard problem. To solve the combinatorial problem, we develop a bi-objective time-varying particle swarm optimisation (BOTV-PSO) algorithm. The parameters are tuned based on elapsed time so a good balance between exploration and exploitation is achieved. To illustrate the effectiveness of proposed algorithm, we defined several scenarios and compared the performance of proposed algorithm with multi-objective GA-based (MOGA) optimiser, a single objective genetic algorithm (SOGA) that only optimises cost function and neglects CSR, and multi-objective simulated annealing algorithm (MOSA). The experimental results showed the superiority of proposed BOTV-PSO against other approaches in terms of convergence, diversity, fitness, performance, and even scalability.