DCADH: A Generating Algorithm of Delay-Constrained Multicast Routing Tree

Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. In order to construct a delay-constrained multicast routing tree, average distance heuristic (ADH) algorithm is analyzed firstly, then by using which a delay-constrained algorithm called DCADH is presented. By using ADH a least-cost multicast tree can be constructed; if the path delay can´t meet the delay upper bound, a shortest delay path which is computed by Dijkstra´s algorithm will be merged into the existing multicast tree to meet the delay upper bound. Simulation experiments show that DCADH has a good performance in achieving a low-cost multicast tree.