Skip to main content

Advertisement

Log in

Research on QoS service composition based on coevolutionary genetic algorithm

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Traditional genetic algorithms overemphasize the struggle for survival and neglect all other aspects of biology. In addition, binary encoding is widely used in individual coding. Since the individual chromosomes produced are longer in length, it is difficult to ensure the efficiency of the algorithm. In this study, a coevolutionary genetic algorithm is proposed for web service composition based on quality of service (QoS), which fully considers the individual relationships among populations. The real coding method is adopted to solve the service selection problem based on QoS, so that the negative effect of the long length of chromosomes in the algorithm is avoided. Moreover, in view of the difficulty of determining the weight of each QoS attribute in web services, we propose to use the entropy method to determine the weights of each one. Compared with the traditional genetic algorithm, the experimental results show that the proposed algorithm converges faster in the service composition, and the fitness of the optimal solution is higher.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Ahuja SP, Soni N (2017) Performance evaluation of public IaaS clouds for web 2.0 applications using cloudstone benchmark. Int J Cloud Appl Comput 7(1):72–93

    Google Scholar 

  • Bao L, Zhao F, Shen MQ (2016) An orthogonal genetic algorithm for QoS-aware service composition. Comput J 59(10):1857–1871

    Article  MathSciNet  Google Scholar 

  • Cai J, Wang Y, Liu Y (2017) Enhancing network capacity by weakening community structure in scale-free network. Future Gen Comput Syst 867:765–771

    Google Scholar 

  • Chandra R, Chand S (2016) Evaluation of co-evolutionary neural network architectures for time series prediction with mobile application in finance. Appl Soft Comput 49:462–473

    Article  Google Scholar 

  • Chen WB, Peng LX, Wang JX (2013) Inapproximability results for the minimum integral solution problem with preprocessing over infinity norm. Theor Comput Sci 478:127–131

    Article  Google Scholar 

  • Chen WB, Chen ZX, Samatova N (2014) Solving the maximum duo-preservation string mapping problem with linear programming. Theor Comput Sci 530:1–11

    Article  MathSciNet  Google Scholar 

  • Chen Y, Huang JW, Lin C (2015) A partial selection methodology for efficient QoS-aware service composition. IEEE Trans Serv Comput 8(3):384–397

    Article  Google Scholar 

  • Chen XF, Li J, Weng J (2016) Verifiable computation over large database with incremental updates. IEEE Trans Comput 65(10):3184–3195

    Article  MathSciNet  Google Scholar 

  • Chen FZ, Dou R, Li M (2016) A flexible QoS-aware web service composition method by multi-objective optimization in cloud manufacturing. Comput Ind Eng 99:423–431

    Article  Google Scholar 

  • Cremene M, Suciu M, Pallez D (2015) Comparative analysis of multi-objective evolutionary algorithms for QoS-aware web service composition. Appl Soft Comput 39(C):124–139

    Google Scholar 

  • Deng SG, Wu HY, Hu DN (2016) Service selection for composition with QoS correlations. IEEE Trans Serv Comput 9(2):291–303

    Article  Google Scholar 

  • Fan L, Lei X, Yang N (2016) Secure multiple amplify-and-forward relaying with cochannel interference. IEEE J Select Top Signal Process 10(8):1494–1505

    Article  Google Scholar 

  • Fekih H, Mtibaa S, Bouamama S (2017) User-centric web services composition approach based on swarm intelligence. In: IEEE international conference on High PERFORMANCE computing and communications; IEEE, international conference on smart city; IEEE, international conference on data science and systems. IEEE, pp 1087–1094

  • Gabrel V, Manouvrier M, Murat C (2015) Web services composition: complexity and models. Discrete Appl Math 196(2):100–114

    Article  MathSciNet  Google Scholar 

  • Garriga M, Flores A, Cechich A (2015) Web services composition mechanisms: a review. IETE Techn Rev 32(5):376–383

    Article  Google Scholar 

  • Ghoneim A, Muhammad G, Amin SU, Gupta B (2018) Medical image forgery detection for smart healthcare. IEEE Commun Mag 56(4):33–37

    Article  Google Scholar 

  • Guan Z, Li J, Wu L (2017) Achieving efficient and secure data acquisition for cloud-supported internet of things in smart grid. IEEE Internet Things J 4(6):1934–1944

    Article  Google Scholar 

  • Guan Z, Si G, Zhang X (2018) Privacy-preserving and efficient aggregation based on blockchain for power grid communications in smart communities. IEEE Commun Mag 56(7):1–7

    Article  Google Scholar 

  • He P, Deng ZL, Wang HF (2016) Model approach to grammatical evolution: theory and case study. Soft Comput 20(9):3537–3548

    Article  Google Scholar 

  • He P, Deng ZL, Gao CZ (2017) Model approach to grammatical evolution: deep-structured analyzing of model and representation. Soft Comput 21(18):5413–5423

    Article  Google Scholar 

  • Hossain M, Gupta B et al (2017) Sybiltrap: a graph-based semi-supervised learning-based sybil defense scheme. Concurr Comput Pract Exp

  • Hu JJ, Wu GJ, Chen XL (2017) Parallel web service composition algorithm based on graph. J Internet Technol 18(3):667–676

    Google Scholar 

  • Huang Y, Li W, Liang ZP (2016) Efficient business process consolidation: combining topic features with structure matching. Soft Comput 22(2):1–13

    Google Scholar 

  • Li Y, Wang GG, Li N (2017) Distance metric optimization driven convolutional neural network for age ivariant face recognition. Pattern Recogn 75:51–62

    Article  Google Scholar 

  • Li D, Wu JC, Deng ZH (2017) QoS-based service selection method for big data service composition. IEEE Int Conf Comput Sci Eng 1(2):436–443

    Google Scholar 

  • Liang C, Wang XM, Zhang XS (2018) A payload-dependent packet rearranging covert channel for mobile VoIP traffic. Inf Sci 465:162–173

    Article  Google Scholar 

  • Lin WW, Xu SY, Li J (2015) Design and theoretical analysis of virtual machine placement algorithm based on peak workload characteristics. Soft Comput 21(5):1301–1314

    Article  Google Scholar 

  • Lin WW, Xu SY, He LG (2017) Multi-resource scheduling and power simulation for cloud computing. Inf Sci 397(C):168–186

    Article  Google Scholar 

  • Liu Y, Ling J, Liu ZS (2017) Finger vein secure biometric template generation based on deep learning. Soft Comput 21(1):1–9

    Article  MathSciNet  Google Scholar 

  • Ni ZW, Fang QH, Li RR (2015) Improved ant colony optimization for QoS-based web service composition optimization. J Comput Appl 35(8):2238–2243

    Google Scholar 

  • Peng T, Liu Q, Meng DC (2017) Collaborative trajectory privacy preserving scheme in location-based services. Inf Sci 387(C):165–179

    Article  Google Scholar 

  • Rodrguez-Mier P, Mucientes M, Lama M (2017) Hybrid optimization algorithm for large-scale QoS-aware service composition. IEEE Trans Serv Comput 10(4):547–559

    Article  Google Scholar 

  • Shen JQ, Kong XJ (2016) QoS interval number service composition method based on improved ant colony optimization algorithm. Comput Eng 42(7):181–188

    Google Scholar 

  • Silva ASD, Ma H, Zhang MJ (2016) Genetic programming for QoS-aware web service composition and selection. Soft Comput 20(10):3851–3867

    Article  Google Scholar 

  • Sun ZZ, Zhang QX, Li YZ (2016) DPPDL: a dynamic partial-parallel data layout for green video surveillance storage. IEEE Trans Circuits Syst Video Technol 28(1):193–205

    Google Scholar 

  • Tan YA, Xue Y, Liang C (2018) A root privilege management scheme with revocable authorization for Android devices. J Netw Comput Appl 107(4):69–82

    Article  Google Scholar 

  • Tan YA, Xu X, Liang C et al (2018) An end-to-end covert channel via packet dropout for mobile networks. Int J Distrib Sens Netw. https://doi.org/10.1177/1550147718779568

    Article  Google Scholar 

  • Wang DH, Huang H, Xie CS (2014) A novel adaptive web service selection algorithm based on ant colony optimization for dynamic web service composition. In: International conference on algorithms & architectures for parallel processing, pp 391–399

    Google Scholar 

  • Wang YC, He Q, Ye DY et al (2017) Service selection based on correlated QoS requirements. In: IEEE international conference on services computing, pp 241–248

  • Wang LJ, Shen J (2017) A systematic review of bio-inspired service concretization. IEEE Trans Serv Comput 10(4):493–505

    Article  Google Scholar 

  • Wang H, Wang WJ, Cui ZH (2018) A new dynamic firefly algorithm for demand estimation of water resources. Inf Sci 438:95–106

    Article  MathSciNet  Google Scholar 

  • Xue Y, Tan YA, Liang C (2018) Rootagency: a digital signature-based root privilege management agency for cloud terminal devices. Inf Sci 444:36–50

    Article  MathSciNet  Google Scholar 

  • Xue H, Cai JY, Yuan Y et al (2017) The collaborative decision of profit distribution in retail supply chain under emergency. In: Control and decision conference, pp 3385–3389

  • Yuan CS, Li XT, Wu J (2017) Fingerprint liveness detection from different fingerprint materials using convolutional neural network and principal component analysis. Comput Mater Contin 53(3):57–371

    Google Scholar 

  • Zhang QX, Gong HX, Zhang XS et al (2018) A sensitive network jitter measurement for covert timing channels over interactive traffic. Multimed Tools Appl 1–17

  • Zhang YW, Wu JT, Guo X (2016) Approach for cloud service composition based on dynamic skyline and genetic particle swarm optimization. J Chin Comput Syst 37(11):2552–2557

    Google Scholar 

  • Zhang XS, Liang C, Zhang QX (2018) Building covert timing channels by packet rearrangement over mobile networks. Inf Sci 445–446:66–78

    Article  MathSciNet  Google Scholar 

  • Zhang J, Hu JL (2016) A novel registration method based on coevolutionary strategy. Evolut Comput 2375–2380

  • Zhu HF, Tan YA, Zhang XS (2017) A round-optimal lattice-based blind signature scheme for cloud services. Future Gen Comput Syst 73(C):106–114

    Article  Google Scholar 

Download references

Acknowledgements

This work has been supported by the National Natural Science Foundation of China (Grant No. 61772070), the National Key Research and Development Program of China (Grant Nos. 2016YFB0800700, 2016YFC060090), Excellent Teachers Development Foundation of BUCEA, the Fundamental Research Funds for Beijing Universities of Civil Engineering and Architecture.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jingjing Hu.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Communicated by B. B. Gupta.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, Y., Hu, J., Wu, Z. et al. Research on QoS service composition based on coevolutionary genetic algorithm. Soft Comput 22, 7865–7874 (2018). https://doi.org/10.1007/s00500-018-3510-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-018-3510-5

Keywords

Navigation