Share Email Print
cover

Proceedings Paper

A distributed hierarchial p-tree link protection scheme for mesh networks
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper presents a distributed scheme for link failure recovery in mesh optical networks, based on the use of network hierarchical spanning trees. The scheme intends to maximize restorability in a network with known working and spare capacities. The hierarchical protection tree (p-tree) provides the hierarchical layering of the network. The straddling links that are not located on the tree are protected through tree branches to the higher layer Parent nodes. The links on the tree are protected by links to backup parent nodes. We study the problem of finding the most optimized network tree to achieve maximum restorability, and present heuristics for finding the best tree. Our algorithm includes two steps: Selection of the best root node for the tree, and construction of the tree based on distribution of tree ID labels among the nodes. Each node selects a primary parent node and a backup parent node, and constructs pre-determined protection paths accordingly. In case of failure, all connections on a link are switched quickly to the protection path as a bundle. We perform restorability analysis for several real and arbitrary long-haul networks and show that our scheme provides excellent network restorability along with exceptional scalability and maintainability.

Paper Details

Date Published: 15 April 2004
PDF: 9 pages
Proc. SPIE 5282, Network Architectures, Management, and Applications, (15 April 2004); doi: 10.1117/12.519786
Show Author Affiliations
Shahram Shah-Heydari, Univ. of Ottawa (Canada)
Oliver Yang, Univ. of Ottawa (Canada)


Published in SPIE Proceedings Vol. 5282:
Network Architectures, Management, and Applications
S. J. Ben Yoo; Kwok-wai Cheung; Yun-Chur Chung; Guangcheng Li, Editor(s)

© SPIE. Terms of Use
Back to Top