By Topic

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

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.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hung-Yi Chang ; Department of Information Management, National Kaohsiung First University of Science and Technology, Taiwan, R.O.C. ; Huan-Duen Deng ; Pi-Chung Wang ; Chia-Tai Chan

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.

Published in:

Networking, Sensing and Control, 2009. ICNSC '09. International Conference on

Date of Conference:

26-29 March 2009