By Topic

Probability based dynamic-alternate routing algorithm in all-optical WDM networks

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

1 Author(s)
Sheng-Wei Wang ; Department of Applied Informatics, Fo Guang University, Yilan 26247, Taiwan

This paper proposes a new dynamic-alternate routing algorithm for all-optical WDM networks without wavelength conversion in order to reduce the connection blocking probability. The main idea in the proposed dynamic-alternate routing algorithm is to try to route the traffics according to a predefined optimal probability distribution. The problem for finding the optimal probability distribution has been shown as a convex optimization problem. The problem can be solved by flow deviation method or other standard optimization techniques. The simulation results show that the proposed routing algorithm yields lower connection blocking probabilities than the previous works as well as the proposed routing algorithm produces similar traffic pattern as the optimal traffic pattern. The similarity between the traffic pattern produced by the proposed dynamic-alternate routing algorithm and the optimal traffic pattern can be further used for solving other network designing problems.

Published in:

Telecommunications (ConTEL), Proceedings of the 2011 11th International Conference on

Date of Conference:

15-17 June 2011