Skip to Main Content
Group multicasting is a kind of communication mechanism whereby each member of a group sends messages to all the other members of the same group. It is more important for group multicast routing algorithms to manage the resources efficiently and satisfy the QoS (Quality-of-Service) requirements of each individual application. In this paper, we proposed two routing algorithms for group multicast with bandwidth-delay constrained. A new metric and a new iterative modification were designed to construct source-specific trees. Simulations over random network were carried out to compare proposed algorithms' performance with Low and Song's. The experimental results show that our proposed algorithms perform better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover, our algorithms achieve good performance in balancing traffic, which can avoid link blocking and enhance the network behavior efficiently.