A fast delay-constrained multicast routing algorithm

Baoxian Zhang, Marwan M. Krunz, Changjia Chen

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

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)
Pages (from-to)2676-2680
Number of pages5
JournalIEEE International Conference on Communications
Volume9
DOIs
StatePublished - Jan 1 2001

Keywords

  • Delay-constrained
  • Multicast
  • QoS routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A fast delay-constrained multicast routing algorithm'. Together they form a unique fingerprint.

  • Cite this