Faster algorithms for construction of recovery trees enhancing QoP and QoS

Authors:
Weiyi Zhang;Guoliang Xue;Jian Tang;Krishnaiyan Thulasiraman
Affiliations:
Department of Computer Science, North Dakota State University, Fargo, ND;Department of Computer Science and Engineering at Arizona State University, Tempe, AZ;Department of Computer Science, Montana State University, Bozeman, MT;School of Computer Science, University of Oklahoma, Norman, OK
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2008

Citing 11
Cited 6

The multi-tree approach to reliability in distributed networks

Information and Computation
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking (TON)
Efficient algorithms for routing dependable connections in WDM optical networks

IEEE/ACM Transactions on Networking (TON)
Generalized loop-back recovery in optical mesh networks

IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms

Introduction to Algorithms
Restoration Methods for Multi-Service Optical Networks

ONDM '98 Proceedings of the IFIP TC6 Second International Working Conference on Optical Network Design and Modeling
Loopback recovery from double-link failures in optical mesh networks

IEEE/ACM Transactions on Networking (TON)
WDM optical communication networks: progress and challenges

IEEE Journal on Selected Areas in Communications
Protection cycles in mesh WDM networks

IEEE Journal on Selected Areas in Communications
Fault management in IP-over-WDM networks: WDM protection versus IP restoration

IEEE Journal on Selected Areas in Communications
Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees

IEEE Journal on Selected Areas in Communications

ILP-based design of survivable broadcast trees

HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Tackling the delay-cost and time-cost trade-offs in computation of node-protected multicast tree pairs

APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Interference-aware robust topology design in multi-channel wireless mesh networks

CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Time-, wavelength-, and code-domain optical reflection monitoring for next-generation access-metro networks

Computer Communications
Reliable collective communications with weighted SRLGs in optical networks

IEEE/ACM Transactions on Networking (TON)
An overview of algorithms for network survivability

ISRN Communications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Médard et al. proposed an elegant recovery scheme (known as the MFBG scheme) using red/blue recovery trees for multicast path protection against single link or node failures. Xue et al. extended the MFBG scheme and introduced the concept of quality of protection (QoP) as a metric for multifailure recovery capabilities of single failure recovery schemes. They also presented polynomial time algorithms to construct recovery trees with good QoP and quality of service (QoS). In this paper, we present faster algorithms for constructing recovery trees with good QoP and QoS performance. For QoP enhancement, our O(n + m) time algorithm has comparable performance with the previously best O(n2(n + m)) time algorithm, where and denote the number of nodes and the number of links in the network, respectively. For cost reduction, our O(n + m) time algorithms have comparable performance with the previously best O(n2(n + m)) time algorithms. For bottleneck bandwidth maximization, our O(mlog n) time algorithms improve the previously best O(nm) time algorithms. Simulation results show that our algorithms significantly outperform previously known algorithms in terms of running time, with comparable QoP or QoS performance.