基于相交多路径的组播主动式恢复方案

Braided multipaths based multicast preactive recovery scheme

提出了基于相交多路径的组播主动式恢复方案。该方案通过为树中节点提供备用父节点的方式,计算组播源到各个组成员的多条相交路径来代替不相交双树。相交多路径保证了构建成功率并为组播路由提供一定程度的保护。仿真结果表明,该方案构建的组播树以及故障恢复后组播树的代价均与现有方案相当,但是提供的故障恢复时间与现有方案相比显著缩短。

This paper presents a scheme based on braided multipaths in which constructing succeed probability can be ensured and the scheme provides a certain level of protection for multicast communication. We provide each node of muhicast tree with two parents nodes, there exist many braided muhipaths from the source to each receiver. Our simulations show that： （a） this scheme has appropriate muhicast tree cost with some schemes proposed previously; （b） cost increase after restoration as much as some schemes proposed previously; （c） compared to prior work in muhicast preactive recovery scheme, our scheme provides shorter restoratlon time.