QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs

Guoliang Xue, Li Chen, K. Thulasiraman

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

14 Scopus citations

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 languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages2766-2770
Number of pages5
Volume5
StatePublished - 2002
Event2002 International Conference on Communications (ICC 2002) - New York, NY, United States
Duration: Apr 28 2002May 2 2002

Other

Other2002 International Conference on Communications (ICC 2002)
CountryUnited States
CityNew York, NY
Period4/28/025/2/02

Keywords

  • Protection and restoration
  • Quality of service
  • Redundant trees

ASJC Scopus subject areas

  • Media Technology

Fingerprint Dive into the research topics of 'QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs'. Together they form a unique fingerprint.

  • Cite this

    Xue, G., Chen, L., & Thulasiraman, K. (2002). QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs. In IEEE International Conference on Communications (Vol. 5, pp. 2766-2770)