基于相对容量损失的一种改进波长寻路算法

An improved wavelength routing algorithm based on relative capacity loss

本文提出一种改进的基于相对容量损失(RCL)最小的波长分配和路由选择算法-DPRCL算法。该算法通过发送探测报文得到光路容量损失率,从而选择具有最小光路容量损失率的波长和路由建立连接。在不牺牲阻塞性能的情况下,DPRCL大大减小了实现复杂度以及网络开销,并适用于采用分布式控制的自适应路由的网络环境,而不限于RCL的固定路由方式。

We propose an improved routing and wavelength assignment method called Distributive Probing for Relative Capacity Loss （DPRCL） which is based upon Relative Capacity Loss. This method uses probing packages for each request to collect the routing and the capacity loss information of the light-path through which each package passes. The routing and the wavelength of package with minimal capacity loss is then chosen to setup the light-path for the request. DPRCL greatly reduced the computation complexity and the cost of exchanging network state information among network nodes. Moreover, DPRCL can use more flexible routing algorithm to obtain better performance, instead of keeping to the fixed routing as RCL.