Quality of Service (QoS) Optimization in a Multicast Routing: : A Hybrid Solution
Pages 27 - 54
Abstract
Optimizing the QoS of multicast routing with multiple constraints is a NP-hard problem. Thus, the use of approximate methods is unavoidable. This article proposes to modify Bat Algorithm (BA) to solve such problem. BA is a metaheuristic that has been applied to several issues of various fields and has given good results, which has owned him a good reputation in terms of robustness and performance. Like any metaheuristic, BA can be trapped in a local optimum. In order to avoid such problem, the authors propose to hybridize BA with the quantum principle and introduce the chaotic map in the calculation of parameters leading to more diversification. The authors chose to adopt a quantum representation for the solutions. The approach, named quantum Bat Algorithm with Chaotic Map (CBAQEA), was experimented and compared with other well-known methods. The experimental results reveal the efficiency and the superiority of the proposed algorithm in terms of multicast routing cost with a good trade-off between intensification and diversification without premature convergence compared to other algorithms in the literature.
References
[1]
Yang, X. S. (2010). A New Metaheuristic Bat-Inspired Algorithm. In J.R. Gonzalez et al. (Eds.), Nature inspired cooperative strategies for optimization (NISCO 2010) (pp. 65-74).
[2]
Abdel-Kader, R. (2011). Hybrid discrete PSO with GA operators for efficient QoS-multicast routing. Ain Shams Engineering Journal, 2(1), 21–31.
[3]
Armaghan, M., & Haghighat, A. (2009). QoS multicast routing algorithms based on tabu search with hybrid candidate list. In International Conference on Future Generation Information Technology (pp. 285-294). Springer.
[4]
Yang, X. S. & Hossein Gandomi, A. (2012). Bat algorithm: A novel approach for global engineering optimization. Engineering Computations: International Journal for Computer-Aided Engineering and Software, 29(5), 464–483.
[5]
Forsati, R., Haghighat, A., & Mahdavi, M. (2008). Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Computer Communications, 31(10), 2505–2519.
[6]
Gandomi, A. H., Xin-She, Y., Alavi, A. H., & Talatahari, S. (2012). Bat algorithm for constrained optimization tasks. Neural Computing and Applications, 22(6), 1239-1255.
[7]
Gandomi, A. H., & Yang, X.-S. (2014). Chaotic bat algorithm. Journal of Computational Science, 5(5), 224–232.
[8]
Ghaboosi, N., & Haghighat, A. (2007). Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommunication Systems, 34(3-4), 147–166.
[9]
GhaboosiN.HaghighatA. T. (2007). A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem. In 19th IEEE International Conference on Tools with Artificial Intelligence (pp. 383-390). 10.1109/ICTAI.2007.17
[10]
Girgis, M. R., Mahmoud, T. M., & Hanna, G. W. (2016). Tree growth based ACO algorithm for solving the bandwidth-delay-constrained least-cost multicast routing problem. International Journal of Computer and Information Technology, 5(6), 516–523.
[11]
Girgis, M. R., Mahmoud, T. M., & Hanna, G. W. (2016). Using GA, PSO and hybrid GA-PSO based algorithms for solving the least-cost multicast problem with QoS constraints. International Journal of Computer Systems, 3(3), 166–172.
[12]
Haghighat, A. T., Faez, K., Dehghan, M., Mowlaei, A., & Ghahremani, Y. (2004). GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing. Computer Communications, 27(1), 111–127.
[13]
Han, K.-H. & Kim, J.-H. (2002). Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE transactions on evolutionary computation, 6(6), 580-593.
[14]
Heidari, A., Abbaspour, R., & Jordehi, A. (2015). An efficient chaotic water cycle algorithm for optimization tasks. Neural Computing & Applications, 28(1), 57–85.
[15]
Huang, L., Han, H., & Hou, J. (2007). Multicast Routing Based on the Ant System. Applied Mathematical Sciences, 1(57), 2827–2838.
[16]
JunS.JingL.WenboX. (2006). QPSO-Based QoS Multicast Routing Algorithm. In Asia-Pacific Conference on Simulated Evolution and Learning (pp. 261-268). Springer.
[17]
Koyama, A., Nishie, T., Arai, J., & Barolli, L. (2008). A GA-based QoS multicast routing algorithm for large-scale networks. International Journal of High Performance Computing and Networking, 5(5-6), 381–387.
[18]
Kumar PatelM.Ranjan KabatM.Ranjan TripathyC. (2011). A Swarm Intelligence Based Algorithm for QoS Multicast Routing Problem. In International Conference on Swarm, Evolutionary, and Memetic Computing (pp. 38-45). Springer.
[19]
Kumar Patel, M., Ranjan Kabat, M., & Ranjan Tripathy, C. (2013). A hybrid ACO/PSO based algorithm for QoS multicast routing problem. Ain Shams Engineering Journal, 5(1), 113–120.
[20]
Mahseur, M., & Boukra, A. (2017). Using bio-inspired approaches to improve the quality of service in a multicast routing. International Journal of Communication Networks and Distributed Systems, 19(2), 186–213.
[21]
Molnar, M. (2016). Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem. Journal of Computer and Communications, 4(14), 57–79.
[22]
Nowotniak, R. (2010). Survey of Quantum-Inspired Evolutionary Algorithms. In Materiały konferencyjne Forum Innowacji Młodych Badaczy.
[23]
Qu, R., Xu, Y., Castro, J. P., & Landa-Silva, D. (2013). Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. Journal of Heuristics, I(19), 317–342.
[24]
Skorin-KapovN.KosM. (2003). The Application of Steiner Trees to Delay Constrained Multicast Routing: a Tabu Search Approach. In Proceedings of the 7th International Conference on Telecommunications ConTEL 2003 (Vol. 2, pp. 443-448). IEEE.
[25]
Skorin-Kapov, N., & Kos, M. (2006). A GRASP heuristic for the delay-constrained multicast routing problem. Telecommunication Systems, 32(1), 55–69.
[26]
Wang, H., Fang, J., Wang, H., & Sun, Y.-M. (2004). TSDLMRA: An efficient multicast routing algorithm based on Tabu search. Journal of Network and Computer Applications, (27): 77–90.
[27]
Wang, H., Meng, X., Li, S., & Xu, H. (2010). A tree-based particle swarm optimization for multicast routing. Computer Networks, 54(15), 2775–2786.
[28]
Wang, H., Xu, H., Yi, S., & Shi, Z. (2011). A tree-growth based ant colony algorithm for QoS multicast routing problem. Expert Systems with Applications, 38(9), 11787–11795.
[29]
Wang, X.-L., & Jiang, Z. (2004). QoS multicast routing based on simulated annealing algorithm (pp. 511–516). Proc. Network Architectures, Management, and Applications.
[30]
Wang, Z., & Crowcroft, J. (1996). Quality-of-Service Routing for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications, 14(7), 1228–1234.
[31]
Waxman, B. M. (1988). Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications, 6(9), 1617–1622.
[32]
Youssef, H., Al-Mulhim, A., M. Sait, S. & Tahir, M. A. (2002). QoS-Driven multicast tree generation using Tabou Search. computer communications, 25(11-12), 1140-1149.
[33]
Zhengying, W., Bingxin, S., & Erdun, Z. (2001). Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Computer Communications, 24(7-8), 685–6932.
Index Terms
- Quality of Service (QoS) Optimization in a Multicast Routing: A Hybrid Solution
Index terms have been assigned to the content through auto-classification.
Recommendations
QoS Multicast Routing Based on Firefly Algorithm
ISCID '13: Proceedings of the 2013 Sixth International Symposium on Computational Intelligence and Design - Volume 01QoS multicast routing problem is a nonlinear combination optimization problem, which is difficult to get the global solution by using the traditional algorithm. In this paper, we use the Firefly Algorithm (FA) to solve the multi-constrained QoS ...
A GA-based QoS multicast routing algorithm for large-scale networks
For multimedia applications, the routing algorithms should consider many Quality of Service (QoS) parameters. However, to find routes with two or more QoS parameters is an NP-hard problem. Therefore, recently many researchers are trying to use heuristic ...
GA-based heuristic algorithms for QoS based multicast routing
Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed algorithm, the ...
Comments
Information & Contributors
Information
Published In
Copyright © 2019.
Publisher
IGI Global
United States
Publication History
Published: 01 April 2019
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 04 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in