Available bandwidth-based real-time multicast routing distributed algorithm

In this paper, available bandwidth instead of cost is adopted as the prime metric of the real-time multicast routing algorithms in that available bandwidth is the better representative of the real network than cost. At the same time, two significant bounds of end-to-end delay and inter-destination delay variation are taken into consideration. Based on these three metrics, a novel distributed real-time multicast routing algorithm with widest available bandwidth paths under the constraints of delay and delay variation is proposed. This algorithm can increase efficiency of algorithms concerned with delay variation by analyzing and attaining the relationship between per path delay and the two constraints. In addition, the problem of false termination is eliminated by a make-and-break procedure. Simulation results and analysis prove the effectiveness of the algorithm as well as its polynomial time complexity.