|
|||||
|
|
| 基于贪婪算法的WDM网络组播路由算法的研究 | |
| 引用本文： | 郑利华,陈胜权,谢春光. 基于贪婪算法的WDM网络组播路由算法的研究[J]. 光通信研究, 2007, 33(4): 22-25 |
| 作者姓名： | 郑利华 陈胜权 谢春光 |
| 作者单位： | 1. 桂林航天工业高等专科学校,广西,桂林,541004 2. 桂林航天工业高等专科学校,广西,桂林,541004;桂林电子科技大学,计算机系,广西,桂林,541004 3. 桂林电子科技大学,计算机系,广西,桂林,541004 |
| 摘 要： | 文章首先用贪婪算法找出在现有网络结构中完成任务所需的波长数较少的波长集,然后依据其上每条链路的权值,用最短路径算法生成一棵组播树,使其跳数和阻塞率较低,以保证网络能够在使用较少波长资源的情况下,快速、有效地传送数据. |
| 关 键 词： | 贪婪算法 波分复用网络 组播树 路由算法 |
| 文章编号： | 1005-8788（2007）04-0022-04 |
| 收稿时间： | 2007-01-10 |
| 修稿时间： | 2007-01-10 |
Study of greedy algorithm-based WDM network multicast routing algorithm |
|
| Zheng Lihua,Chen Shengquan,Xie Chunguang. Study of greedy algorithm-based WDM network multicast routing algorithm[J]. Study on Optical Communications, 2007, 33(4): 22-25 | |
| Authors: | Zheng Lihua Chen Shengquan Xie Chunguang |
| Affiliation: | 1. Guilin College of Aerospace Technology, Guilin 541004, China; 2.Department of Computer Science, Guilin Electronic Science and Technology University, Guilin 541004, China |
| Abstract: | In this paper, small wavelength set required to accomplish the task in the existing network structure is first identified by using greedy algorithm. Then a multicast tree is generated on the basis of each link weight by using the most short-circuit path algorithm to enable lower hops and obstruction rate so as to ensure fast and effective data transfer when smaller amount of wavelength resource is used. |
| Keywords: | greedy algorithm WDM network multicast tree routing algorithms |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |