A degree-constrained multicast routing algorithm for multimedia communications
Yanlin Wang, Ying Lu, Yugeng Sun · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2005
Multicast services have been increasingly used by many multimedia applications. As one of the key techniques to support multimedia applications, the rational and effective multicast routing algorithms are very important to networks performance. When switch nodes in networks have different multicast capability, multicast routing problem is modeled as the degree-constrained Steiner problem. We presented a genetic algorithm, named DCGA, for the degree-constrained case in multimedia communications. The algorithm is used to generate degree-constrained multicast trees with bandwidth and end to end delay bound. Simulations over random networks were carried out to compare the performance of the proposed algorithm. Experimental results show that DCGA has better ability in balance load among the nodes in networks, and has capability of finding unsaturated links and (or) unsaturated nodes to generate multicast trees than BMSTA. Moreover, the proposed algorithm can generate multicast tree with lower cost in any networks and can also achieve optimal multicast tree rapidly with the smaller group size.