A study of two rerouting methods of link-restoration based selfhealing algorithms in selfhealing networks

In communication networks, single link failure is more frequent than other failures. Link-restoration based selfhealing algorithms is effective to single link failure. Among all rerouting methods of selfhealing algorithms, KSP (K-shortest path) and KMF (K-maximum flow) are most important. This approach presents a study of KSP and KMF. Computer experiments show that, the rerouting ability of KSP and KMF are approximate to the maximum and the rerouting ability of KMF is a little better than KSP. This result reveals the good performance of KSP and KMF. It is helpful to choosing a selfhealing algorithm with high restoration ratio