|
|||||
|
|
| 求解有度约束多播路由问题的分布式算法 | |
| 引用本文： | 刘莹,吴建平,刘三阳,唐厚俭.求解有度约束多播路由问题的分布式算法[J].软件学报,2002,13(6):1130-1134. |
| 作者姓名： | 刘莹 吴建平 刘三阳 唐厚俭 |
| 作者单位： | 1. 清华大学,计算机科学与技术系,北京,100084;西安电子科技大学,数学系,陕西,西安,710071 2. 清华大学,计算机科学与技术系,北京,100084 3. 西安电子科技大学,数学系,陕西,西安,710071 |
| 基金项目： | 国家自然科学基金资助项目(69972036;90104002) |
| 摘 要： | 在应用多播(multicast)时,有效的多播路由是关键.现有的多播路由算法一般假定每个节点都支持multicast,但在实际网络中,某些节点并不支持多播,而为了保证网络速度,需限制进行多播所要复制信息的数量.为此,采用度约束来表示每个节点的多播能力,提出了一种有度约束的分布式多播路由算法.算法的复杂度和所需传递信息的数量都低于已有的同类算法. |
| 关 键 词： | 多播 度约束 多播路由算法 分布式算法 |
| 收稿时间： | 2000/6/21 0:00:00 |
| 修稿时间： | 2000年6月21日 |
A Distributed Algorithm for Degree-Constrained Multicast Routing |
|
| LIU Ying,WU Jian-ping,LIU San-yang and TANG Hou-jian.A Distributed Algorithm for Degree-Constrained Multicast Routing[J].Journal of Software,2002,13(6):1130-1134. | |
| Authors: | LIU Ying WU Jian-ping LIU San-yang and TANG Hou-jian |
| Abstract: | In order to support multicast, efficient multicast routing is crucial. Many present multicast routing algorithms assume that every node in the network support multicast. But in real networks, some nodes may not support multicast, others may limit the number of multicast copies in order to ensure network speed. Thus, the multicast capability of each node is represented in this paper by a degree-constraint. A distributed degree- constrained multicast routing algorithm is proposed which has smaller time complexity and needs smaller number of messages than other existing algorithms. |
| Keywords: | multicast degree-constraint multicast routing algorithm distributed algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《软件学报》浏览原始摘要信息 | |
| 点击此处可从《软件学报》下载全文 | |