Cost minimization 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

4 Scopus citations

Abstract

Preplanned recovery using redundant trees in vertex-redundant or edge-redundant graphs is extended in this work to the case where each edge has a cost and the goal is to find a pair of working and protection trees such that the cost of the working tree is as low as possible. We present efficient heuristic algorithms for this problem. Extensive computational results show that the cost of the working tree found with our algorithm is within 19% of the cost of a minimum spanning tree on the average, while the smaller cost of the working and protection trees found by the original algorithm without QoS consideration is about 95% over the cost of a minimum spanning tree on the average.

Original languageEnglish (US)
Title of host publicationIEEE International Performance, Computing and Communications Conference, Proceedings
Pages187-194
Number of pages8
StatePublished - 2002
Event21st IEEE International Performance, Computing, and Communications Conference - Phoenix, AZ, United States
Duration: Apr 3 2002Apr 5 2002

Other

Other21st IEEE International Performance, Computing, and Communications Conference
CountryUnited States
CityPhoenix, AZ
Period4/3/024/5/02

Keywords

  • Cost minimization
  • Performance evaluation
  • Protection and restoration
  • Quality of service
  • Redundant trees

ASJC Scopus subject areas

  • Media Technology

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

Cite this