Abstract
Web services are independently programmable application components which scatter over the Internet. Network latency is one of the major concerns of web service application. Thus, physical locations of web services and users should be taken into account for web service composition. In this paper, we propose a new solution based on the modified binary PSO-based (MBPSO) approach which employs an adaptive inertia technique to allocating web service locations. Although several heuristic approaches have been proposed for web service location-allocation, to our best knowledge, this is the first time applying PSO to solve the problem. A simulated experiment is done using the WS-DREAM dataset with five different complexities. To compare with genetic algorithm and original binary PSO approaches, the proposed MBPSO approach has advantages in most situations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aboolian, R., Sun, Y., Koehler, G.J.: A location allocation problem for a web services provider in a competitive market. Eur. J. Oper. Res. 194(1), 64–77 (2009)
Blondin, J.: Particle Swarm Optimization: A Tutorial (2009)
Clerc, M., Kennedy, J.: The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58–73 (2002)
Curbera, F., Duftler, M., Khalaf, R., Nagy, W., Mukhi, N., Weerawarana, S.: Unraveling the web services web: an introduction to SOAP, WSDL, and UDDI. IEEE Internet Comput. 6(2), 86 (2002)
Curbera, F., Khalaf, R., Mukhi, N., Tai, S., Weerawarana, S.: The next step in web services. Commun. ACM 46(10), 29–34 (2003)
Eberhart, R.C., Shi, Y.: Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. 1, pp. 81–86. IEEE (2001)
Erl, T.: SOA: Principles of Service Design, vol. 1. Prentice Hall, Upper Saddle River (2008)
Fielding, R., Gettys, J., Mogul, J., Frystyk, H., Masinter, L., Leach, P., Berners-Lee, T.: Hypertext transfer protocol-HTTP/1.1, Rfc 2616, (1999, 2009)
Garriga, M., Flores, A., Cechich, A., Zunino, A.: Web services composition mechanisms: a review. IETE Tech. Rev. 32(5), 376–383 (2015)
Ghaderi, A., Jabalameli, M., Barzinpour, F., Rahmaniani, R.: An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem. Netw. Spat. Econ. 12(3), 421–439 (2012)
Guner, A.R., Sevkli, M.: A discrete particle swarm optimization algorithm for uncapacitated facility location problem. J. Artif. Evol. Appl. (2008)
Huang, H., Ma, H., Zhang, M.: An enhanced genetic algorithm for web service location-allocation. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds.) DEXA 2014. LNCS, vol. 8645, pp. 223–230. Springer, Heidelberg (2014). doi:10.1007/978-3-319-10085-2_20
Huang, L., Nie, J.: Using pareto principle to improve efficiency for selection of QoS web services. In: 2010 7th IEEE Consumer Communications and Networking Conference, pp. 1–2. IEEE (2010)
Kennedy, J., Eberhart, R., et al.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, Australia, vol. 4, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, vol. 5, pp. 4104–4108. IEEE (1997)
Khanesar, M.A., Teshnehlab, M., Shoorehdeli, M.A.: A novel binary particle swarm optimization. In: Mediterranean Conference on Control and Automation, MED 2007, pp. 1–6. IEEE (2007)
Kramer, O.: A review of constraint-handling techniques for evolution strategies. Appl. Comput. Intell. Soft Comput. (2010)
Liu, J., Tang, M., Zheng, Z., Liu, X., Lyu, S.: Location-aware and personalized collaborative filtering for web service recommendation. IEEE Trans. Serv. Comput. 9(5), 686–699 (2016)
Liu, Z., Lu, T.: A location & time related web service distributed selection approach for composition. In: 2010 9th International Conference on Grid and Cooperative Computing (GCC), pp. 296–301. IEEE (2010)
McKendrick, J.: Ten companies where SOA made a difference in 2006 (2006)
Mei, Y., Li, X., et al.: An Analysis of the Inertia Weight Parameter for Binary Particle Swarm Optimization (2012)
Moraglio, A., Di Chio, C., Togelius, J., Poli, R.: Geometric particle swarm optimization. J. Artif. Evol. Appl. 2008, 11 (2008)
Rao, J., Su, X.: A survey of automated web service composition methods. In: Cardoso, J., Sheth, A. (eds.) SWSWPC 2004. LNCS, vol. 3387, pp. 43–54. Springer, Heidelberg (2005). doi:10.1007/978-3-540-30581-1_5
Jordehi, A.R., Jasni, J.: Particle swarm optimisation for discrete optimisation problems: a review. Artif. Intell. Rev. 43(2), 243–258 (2015)
Sun, Y., Koehler, G.J.: A location model for a web service intermediary. Decis. Support Syst. 42(1), 221–236 (2006)
Wahab, O.A., Bentahar, J., Otrok, H., Mourad, A.: A survey on trust and reputation models for web services: single, composite, and communities. Decis. Support Syst. 74, 121–134 (2015)
Zhang, Y., Wang, S., Ji, G.: A comprehensive survey on particle swarm optimization algorithm and its applications. Math. Prob. Eng. (2015)
Zhang, Y., Zheng, Z., Lyu, M.R.: WSExpress: a QoS-aware search engine for web services. In: Proceedings of the IEEE International Conference on Web Services (ICWS 2010), pp. 83–90 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Tan, B., Huang, H., Ma, H., Zhang, M. (2017). Binary PSO for Web Service Location-Allocation. In: Wagner, M., Li, X., Hendtlass, T. (eds) Artificial Life and Computational Intelligence. ACALCI 2017. Lecture Notes in Computer Science(), vol 10142. Springer, Cham. https://doi.org/10.1007/978-3-319-51691-2_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-51691-2_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-51690-5
Online ISBN: 978-3-319-51691-2
eBook Packages: Computer ScienceComputer Science (R0)