Two-stage evolutionary algorithm for dynamic multicast routing in mesh network |
| |
| Authors: | Li Zhu Zhi-shu Li Liang-yin Chen and Yan-hong Cheng |
| |
| Institution: | [1]School of Computer Science, Siehuan University, Chengdu 610065, China [2]Network Center, Chengdu Sport University, Chengdu 610041, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Dynamic multicast Routing Encoding Quality of Service (QoS) Evolution Genetic algorithm (GA) |
| 本文献已被 维普 万方数据 SpringerLink 等数据库收录！ |
|
