Keywords : Routing
Engineering and Technology Journal,
2010, Volume 28, Issue 15, Pages 4992-4999
Many Internet applications (such as video conferences) are one-to-many
or many-to-many, where one or multiple sources are sending to multiple receivers. These applications need certain Quality of Services to be guaranteed in underlying network. This paper presents a genetic multicast routing algorithm which finds the low-cost multicasting tree from a designated source to multiple destinations with Quality of Service (QoS) (i.e., bandwidth and end-to-end delay) constraints.
Experimental results show that the proposed algorithm finds the minimum-cost multicast routing tree while satisfying QoS constraints and could finally converge to the global optimal solution for a large-scale network.