Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
An effective genetic algorithm approach to the quadratic minimum spanning tree problem
Computers and Operations Research
An efficient delay-constrained multicast routing algorithm
Journal of High Speed Networks
Multicast routing with multiple QoS constraints in ATM network
Information Sciences—Informatics and Computer Science: An International Journal
Optimization of Steiner Trees Using Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
A Genetic Algorithm for the Rectilinear Steiner Problem
Proceedings of the 5th International Conference on Genetic Algorithms
A genetic algorithm for the multiple destination routing problems
IEEE Transactions on Evolutionary Computation
An orthogonal genetic algorithm for multimedia multicast routing
IEEE Transactions on Evolutionary Computation
Research: Source-based delay-bounded multicasting in multimedia networks
Computer Communications
QoS routing based on genetic algorithm
Computer Communications
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm
Computer Communications
Improved neural heuristics for multicast routing
IEEE Journal on Selected Areas in Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Hybridized optimization genetic algorithm for QOS-based multicast routing problem
ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
Skynets: searching for minimum trees in graphs with incomparable edge weights
Proceedings of the 20th ACM international conference on Information and knowledge management
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
| Hi-index | 0.00 |
The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed method, Prüfer number is used for genotype representation. Some novel heuristic algorithms are also proposed for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed GA-based algorithm in comparison with other existing heuristic and GA-based algorithms by the result of simulation. This proposed algorithm has overcome all of the previous algorithms in the literatures.