A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem

Path relinking is an evolutionary approach for solving a diverse array of optimization problems. The NP-complete Steiner tree problem is a fundamental component of many real world telecommunication applications and is a critical structure underlying multicast communications. This paper describes a novel path relinking algorithm for the delay- constrained least-cost multicast routing problem. Computational results on various random generated networks indicate that our proposed path relinking algorithm results in the best overall performance with regard to total tree cost in comparison with other existing algorithms and heuristics.

[1]  Nejla Ghaboosi,et al.  A Tabu Search Based Algorithm for Multicast Routing with QoS Constraints , 2006, 9th International Conference on Information Technology (ICIT'06).

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

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

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

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

[6]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

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

[8]  In-Chan Choi,et al.  A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem , 2003, Comput. Oper. Res..

[9]  Sadiq M. Sait,et al.  Evolutionary algorithms, simulated annealing and tabu search: a comparative study , 2001 .

[10]  Sadiq M. Sait,et al.  Evolutionary algorithms, simulated annealing, and Tabu search: a comparative study , 1998, Optics & Photonics.

[11]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[12]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

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

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

[15]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

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

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

[18]  Sriram Raghavan,et al.  A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees , 1999, TNET.

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

[20]  N. Skorin-Kapov,et al.  The application of Steiner trees to delay constrained multicast routing: a tabu search approach , 2003, Proceedings of the 7th International Conference on Telecommunications, 2003. ConTEL 2003..

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

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

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

[24]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

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

[26]  C. Ribeiro,et al.  Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs , 2002 .

[27]  Heng Wang,et al.  TSDLMRA: an efficient multicast routing algorithm based on Tabu search , 2004, J. Netw. Comput. Appl..

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