Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues
IEEE Transactions on Parallel and Distributed Systems
Scheduling Multiprocessor Tasks with Genetic Algorithms
IEEE Transactions on Parallel and Distributed Systems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Generalized Multiprocessor Scheduling and Applications to Matrix Computations
IEEE Transactions on Parallel and Distributed Systems
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
SNMP GetPrev: an efficient way to browse large MIB tables
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Designing optimal measurement infrastructure is a key step for network management. In this work the goal of the optimization is to identify a minimum aggregating nodes set subject to bandwidth and delay constraints on the aggregating procedure. The problem is NP-hard. In this paper, we describe the way of using Genetic Algorithm for finding aggregating nodes set. The simulation indicates that Genetic Algorithm can produce much better result than the current method of randomly picking aggregating nodes.