An evolutionary programming algorithm for survivable routing and wavelength assignment in transparent optical networks

详细信息    查看全文

• 作者：Urmila Bhanja^a ; ^{urmilabhanja@gmail.com} ; Sudipta Mahapatra^b ; ^{sudipta@ece.iitkgp.ernet.in} ; Rajarshi Roy^b ; ^{royr@ece.iitkgp.ernet.in}
• 关键词：Dynamic routing ; Evolutionary programming algorithm ; Lightpath ; Survivability ; Set up time ; Fitness function
• 刊名：Information Sciences
• 出版年：2013
• 出版时间：10 February, 2013
• 年：2013
• 卷：222
• 期：Complete
• 页码：634-647
• 全文大小：705 K

文摘

The dynamic routing and wavelength assignment (DRWA) problem is a challenging optimisation problem in optical wavelength division multiplexed (WDM) networks. This paper proposes a novel evolutionary programming algorithm, namely, ERWA, to reduce the set-up time of lightpaths in a WDM network. It is shown that the proposed algorithm with simple extensions, referred to in this paper as ESRWA, is able to provide dedicated protection at the optical layer of the network, thereby addressing the survivable DRWA problem. In contrast to other bio-inspired algorithms available in the literature for the DRWA problem, ERWA facilitates the online discovery of a requested lightpath. The novelty of ERWA lies in the fact that it uses an initial population consisting of only one individual or chromosome and integrates a soft constraint with a set of hard constraints to accomplish proper load balancing. These features result in a lower mean blocking probability and a lower mean execution time compared to those exhibited by the existing bio-inspired algorithms for both the DRWA and the survivable DRWA problems.