Multicast routing with multiple constraints in high-speed networks based on genetic algorithms

The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed method, the degree-based permutation encoding is used for genotype representation. Some novel heuristic algorithms are also proposed for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed GA-based algorthims in comparison with other existing heuristic and GA-based algorithms by the result of simulation. This proposed algorithm has overcome all of the previous algorithms in the literatures.

[1]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

[2]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[3]  Wang Zhengying,et al.  Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm , 2001 .

[4]  Bryant A. Julstrom,et al.  Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem , 1993, SAC '94.

[5]  Mitsuo Gen,et al.  An effective genetic algorithm approach to the quadratic minimum spanning tree problem , 1998, Comput. Oper. Res..

[6]  Anoop Ghanwani,et al.  Improved Neural Heuristics for Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[7]  Peng Song.  QoS Routing Based on Genetic Algorithm , 2004 .

[8]  R. Ravi,et al.  Bicriteria Network Design Problems , 1998, J. Algorithms.

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

[10]  Samuel Pierre,et al.  A genetic algorithm for designing distributed computer network topologies , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[11]  C. P. Ravikumar,et al.  Source-based delay-bounded multicasting in multimedia networks , 1998, Comput. Commun..

[12]  Charles C. Palmer,et al.  An approach to a problem in network design using genetic algorithms , 1994, Networks.

[13]  Norio Shiratori,et al.  A neural network approach to multicast routing in real-time communication networks , 1995, Proceedings of International Conference on Network Protocols.

[14]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

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

[16]  C. Siva Ram Murthy,et al.  A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[17]  Qing Zhu,et al.  An iterative algorithm for delay-constrained minimum-cost multicasting , 1998, TNET.

[18]  Quan Sun,et al.  A Genetic Algorithm for Delay-Constrained Minimum-Cost Multicasting , 1999 .

[19]  Quan Sun,et al.  An efficient delay-constrained multicast routing algorithm , 1998, J. High Speed Networks.

[20]  G. D. Smith,et al.  Solving the Graphical Steiner Tree Problem Using Genetic Algorithms , 1993 .

[21]  Erdun Zhao,et al.  Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm , 2001, Comput. Commun..

[22]  Tughrul Arslan,et al.  Genetic framework for the high level optimisation of low power VLSI DSP systems , 1996 .

[23]  Yee Leung,et al.  A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..

[24]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[25]  Liang Guo,et al.  QDMR: an efficient QoS dependent multicast routing algorithm , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.

[26]  John E. Hopcroft,et al.  Complexity of Computer Computations , 1974, IFIP Congress.

[27]  Henrik Esbensen.  Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm , 1994 .

[28]  Hsueh-I Lu,et al.  Multicast routing with multiple QoS constraints in ATM networks , 2000, Inf. Sci..

[29]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[30]  A. Gill Waters.  A new heuristic for ATM multicast routing , 1994 .

[31]  Douglas S. Reeves,et al.  Evaluation of multicast routing algorithms for real-time communication on high-speed networks , 1995 .

[32]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[33]  Yu Jian-kun.  Genetic Algorithm and Its Application , 2002 .

[34]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

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

[36]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[37]  Reinhard Männer,et al.  Optimization of Steiner Trees Using Genetic Algorithms , 1989, International Conference on Genetic Algorithms.