arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.3310cs.NI
收藏

透明光网络中动态路由和波长分配问题的一种新解决方案

A Novel Solution to the Dynamic Routing and Wavelength Assignment Problem in Transparent Optical Networks

Urmila Bhanja, Sudipta Mahapatra, Rajarshi Roy

摘要:

提出了一种求解波长连续性约束下光波分复用网络中动态路由和波长分配问题的进化规划算法。我们假设一个理想的物理通道,因此忽略了连接请求的阻塞,由于物理损伤。该问题的制定包括适当的约束,使算法能够平衡的个人之间的负载,从而导致在一个较低的阻塞概率和较低的平均执行时间比现有的生物启发的算法在文献中的DRWA问题。本文研究了三种类型的波长分配技术,例如First fit、Random和Round Robin波长分配技术。该算法无需波长转换器就能保证低阻塞率和小时延,这使得该算法在当前的光交换网络中具有很大的吸引力。

英文摘要:

We present an evolutionary programming algorithm for solving the dynamic routing and wavelength assignment (DRWA) problem in optical wavelength-division multiplexing (WDM) networks under wavelength continuity constraint. We assume an ideal physical channel and therefore neglect the blocking of connection requests due to the physical impairments. The problem formulation includes suitable constraints that enable the algorithm to balance the load among the individuals and thus results in a lower blocking probability and lower mean execution time than the existing bio-inspired algorithms available in the literature for the DRWA problems. Three types of wavelength assignment techniques, such as First fit, Random, and Round Robin wavelength assignment techniques have been investigated here. The ability to guarantee both low blocking probability without any wavelength converters and small delay makes the improved algorithm very attractive for current optical switching networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