Self-healing Algorithm for Delay-Constrained Multicast Tree

摘要

Multicasting, which is a bandwidth efficient routing algorithm, has been the solution where many multimedia applications have been built upon for point-to-multipoint and multipoint-to-multipoint communications. A multicast delivery tree is built to efficiently disseminate the data packets to the receivers who may span broadly across a wide network. When a fault in the multicast delivery tree occurs as a result of network link failures, receivers will experience service outages. A self-healing mechanism is hence needed to dynamically restore the multicast tree from link failure. In this paper, we proposed a distributed self-healing algorithm that restores a broken multicast tree with sub-optimal network cost while satisfying the delay requirement as specified by the multimedia application.