Heuristic algorithms for designing self-repairing protection trees in mesh networks

Authors:
Shahram Shah-Heydari;Oliver Yang
Affiliations:
University of Ontario Institute of Technology, Oshawa, Ontario, Canada L1H 7K4;University of Ottawa, School of Information Technology and Engineering, Ottawa, Ontario, Canada K1N 6N5
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2009

Citing 12
Cited 0

Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

IEEE/ACM Transactions on Networking (TON)
An algorithm for distributed computation of a spanningtree in an extended LAN

SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

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

IEEE/ACM Transactions on Networking (TON)
Fiber Network Service Survivability

Fiber Network Service Survivability
Approximating optimal spare capacity allocation by successive survivable routing

IEEE/ACM Transactions on Networking (TON)
A protection tree scheme for first-failure protection and second-failure restoration in optical networks

ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
A series of Hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience

IEEE Communications Magazine
Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees

IEEE Journal on Selected Areas in Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications
Network design sensitivity studies for use of digital cross-connect systems in survivable network architectures

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Protection trees have been used in the past for restoring multicast and unicast traffic in networks in various failure scenarios. In this paper we focus on shared self-repairing trees for link protection in unicast mesh networks. Shared protection trees have been proposed as a relatively simple approach that is easy to reconfigure and could provide sub-second restoration times with sub-optimal redundancy requirement. The self-repairing nature of this class of protection trees may make them an attractive option for cases where dynamic changes in network topology or demand may occur. In this paper, we present heuristic algorithms to design a self-repairing protection tree for a given network. We study the restorability performance of shared trees and examine the limitations of such schemes in specific topologies, such as cases where long node chains exist. Using extensive simulations with thousands of randomly generated network graphs. We compare redundancy and average backup path length of shared protection trees with optimal tree designs and non-tree designs. We also apply our algorithms to the problem of designing the protection tree in a pre-designed fixed-capacity network, and study the performance of shared protection trees in this scenario under different network loads and link utilization levels.