DocumentCode
1687750
Title
DLCR: a new adaptive routing scheme in WDM mesh networks
Author
Chu, Xiaowen ; Liu, Jiangchuan
Author_Institution
Dept. of Comput. Sci., Hong Kong Baptist Univ., China
Volume
3
fYear
2005
Firstpage
1797
Abstract
Rerouting is an effective approach to decrease the blocking probability in legacy circuit-switched networks. In this paper, we consider intentional lightpath rerouting in all-optical WDM mesh networks. We propose a dynamic least congested routing (DLCR) algorithm, which dynamically switches the lightpath between the primary route and alternate route according to the network traffic distribution. Extensive simulation results show that DLCR algorithm can achieve much better blocking performance than traditional routing algorithms, including shortest path routing, fixed-alternate routing, and least congested path routing. We also find that the performance gain is more significant when wavelength conversion is available.
Keywords
optical fibre networks; optical wavelength conversion; probability; telecommunication congestion control; telecommunication network routing; telecommunication traffic; wavelength division multiplexing; DLCR algorithm; WDM mesh network; adaptive routing scheme; all-optical network; blocking probability; dynamic least congested routing; fixed-alternate routing; legacy circuit-switched network; lightpath rerouting; network traffic distribution; shortest path routing; wavelength conversion; Circuit simulation; Heuristic algorithms; Mesh networks; Performance gain; Routing; Switches; Telecommunication traffic; Traffic control; WDM networks; Wavelength division multiplexing;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2005. ICC 2005. 2005 IEEE International Conference on
Print_ISBN
0-7803-8938-7
Type
conf
DOI
10.1109/ICC.2005.1494651
Filename
1494651
Link To Document