Skip to main content

Advertisement

Springer Nature Link
Log in

VNE strategy based on chaos hybrid flower pollination algorithm considering multi-criteria decision making

  • S. I : Hybridization of Neural Computing with Nature Inspired Algorithms
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

With the development of science and technology and the need for multi-criteria decision making (MCDM), the optimization problem to be solved becomes extremely complex. The theoretically accurate and optimal solutions are often difficult to obtain. Therefore, meta-heuristic algorithms based on multi-point search have received extensive attention. The flower pollination algorithm (FPA) is a new swarm intelligence meta-heuristic algorithm, which can effectively control the balance between global search and local search through a handover probability, and gradually attracts the attention of researchers. However, the algorithm still has problems that are common to optimization algorithms. For example, the global search operation guided by the optimal solution is easy to lead the algorithm into local optimum, and the vector-guided search process is not suitable for solving some problems in discrete space. Moreover, the algorithm does not consider dynamic multi-criteria decision problems well. Aiming at these problems, the design strategy of hybrid flower pollination algorithm for virtual network embedding problem is discussed. Combining the advantages of the genetic algorithm and FPA, the algorithm is optimized for the characteristics of discrete optimization problems. The cross-operation is used to replace the cross-pollination operation to complete the global search and replace the mutation operation with self-pollination operation to enhance the ability of local search. Moreover, a life cycle mechanism is introduced as a complement to the traditional fitness-based selection strategy to avoid premature convergence. A chaos optimization strategy is introduced to replace the random sequence-guided crossover process to strengthen the global search capability and reduce the probability of producing invalid individuals. In addition, a two-layer BP neural network is introduced to replace the traditional objective function to strengthen the dynamic MCDM ability. Simulation results show that the proposed method has good performance in link load balancing, revenue–cost ratio, VN requests acceptance ratio, mapping average quotation, average time delay, average packet loss rate, and the average running time of the algorithm.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Tutschku K, Zinner T, Nakao A, Tran-Gia P (2009) Network virtualization: implementation steps towards the future internet. J Hum Behav Soc Environ 22(4):463–478

    Google Scholar 

  2. Miglani A, Kumar N, Chamola V, Zeadally S (2020) Blockchain for internet of energy management: review, solutions, and challenges. Comput Commun 151:395–418

    Google Scholar 

  3. Saharan S, Bawa S, Kumar N (2019) Dynamic pricing techniques for intelligent transportation system in smart cities: a systematic review. Comput Commun 150:603–625

    Google Scholar 

  4. Miglani A, Kumar N (2019) Deep learning models for traffic flow prediction in autonomous vehicles: a review, solutions, and challenges. Veh Commun 20:100184

    Google Scholar 

  5. Sirohi D, Kumar N, Rana PS (2020) Convolutional neural networks for 5g-enabled intelligent transportation system: a systematic review. Comput Commun 153:459–498

    Google Scholar 

  6. Yin X, Zhang K, Li B, Sangaiah AK, Wang J (2018) A task allocation strategy for complex applications in heterogeneous cluster-based wireless sensor networks. Int J Distrib Sens Netw 14(8):1550147718795355

    Google Scholar 

  7. Sulaiman MH, Mustaffa Z, Saari M, Daniyal H, Daud M, Razali S, Bin Mohamed AI (2018) Barnacles mating optimizer: a bio-inspired algorithm for solving optimization problems, pp 265–270

  8. Liu W, Tang Y, Yang F, Dou Y, Wang J (2019) A multi-objective decision-making approach for the optimal location of electric vehicle charging facilities. CMC-Comput Mater Continua 60(2):813–834

    Google Scholar 

  9. Yang H, Yi J, Zhao J, Dong Z (2013) Extreme learning machine based genetic algorithm and its application in power system economic dispatch. Neurocomputing 102:154–162

    Google Scholar 

  10. Pandey HM, Chaudhary A, Mehrotra D (2014) A comparative review of approaches to prevent premature convergence in ga. Appl Soft Comput 24:1047–1077

    Google Scholar 

  11. Pandey HM, Shukla A, Chaudhary A, Mehrotra D (2016) Evaluation of genetic algorithm’s selection methods. In: Satapathy S, Mandal J, Udgata S, Bhateja V (eds) Information systems design and intelligent applications. Advances in intelligent systems and computing, vol 434. Springer, New Delhi

    Google Scholar 

  12. Pandey HM, Chaudhary A, Mehrotra D (2016) Grammar induction using bit masking oriented genetic algorithm and comparative analysis. Appl Soft Comput 38:453–468

    Google Scholar 

  13. Pandey HM, Chaudhary A, Mehrotra D, Kendall G (2016) Maintaining regularity and generalization in data using the minimum description length principle and genetic algorithm: case of grammatical inference. Swarm Evol Comput 31:11–23

    Google Scholar 

  14. Huang Z, Wang C, Chen J, Tian H (2011) Optimal design of aeroengine turbine disc based on kriging surrogate models. Comput Struct 89(1–2):27–37

    Google Scholar 

  15. Venter G, Jaroslaw SS (2002) Particle swarm optimization. AIAA J 41:129–132

    Google Scholar 

  16. Wang J, Ju C, Gao Y, Sangaiah AK, Kim Gj (2018) A pso based energy efficient coverage control algorithm for wireless sensor networks. Comput Mater Contin 56(3):433–446

    Google Scholar 

  17. Wang J, Gao Y, Liu W, Sangaiah AK, Kim HJ (2019) An improved routing schema with special clustering using pso algorithm for heterogeneous wireless sensor network. Sensors 19(3):671

    Google Scholar 

  18. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Glob Optim 39:459–471

    MathSciNet  MATH  Google Scholar 

  19. Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2–3):243–278

    MathSciNet  MATH  Google Scholar 

  20. Wang J, Gao Y, Wang K, Sangaiah AK, Lim SJ (2019) An affinity propagation-based self-adaptive clustering method for wireless sensor networks. Sensors 19(11):2579

    Google Scholar 

  21. Yang XS, He X (2013) Firefly algorithm: recent advances and applications. Int J Swarm Intell 1(1):36

    Google Scholar 

  22. Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) Gsa: a gravitational search algorithm. Inf Sci 179(13):2232–2248

    MATH  Google Scholar 

  23. Erol O, Eksin I (2006) A new optimization method: big bang big crunch. Adv Eng Softw 37(2):106–111

    Google Scholar 

  24. Kumar S, Datta D, Singh SK (2015) Black hole algorithm and its applications. Stud Comput Intell 575:147–170

    Google Scholar 

  25. Shareef H, Ibrahim A, Mutlag A (2015) Lightning search algorithm. Appl Soft Comput 36:315–333

    Google Scholar 

  26. Geem ZW (2009) Music-inspired harmony search algorithm. Stud Comput Intell 191:163–172

    Google Scholar 

  27. Venkata Rao R, Savsani V, Balic J (2012) Teaching-learning-based optimization algorithm for unconstrained and constrained real-parameter optimization problems. Eng Optim 44:1–16

    MathSciNet  Google Scholar 

  28. Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition, pp 4661–4667

  29. Cao H, Han H, Qu Z, Yang L (2018) Heuristic solutions of virtual network embedding: a survey. China Commun 3:186–214

    Google Scholar 

  30. Cao H, Wu S, Aujla G, Wang Q, Yang L, Zhu H (2019) Dynamic embedding and quality of service driven adjustment for cloud networks. IEEE Trans Ind Inf PP:1–1

    Google Scholar 

  31. Haotong C, Yongan G, Shengchen W, Zhicheng Q, Hongbo Z, Longxiang Y (2019) Location aware and node ranking value driven embedding algorithm for multiple substrate networks. In: 2019 IEEE international conference on communications, ICC 2019, Shanghai, China, May 20–24, 2019, pp 1–6

  32. Cao H, Wu S, Hu Y, Mann R, Liu Y, Yang L, Zhu H (2019) An efficient energy cost and mapping revenue strategy for inter-domain nfv-enabled networks. IEEE Internet Things J PP:1–1

    Google Scholar 

  33. Cao H, Zhu Y, Zheng G, Yang L (2017) A novel optimal mapping algorithm with less computational complexity for virtual network embedding. IEEE Trans Netw Serv Manag PP:1–1

    Google Scholar 

  34. Cao H, Yang L, Zhu H (2017) Novel node-ranking approach and multiple topology attributes-based embedding algorithm for single-domain virtual network embedding. IEEE Internet Things J PP:1–1

    Google Scholar 

  35. Cheng X, Zhang ZB, Su S, Yang FC (2011) Virtual network embedding based on particle swarm optimization. Acta Electron Sin 39:2240–2244

    Google Scholar 

  36. Song A, Chen WN, Gu T, Yuan H, Zhang J (2019) Distributed virtual network embedding system with historical archives and set-based particle swarm optimization. IEEE Trans Syst Man Cybern Syst PP(99):1–16

    Google Scholar 

  37. Zhang Z, Xiang C, Su S, Wang Y, Yan L (2013) A unified enhanced particle swarm optimization-based virtual network embedding algorithm. Int J Commun Syst 26(8):1054–1073

    Google Scholar 

  38. Ni Y, Huang G, Wu S, Li C, Zhang P, Yao H (2019) A pso based multi-domain virtual network embedding approach. China Commun 16(4):105–119

    Google Scholar 

  39. Zhuang L, Wang G, Wang M, Zhang K (2018) A virtual network embedding algorithm based on cellular automata genetic mechanism. MATEC Web Conf 232(4):01019

    Google Scholar 

  40. Yu J (2012) Solution for virtual network embedding problem based on simulated annealing genetic algorithm. In: 2012 2nd international conference on consumer electronics, communications and networks (CECNet), pp 579–582

  41. Zhou Z, Chang X, Yang Y, Li L (2016) Resource-aware virtual network parallel embedding based on genetic algorithm. In: 2016 17th international conference on parallel and distributed computing, applications and technologies (PDCAT), pp 81–86

  42. Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs. Springer, Berlin

    MATH  Google Scholar 

  43. Kuang F, Zhang S, Jin Z, Xu W (2015) A novel svm by combining kernel principal component analysis and improved chaotic particle swarm optimization for intrusion detection. Soft Comput 19(5):1187–1199

    MATH  Google Scholar 

  44. Jiang C, Zhang H, Ren Y, Han Z, Chen K, Hanzo L (2017) Machine learning paradigms for next-generation wireless networks. IEEE Wirel Commun 24(2):98–105

    Google Scholar 

  45. Rumelhart David E, Hinton Geoffrey E, Williams RJ (1986) Learning representations by back-propagating errors. Nature 323(10):533–536

    MATH  Google Scholar 

  46. Wang J, Gao Y, Liu W, Sangaiah AK, Kim HJ (2019) An intelligent data gathering schema with data fusion supported for mobile sink in wireless sensor networks. Int J Distrib Sens Netw 15(3):1550147719839581

    Google Scholar 

  47. Yin C, Ding S, Wang J (2019) Mobile marketing recommendation method based on user location feedback. Human Centric Comput Inf Sci 9(1):14

    Google Scholar 

  48. Krizhevsky A, Sutskever I, Hinton GE (2012) Imagenet classification with deep convolutional neural networks. In: Pereira F, Burges CJC, Bottou L, Weinberger KQ (eds) Advances in neural information processing systems 25. Curran Associates, Inc., Red Hook, pp 1097–1105

    Google Scholar 

  49. Zegura EW, Calvert KL, Bhattacharjee S (1996) How to model an internetwork. IEEE Infocom 2(4):594

    Google Scholar 

  50. Pandey HM (2016) Jaya a novel optimization algorithm: what, how and why. In: 2016 6th international conference-cloud system and big data engineering (confluence). IEEE, pp 728–730

