The multi-constrained multicast routing improved by hybrid bacteria foraging-particle swarm optimization

• Autorzy: Sahoo Satya Prakash , Kabat Manas Ranjan

Identyfikatory

DOI

10.7494/csci.2019.20.2.3131

• Języki publikacji: EN

Abstrakty

EN

To solve multicast routing under multiple constraints, it is required to generate a multicast tree that ranges from a source to the destinations with minimum cost subject to several constraints. In this paper, PSO has been embedded with BFO to improve the convergence speed and avoid premature convergence that will be used for solving QoS multicast routing problem. The algorithm proposed here generates a set of delay compelled links to every destination present in the multicast group. Then the Bacteria Foraging Algorithm (BFA) selects the paths to all the destinations sensibly from the set of least delay paths to construct a multicast tree. The robustness of the algorithm being proposed had been established through the simulation. The efficiency and effectiveness of the algorithm being proposed was validated through the comparison study with other existing meta-heuristic algorithms. It shows that our proposed algorithm IBF-PSO outperforms its competitive algorithms.

Słowa kluczowe

EN

QoS routing; multicasting; bacteria foraging optimization; particle swarm optimization (PSO)

• Wydawca: Wydawnictwa AGH
• Czasopismo: Computer Science
• Rocznik: 2019
• Tom: Vol. 20 (2)
• Strony: 245--269
• Opis fizyczny: Bibliogr. 36 poz., rys., tab.

Twórcy

autor

Sahoo Satya Prakash

• Veer Surendra Sai University of Technology, Department of Computer Science & Engineering

autor

Kabat Manas Ranjan

• Veer Surendra Sai University of Technology, Department of Computer Science & Engineering

Bibliografia

