| 本文已被：浏览 3913次 下载 5700次 |
码上扫一扫！ |
|
|
| 求解有度约束多播路由问题的分布式算法 |
|
刘莹1,2, 吴建平1, 刘三阳2, 唐厚俭2
|
|
1.清华大学,计算机科学与技术系,北京,100084;2.西安电子科技大学,数学系,陕西,西安,710071
|
|
| 摘要: |
| 在应用多播(multicast)时,有效的多播路由是关键.现有的多播路由算法一般假定每个节点都支持multicast,但在实际网络中,某些节点并不支持多播,而为了保证网络速度,需限制进行多播所要复制信息的数量.为此,采用度约束来表示每个节点的多播能力,提出了一种有度约束的分布式多播路由算法.算法的复杂度和所需传递信息的数量都低于已有的同类算法. |
| 关键词: 多播 度约束 多播路由算法 分布式算法 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金资助项目(69972036;90104002) |
|
| A Distributed Algorithm for Degree-Constrained Multicast Routing |
|
LIU Ying,WU Jian-ping,LIU San-yang,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. |
| Key words: multicast degree-constraint multicast routing algorithm distributed algorithm |
