Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

An approach to Generate An Efficient set of Candidate p-Cycles in WDM Mesh 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

6 Author(s)
Kang, B. ; Sch. of Eng. & Math., Edith Cowan Univ., Churchlands, WA ; Habibi, D. ; Kungmeng Lo ; Phung, Q.V.
more authors

In this paper we propose a new framework for computing an efficient set of p-cycles which can lead to superior performance in terms of capacity utilization in network protection. We first propose an algorithm for finding all fundamental cycles. Then, the set of candidate p-cycles is constructed by merging fundamental cycles. The number of proposed candidate p-cycles is small but they can construct more straddling link and have high a priori efficiency. Finally, an ILP model is employed to select an adequate set of p-cycles to ensure 100% protection while minimizing the total spare capacity. Our numerical results show that the number of candidate p-cycles generated is less than 7% out of all possible cycles for the test networks and the solutions are close to optimal

Published in:

Communications, 2006. APCC '06. Asia-Pacific Conference on

Date of Conference:

Aug. 2006