• [1] Abdel-Kader R.F.: Hybrid discrete PSO with GA operators for efficient QoS-multicast routing, Ain Shams Engineering Journal, vol. 2(1), pp. 21-31, 2011.
• [2] Ahlgren B., Dannewitz C., Imbrenda C., Kutscher D., Ohlman B.: A survey of information-centric networking, IEEE Communications Magazine, vol. 50(7), pp. 26-36, 2012.
• [3] Eberhart R., Kennedy J.: A new optimizer using particle swarm theory. In: MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39-43. Ieee, 1995.
• [4] Felber P., Kropf P., Schiller E., Serbu S.: Survey on Load Balancing in Peer- to-Peer Distributed Hash Tables, IEEE Communications Surveys & Tutorials, vol. 16(1), pp. 473-492, 2014.
• [5] Forsati R., Haghighat A.T., Mahdavi M.: Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing, Computer Communications, vol. 31(10), pp. 2505-2519, 2008.
• [6] Gong B., Li L., Wang X.: Multicast Routing Based on Ant Algorithm with Multiple Constraints. In: 2007 International Conference on Wireless Communications, Networking and Mobile Computing, pp. 1945-1948. IEEE, 2007.
• [7] Haghighat A.T., Faez K., Dehghan M., Mowlaei A., Ghahremani Y.: GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing, Computer Communications, vol. 27(1), pp. 111-127, 2004.
• [8] Hamed A.Y.: An Ant Algorithm for Solving QoS Multicast Routing Problem, International Journal of Computer Science and Security, vol. 5(1), pp. 156-167, 2011.
• [9] Hwang R.H., Do W.Y., Yang S.C.: Multicast Routing Based on Genetic Algorithms, Journal of Information Science and Engineering, vol. 16(6), pp. 885-901, 2000.
• [10] Jiang D., Huo L., Li Y.: Fine-granularity inference and estimations to network traffic for SDN, PloS one, vol. 13(5), p. e0194302, 2018.
• [11] Jiang D., Huo L., Lv Z., Song H., Qin W.: A Joint Multi-Criteria Utility-Based Network Selection Approach for Vehicle-to-Infrastructure Networking, IEEE Transactions on Intelligent Transportation Systems, vol. 19(10), pp. 3305-3319, 2018.
• [12] Jiang D., Li W., Lv H.: An energy-efficient cooperative multicast routing in multi- hop wireless networks for smart medical applications, Neurocomputing, vol. 220, pp. 160-169, 2017.
• [13] Jiang D., Xu Z., Li W., Chen Z.: Network coding-based energy-efficient multi- cast routing algorithm for multi-hop wireless networks, Journal of Systems and Software, vol. 104, pp. 152-165, 2015.
• [14] Jiang D., Xu Z., Li W., Yao C., Lv Z., Li T.: An energy-efficient multicast algorithm with maximum network throughput in multi-hop wireless networks, Journal of Communications and Networks, vol. 18(5), pp. 713-724, 2016.
• [15] Jiang D., Zhang P., Lv Z., Song H.: Energy-Efficient Multi-Constraint Routing Algorithm with Load Balancing for Smart City Applications, IEEE Internet of Things Journal, vol. 3(6), pp. 1437-1447, 2016.
• [16] Li W., Li K., Huang Y., Yang S., Yang L.: A EA- and ACA-based QoS multicast routing algorithm with multiple constraints for ad hoc networks, Soft Computing, vol. 21(19), pp. 5717-5727, 2016.
• [17] Molnar M., Bellabas A., Lahoud S.: The cost optimal solution of the multi-constrained multicast routing problem, Computer Networks, vol. 56(13), pp. 3136-3149, 2012.
• [18] Passino K.M.: Biomimicry of bacterial foraging for distributed optimization and control, IEEE Control Systems Magazine, vol. 22(3), pp. 52-67, 2002.
• [19] Patel M.K., Kabat M.R., Tripathy C.R.: A hybrid ACO/PSO based algorithm for QoS multicast routing problem, Ain Shams Engineering Journal, vol. 5(1), pp. 113-120, 2014.
• [20] Peng B., Li L.: A Method for QoS Multicast Routing Based on Genetic Simulated Annealing Algorithm, International Journal of Future Generation Communication and Networking, vol. 5(1), pp. 43-60, 2012.
• [21] Qu R., Xu Y., Castro J.P., Landa-Silva D.: Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems, Journal of Heuristics, vol. 19(2), pp. 317-342, 2013.
• [22] Salama H.F., Reeves D.S., Viniotis Y.: Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE Journal on Selected Areas in Communications, vol. 15(3), pp. 332-345, 1997.
• [23] Sangeetha J., Keerthiraj N., Murthy K.B., Rustagi P.R.: A New Approach for Analyzing the Performance of the WiMAX Networks Based on QoS Traffic Prediction Routing Protocol Using Gene Expression Programming, International Journal of Applied Metaheuristic Computing (IJAMC), vol. 7(2), pp. 16-38, 2016.
• [24] Sharma S., Kumar S., Singh B.: AntMeshNet: An Ant Colony Optimization Based Routing Approach to Wireless Mesh Networks, International Journal of Applied Metaheuristic Computing (IJAMC), vol. 5(1), pp. 20-45, 2014.
• [25] Shi L., Li L., Zhao W., Qu B.: A Delay-Constrained Multicast Routing Algorithm Based on the Ant Colony Algorithm. In: Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012, Springer, pp. 875-882 2013.
• [26] Sun J., Fang W., Wu X., Xie Z., Xu W.: QoS multicast routing using a quantum- behaved particle swarm optimization algorithm, Engineering Applications of Artificial Intelligence, vol. 24(1), pp. 123-131, 2011.
• [27] Wang H., Meng X., Li S., Xu H.: A tree-based particle swarm optimization for multicast routing, Computer Networks, vol. 54(15), pp. 2775-2786, 2010.
• [28] Wang H., Shi Z., Li S.: Multicast routing for delay variation bound using a modified ant colony algorithm, Journal of Network and Computer Applications, vol. 32(1), pp. 258-272, 2009.
• [29] Wang H., Xu H., Yi S., Shi Z.: A tree-growth based ant colony algorithm for QoS multicast routing problem, Expert Systems with Applications, vol. 38(9), pp. 11787-11795, 2011.
• [30] Wang Z., Crowcroft J.: Quality-of-Service Routing for Supporting Multimedia Applications, IEEE Journal on Selected Areas in Communications, vol. 14(7), pp. 1228-1234, 1996.
• [31] Xylomenos G., Ververidis C.N., Siris V.A., Fotiou N., Tsilopoulos C., Vasilakos X., Katsaros K.V., Polyzos G.C.: A Survey of Information-Centric Net- working Research, IEEE Communications Surveys & Tutorials, vol. 16(2), pp. 1024-1049, 2014.
• [32] Yadav A.K., Tripathi S.: QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs, Peer-to-Peer Networking and Applications, vol. 10(4), pp. 897-909, 2017.
• [33] Yen J.Y.: Finding the K Shortest Loopless Paths in a Network, Management Science, vol. 17(11), pp. 712-716, 1971.
• [34] Yin P.Y., Chang R.I., Chao C.C., Chu Y.T.: Niched ant colony optimization with colony guides for QoS multicast routing, Journal of Network and Computer Applications, vol. 40, pp. 61-72, 2014.
• [35] Zhang K., Wang H., Liu F.: Multicast routing for delay and delay variation bounded Steiner tree using simulated annealing. In: Proceedings of 2005 IEEE Networking, Sensing and Control, IEEE, pp. 682-687, 2005
• [36] Zhang L., Cai L.b., Li M., Wang F.h.: A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm, Computer Communications, vol. 32(1), pp. 105-110, 2009.