Delay-constrained anycast routing problem in WDM networks with wavelength conversions

详细信息    查看全文

• 作者：Xuegong Tan ; Shunzheng Yu ; Hongbin Zhang ; Li Jun
• 关键词：Anycast ; WDM network ; Delay ; Routing ; Wavelength conversion
• 刊名：Optik - International Journal for Light and Electron Optics
• 出版年：2013
• 出版时间：October, 2013
• 年：2013
• 卷：124
• 期：20
• 页码：4315-4318
• 全文大小：447 K

文摘

Anycast routing and wavelength assignment problem has been intensively studied in wavelength-division multiplexing (WDM) networks, however, real-time application where packets have explicit expiration deadlines is not taken into consideration. In a WDM network, each link is associated with limited wavelengths available for channel connections. Data transmission over one wavelength to another requires wavelength conversion, which causes a long delay of message transmission. When the network and the set of anycast routing requests are given, the delay-constrained wavelength conversions anycast routing (DWCAR) problem is to find a set of light-paths, one for each source, for anycasting message to one member of the anycast destination group. The objective is to find a minimum number of wavelength conversions with the constraint that the sum of delays along every path must not exceed a given delay-bound. In this paper, we present a Tabu-search based delay-constrained anycast routing algorithm (TSDA) to solve this NP-complete problem, and compare it to a simple K shortest path based anycast algorithm (KSPA). Simulation results show TSDA achieves an average 40-50 % improvement in required wavelength conversions.