A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

Applied Intelligence

Volumn 36, Issue 1, 2012, Pages 229-241

  Xu, Ying ^a,b   Qu, Rong ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b HUNAN UNIVERSITY   (China)

Author keywords

Multicast routing; Path relinking; Scatter search; Variable neighborhood search

Indexed keywords

COMBINATION METHOD; CONSTRAINED STEINER TREE; MATHEMATIC MODEL; METAHEURISTIC; MULTICAST ROUTING; NP COMPLETE PROBLEMS; PATH RELINKING; RANDOM GRAPHS; SCATTER SEARCH; SCATTER SEARCH ALGORITHM; VARIABLE NEIGHBORHOOD SEARCH;

BENCHMARKING; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LEARNING ALGORITHMS; MULTICASTING; NETWORK ROUTING; ROUTING ALGORITHMS; TREES (MATHEMATICS);

TABU SEARCH;

EID: 84856284365     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-010-0256-x     Document Type: Article

References (42)

1. Cheng X, Du DZ (2001) Steiner trees in industry. Kluwer Academic, Dordrecht
2. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
3. Guo L, Matta I (1999) QDMR: An efficient QoS dependent multicast routing algorithm. In: Proceedings of the 5th IEEE real time technology and applications symposium, pp 213-222
4. HF Salama DS Reeves Y Viniotis 1997 Evaluation of multicast routing algorithms for real-time communication on high-speed networks IEEE J Sel Areas Commun 15 332 345 10.1109/49.564132
5. CK Yeo BS Lee MH Er 2004 A survey of application level multicast techniques Comput Commun 27 1547 1568 10.1016/j.comcom.2004.04.003
6. X Masip-Bruin M Yannuzzi J Domingo-Pascual A Fonte M Curado E Monteiro F Kuipers P Van Mieghem S Avallone G Ventre P Aranda-Gutierrez M Hollick R Steinmetz L Iannone K Salamatian 2006 Research challenges in QoS routing Comput Commun 29 563 581 10.1016/j.comcom.2005.06.008 (Pubitemid 43267613)
7. C Diot W Dabbous J Crowcroft 1997 Multipoint communication: a survey of protocols, functions, and mechanisms IEEE J Sel Areas Commun 15 277 290 10.1109/49.564128
8. CAS Oliveira PM Pardalos 2005 A survey of combinatorial optimization problems in multicast routing Comput Oper Res 32 8 1953 1981 1068.90027 10.1016/j.cor.2003.12.007
9. JE Beasley 1990 OR-Library: distributing test problems by electronic mail J Oper Res Soc 41 11 1069 1072 http://people.brunel.ac.uk/~mastjjb/jeb/orlib/ steininfo.html
10. VP Kompella JC Pasquale GC Polyzos 1993 Multicast routing for multimedia communication IEEE/ACM Trans Netw 1 286 292 10.1109/90.234851
11. Widyono R (1994) The design and evaluation of routing algorithms for realtime channels. Technical Report, ICSI TR-94-024, International Computer Science Institute, UC Berkeley
12. Sun Q, Langendoerfer H (1995) Efficient multicast routing for delay-sensitive applications. In: Proceedings of the 2nd workshop on protocols for multimedia systems, pp 452-458
13. Sun Q, Langendoerfer H (1997) An efficient delay-constrained multicast routing algorithm. Technical Report, Internal Report, Institute of Operating Systems and Computer Networks, TU Braunschweig, Germany
14. Zhu Q, Parsa M, Garcia-Luna-Aceves JJ (1995) A source-based algorithm for delay-constrained minimum-cost multicasting. In: Proceedings of the 14th annual joint conference of the IEEE computer and communication (INFOCOM'95). IEEE Comput Soc, Boston, pp 377-385
15. Kompella VP, Pasquale JC, Polyzos GC (1993) Two distributed algorithms for the constrained Steiner tree problem. In: Proceedings of the 2nd international conference on computer communications and networking, pp 343-349
16. A Shaikh K Shin 1997 Destination-driven routing for low-cost multicast IEEE J Sel Areas Commun 15 373 381 10.1109/49.564135 (Pubitemid 127571572)
17. X Jia 1998 A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks IEEE/ACM Trans Netw 6 828 837 10.1109/90.748092 (Pubitemid 128745475)
18. Wang XL, Jiang Z (2004) QoS multicast routing based on simulated annealing algorithm. In: Proceedings international and applications, pp 511-516
19. Z Kun W Heng L Feng-Yu 2005 Distributed multicast routing for delay variation-bounded Steiner tree using simulated annealing Comput Commun 28 1356 1370 10.1016/j.comcom.2004.12.003 (Pubitemid 40822793)
20. Z Wang B Shi E Zhao 2001 Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm Comput Commun 24 685 692 10.1016/S0140-3664(00)00273-5 (Pubitemid 32287920)
21. AT Haghighat K Faez M Dehghan A Mowlaei Y Ghahremani 2004 GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing Comput Commun 27 111 127 10.1016/S0140-3664(03)00185-3
22. MS Zahrani MJ Loomes Malcolm JA Ullah AZM Dayem K Steinhofel AA Albrecht 2008 Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing Comput Oper Res 35 2049 2070 1139.90035 2579742 10.1016/j.cor.2006.10.001 (Pubitemid 47615242)
23. SJ Kim MK Choi 2007 Evolutionary Algorithms for route selection and rate allocation in multirate multicast networks Appl Intell 26 3 197 215 1189.90211 10.1007/s10489-006-0014-2 (Pubitemid 46589208)
24. H Youssef A Al-Mulhem SM Sait Tahir MA 2002 QoS-driven multicast tree generation using tabu search Comput Commun 25 11-12 1140 1149 10.1016/S0140-3664(02)00029-4 (Pubitemid 34249594)
25. Skorin-Kapov N, Kos M (2003) The application of Steiner trees to delay constrained multicast routing: a tabu search approach. In: Proceedings of the seventh international conference on telecommunications, Zagreb, Croatia
26. H Wang J Fang H Wang YM Sun 2004 TSDLMRA: an efficient multicast routing algorithm based on tabu search J Netw Comput Appl 27 77 90 10.1016/j.jnca.2003. 10.001
27. Ghaboosi N, Haghighat AT (2006) A tabu search based algorithm for multicast routing with QoS constraints. In: 9th international conference on information technology, pp 18-21
28. Ghaboosi N, Haghighat AT (2007) A path relinking approach for delay-constrained least-cost multicast routing problem. In: 19th international conference on tools with artificial intelligence, pp 383-390
29. N Skorin-Kapov M Kos 2006 A GRASP heuristic for the delay-constrained multicast routing problem Telecommun Syst 32 1 55 69 10.1007/s11235-006-8202-2 (Pubitemid 43814340)
30. Xu Y, Qu R (2009) A GRASP approach for the delay-constrained multicast routing problem. In: Proceedings of the 4th multidisciplinary international scheduling conference (MISTA4). Dublin, Ireland
31. Qu R, Xu Y, Kendall G (2009) A variable neighborhood descent search algorithm for delay-constrained least-cost multicast routing. In: Stützle T (ed) Proceedings of learning and intelligent optimization (LION3). LNCS, vol 5851. Springer, Berlin, pp 15-29
32. Betsekas D, Gallager R (1992) Data networks, 2nd edn. Englewood Cliffs, Prentice-Hall
33. Cormen TH, Leiserson CE, Revest RL (1997) Introduction to algorithms. MIT Press, Cambridge
34. D Eppstein 1998 Finding the k shortest paths SIAM J Comput 28 2 652 673 0912.05057 1634364 10.1137/S0097539795290477
35. Glover F (1998) A template for scatter search and path relinking. In: Hao JK, Lutton E, Ronald E, Schoenauer M, Snyers D (eds) Artificial Evolution. LNCS, vol 1363. Springer, Berlin, pp 3-51
36. F Glover M Laguna R Martí 2000 Fundamentals of scatter search and path relinking Control Cybern 29 3 653 684 0983.90077
37. Glover F, Løkketangen A, Woodruff DL (2000) Scatter search to generate diverse MIP solutions. In: Laguna M, González-Velarde JL (eds) OR computing tools for modeling, optimization and simulation: interfaces in computer science and operations research, pp 299-317
38. Drias H, Khabzaoui M (2001) Scatter search with random walk strategy for SAT and MAX-W-SAT problems. In: LNCS, vol 2070. Springer, Berlin, pp 35-44 (Pubitemid 33291310)
39. Hamiez JP, Hao JK (2002) Scatter search for graph coloring. In: LNCS, vol 2310. Springer, Berlin, pp 168-179
40. J Tang J Zhang Z Pan 2010 A Scatter search for solving vehicle routing problem with loading cost Expert Syst Appl 37 6 4073 4083 10.1016/j.eswa.2009. 11.027
41. Bastos MP Ribeiro CC (1999) Reactive tabu search with path relinking for the Steiner problem in graphs. In: Proceedings of the third metaheuristics international conference, Angra dos Reis, Brazil
42. BM Waxman 1988 Routing of multipoint connections IEEE J Sel Areas Commun 6 1617 1622 10.1109/49.12889