A fast delay-constrained multicast routing algorithm

B. Zhang, Marwan M Krunz, C. Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations


In this paper, we propose a fast multicast routing heuristic, called DCMA, for delay-sensitive applications. The running complexity of DCMA is O(m log m+|V|), where m is the size of the multicast group and |V| is the number of nodes in the network. We first present a unicast version of DCMA, called SDCR, which is used to setup an end-to-end, cost effective delay-constrained path between two nodes. SDCR can always find a delay-constrained path if one exists. Its running complexity is O(|V|). SDCR is used in constructing DCMA, which is guaranteed to be loop free. Simulation results are used to demonstrate the high performance and cost effectiveness of the proposed heuristic.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Number of pages5
Publication statusPublished - 2001
EventInternational Conference on Communications (ICC2001) - Helsinki, Finland
Duration: Jun 11 2000Jun 14 2000


OtherInternational Conference on Communications (ICC2001)



  • Delay-constrained
  • Multicast
  • QoS routing

ASJC Scopus subject areas

  • Media Technology

Cite this

Zhang, B., Krunz, M. M., & Chen, C. (2001). A fast delay-constrained multicast routing algorithm. In IEEE International Conference on Communications (Vol. 9, pp. 2676-2680)