DocumentCode
3523886
Title
A optimal dynamic multicast routing algorithm
Author
Ming, Yang ; Xiren, Xie
Volume
2
fYear
1999
fDate
18-22 Oct. 1999
Firstpage
1130
Abstract
An optimal on-line multicast routing algorithm is proposed to update the current multicast tree when group members change dynamically. It carries out local optimization to lower the cost of the new multicast tree for each node addition.
Keywords
multicast communication; optimisation; telecommunication network routing; trees (mathematics); group members; local optimization; multicast tree; on-line multicast routing; optimal dynamic multicast routing algorithm; Application software; Computer networks; Cost function; Greedy algorithms; Heuristic algorithms; Multicast algorithms; Routing; Steiner trees; Teleconferencing; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 1999. APCC/OECC '99. Fifth Asia-Pacific Conference on ... and Fourth Optoelectronics and Communications Conference
Conference_Location
Beijing, China
Print_ISBN
7-5635-0402-8
Type
conf
DOI
10.1109/APCC.1999.820463
Filename
820463
Link To Document