Bottleneck branch marking for noise consolidation in multicast networks

The noisy feedback consolidation problem in point-to-multipoint ATM multicast networks is studied. A new algorithm, which keeps track of the M smallest available rates (AR) from the branches at each branching point, is proposed. This algorithm has zero response delay, noise stability (defined in the present paper), and small probability of noise. The probability model assumes no knowledge of the distribution of the available rate from the branches. Both analytical and simulation results demonstrate the superiority of the new algorithm.