Cost minimization in redundant trees for protection in vertex-redundant or edge-redundant graphs

Guoliang Xue; Li Chen; K. Thulasiraman

Cost minimization in redundant trees for protection in vertex-redundant or edge-redundant graphs

Guoliang Xue, Li Chen, K. Thulasiraman

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	IEEE International Performance, Computing and Communications Conference, Proceedings
Pages	187-194
Number of pages	8
State	Published - 2002
Event	21st IEEE International Performance, Computing, and Communications Conference - Phoenix, AZ, United States Duration: Apr 3 2002 → Apr 5 2002

Other

Other	21st IEEE International Performance, Computing, and Communications Conference
Country/Territory	United States
City	Phoenix, AZ
Period	4/3/02 → 4/5/02

Keywords

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

ASJC Scopus subject areas

Media Technology

Cite this

@inproceedings{dca6d66d2083481eb4160929f5e2ccce,

title = "Cost minimization in redundant trees for protection in vertex-redundant or edge-redundant graphs",

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.",

keywords = "Cost minimization, Performance evaluation, Protection and restoration, Quality of service, Redundant trees",

author = "Guoliang Xue and Li Chen and K. Thulasiraman",

year = "2002",

language = "English (US)",

pages = "187--194",

booktitle = "IEEE International Performance, Computing and Communications Conference, Proceedings",

note = "21st IEEE International Performance, Computing, and Communications Conference ; Conference date: 03-04-2002 Through 05-04-2002",

}

TY - GEN

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

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

KW - Cost minimization

KW - Performance evaluation

KW - Protection and restoration

KW - Quality of service

KW - Redundant trees

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

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

M3 - Conference contribution

AN - SCOPUS:0036088536

SP - 187

EP - 194

BT - IEEE International Performance, Computing and Communications Conference, Proceedings

T2 - 21st IEEE International Performance, Computing, and Communications Conference

Y2 - 3 April 2002 through 5 April 2002

ER -

Cost minimization in redundant trees for protection in vertex-redundant or edge-redundant graphs

Abstract

Other

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this