A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
TSDLMRA: an efficient multicast routing algorithm based on tabu search
Journal of Network and Computer Applications
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Destination-driven shortest path tree algorithms
Journal of High Speed Networks
IEEE Transactions on Parallel and Distributed Systems
Proactive rearrangement in delay constrained dynamic membership multicast
Computer Communications
An Ant Algorithm for the Steiner Tree Problem in Graphs
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
EvoArch: An evolutionary algorithm for architectural layout design
Computer-Aided Design
On the methodology for the evaluation of unconstrained multicast routing algorithms
ICT'09 Proceedings of the 16th international conference on Telecommunications
Minimal traffic-constrained similarity-based SOAP multicast routing protocol
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Destination-driven on-demand multicast routing protocol for wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Algorithms for delay-constrained low-cost multicast tree construction
Computer Communications
Multicast routing for multimedia collaborative applications
Computer Communications
New Strategies and Extensions in Kruskal's Algorithm in Multicast Routing
International Journal of Business Data Communications and Networking
| Hi-index | 0.07 |
We present a destination-driven algorithm that optimizes for applications, such as group video or teleconferencing, that require multicast trees with low total cost. The destination-driven algorithm uses a greedy strategy based on shortest-path trees and minimal spanning trees but biases routes through destinations. The performance of the algorithm is analyzed through extensive simulation and compared with several Steiner tree heuristics and the popular shortest-path tree (SPT) method. The algorithm is found to produce trees with significantly lower overall cost than the SPT while maintaining reasonable per-destination performance. Its performance also compares well with other known Steiner heuristics. Moreover, the algorithm does not suffer from high complexity common to most Steiner tree heuristics and builds a route by querying only incident links for cost information