Abstract
We study quality of service issues in preplanned recovery using redundant trees in vertex-redundant or edge-redundant graphs. In particular, we present efficient heuristic algorithms for finding a pair of working-protection trees with large bandwidth in the working tree. Computational results are presented to demonstrate the effectiveness of our algorithms. Many challenging problems remain open.
Original language | English (US) |
---|---|
Title of host publication | IEEE International Conference on Communications |
Pages | 2766-2770 |
Number of pages | 5 |
Volume | 5 |
State | Published - 2002 |
Event | 2002 International Conference on Communications (ICC 2002) - New York, NY, United States Duration: Apr 28 2002 → May 2 2002 |
Other
Other | 2002 International Conference on Communications (ICC 2002) |
---|---|
Country/Territory | United States |
City | New York, NY |
Period | 4/28/02 → 5/2/02 |
Keywords
- Protection and restoration
- Quality of service
- Redundant trees
ASJC Scopus subject areas
- Media Technology