| 基于贪婪算法的WDM网络组播路由算法的研究 |
| |
| 引用本文： | 谢春光,陈胜权. 基于贪婪算法的WDM网络组播路由算法的研究[J]. 半导体光电, 2007, 28(4): 556-560 |
| |
| 作者姓名： | 谢春光 陈胜权 |
| |
| 作者单位： | 桂林电子科技大学,计算机系,广西,桂林,541004;桂林航天工业高等专科学校,广西,桂林,541004 |
| |
| 摘 要： | 用贪婪算法找出在现有网络结构中完成任务所需的波长数较少的波长集,然后依据其上每条链路的权值,用最短路算法生成一棵组播树,使其跳数和阻塞率较低,以保证在使用较少波长资源的情况下,快速、有效地传送数据.
|
| 关 键 词： | 贪婪算法 WDM网络 组播树 路由算法 |
| 文章编号： | 1001-5868（2007）04-0556-05 |
| 修稿时间： | 2007-01-15 |
Research of WDM Network Multicast Routing Algorithm Based on Greedy Algorithm |
| |
| XIE Chun-guang,CHEN Sheng-quan. Research of WDM Network Multicast Routing Algorithm Based on Greedy Algorithm[J]. Semiconductor Optoelectronics, 2007, 28(4): 556-560 |
| |
| Authors: | XIE Chun-guang CHEN Sheng-quan |
| |
| Affiliation: | 1. Department of Computer Science,Guilin Electronic Science and Technology University,Guilin 541004,CHN; 2. Guilin College of Aerospace Technology, Guilin 541004,CHN |
| |
| Abstract: | The greedy algorithm was adopted to identify the structure of the existing network to complete the task in wavelength set of less number wavelengths. Then each link on the basis of its weight, using the shortest path algorithm to form a multicast tree,which made it hop and block lower to ensure that resources are used in less wavelength, rapid and efficient transmission of data. |
| |
| Keywords: | greedy algorithm WDM network multicast tree routing algorithms |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
