TY - JOUR
T1 - Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees
AU - Xue, Guoliang
AU - Chen, Li
AU - Thulasiraman, Krishnaiyan
N1 - Funding Information:
Manuscript received January 1, 2003; revised May 20, 2003. This paper was supported in part by ARO under Grant DAAD19-00-1-0377 and in part by the NSF ITR under Grant ANI-0312435 and under Grant ANI-0312635. G. Xue is with the Department of Computer Science and Engineering at Arizona State University, Tempe, AZ 85287-5406 USA (e-mail: xue@asu.edu; URL: http://www.fulton.asu.edu/~xue). L. Chen is with the Department of Computer Science, The University of Vermont, Burlington, VT 05405 USA (e-mail: lchen@cs.uvm.edu). K. Thulasiraman is with the School of Computer Science, University of Oklahoma, Norman, OK 73019 USA (e-mail: thulasi@ou.edu; URL: http://www.cs.ou.edu/~thulasi). Digital Object Identifier 10.1109/JSAC.2003.816597
PY - 2003/10
Y1 - 2003/10
N2 - In this paper, we study quality-of-service (QoS) and quality-of-protection (QoP) issues in redundant tree based preplanned recovery schemes for a single-link failure in two-edge connected graphs and for a single-node failure in two-connected graphs. We present schemes (to be called G-MFBG schemes) that generalize the schemes (to be called MFBG schemes) developed by Médard et al. to construct a pair of redundant trees, called red and blue trees, which guarantees fast recovery from any single-link/node failure, as long as the failed node is not the root node. Using the G-MFBG schemes, we study QoS issues relating to red/blue trees. We present effective heuristics for computing a pair of redundant trees with low average delay or small total cost. We develop an optimal algorithm for computing a pair of red/blue trees with maximum bandwidth. Furthermore, a pair of red/blue trees guarantees fast recovery from simultaneous multiple failures if it satisfies certain properties. This leads us to define the concept of QoP of a pair of red/blue trees. We present an effective heuristic to construct a pair of red/blue trees with high QoP. The paper concludes with a discussion of computational results that demonstrate the effectiveness of the different algorithms presented.
AB - In this paper, we study quality-of-service (QoS) and quality-of-protection (QoP) issues in redundant tree based preplanned recovery schemes for a single-link failure in two-edge connected graphs and for a single-node failure in two-connected graphs. We present schemes (to be called G-MFBG schemes) that generalize the schemes (to be called MFBG schemes) developed by Médard et al. to construct a pair of redundant trees, called red and blue trees, which guarantees fast recovery from any single-link/node failure, as long as the failed node is not the root node. Using the G-MFBG schemes, we study QoS issues relating to red/blue trees. We present effective heuristics for computing a pair of redundant trees with low average delay or small total cost. We develop an optimal algorithm for computing a pair of red/blue trees with maximum bandwidth. Furthermore, a pair of red/blue trees guarantees fast recovery from simultaneous multiple failures if it satisfies certain properties. This leads us to define the concept of QoP of a pair of red/blue trees. We present an effective heuristic to construct a pair of red/blue trees with high QoP. The paper concludes with a discussion of computational results that demonstrate the effectiveness of the different algorithms presented.
KW - Protection and restoration
KW - Quality-of-protection (QoP)
KW - Quality-of-service (QoS)
KW - Redundant trees
UR - http://www.scopus.com/inward/record.url?scp=0141917670&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0141917670&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2003.816597
DO - 10.1109/JSAC.2003.816597
M3 - Article
AN - SCOPUS:0141917670
SN - 0733-8716
VL - 21
SP - 1332
EP - 1345
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 8
ER -