DocumentCode :
2719083
Title :
An efficient delay-constrained multicast routing algorithm
Author :
Baoxian, Zhang ; Yue, Liu ; Changjia, Chen
Author_Institution :
Sch. of Electr. & Inf., Northern Jiaotong Univ., Beijing, China
Volume :
2
fYear :
2000
fDate :
2000
Firstpage :
1244
Abstract :
We propose a simple multicast routing heuristic for delay-sensitive applications. The running complexity of it is O(m|V), where m is the number of group members and |V is the number of nodes in the network. Experimental results through simulations show that the DCMA achieves good performance
Keywords :
computational complexity; delays; multicast communication; multimedia communication; telecommunication network routing; trees (mathematics); delay-constrained multicast routing algorithm; delay-sensitive applications; group members; multicast routing heuristic; multicast tree; multimedia information transmission; network nodes; running complexity; Bandwidth; Collaboration; Communication networks; Costs; Delay; Distance learning; Multicast algorithms; Routing; Teleconferencing; Tree data structures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-6394-9
Type :
conf
DOI :
10.1109/ICCT.2000.890895
Filename :
890895
Link To Document :
بازگشت