Shortest backup path based multicast fast fault-recovery scheme
Jianhui Zhang · Jisuanji yingyong yanjiu · 2010
This paper systematically presented possible implementation approaches on multicast proactive recovery schemes and classified them into two catalogs: end-to-end recovery and local recovery. It modeled and analyzed these implementation approaches in continuous-time Markov chains ( CTMC) . Based on theoretical results,this paper proposed an novel fast faultrecovery scheme of multicast routing,which could effectively calculate a shortest and loop-free backup path to reconnect the isolated sub-trees due to fault,whether single link or single node failure cases. Simulation experiments show that failure recovery time of our scheme decreased by 56. 3% and 35. 1% compared toredundant treescheme anddual-treescheme,the scheme cause less multicast tree cost increase after restoration than those schemes proposed previously.