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 language | English (US) |
|---|---|
| Title of host publication | Conference Record / IEEE Global Telecommunications Conference |
| Pages | 2691-2695 |
| Number of pages | 5 |
| Volume | 3 |
| State | Published - 2002 |
| Event | GLOBECOM'02 - IEEE Global Telecommunications Conference - Taipei, Taiwan, Province of China Duration: Nov 17 2002 → Nov 21 2002 |
Other
| Other | GLOBECOM'02 - IEEE Global Telecommunications Conference |
|---|---|
| Country/Territory | Taiwan, Province of China |
| City | Taipei |
| Period | 11/17/02 → 11/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
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS