QoS Multicast Routing Based on a Quantum Chaotic Dragonfly Algorithm

被引:0
作者
Mahseur, Mohammed [1 ]
Boukra, Abdelmadjid [1 ]
Meraihi, Yassine [2 ]
机构
[1] Univ Sci & Technol Houari Boumed, Fac Elect & Informat, Dept Informat, Algiers 16025, Algeria
[2] Univ MHamed Bougara Boumerdes, Automat Dept, Ave Independence, Boumerdes 35000, Algeria
来源
MODELLING AND IMPLEMENTATION OF COMPLEX SYSTEMS | 2019年 / 64卷
关键词
Quantum evolutionary algorithm; Dragonfly algorithm; Quality of Service (QoS); Multicast routing; TABU SEARCH; SERVICE; QUALITY;
D O I
10.1007/978-3-030-05481-6_4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.. 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).
引用
收藏
页码:47 / 59
页数:13
相关论文
共 20 条
[1]   Hybrid discrete PSO with GA operators for efficient QoS-multicast routing [J].
Abdel-Kader, Rehab F. .
AIN SHAMS ENGINEERING JOURNAL, 2011, 2 (01) :21-31
[2]  
Armaghan M, 2009, LECT NOTES COMPUT SC, V5899, P285, DOI 10.1007/978-3-642-10509-8_32
[3]   THE COMPUTER AS A PHYSICAL SYSTEM - A MICROSCOPIC QUANTUM-MECHANICAL HAMILTONIAN MODEL OF COMPUTERS AS REPRESENTED BY TURING-MACHINES [J].
BENIOFF, P .
JOURNAL OF STATISTICAL PHYSICS, 1980, 22 (05) :563-591
[4]   Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing [J].
Ghaboosi, Nejla ;
Haghighat, Abolfazl T. .
TELECOMMUNICATION SYSTEMS, 2007, 34 (3-4) :147-166
[5]   Quantum-inspired evolutionary algorithm for a class of combinatorial optimization [J].
Han, KH ;
Kim, JH .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) :580-593
[6]  
Han KH, 2000, IEEE C EVOL COMPUTAT, P1354, DOI 10.1109/CEC.2000.870809
[7]   Quantum computing: an introduction [J].
Hey, T .
COMPUTING & CONTROL ENGINEERING JOURNAL, 1999, 10 (03) :105-112
[8]  
Huang L., 2007, APPL MATH SCI, V1, P2827
[9]   A GA-based QoS multicast routing algorithm for large-scale networks [J].
Koyama, Akio ;
Nishie, Toshiki ;
Arai, Junpei ;
Barolli, Leonard .
International Journal of High Performance Computing and Networking, 2008, 5 (5-6) :381-387
[10]   A novel Hash algorithm construction based on chaotic neural network [J].
Li, Yantao ;
Deng, Shaojiang ;
Xiao, Di .
NEURAL COMPUTING & APPLICATIONS, 2011, 20 (01) :133-141