HGA: a hardware-based genetic algorithm
FPGA '95 Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays
A Genetic Algorithm Based Routing Method Using Two QoS Parameters
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Group multicast routing problem: A genetic algorithms based approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quick convergence of genetic algorithm for QoS-driven web service selection
Computer Networks: The International Journal of Computer and Telecommunications Networking
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Multi-objective and multi-constrained non-additive shortest path problems
Computers and Operations Research
Multi-constraint Qos Unicast Routing Using Genetic Algorithm (MURUGA)
Applied Soft Computing
An oriented spanning tree based genetic algorithm for multi-criteria shortest path problems
Applied Soft Computing
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Mathematical and Computer Modelling: An International Journal
QoS routing based on genetic algorithm
Computer Communications
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Performance evaluation of constraint-based path selection algorithms
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Multi-constrained routing (MCR) aims to find the feasible path in the network that satisfies multiple independent constraints, it is usually used for routing multimedia traffic with quality-of-service (QoS) guarantees. It is well known that MCR is NP-complete. Heuristic and approximate algorithms for MCR are not effective in dynamic network environment for real-time applications when the state information of the network is out of date. This paper presents a genetic algorithm to solve the MCR problem subject to transmission delay and transmission success ratio. Three key design problems are investigated for this new algorithm, i.e., how to encode the problem in genetic representation, how to avoid the illegal chromosomes in the process of population initialization and genetic operation, and how to design effective genetic operator. We propose the gene structure (GS) to deal with the first problem, and the gene structure algorithm (GSA) to generate the GS. Based on the GS, we provide the heuristic chromosome initialization and mutation operator to solve the last two problems. Computer simulations show that the proposed GA exhibits much faster computation speed so as to satisfy the real-time requirement, and much higher rate of convergence than other algorithms. The results are relatively independent of problem types (network scales and topologies). Furthermore, simulation results show that the proposed GA is effective and efficient in dynamic network environment.