Title :
QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs
Author :
Xue, Guoliang ; Chen, Li ; Thulasiraman, K.
Author_Institution :
Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA
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.
Keywords :
graph theory; quality of service; telecommunication network reliability; trees (mathematics); QoS issues; bandwidth; edge-redundant graphs; efficient heuristic algorithms; preplanned recovery; quality of service; redundant trees; vertex-redundant graphs; working-protection trees; Bandwidth; Computer science; Heuristic algorithms; High-speed networks; Protection; Quality of service; SONET; Tree graphs; Uniform resource locators; WDM networks;
Conference_Titel :
Communications, 2002. ICC 2002. IEEE International Conference on
Print_ISBN :
0-7803-7400-2
DOI :
10.1109/ICC.2002.997346
