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

Guoliang Xue, Li Chen, K. Thulasiraman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Pages2691-2695
Number of pages5
Volume3
StatePublished - 2002
EventGLOBECOM'02 - IEEE Global Telecommunications Conference - Taipei, Taiwan, Province of China
Duration: Nov 17 2002Nov 21 2002

Other

OtherGLOBECOM'02 - IEEE Global Telecommunications Conference
CountryTaiwan, Province of China
CityTaipei
Period11/17/0211/21/02

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint Dive into the research topics of 'Delay reduction in redundant trees for pre-planned protection against single link/node failure in 2-connected graphs'. Together they form a unique fingerprint.

Cite this