基于贪婪算法的WDM网络组播路由算法的研究

Research of WDM Network Multicast Routing Algorithm Based on Greedy Algorithm

用贪婪算法找出在现有网络结构中完成任务所需的波长数较少的波长集,然后依据其上每条链路的权值,用最短路算法生成一棵组播树,使其跳数和阻塞率较低,以保证在使用较少波长资源的情况下,快速、有效地传送数据。

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.