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

Study of greedy algorithm-based WDM network multicast routing algorithm

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

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.