By Topic

An adaptive routing strategy for wavelength-routed networks with wavelength conversion capability

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
$31 $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

3 Author(s)
Ching-Fang Hsu ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Te-Lung Liu ; Nen-Fu Huang

We investigate adaptive routing in wavelength-routed networks. Exploiting the concept of load balancing, we propose an adaptive routing strategy named weighted-shortest-cost-path (WSCP). The salient feature of WSCP is that it seeks the path that minimizes the resource cost while simultaneously maintaining the traffic load as balanced as possible. We compare the blocking probability and average hops of WSCP with those of the traditional shortest-cost-path (SCP) strategy, fixed routing, and alternate routing. The numerical results show that WSCP can enhance blocking performance and lengthen hop distances just a little. The improvement is more significant in denser networks or with more wavelengths. We also develop an analytical model to estimate blocking performance of WSCP.

Published in:

Communications, 2002. ICC 2002. IEEE International Conference on  (Volume:5 )

Date of Conference:

2002