Cart (Loading....) | Create Account
Close category search window
 

Dynamic reconfiguration based on balanced alternate routing algorithm (BARA) for all-optical wavelength-routed 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
$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)
Bin Zhou ; Dept. of Electr. & Comput. Eng., Queen''s Univ., Canada ; Jun Zheng ; Mouftah, H.T.

This paper studies the virtual topology reconfiguration problem for all-optical wavelength-routed WDM networks. We consider dynamic reconfiguration in response to changing traffic demands and formulate the problem as an Integer Programming problem with multiple optimization objectives, aiming at maximizing the network throughput, minimizing the average propagation delay over a lightpath, and minimizing the reconfiguration cost. We use heuristics to obtain approximate optimal solutions and propose a balanced alternate routing algorithm (BARA) based on a genetic algorithm. To make the problem computational tractable, we assume wavelength converters at each network node and approximately divide the optimization process into two relatively independent stages: route computation and lightpath routing. At the route computing stage, the aim is to compute a set of alternate routes for each pair of source and destination nodes in the network. At the lightpath routing stage, the aim is to decide an "optimal" route for each of the lightpaths between a pair of source and destination nodes from a set of alternate routes, and the decisions are subject to the formulated constraints and optimization objectives. Through simulation experiments, we show the effectiveness of BARA.

Published in:

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE  (Volume:3 )

Date of Conference:

17-21 Nov. 2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.