Effective multicasting algorithm for dynamic membership with delay constraint

• Published in: Journal of Zhejiang University. A. Science Vol. 7; no. 2; pp. 156 - 163
• Main Author: 陈琳 徐正全
• Format: Journal Article
• Language: English
• Published: Computer College, Yangtze University, Jingzhou 434102, China 01.02.2006; State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430072, China%State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430072, China
• Subjects: 多信道广播算法; 多址通信; 延迟约束; 服务质量; 路由选择; Multicast; Delay constraint; Quality of Service (QoS); Routing
• DOI: 10.1631/jzus.2006.A0156
• ISSN: 1673-565X

This paper proposes an effective heuristic algorithm The tree constructed by DDMR has the following characteristics： for dynamic multicast routing with delay-constrained DDMR. （1） multicast tree changes with the dynamic memberships; （2） the cost of the tree is as small as possible at each node addition/removal event; （3） all of the path delay meet a fixed delay constraint; （4） minimal perturbation to an existing tree. The proposed algorithm is based on “damage” and “usefulness” concepts proposed in previous work, and has a new parameter bf（Balancing Factor） for judging whether or not to rearrange a tree region when membership changes. Mutation operation in Genetic Algorithm （GA） is also employed to find an attached node for a new adding node. Simulation showed that our algorithm performs well and is better than static heuristic algorithms, in term of cost especially.