Explicit Multicast Routing Algorithms for Constrained Traffic Engineering
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
A Multiobjective Model for QoS Multicast Routing Based on Genetic Algorithm
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Hashing based traffic partitioning in a multicast-multipath MPLS network model
LANC '05 Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking
Hi-index | 0.00 |
In a previous paper a novel Generalized Multiobjective Multitree model (GMM-model) was proposed. This model considers for the first time multitree-multicast load balancing with splitting in a multiobjective context, whose mathematical solution is a whole Pareto optimal set that can include several results than it has been possible to find in the publications surveyed. To solve the GMM-model, in this paper a multi-objective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) is proposed. Experimental results considering up to 11 different objectives are presented for the well-known NSF network, with two simultaneous data flows.