An adaptive algorithm for dynamic routing in WDM networks using congestion threshold

Hung Yi Chang*, Huan Duen Deng, Pi Chung Wang, Chia Tai Chan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, a new dynamic routing algorithm, threshold-based least congestion routing (TLCR), over WDM networks is proposed. In comparison with previous dynamic routing algorithms, TLCR is more flexible and efficient without sacrificing performance in terms of blocking probability.

Original languageEnglish
Title of host publicationProceedings of the 2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009
Pages77-80
Number of pages4
DOIs
StatePublished - 2009
Event2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009 - Okayama, Japan
Duration: 26 Mar 200929 Mar 2009

Publication series

NameProceedings of the 2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009

Conference

Conference2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009
Country/TerritoryJapan
CityOkayama
Period26/03/0929/03/09

Fingerprint

Dive into the research topics of 'An adaptive algorithm for dynamic routing in WDM networks using congestion threshold'. Together they form a unique fingerprint.

Cite this