Advertisement

QoS Multicast Routing Based on a Quantum Chaotic Dragonfly Algorithm

  • Mohammed Mahseur
  • Abdelmadjid Boukra
  • Yassine Meraihi
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 64)

Abstract

Optimizing the quality of service in a multicast routing is a persistent research problem for data transmission in computer networks. It is known to be an NP-hard problem, so several meta-heuristics are applied for an approximate resolution. In this paper, we resolve the quality of service multicast routing problem (QoSMRP) with using a combined approach that uses a newly meta-heuristic called Dragonfly Algorithm (DFA) and Quantum Evolutionary Algorithm (QEA), we adopted a quantum representation of the solutions by a vector of continuous real values which allowed us to use the continuous version of the DFA without discretization, we also use the equation of DFA to calculate \(\varDelta \theta \) in QEA. The interest of these contributions is to avoid premature convergence, to improve the diversity of solutions, and to increase the efficiency and performance of the proposed algorithm. The experimental results show the feasibility, scalability, and effectiveness of our proposed approach compared to other algorithms such as Genetic Algorithm (GA), Quantum Evolutionary Algorithm (QEA), and Dragonfly Algorithm (DFA).

Keywords

Quantum evolutionary algorithm Dragonfly algorithm Quality of Service (QoS) Multicast routing 

References

  1. 1.
    Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE J. Sel. Areas Commun. 14(7), 1228–1234 (1996)CrossRefGoogle Scholar
  2. 2.
    Koyama, A., Nishie, T., Arai, J., Barolli, L.: A GA-based QoS multicast routing algorithm for large-scale networks. Int. J. High Perform. Comput. Netw. 5(5–6), 381–387 (2008)CrossRefGoogle Scholar
  3. 3.
    Haghighat, A.T., Nejla Ghaboosi and: Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommun. Syst. 34(3–4), 147–166 (2007)Google Scholar
  4. 4.
    Armaghan, M., Haghighat, A.T.: QoS Multicast Routing Algorithms Based on Tabu Search with Hybrid Candidate List, pp. 285–294. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Huang, L., Han, H., Hou, J.: Multicast routing based on the ant system. Appl. Math. Sci. 1(57), 2827–2838 (2007)zbMATHGoogle Scholar
  6. 6.
    Wang, H., Hong, X., Yi, S., Shi, Z.: A tree-growth based ant colony algorithm for QoS multicast routing problem. Expert. Syst. Appl. 38(9), 11787–11795 (2011)CrossRefGoogle Scholar
  7. 7.
    Mahseur, M., Boukra, A.: Using bio-inspired approaches to improve the quality of service in a multicast routing. Int. J. Commun. Netw. Distrib. Syst. 19(2), 186–213 (2017)CrossRefGoogle Scholar
  8. 8.
    Meraihi, Y., Acheli, D., Ramdane-Cherif, A.: An improved chaotic binary bat algorithm for QoS multicast routing. Int. J. Artif. Intell. Tools 25(04), 1650025 (2016)CrossRefGoogle Scholar
  9. 9.
    Mahseur, M., Boukra, A., Meraihi, Y.: Improved quantum chaotic animal migration optimization algorithm for qos multicast routing problem. In: 6th IFIP TC 5 International Conference on Computational Intelligence and Its Applications, CIIA 2018, Oran, Algeria, May 8–10, 2018, Proceedings 6, pp. 128–139. Springer (2018)Google Scholar
  10. 10.
    Meraihi, Y., Acheli, D., Ramdane-Cherif, A., Mahseur, M.: A quantum-inspired binary firefly algorithm for QoS multicast routing. Int. J. Metaheuristics 6(4), 309–333 (2017)CrossRefGoogle Scholar
  11. 11.
    Abdel-Kader, R.F.: Hybrid discrete PSO with GA operators for efficient QoS-multicast routing. Ain Shams Eng. J. 2(1), 21–31 (2011)CrossRefGoogle Scholar
  12. 12.
    Meraihi, Y., Acheli, D., Ramdane-Cherif, A.: QoS multicast routing for wireless mesh network based on a modified binary bat algorithm. Neural Comput. Appl. 1–17 (2017)Google Scholar
  13. 13.
    Mirjalili, S.: Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput. Appl. 27(4), 1053–1073 (2016)CrossRefGoogle Scholar
  14. 14.
    Han, K.-H., Kim, J.-H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput. 6(6), 580–593 (2002)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Benioff, P.: The computer as a physical system: a microscopic quantum mechanical hamiltonian model of computers as represented by turing machines. J. Stat. Phys. 22(5), 563–591 (1980)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Han, K.H., Kim, J.H.: Genetic quantum algorithm and its application to combinatorial optimization problem, vol. 2, pp. 1354–1360. IEEE (2000)Google Scholar
  17. 17.
    Ying, M.: Quantum computation, quantum theory and AI. Artif. Intell. 174(2), 162–176 (2010)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Hey, T.: Quantum computing: an introduction. Comput. Control. Eng. J. 10(3), 105–112 (1999)CrossRefGoogle Scholar
  19. 19.
    Li, Y., Deng, S., Xiao, D.: A novel hash algorithm construction based on chaotic neural network. Neural Comput. Appl. 20(1), 133–141 (2011)CrossRefGoogle Scholar
  20. 20.
    Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Mohammed Mahseur
    • 1
  • Abdelmadjid Boukra
    • 1
  • Yassine Meraihi
    • 2
  1. 1.Department of Informatics, Faculty of Electronics and Informatics, University of Sciences and Technology Houari BoumedieneAlgiersAlgeria
  2. 2.Automation Department, University of MHamed Bougara BoumerdesBoumerdesAlgeria

Personalised recommendations