Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(246.54KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
An Ant Algorithm for Solving QoS Multicast Routing Problem
Ahmed Younes Hamed
Pages - 156 - 167     |    Revised - 31-03-2011     |    Published - 04-04-2011
Volume - 5   Issue - 1    |    Publication Date - March / April 2011  Table of Contents
MORE INFORMATION
KEYWORDS
Multimedia Communication, Multicast Routing, Multicast Tree, Ant Colony Algorithms, Bandwidth, Delay and Cost.
ABSTRACT
Abstract: Many applications require send information from a source to multiple destinations through a communication network. To support these applications, it is necessary to determine a multicast tree of minimal cost to connect the source node to the destination nodes subject to delay constraints. Based on the Ant System algorithm, we present an ant algorithm to find the multicast tree that minimizes the total cost. In the proposed algorithm, the k shortest paths from the source node to the destination nodes are used for genotype representation. The expermintal results show that the algorithm can find optimal solution quickly and has a good scalability.
CITED BY (3)  
1 Peng, B., & Li, L. (2014). Combination of Genetic Algorithm and Ant Colony Optimization for QoS Multicast Routing. In Soft Computing in Artificial Intelligence (pp. 49-56). Springer International Publishing.
2 Peng, B., & Li, L. (2013). QoS Multicast Routing Algorithm Based on Genetic Algorithm and Ant Colony Optimization. International Information Institute (Tokyo). Information, 16(10), 7717.
3 Chen, H., & Zhou, P. (2013, July). An ant algorithm for solving the four-coloring map problem. In Natural Computation (ICNC), 2013 Ninth International Conference on (pp. 491-495). IEEE.
1 Google Scholar
2 Academic Journals Database
3 CiteSeerX
4 refSeek
5 Scribd
6 SlideShare
7 PdfSR
1 L. H. Sahasrabuddhe, and B. Mukherjee, “Multicast Routing Algorithms and Protocols: A Tutorial”, IEEE Network, pp. 90-102, January, February 2000.
2 B. Wang, and J. C. Hou, “Multicast Routing and Its QoS Extension: Problems, Algorithms, and Protocols,” IEEE Network, pp. 22-36, January/February 2000.
3 H. F. Salama, D. S. Reeves, and Y. Viniotis, “Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks,” IEEE Journal on Selected Areas in Communications, Vol. 15(3): 332-345, 1997.
4 A. Younes, “A Genetic Algorithm for Finding the K Shortest Paths in a Network”, Egyptian Informatics Journal, Vol.10(2), 2010.
5 Z. Wang, and B. Shi, “Solution to QoS Multicast Routing Problem Based on Heuristic Genetic Algorithm,” Journal of Computer, 2001, Vol. 24(1): 55-61, 2001.
6 X. Zhou, C. Chen, and G. Zhu, “A Genetic Algorithm for Multicasting Routing Problem,” International Conference on Communication Technology, Vol. 2, pp. 1248-1253, 2000.
7 Z. Wang, and J. Crowcroft, “Quality of Service for Supporting Multimedia Applications,” IEEE Journal on Selected Areas in Communications, Vol. 14(7): 1228-1234, 1996.
8 L. Guo and I. Matta, “QDMR: An Efficient QoS Dependent Multicast Routing Algorithm,” Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium, pp. 213- 222, 1999.
9 W. Wu, “Multicast routing Algorithm Based on Multiple Qualities of Services,” Applied Electronic Technologies”, Vol. 266(8), 2000.
10 Chao-Hsien Chu, “A Heuristic Ant Algorithm for Solving QoS Multicast Routing Problem”, Proceedings of the Evolutionary Computation Vol. 2, 2002.
11 Lin Huang, Haishan Han and Jian Hou, “Multicast Routing Based on the Ant System“,Applied Mathematical Sciences, Vol. 1(57): 2827–2838, 2007.
12 Hua Chen, Baolin Sun, “ Multicast Routing Optimization Algorithm with Bandwidth and Delay Constraints Based on GA”, Journal of Communication and Computer, Vol. 2(5): 2005.
13 L. Atzori and A. Raccis, “Network Capacity Assignment for Multicast Services Using Genetic Algorithms”, IEEE Communications Letters, vol. 8(6): 403-405, June 2004.
14 C.W. Ahn and R.S. Ramakrishna, “A genetic algorithm for shortest path routing problem and the sizing of population”, IEEE Transaction on evolutionary computation, vol. 6(6): Dec. 2002.
15 R.H. Hwang, W.Y. Do, and S.C. Yang, “Multicast Routing Based on Genetic Algorithms”, Journal of information science and engineering, vo1.16, pp.885-901, 2000.
16 R. Bhattacharya, P. Venkateswaran, S.K. Sanyal, R. Nandi, , “Genetic algorithm based efficient outing scheme for multicast networks”, IEEE International Conference on Personal Wireless Communications (ICPWC 2005), pp. 500 - 504, Jan 2005
17 L. Chen, Z. Yang, Z. Xu, “A degree-delay-constrained genetic algorithm for multicast routing tree”, The Fourth International Conference on Computer and Information Technology (CIT), pp. 1033 -1038, September 2004.
18 M. Hamdan and M.E. El-Hawary, “Multicast routing with delay and delay variation constraints using genetic algorithm”, Canadian Conference on Electrical and Computer Engineering, vol. 4, pp. 2363 - 2366, May 2004.
19 Luca Sanna Randaccio and Luigi Atzori, “A Genetic Algorithm Based Approach for Group Multicast Routing”, Journal of Networks, Vol. 1(4): , 2006.
Associate Professor Ahmed Younes Hamed
Dammam university, Soudia Arabia - Saudi Arabia
a_y_hamed@yahoo.com