Abstract
In shared mesh restoration, a distributed signaling protocol is used to reroute connections from failed service paths to restoration paths upon failure events. However, even when the network contains sufficient capacity, the restoration paths could be blocked for two different reasons: (1) with distributed restoration-path selection schemes, multiple restoration paths may compete for the capacity of the same logical links, even when other logical links have sufficient capacity; (2) multiple restoration-path setup attempts may compete for the same channels within the logical link (the glare problem), even when sufficient capacity is available within the logical link. We propose a hybrid distributed-centralized restoration mechanism for restoration-path selection and a channel-selection scheme that eliminates almost all glares. As shown from simulation in a typical intercity backbone network, our proposed hybrid mechanism improves the first restoration attempt success ratio by 40% compared with a pure distributed restoration approach. In addition, the proposed restoration-path selection algorithm saves up to 50% of restoration capacity compared with the disjoint shortest-path algorithm and 15% compared with a previously published greedy algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.