WDM网络中一种时延约束多播路由算法

A Delay-constrained Multicast Routing Algorithm in WDM Networks

文章提出了一种在有限波长转换器的WDM网络中,基于拉格朗日松驰的时延约束最小代价多播路由算法。该算法将WDM网络中的寻径与波长分配合成一步,并充分考虑到波长转换器的限制,利用拉格朗日松驰方法的特点,通过对松驰参数的变化得到每链路上的聚合代价,从而得到一棵近似于最优解的多播树。

This paper proposes a delay-constrained least-cost multicast routing algorithm based on Lagrange relaxation in WDM networks with sparse wavelength converters.The algorithm deals with routing and wavelength assignment as a unified process,thinking about the limit of sparse wavelength converters.It makes use of the characteristic of Lagrange relaxation method,and constructs a multicast tree which approximates to the best solution through adjusting the cost aggregation of every link.