An efficient delay‐constrained multicast routing algorithm

Abstract

An efficient delay‐constrained multicast routing algorithm computing low cost delay‐constrained multicast trees with small algorithm complexity is proposed in this paper. The proposed algorithm can be used to compare cost performances of the existing or future multicast routing algorithms that provide quality of service (QoS) guarantees, especially in multicast routing simulation environments which simulate relatively large networks and consider realistic network conditions. The proposed algorithm is also useful for routing real‐time multicast data in high‐speed networks if adequate global information is available to the source.