Particle Swarm Optimization for Multi-Objective Web Service Location Allocation

Web service location allocation problem is an important problem in the modern IT industry. In this paper, the two major objectives, i.e. deployment cost and network latency, are considered simultaneously. In order to solve this new multi-objective problem effectively, we adopted the framework of binary Particle Swarm Optimization (PSO) due to its efficacy that has been demonstrated in many optimization problems. Specifically, we developed two PSO variants, one with weighted-sum fitness function (WSPSO) and the other with dominance-based fitness function. Concretely, it uses the fast Non-dominate Sorting scheme, and thus is called NSPSO. The experimental results showed that both PSO variants performed better than NSGA-II, which is the one of the most commonly used multi-objective genetic algorithms. Furthermore, we have found that NSPSO achieved a more diverse set of solutions than WSPSO, and thus covers the Pareto front better. This demonstrates the efficacy of using the dominance-based fitness function in solving multi-objective Web service location allocation problem.

[1]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[2]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[3]  Mike P. Papazoglou,et al.  Service oriented architectures: approaches, technologies and research issues , 2007, The VLDB Journal.

[4]  Eila Niemelä,et al.  Toward Semantic QoS Aware Web Services: Issues, Related Studies and Experience , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[5]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[6]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

[7]  Yi Sun,et al.  A location-allocation problem for a web services provider in a competitive market , 2009, Eur. J. Oper. Res..

[8]  El-Ghazali Talbi,et al.  A pareto-based genetic algorithm for optimized assignment of VM requests on a cloud brokering environment , 2013, 2013 IEEE Congress on Evolutionary Computation.

[9]  Xiaodong Li,et al.  A Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization , 2003, GECCO.

[10]  Brunilde Sansò,et al.  Optimal Location of Data Centers and Software Components in Cloud Computing Network Design , 2012, 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012).

[11]  Asit Dan,et al.  SOA service reuse by design , 2008, SDSOA '08.

[12]  Yi Sun,et al.  A location model for web services intermediaries , 2003 .

[13]  Shuping Ran,et al.  A model for web services discovery with QoS , 2003, SECO.

[14]  Junichi Suzuki,et al.  Evolutionary multiobjective optimization for green clouds , 2012, GECCO '12.

[15]  Zibin Zheng,et al.  Distributed QoS Evaluation for Real-World Web Services , 2010, 2010 IEEE International Conference on Web Services.

[16]  Helen J. Wang,et al.  SecondNet: a data center network virtualization architecture with bandwidth guarantees , 2010, CoNEXT.

[17]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[18]  Yi Sun,et al.  A location model for a web service intermediary , 2006, Decis. Support Syst..

[19]  Hitesh Ballani,et al.  Towards predictable datacenter networks , 2011, SIGCOMM 2011.

[20]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[21]  Mengjie Zhang,et al.  An Enhanced Genetic Algorithm for Web Service Location-Allocation , 2014, DEXA.

[22]  Zibin Zheng,et al.  Exploring Latent Features for Memory-Based QoS Prediction in Cloud Computing , 2011, 2011 IEEE 30th International Symposium on Reliable Distributed Systems.

[23]  Carlos A. Coello Coello,et al.  Evolutionary multi-objective optimization: a historical view of the field , 2006, IEEE Comput. Intell. Mag..

[24]  Xin Yao,et al.  Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem , 2011, IEEE Transactions on Evolutionary Computation.