DLCR: A new adaptive routing scheme in WDM mesh networks

Xiaowen CHU*, Jiangchuan Liu

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

22 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)1797-1801
Number of pages5
JournalConference Record - International Conference on Communications
Volume3
Publication statusPublished - 2005
Event2005 IEEE International Conference on Communications, ICC 2005 - Seoul, Korea, Republic of
Duration: 16 May 200520 May 2005

Scopus Subject Areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'DLCR: A new adaptive routing scheme in WDM mesh networks'. Together they form a unique fingerprint.

Cite this