Self-healing networks: a distributed algorithm fork-shortest link-disjoint paths in a multigraph with applications in real-time network restoration
A highly efficient path-restoration protocol for management of optical network transport integrity
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this study the restoration performance of two closely related Sender/Chooser-based distributed path restoration protocols (both extensions of the Self-Healing Network (SHN) to path restoration) is compared. Some pathological situations in which these Sender/Chooser-based restoration algorithms perform suboptimally are identified and, where available, possible solutions are proposed. Built-in mechanisms to resolve contention between Sender/Chooser pairs were found to be very helpful. In addition, the performance of the distributed restoration algorithms studied was found to be close to its theoretical upper bound, suggesting that the pathological situations described may not be that important for real-life networks.