AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (747.9 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

MR-IDPSO: A Novel Algorithm for Large-Scale Dynamic Service Composition

Yanping ZhangZihui JingYiwen Zhang( )
School of Computer Science and Technology, Key Laboratory of Intelligent Computing and Signal Processing, Ministry of Education, Anhui University, Hefei 230601, China.
Show Author Information

Abstract

In the era of big data, data intensive applications have posed new challenges to the field of service composition. How to select the optimal composited service from thousands of functionally equivalent services but different Quality of Service (QoS ) attributes has become a hot research in service computing. As a consequence, in this paper, we propose a novel algorithm MR-IDPSO (MapReduce based on Improved Discrete Particle Swarm Optimization), which makes use of the improved discrete Particle Swarm Optimization (PSO) with the MapReduce to solve large-scale dynamic service composition. Experiments show that our algorithm outperforms the parallel genetic algorithm in terms of solution quality and is efficient for large-scale dynamic service composition. In addition, the experimental results also demonstrate that the performance of MR-IDPSO becomes more better with increasing number of candidate services.

References

[1]
Marston S., Li Z., Bandyopadhyay S., Zhang J., Ghalsasi A., Cloud computing—The business perspective, Decision Support Systems, vol. 51, no. 1, pp. 176–189, 2011.
[2]
Chen Z., Dong W. Y., Li H., Zhang P., Chen X. M., Cao J. W., Collaborative network security in multi-tenant data center for cloud computing, Tsinghua Science and Technology, vol. 19, no. 1, pp. 82–94, 2014.
[3]
Klein A., Fuyuki I., Honiden S., SanGA: A self-adaptive network-aware approach to service composition, IEEE Transactions on Services Computing, vol. 7, no. 3, pp. 452–464, 2014.
[4]
Jula A., Sundararajan E., Othman Z., Cloud computing service composition: A systematic literature review, Expert Systems with Applications, vol. 41, no. 8, pp. 3809–3824, 2014.
[5]
Chen J. F., Wang H. H., Towey D., Mao C. Y., Huang R. B., Zhan Y. Z., Worst-input mutation approach to web services vulnerability testing based on SOAP messages, Tsinghua Science and Technology, vol. 19, no. 5, pp. 429–441, 2014.
[6]
Zhao X., Song B., Huang P., Wen Z., Weng J., Fan Y., An improved discrete immune optimization algorithm based on PSO for QoS-driven web service composition, Applied Soft Computing, vol. 12, no. 8, pp. 2208–2216, 2012.
[7]
Liang H., Du Y. H., Li S. J., An improved genetic algorithm for service selection under temporal constraints in cloud computing, in Web Information Systems Engineering-WISE 2013, Springer, 2013, pp. 309–318.
[8]
Zhang Y. W., Cui G. M., Wang Y., Zhao S., An optimization algorithm for services composition based on improved FOA, Tsinghua Science and Technology, vol. 20, no. 1, pp. 90–99, 2015.
[9]
Crainic T. G., Toulouse M., Parallel meta-heuristics, in Handbook of Metaheuristics, Springer, 2010, pp. 497–541.
[10]
Snir M., Otto S., Huss-Lederman S., Walker D., Dongarra J., MPI: The Complete Reference. MIT Press, Cambridge, MA, USA, 1995.
[11]
Dean J., Ghemawat S., MapReduce: Simplified data processing on large clusters, Communications of the ACM, vol. 51, no. 1, pp. 107–113, 2008.
[12]
Zhang J. B., Xiang D., Li T. R., Pan Y., M2M: A simple Matlab-to-MapReduce translator for cloud computing, Tsinghua Science and Technology, vol. 18, no. 1, pp. 1–9, 2013.
[13]
Khalid N., Fadzil A., Manaf M., Adapting MapReduce framework for genetic algorithm with large population, in IEEE Conference on Systems, Process & Control (ICSPC), IEEE, 2013, pp. 36–41.
[14]
Zheng H., Yang J., Zhao W., Bouguettaya A., QoS analysis for web service compositions based on probabilistic QoS, in Service-Oriented Computing, Springer, 2011, pp. 47–61.
[15]
Wen T., Sheng G. J., Guo Q., Li Y. Q., Web service composition based on modified particle swarm optimization, (in Chinese), Chinese Journal of Computers, vol. 36, no. 5, pp. 1031–1046, 2013.
[16]
Zhao Y. X., Wu J., Liu C., Dache: A data aware caching for big-data applications using the MapReduce framework, Tsinghua Science and Technology, vol. 19, no. 1, pp. 39–51, 2014.
[17]
[18]
Babu S., Towards automatic optimization of MapReduce programs, in Proceedings of the 1st ACM Symposium on Cloud Computing, ACM, 2010, pp. 137–142.
[19]
Kennedy J., Particle swarm optimization, in Encyclopedia of Machine Learning, Springer, 2010, pp. 760–766.
[20]
Tao F., Zhao D., Yefa H., Zhou Z., Correlation-aware resource service composition and optimal-selection in manufacturing grid, European Journal of Operational Research, vol. 201, no. 1, pp. 129–143, 2010.
[21]
Wang S., Zheng Z., Sun Q., Zou H., Yang F., Cloud model for service selection, in IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), IEEE, 2011, pp. 666–671.
[22]
Wang S., Sun Q., Zou H., Yang F., Particle swarm optimization with skyline operator for fast cloud-based web service composition, Mobile Networks and Applications, vol. 18, no. 1, pp. 116–121, 2013.
[23]
Alrifai M., Risse T., Nejdl W., A hybrid approach for efficient web service composition with end-to-end QoS constraints, ACM Transactions on the Web, vol. 6, no. 2, pp. 7:1–7:31, 2012.
[24]
Beran P. P., Vinek E., Schikuta E., Leitner M., An adaptive heuristic approach to service selection problems in dynamic distributed systems, in Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing, Washington, DC, USA: IEEE Computer Society, 2012, pp. 66–75.
[25]
Tao F., LaiLi Y., Xu L., Zhang L., FC-PACO-RM: A parallel method for service composition optimal-selection in cloud manufacturing system, IEEE Transactions on Industrial Informatics, vol. 9, no. 4, pp. 2023–2033, 2013.
[26]
Pathak J., Basu S., Lutz R., Honavar V., Parallel web service composition in moscoe: A choreography-based approach, in IEEE 4th European Conference on Web Services, IEEE, 2006, pp. 3–12.
[27]
Bartalos P., Bielikov'a M., Semantic web service composition framework based on parallel processing, in IEEE Conference on Commerce and Enterprise Computing, IEEE, 2009, pp. 495–498.
[28]
Brunetti A., A fast fine-grained genetic algorithm for spectrum fitting: An application to X-ray spectra, Computer Physics Communications, vol. 184, no. 3, pp. 573–578, 2013.
[29]
Chen Y., Wei X., Study on coarse-grained parallel genetic algorithm, Advanced Materials Research, vol. 532, pp. 1654–1658, 2012.
[30]
Lim D., Ong Y. S., Jin Y., Sendhoff B., Lee B. S., Efficient hierarchical parallel genetic algorithms using grid computing, Future Generation Computer Systems, vol. 23, no. 4, pp. 658–670, 2007.
[31]
McNabb A. W., Monson C. K., Seppi K. D., Parallel pso using MapReduce, in IEEE Congress on Evolutionary Computation, IEEE, 2007, pp. 7–14.
[32]
Aljarah I., Ludwig S. A., A MapReduce based glowworm swarm optimization approach for multimodal functions, in IEEE Symposium on Swarm Intelligence (SIS), IEEE, 2013, pp. 22–31.
[33]
Pan L., Chen L., Wu J., Skyline web service selection with MapReduce, in IEEE International Conference on Computer Science and Service System (CSSS), IEEE, 2011, pp. 739–743.
Tsinghua Science and Technology
Pages 602-612
Cite this article:
Zhang Y, Jing Z, Zhang Y. MR-IDPSO: A Novel Algorithm for Large-Scale Dynamic Service Composition. Tsinghua Science and Technology, 2015, 20(6): 602-612. https://doi.org/10.1109/TST.2015.7349932

562

Views

62

Downloads

9

Crossref

N/A

Web of Science

11

Scopus

0

CSCD

Altmetrics

Received: 17 March 2015
Revised: 01 June 2015
Accepted: 08 June 2015
Published: 17 December 2015
© The author(s) 2015
Return