15 April 2004 A distributed hierarchial p-tree link protection scheme for mesh networks
Author Affiliations +
Proceedings Volume 5282, Network Architectures, Management, and Applications; (2004) https://doi.org/10.1117/12.519786
Event: Asia-Pacific Optical and Wireless Communications, 2003, Wuhan, China
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.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shahram Shah-Heydari, Oliver Yang, "A distributed hierarchial p-tree link protection scheme for mesh networks", Proc. SPIE 5282, Network Architectures, Management, and Applications, (15 April 2004); doi: 10.1117/12.519786; https://doi.org/10.1117/12.519786

Back to Top