A genetic algorithm computing multicast
trees is proposed in the paper.
The quality of the computed multicast tree is characterized by
the tree cost, end-to-end delay and inter-destination delay variation.
The proposed algorithm is based on a bitstring
encoding of selected Steiner nodes and an efficient genotype decoder
computing delay-constrained multicast trees.
Simulation results show that the proposed genetic
algorithm has very good cost performance
and it can also yield
satisfactory performance regarding end-to-end delay or inter-destination
delay variation under conditions typical of
multicast scenarios in high-speed networks where the number of
destination nodes is
small relative to the size of the network.
To my homepage