| Effective multicasting algorithm for dynamic membership with delay constraint |
| |
| 作者姓名： | 陈琳 徐正全 |
| |
| 作者单位： | Computer College Yangtze University Jingzhou 434102 China，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 |
| |
| 摘 要： | INTRODUCTION Some new emerging applications involve in- formation transmission in a network. Different from traditional single-cast applications, these new arising applications are called multicast as they contain a single sender and multiple receivers. In general, it is needed to construct a multicast routing tree to deliver information along the tree branches. Because links in the tree are shared by paths to different receivers, just one information copy is needed in the middle node. Th…
|
| 关 键 词： | 多址通信 路由选择 延迟约束 服务质量 多信道广播算法 |
| 收稿时间： | 2005-05-21 |
| 修稿时间： | 2005-09-10 |
Effective multicasting algorithm for dynamic membership with delay constraint |
| |
| Lin Chen,Zheng-quan Xu.Effective multicasting algorithm for dynamic membership with delay constraint[J].Journal of Zhejiang University Science,2006,7(2):156-163. |
| |
| Authors: | Lin Chen Zheng-quan Xu |
| |
| Institution: | (1) Computer College, Yangtze University, Jingzhou, 434102, China;(2) State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, 430072, China |
| |
| Abstract: | This paper proposes an effective heuristic algorithm for dynamic multicast routing with delay-constrained DDMR. The tree constructed
by DDMR has the following characteristics: (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. |
| |
| Keywords: | Multicast Routing Delay constraint Quality of Service (QoS) |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
