A fast delay-constrained multicast routing algorithm

Author

Zhang, Baoxian ; Kruntz, M.M. ; Chen, Changjia

Author_Institution

Sch. of Electron. & Inf. Eng., Northern Jiaotong Univ., Beijing, China

Volume

9

fYear

2001

fDate

2001

Firstpage

2676

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

computational complexity; delays; multicast communication; telecommunication network routing; DCMA; SDCR; delay-constrained multicast routing algorithm; delay-constrained path; delay-sensitive applications; end-to-end cost effective path; fast multicast routing heuristic; running complexity; Application software; Collaboration; Communication networks; Costs; Delay effects; Iterative algorithms; Multicast algorithms; Routing; Teleconferencing; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2001. ICC 2001. IEEE International Conference on

Conference_Location

Helsinki

Print_ISBN

0-7803-7097-1

Type

conf

DOI

10.1109/ICC.2001.936636

Filename

936636