Download references

Acknowledgements

This work is supported by “the Fundamental Research Funds for the Central Universities” of China University of Petroleum (East China) (Grant No. 18CX02139A), the Shandong Provincial Natural Science Foundation, China (Grant No. ZR2014FQ018), and the Demonstration and Verification Platform of Network Resource Management and Control Technology (Grant No. 05N19070040). The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, China University of Petroleum (East China), Qingdao, 266580, People’s Republic of China

    Peiying Zhang & Fanglin Liu

  2. School of Computing, Newcastle University, Newcastle Upon Tyne, UK

    Gagangeet Singh Aujla

  3. Computer Science and Engineering Department, Chandigarh University, Gharuan, Mohali, Punjab, India

    Gagangeet Singh Aujla

  4. Research and Development Department, CGC College of Engineering, Mohali, Punjab, 140307, India

    Sahil Vashisht

Authors
  1. Peiying Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Fanglin Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Gagangeet Singh Aujla
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Sahil Vashisht
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding authors

Correspondence to Peiying Zhang or Gagangeet Singh Aujla.

Additional information

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

Zhang, P., Liu, F., Aujla, G.S. et al. VNE strategy based on chaos hybrid flower pollination algorithm considering multi-criteria decision making. Neural Comput & Applic 33, 10673–10684 (2021). https://doi.org/10.1007/s00521-020-04827-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-020-04827-5

Keywords