By Topic

Dynamic lightpath protection in WDM mesh networks under risk-disjoint constraint

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

2 Author(s)
Shengli Yuan ; Dept. of Comput. & Math. Sci., Houston Univ., TX, USA ; Jue, J.P.

Path protection requires finding a working path and a protection path that are link disjoint. We consider the dynamic lightpath protection problem in WDM mesh networks where a single risk factor may cause multiple links to fail simultaneously. The objective is to find link-disjoint lightpaths that are also risk disjoint. A similar problem has recently been proven to be NP-complete. We give an alternative proof of the NP-completeness, and formulate the problem as an integer linear program. We then develop heuristic algorithms and evaluate the performance of the algorithms through computer simulation. We show that we can achieve satisfactory performance using the heuristic techniques.

Published in:

Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE  (Volume:3 )

Date of Conference:

29 Nov.-3 Dec. 2004