A fast algorithm for improved RS Steiner tree heuristic in multipoint routing

This paper presents a new fast algorithm for the improved RS Steiner tree heuristic. In order to reduce the execution time, we investigate the circumstances under which more than two trees can be united in a single iteration stage as opposed to the original algorithm in which only two trees are united. We implement both the original algorithm and the proposed fast algorithm and perform simulations on various sizes of random graphs to estimate the amount of reduction achieved both in time and in number of iterations. The amount of reduction achieved by the proposed fast algorithm appears to be proportional to the ratio of number of special nodes to network size