By Topic

Delay reduction in redundant trees for preplanned protection against single link/node failure in 2-connected graphs

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)
Guoliang Xue ; Arizona State Univ., Tempe, AZ, USA ; Li Chen ; Thulasiraman, K.

Protection and restoration in high speed networks is an important issue, especially for applications in SONET and WDM networks. We study quality of service issues in preplanned recovery using redundant trees in 2-vertex connected graphs and 2-edge connected graphs. In particular, we present efficient heuristic algorithms for finding a pair of working-protection trees with small delay in the working tree. Extensive computational results show that our algorithms reduce the average delay in the working tree by 60% to 90%. Many challenging problems remain open.

Published in:

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

Date of Conference:

17-21 Nov. 2002