An Efficient Multicast Routing Algorithm for Packet-Switched Networks

This paper has a dual purpose. First, we consider a relaxation algorithm which seems to be particularly suitable for multicasting routing problems. We show that the algorithm has polynomial complexity. Second, to measure the quality of solutions in comparison to the optimal solutions over a wide range of network sizes for which the computation of the optimal costs is too excessive, we also propose a random graph generation scheme in which an asymptotic lower bound on the expected optimal cost can be computed as a function of network node size.