摘要
为了充分利用日趋紧张的网络资源 ,该文提出了基于克隆策略的重构动态组播路由 ,其基本思想是根据组播成员加入或离开网络而造成对树局部范围的损伤程度来决定是否对该部分进行重构 ,重构是通过先删除重构区域内的所有链路和节点 ,然后用克隆算法对该区域重新选择路由 .实验结果表明 :(1)重构的动态组播树在性能上比不重构的动态组播树好 ;(2 )重构的组播树代价随着重构阈值λ的增大而增大 .
To make use of scare networks resources, a rearrangeable dynamic multicast routing algorithm based on clone strategy is proposed in the paper. Whether or not rearrangement will be determined by the damage to any region of the multicast tree, with newly adding or recently deleting nodes in the region. The rearrangement algorithm is to remove all nodes and edges in that region, and the multicast tree is computed in that region by clone algorithm. The simulation proves that the performance of rearrangement dynamic multicast is better than that of the non-rearrangement, and the cost of rearrangeable dynamic multicast increases with the increase of threshold A.
出处
《计算机学报》
EI
CSCD
北大核心
2004年第6期833-837,共5页
Chinese Journal of Computers
基金
国家自然科学基金 ( 60 3 72 0 45
60 13 3 0 10 )资助
