Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

A dynamic routing and wavelength assignment algorithm for WDM networks based on bottleneck link avoidance

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Xing-Wen Han ; Sch. of Electron. & Inf., Northwest Polytech. Univ., Xi''an, China ; Hao-Shan Shi ; Qi Yang

In order to maximize the number of connections and reduce the blocking probability of wavelength division multiplexing (WDM) optical networks, a dynamic routing and wavelength assignment (RWA) algorithm is studied in this paper. In the absence of wavelength converter, the network performance deterioration is more likely caused by bottleneck links of the network, which is related to static factors (such as the particular network topology), and dynamic factors (such as the number of idle wavelength). This paper proposes a dynamic algorithm based on bottleneck links avoidance, named Bottleneck Links Avoidance with Load Balancing (BLALB) Algorithm, which gives a solution to the RWA problem in both the link level and the network level. By minimizing load variance and proactively avoiding `bottleneck links', our BLAMLV algorithm can improve the network performance. Simulation results show that the algorithm has lower blocking probability and higher link utilization compared with fixed-path least-congestion (FPLC) algorithm and the minimum load distribution variance algorithm.

Published in:

Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on

Date of Conference:

14-16 Sept. 2011