Performance Study of Self-repairing Unicast Hierarchical Protection Trees in Mesh Networks

Shahram Shah-Heydari; Oliver Yang

4th International IEEE Conference on Broadband Communications, Networks, Systems

Research Article

Performance Study of Self-repairing Unicast Hierarchical Protection Trees in Mesh Networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/BROADNETS.2007.4550490,
    author={Shahram Shah-Heydari and Oliver Yang},
    title={Performance Study of Self-repairing Unicast Hierarchical Protection Trees in Mesh Networks},
    proceedings={4th International IEEE Conference on Broadband Communications, Networks, Systems},
    publisher={IEEE},
    proceedings_a={BROADNETS},
    year={2010},
    month={5},
    keywords={Network protection Shared backup trees Mesh network restoration.},
    doi={10.1109/BROADNETS.2007.4550490}
}

Shahram Shah-Heydari
Oliver Yang
Year: 2010
Performance Study of Self-repairing Unicast Hierarchical Protection Trees in Mesh Networks
BROADNETS
IEEE
DOI: 10.1109/BROADNETS.2007.4550490

Shahram Shah-Heydari¹, Oliver Yang²

1: Member, IEEE,
2: Senior Member, IEEE

Abstract

Protection trees have been used in the past for protecting multicast and unicast traffic in networks in various scenarios. In this paper we focus on shared protection trees for link protection in unicast mesh networks. We present a heuristic algorithm that reduces the redundant capacity required for protection on shared trees, and improves the restorability of the network. We use simulation of random mesh graphs to compute the performance improvement for various network sizes.

Keywords: Network protection Shared backup trees Mesh network restoration.

Published: 2010-05-16
Publisher: IEEE
Modified: 2010-05-16

: http://dx.doi.org/10.1109/BROADNETS.2007.4550490