Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Two strategies for spare capacity placement in mesh restorable 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)
Venables, B.D. ; TRLabs, Edmonton, Alta., Canada ; Grover, W.D. ; MacGregor, M.H.

Because the problem of optimal spare capacity placement in a mesh-restorable network is NP-hard, the authors consider two heuristic strategies to solve the spare capacity placement problem in a near-optimal way within reasonable time constraints. The spare link placement algorithm (SLPA) is based on the principle of iterative link addition to produce the greatest incremental change in network restorability. SLPA is shown theoretically and experimentally to have polynomial time complexity. The iterated cutsets heuristic (ICH) formulates spare capacity placement as a linear programming problem subject to constraints based on a subset of cutsets of the network. Iteration and heuristic rules are used to develop the constraint set required by ICH. Theoretical time complexities are assessed for both SLPA and ICH. Comparative experimental tests on 36 trial networks are discussed. ICH network designs require slightly less redundant capacity. On average, SLPA placed 5% more spare capacity than ICH

Published in:

Communications, 1993. ICC '93 Geneva. Technical Program, Conference Record, IEEE International Conference on  (Volume:1 )

Date of Conference:

23-26 May 1993