MET: an efficient static routing algorithm for WDM networks with full wavelength conversion

Abstract

ming at simultaneously minimizing the network wavelength requirement (NWR) and the network bandwidth requirement (NBR) for a given traffic matrix, we focus on the static routing problem in WDM networks with full wavelength conversion. A new algorithm MET (most even traffic distribution) is proposed. MET consists of two steps, the initial shortest-path-based route assignment, followed by a rerouting process to refine the solution. Unlike existing approaches, MET makes each rerouting decision by judiciously balancing the overall network traffic loads. A uniformity function is defined and embodied in MET to characterize the traffic load distribution in the network. Numerical results show that MET outperforms the best existing algorithm (Min-hops) by requiring less amount (about 10% saving) of network bandwidth (NBR) and less number of wavelengths (NWR).

Original document

The different versions of the original document can be found in:

• http://hub.hku.hk/bitstream/10722/45952/1/130753.pdf under the license https://creativecommons.org/licenses/by-nc-nd

• http://xplorestaging.ieee.org/ielx5/11206/36067/01709715.pdf?arnumber=1709715,

http://dx.doi.org/10.1109/hpsr.2006.1709715 under the license cc-by-nc-nd

• http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000001709715,

http://hub.hku.hk/handle/10722/45952,

https://ieeexplore.ieee.org/document/1709715,

https://academic.microsoft.com/#/detail/2090594374