Abstract

Efficient QoS-aware web services selection from the numerous number of functionally substitutable web services to deliver complex tasks is a current call from the business world. QoS-aware web services selection is a multi-objective optimization problem. Current approaches adapt genetic algorithms (GA) and particle swarm optimization (PSO) to solve it. However, the execution time performance of QoS-aware web services selection to achieve the maximum fitness value is still a concern for practical distributed applications. This paper proposes an efficient technique to solve this problem using the Social Spider Algorithm (SSA). The experiments evaluate the efficiency and feasibility of the proposed algorithm against PSO. SSA is found to outperform PSO in terms of both execution time and fitness.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call