Reducing average delay after link failure in single-link recovery trees using distributed switching mechanism

Based on the modified MFBG algorithm, the distributed switching mechanism (DSM) is proposed to reduce the average delay after link failure in the preplanned single-link recovery trees. The main principle of the DSM is to use as many links in the blue tree as possible to keep connected, and the key feature is that all the active links comprise a new spanning tree after distributed switching. Simulation results demonstrate the effectiveness of the DSM in reducing the average delay.