Research of bound multicast tree

In multicast communication, messages are sent to multiple destinations that belong to the same multicast group. One of the core issues in providing such mechanisms is routing. Typical approaches of multicast routing require the transmission of packets along the branches of a tree spanning the source and destination nodes. In order to improve multicast routing quality under interactive real-time application conditions, this paper provides minimum cost multicast trees based on end-to-end delay and delay variation constraints. We first discuss the minimum cost multicast network model and its mathematical model based on bound delay and delay variation, and then provide the heuristic algorithm to solve the problem and show the time complexity analysis