CFP last date
20 December 2024
Reseach Article

Multicast Routing in Computer Networks considering Quality of Service (QoS) based on Honey Bee Algorithm

by Mohammad Tayeb Taher, Amir Masoudrahmani
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Number 2
Year of Publication: 2012
Authors: Mohammad Tayeb Taher, Amir Masoudrahmani
10.5120/9254-3423

Mohammad Tayeb Taher, Amir Masoudrahmani . Multicast Routing in Computer Networks considering Quality of Service (QoS) based on Honey Bee Algorithm. International Journal of Computer Applications. 58, 2 ( November 2012), 20-24. DOI=10.5120/9254-3423

@article{ 10.5120/9254-3423,
author = { Mohammad Tayeb Taher, Amir Masoudrahmani },
title = { Multicast Routing in Computer Networks considering Quality of Service (QoS) based on Honey Bee Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 58 },
number = { 2 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 20-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume58/number2/9254-3423/ },
doi = { 10.5120/9254-3423 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:01:30.362660+05:30
%A Mohammad Tayeb Taher
%A Amir Masoudrahmani
%T Multicast Routing in Computer Networks considering Quality of Service (QoS) based on Honey Bee Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 58
%N 2
%P 20-24
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The main purpose of multicast routing is minimizing the sources relationship by using multicast structure and the purpose will prepare the routing by minimizing the tree's cost. The Steiner tree's issue is to find a tree the least cost in the network in a way that total weights of the tree should be minimized and connect one or more sources to one or more destinations. The weights which are applied to the edge of the tree could include one or more limitations of quality of service such as bandwidth, delay and cost. It is improved that finding such a tree in the network is a NP-COMPLETE problem. So, a real answer can't be find for that and approximate and discovering solutions are proposed for that. In this paper a suitable answer for mentioned NP-COMPLETE problem is found by presenting a new algorithm according to bee algorithm. Bee algorithm is a collective smart searching algorithm for optimizing the solution of problem. The applied results show that the proposed algorithm with regard to genetic algorithm and practice swarm optimization of Steiner tree with more suitable application percent computers the relation among bandwidth, delay and cost.

References
  1. Hua Wang, Xiangxu Meng, Shuai Li, Hong Xu, Atree-based particle swarm optimization for multicast routing. Computer Networks 54(15): 2775-2786 (2010)
  2. Ziqiang Wang, Xia Sun, Dexian Zhang, "A PSO-Based Multicast Routing Algorithm," icnc, vol. 4, p. 664-667, Third International Conference on Natural Computation (ICNC 2007), 2007
  3. Junwei Wang,Zhaoxia Wu, PSO based QoS Multicast Routing Scheme under inaccurate network Information, Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on 568
  4. Hua Wang; Zhao Shi; Jun Ma; Sch. of Comput. Sci. & Technol. , Shandong Univ. , Jinan, A Modified Ant Colony Algorithm for Multi-constraint Multicast Routing ,Communications and Networking in China, 2006, 1 – 5
  5. Xi-hong Chen, Shao-wei Liu, Jiao Guan, Qiang Liu, "Study on QoS Multicast Routing Based on ACO-PSO Algorithm," icicta, vol. 3, pp. 534-537, International Conference on Intelligent Computation Technology and Automation, 2010
  6. D. T. Pham, A. Ghanbarzadeh, E. Koc, S. Otri, S. Rahim and M. Zaidi, " The Bees Algorithm-A novel tool for complex optimization problems". Proceedings of IPROMS 2006 Conference. pp. 151-168, 2006.
  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 Journal (Elsevier Science), Vol. 27, No. 1, PP. 111-127, 2004.
  8. . Pham D T, Ghanbarzadeh A, Koc E, Otri S, Rahim S and Zaidi M, 2005, The Bees Algorithm,Technical Note, Manufacturing Engineering Centre,Cardiff University, UK.
  9. Z. Wang, B. Shi, E. Zhao, Bandwidth-delay-Constrainted least cost multicast routing based on heuristic genetic algorithm' Computer Communications 24(2001) 685-692.
  10. H. F. Salama, D. S. Reeves, and Y. Viniotis, "Evaluation of multicast routing algorithm for real-time communication on high-speed networks", IEEE Journal on Selected Areas in Communications, IEEE Press, Los Alamitos, CA, April 1997, pp. 332-345.
Index Terms

Computer Science
Information Sciences

Keywords

multicast routing multicast tree quality of service Bee algorithm