Multicast routing with multiple constraints in high-speed networks based on genetic algorithms

Authors:
A. T. Haghighat;K. Faez;M. Dehghan;A. Mowlaei;Y. Ghahremani
Affiliations:
Atomic Energy Organization of Iran (AEOI), Tehran, Iran;Dept. of Electrical Engineering, Amirkabir University of Technology, Tehran 15914, Iran;Iran Telecommunication research Center (ITRC), Tehran, Iran;Dept. of Electrical Engineering, Amirkabir University of Technology, Tehran 15914, Iran;-
Venue:
ICCC '02 Proceedings of the 15th international conference on Computer communication
Year:
2002

Citing 22
Cited 2

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
An approach to a problem in network design using genetic algorithms

An approach to a problem in network design using genetic algorithms
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
Bicriteria network design problems

Journal of Algorithms
Multicast routing with multiple QoS constraints in ATM network

Information Sciences—Informatics and Computer Science: An International Journal
Genetic Algorithms

Genetic Algorithms
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
QDMR: An Efficient QoS Dependent Multicast Routing Algorithm

RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
A neural network approach to multicast routing in real-time communication networks

ICNP '95 Proceedings of the 1995 International Conference on Network Protocols
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
A genetic algorithm for designing distributed computer networktopologies

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Algorithms for delay-constrained low-cost multicast tree construction

Computer Communications
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
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications

The novel application of artificial neural networks for a reliable secure wireless multicast routing in mobile ad-hock networks

ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, the degree-based permutation encoding 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 algorthims 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.