TY - GEN
T1 - Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS
AU - Zhang, Weiyi
AU - Xue, Guoliang
AU - Tang, Jian
AU - Thulasiraman, Krishnaiyan
PY - 2005
Y1 - 2005
N2 - Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and introduced the concept of quality of protection (QoP) as a metric of multifailure recovery capabilities for single failure recovery schemes. In this paper, we present three linear time algorithms for constructing redundant trees for single link failure recovery in 2-edge connected graphs and for single node failure recovery in 2-connected graphs. Our first algorithm amis at high QoP for single link recovery schemes in 2-edge connected graphs. The previous best algorithm has a running time of O(n 2(m + n)), where n and m are the number of nodes and links in the network. Our algorithm has a running time of O(m + n), with comparable performance. Our second algorithm aims at high QoS for single link recovery schemes in 2-edge connected graphs. Our algorithm improves the previous best algorithm with O(n 2(m + n)) time complexity to O(m + n) time complexity with comparable performance. Our third algorithm aims at high QoS for single node recovery schemes in 2-connected graphs. Again, our algorithm improves the previous best algorithm with O(n 2(m + n)) time complexity to O(m + n) time complexity with comparable performance. Simulation results show that our new algorithms outperform previously known linear time algorithms significantly in terms of QoP or QoS, and outperform other known algorithms in terms of running time, with comparable QoP of QoS performance.
AB - Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and introduced the concept of quality of protection (QoP) as a metric of multifailure recovery capabilities for single failure recovery schemes. In this paper, we present three linear time algorithms for constructing redundant trees for single link failure recovery in 2-edge connected graphs and for single node failure recovery in 2-connected graphs. Our first algorithm amis at high QoP for single link recovery schemes in 2-edge connected graphs. The previous best algorithm has a running time of O(n 2(m + n)), where n and m are the number of nodes and links in the network. Our algorithm has a running time of O(m + n), with comparable performance. Our second algorithm aims at high QoS for single link recovery schemes in 2-edge connected graphs. Our algorithm improves the previous best algorithm with O(n 2(m + n)) time complexity to O(m + n) time complexity with comparable performance. Our third algorithm aims at high QoS for single node recovery schemes in 2-connected graphs. Again, our algorithm improves the previous best algorithm with O(n 2(m + n)) time complexity to O(m + n) time complexity with comparable performance. Simulation results show that our new algorithms outperform previously known linear time algorithms significantly in terms of QoP or QoS, and outperform other known algorithms in terms of running time, with comparable QoP of QoS performance.
KW - Blue/red trees
KW - Linear time algorithms
KW - Protection and restoration
KW - Quality of protection
KW - Quality of service
KW - Redundant trees
UR - http://www.scopus.com/inward/record.url?scp=25644442522&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=25644442522&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2005.1498553
DO - 10.1109/INFCOM.2005.1498553
M3 - Conference contribution
AN - SCOPUS:25644442522
SN - 0780389689
T3 - Proceedings - IEEE INFOCOM
SP - 2702
EP - 2710
BT - Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
A2 - Makki, K.
A2 - Knightly, E.
T2 - IEEE INFOCOM 2005
Y2 - 13 March 2005 through 17 March 2005
ER -