MulRoGA: A Multicast Routing Genetic Algorithm approach considering multiple objectives

We solve a multicast routing problem by means of a genetic algorithm (GA) without using multicast trees. The source-destination routes need to fulfill two conflicting objectives: maximization of the common links and minimization of the route sizes. The proposed GA can be characterized by its representation of network links and routes in a variable size multi-chromosome problem; local viability restrictions in order to generate the initial population and define variation operators; selection operators in order to choose the most promising individuals thus preserving diversity, and the fitness function in order to handle the conflicting multiple objectives. The proposed model is called a Multicast Routing Genetic Algorithm (MulRoGA). The model was tested on the 33-node European GÉANT WAN network backbone and three other networks (66-node, 100-node and 200-node) randomly generated using the Waxman model on a network topology generator BRITE. On considering each network, a number of solutions were found for changes in the size and node members of the multicast groups, and the source node. The results of the MulRoGA operation suggest a consistent and robust performance in the various cases including comparisons with the methods of unicast shortest path routing, shortest path tree routing (SPT), and simulated annealing (SA) heuristic.

[1]  Carlos A. Coello Coello,et al.  An updated survey of GA-based multiobjective optimization techniques , 2000, CSUR.

[2]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[3]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[4]  Hideaki Takagi,et al.  Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks , 2005, IEICE Trans. Commun..

[5]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[6]  Beatrice M. Ombuki-Berman,et al.  Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows , 2006, Applied Intelligence.

[7]  Abhishek Roy,et al.  QM2RP: A QoS-Based Mobile Multicast Routing Protocol Using Multi-Objective Genetic Algorithm , 2004, Wirel. Networks.

[8]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[9]  Ren-Hung Hwang,et al.  Multicast Routing Based on Genetic Algorithms , 2000, J. Inf. Sci. Eng..

[10]  Kai-Yeung Siu,et al.  New dynamic algorithms for shortest path tree computation , 2000, TNET.

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  Thomas A. Maufer,et al.  Deploying IP Multicast in the Enterprise , 1998 .

[13]  Cheng-Fa Tsai,et al.  A novel algorithm for multimedia multicast routing in a large scale network , 2004, J. Syst. Softw..

[14]  Shian-Shyong Tseng,et al.  A Genetic Algorithm for Multicast Routing under Delay Constraint in WDM Network with Different Light Splitting , 2005, J. Inf. Sci. Eng..

[15]  C. Siva Ram Murthy,et al.  Algorithms for delay-constrained low-cost multicast tree construction , 1998, Comput. Commun..

[16]  C. Kenneth Miller,et al.  Multicast Networking and Applications , 1998 .

[17]  Mitsuo Gen,et al.  Genetic Algorithms , 1999, Wiley Encyclopedia of Computer Science and Engineering.

[18]  Mario Gerla,et al.  Aggregated Multicast – A Comparative Study , 2002, Cluster Computing.

[19]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[20]  M. M. Makela,et al.  Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications , 1999 .

[21]  Panos M. Pardalos,et al.  A survey of combinatorial optimization problems in multicast routing , 2005, Comput. Oper. Res..

[22]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[23]  K. Faez,et al.  A Genetic Algorithm for Steiner Tree Optimization with Multiple Constraints Using Prüfer Number , 2002, EurAsia-ICT.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Jon Crowcroft,et al.  Core Based Trees (CBT) An Architecture for Scalable Inter-Domain Multicast Routing , 1993, SIGCOMM 1993.

[26]  Qingfu Zhang,et al.  An orthogonal genetic algorithm for multimedia multicast routing , 1999, IEEE Trans. Evol. Comput..

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

[28]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[29]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM 1993.

[30]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[31]  Karim Faez,et al.  GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing , 2004, Comput. Commun..

[32]  Cícero Garrozi,et al.  Multiobjective Genetic Algorithm for Multicast Routing , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[33]  Karim Faez,et al.  GA-Based Heuristic Algorithms for QoS Based Multicast Routing , 2003, Knowl. Based Syst..

[34]  Rajeev Kumar,et al.  Running Time Analysis of a Multiobjective Evolutionary Algorithm on Simple and Hard Problems , 2005, FOGA.

[35]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[36]  Aluizio F. R. Araújo,et al.  Multicast routing using genetic algorithm seen as a permutation problem , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[37]  Layuan Li,et al.  Genetic Algorithm-Based QoS Multicast Routing for Uncertainty in Network Parameters , 2003, APWeb.