Two-stage evolutionary algorithm for dynamic multicast routing in mesh network

In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.

[1]  Cícero Garrozi,et al.  Multiobjective Genetic Algorithm for Multicast Routing , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[2]  Wu Jia.  A QoS-Aware Overlay Multicast Routing Protocol , 2006 .

[3]  Chunping Li,et al.  An Improved Genetic Algorithm for Cost-Delay-Jitter QoS Multicast Routing , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[4]  Tobias Polzin,et al.  Algorithms for the Steiner problem in networks , 2003 .

[5]  Liu Chun-lin.  A QoS Multicast Routing Approach Based on Parallel Quantum Genetic Algorithm , 2007 .

[6]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.

[7]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[8]  Lin Chen,et al.  Effective multicasting algorithm for dynamic membership with delay constraint , 2006 .

[9]  Vijay Arya,et al.  Encodings of Multicast Trees , 2005, NETWORKING.

[10]  Sriram Raghavan,et al.  A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees , 1999, TNET.

[11]  Yi Lin,et al.  Dynamic Zone Based Multicast Routing Protocol for Mobile Ad Hoc Network , 2007, 2007 International Conference on Wireless Communications, Networking and Mobile Computing.

[12]  Li Zhishu,et al.  An Immune Genetic Routing Algorithm for Mesh Network with QoS Constraints , 2007, 2007 International Conference on Wireless Communications, Networking and Mobile Computing.

[13]  Jing Yuan-wei.  QoS Multicast Routing Based on Chaotic Genetic Algorithm , 2007 .

[14]  Gene Tsudik,et al.  Exploring mesh and tree-based multicast. Routing protocols for MANETs , 2006, IEEE Transactions on Mobile Computing.

[15]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[16]  Vachaspathi P. Kompella,et al.  Multicast routing algorithms for multimedia traffic , 1993 .

[17]  Chien-Hung Liu,et al.  A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).