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 Citations (Scopus)

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

Fingerprint

Heuristic algorithms
Quality of service
Bandwidth
Recovery

Keywords

  • Protection and restoration
  • Quality of service
  • Redundant trees

ASJC Scopus subject areas

  • Media Technology

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)

QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs. / Xue, Guoliang; Chen, Li; Thulasiraman, K.

IEEE International Conference on Communications. Vol. 5 2002. p. 2766-2770.

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

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, 2002 International Conference on Communications (ICC 2002), New York, NY, United States, 4/28/02.
Xue G, Chen L, Thulasiraman K. QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs. In IEEE International Conference on Communications. Vol. 5. 2002. p. 2766-2770
Xue, Guoliang ; Chen, Li ; Thulasiraman, K. / QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs. IEEE International Conference on Communications. Vol. 5 2002. pp. 2766-2770
@inproceedings{63c61ab8581f4f67885a78b32a01aaee,
title = "QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs",
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 = "Protection and restoration, Quality of service, Redundant trees",
author = "Guoliang Xue and Li Chen and K. Thulasiraman",
year = "2002",
language = "English (US)",
volume = "5",
pages = "2766--2770",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

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

AU - Xue, Guoliang

AU - Chen, Li

AU - Thulasiraman, K.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

KW - Protection and restoration

KW - Quality of service

KW - Redundant trees

UR - http://www.scopus.com/inward/record.url?scp=0036283422&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036283422&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036283422

VL - 5

SP - 2766

EP - 2770

BT - IEEE International Conference on Communications

ER -