A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
Electronic Commerce Research
Fault Recovery for a Distributed SP-Based Delay Constrained Multicast Routing Algorithm
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Genetic Algorithm for Steiner Tree Optimization with Multiple Constraints Using Prüfer Number
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Multicast routing with multiple constraints in high-speed networks based on genetic algorithms
ICCC '02 Proceedings of the 15th international conference on Computer communication
Fault Recovery for a Distributed QoS-Based Multicast Routing Algorithm
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
An efficient algorithm for constructing delay bounded minimum cost multicast trees
Journal of Parallel and Distributed Computing
International Journal of Metaheuristics
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm
Computer Communications
| Hi-index | 0.00 |
An efficient delay-constrained multicast routing algorithmcomputing low cost delay-constrained multicast trees with smallalgorithm complexity is proposed in this paper. The proposedalgorithm can be used to compare cost performances of the existingor future multicast routing algorithms that provide quality ofservice (QoS) guarantees, especially in multicast routingsimulation environments which simulate relatively large networksand consider realistic network conditions. The proposed algorithmis also useful for routing real-time multicast data in high-speednetworks if adequate global information is available to thesource.