A fast delay-constrained multicast routing algorithm

B. Zhang, Marwan M Krunz, C. Chen

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

6 Citations (Scopus)

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)
Title of host publicationIEEE International Conference on Communications
Pages2676-2680
Number of pages5
Volume9
StatePublished - 2001
EventInternational Conference on Communications (ICC2001) - Helsinki, Finland
Duration: Jun 11 2000Jun 14 2000

Other

OtherInternational Conference on Communications (ICC2001)
CountryFinland
CityHelsinki
Period6/11/006/14/00

Fingerprint

Routing algorithms
Cost effectiveness
Costs

Keywords

  • 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)

A fast delay-constrained multicast routing algorithm. / Zhang, B.; Krunz, Marwan M; Chen, C.

IEEE International Conference on Communications. Vol. 9 2001. p. 2676-2680.

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

Zhang, B, Krunz, MM & Chen, C 2001, A fast delay-constrained multicast routing algorithm. in IEEE International Conference on Communications. vol. 9, pp. 2676-2680, International Conference on Communications (ICC2001), Helsinki, Finland, 6/11/00.
Zhang B, Krunz MM, Chen C. A fast delay-constrained multicast routing algorithm. In IEEE International Conference on Communications. Vol. 9. 2001. p. 2676-2680
Zhang, B. ; Krunz, Marwan M ; Chen, C. / A fast delay-constrained multicast routing algorithm. IEEE International Conference on Communications. Vol. 9 2001. pp. 2676-2680
@inproceedings{891153ce6e5849c888a6f27507b43129,
title = "A fast delay-constrained multicast routing algorithm",
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.",
keywords = "Delay-constrained, Multicast, QoS routing",
author = "B. Zhang and Krunz, {Marwan M} and C. Chen",
year = "2001",
language = "English (US)",
volume = "9",
pages = "2676--2680",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - A fast delay-constrained multicast routing algorithm

AU - Zhang, B.

AU - Krunz, Marwan M

AU - Chen, C.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Delay-constrained

KW - Multicast

KW - QoS routing

UR - http://www.scopus.com/inward/record.url?scp=0034850502&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034850502&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0034850502

VL - 9

SP - 2676

EP - 2680

BT - IEEE International Conference on Communications

ER -