论文信息 - Solving the GMM-model with a MOEA

Solving the GMM-model with a MOEA

The Generalized Multiobjective Multitree model (GMM-model) considers, for the first time, multitree-multicast load balancing with splitting in a multiobjective context. The mathematical solution of the GMM-model is a whole Pareto optimal set that includes several previously published results, according to surveyed publications. To solve the GMM-model, this paper proposes a multi-objective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA). Experimental results considering up to 11 different objectives are presented for the well-known NSF network, with two simultaneous data flows.

Ramón Fabregat | José-Luis Marzo | Benjamín Barán | Fernando Solano Donado | Yezid Donoso

[1] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[2] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[3] Gary B. Lamont,et al. Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[4] Yanghee Choi,et al. A constrained multipath traffic engineering scheme for MPLS networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[5] Shueng-Han Gary Chan,et al. Multipath routing for video unicast over bandwidth-limited networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[6] Ramón Fabregat,et al. Multi-objective scheme over multi-tree routing in multicast MPLS networks , 2003, LANC '03.