| 摘要: |
| 针对目前基于共享树的组播路由算法中有些算法没有考虑时延约束、有些不能准确地选举出树的中心的情况,提出一种新的时延受限共享组播树算法,并对新算法进行算法分析和仿真实验。该算法首先准确地选择出共享组播树的中心,然后以所选举的中心为树根,构造一棵满足时延约束的最小代价组播树。仿真实验表明,该算法所构造的组播树的成功率要高于RAND_DCSHARED,MINMAXD_CSHARD,DCINITIAL_DCSHARED等算法,同时也能保证多个源结点到成员结点之间的时延约束。 |
| 关键词: 组播 时延约束 中心选举 算法 服务质量(Q,oS) |
| DOI： |
| 投稿时间：2006-01-06修订日期：2006-07-19 |
| 基金项目:广西"新世纪十百千人才工程"专项基金项目(桂人函2001213号);广西科学研究和技术开发计划应用基础研究专项项目(桂科基0342011);广西自然科学基金项目(桂科自06400026)联合资助 |
|
| A Delay-Constrained Multicast Routing Algorithm Based on Shared Tree |
|
LIU Wen-bin1,2, LI Tao-shen1,3
|
| (1.School of Computer, Electronics and Information, Guangxi University, Nanning, Guangxi, 530004, China;2.Hunan Financial College, Changsha, Hunan, 410086, China;3.School of Information Science and Engineering, Central South University, Changsha, Hunan, 410083, China) |
| Abstract: |
| In view of existing situation which some algorithms have not considered the delay-constrained or can not selected nicely the enter of the shared tree in the multicast routing algorithms based shared tree.This paper proposes a new multicast routing algorithm with delay-constrained for the shared tree,and gives analysis of algorithm's performance and simulated experiment.At first,a center of shared multicast tree is selected nicely in this algorithm.And then,a delay-constrained multicast tree rooted at this center was constructed with the least cost.Simulation and experiment results show that the successful ratio constructing shared multicast tree with our algorithm is not only higher than that of RAND_DCSHARED,MINMAXD_DCSHARD,DCINITIAL_DCSHARED,can also ensure the delay constrained between the multi-source node and member node of a multicast group. |
| Key words: multicast delay-constrained selection of center algorithm Quality of Service (QoS) |
