Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing

Computers and Operations Research

Volumn 35, Issue 6, 2008, Pages 2049-2070

  Zahrani, M S ^a   Loomes, M J ^b   Malcolm, J A ^a   Dayem Ullah, A Z M ^c   Steinhofel K ^d   Albrecht, A A ^a  

^a UNIVERSITY OF HERTFORDSHIRE   (United Kingdom)

^b MIDDLESEX UNIVERSITY   (United Kingdom)

^c IMPERIAL COLLEGE LONDON   (United Kingdom)

^d KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Genetic local search; Multicast routing; Quality of service (QoS); Simulated annealing; Steiner trees

Indexed keywords

ALGORITHMS; COST REDUCTION; MULTICASTING; ONLINE SEARCHING; POPULATION DYNAMICS; QUALITY OF SERVICE; SIMULATED ANNEALING;

GENETIC LOCAL SEARCH; LANDSCAPE ANALYSIS; LOGARITHMIC SIMULATED ANNEALING; MULTICAST ROUTING; PARTIALLY MIXED CROSSOVER OPERATION; STEINER TREES;

SEARCH ENGINES;

EID: 35348963073     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.10.001     Document Type: Article

References (59)

1. Oliveira C.A.S., and Pardalos P.M. A survey of combinatorial optimization problems in multicast routing. Computers & Operations Research 32 (2005) 1953-1981
2. Wang Z., Bingxin S., and Liu W. A distributed dynamic heuristic for delay-constrained least-cost multicast routing. Journal of Interconnection Networks 1 4 (2000) 331-344
3. Novak R., Rugelj J., and Kandus G. A note on distributed multicast routing in point-to-point networks. Computers & Operations Research 28 (2001) 1149-1164
4. Diot C., Dabbous W., and Crowcroft J. Multipoint communication: a survey of protocols, functions, and mechanisms. IEEE Journal on Selected Areas in Communications 15 (1997) 277-290
5. Muchnik V.B., and Shafarenko A.V. Dynamic evaluation strategy for fine-grain data-parallel computing. IEE Proceedings-Computers and Digital Techniques 143 (1996) 181-188
6. Salama H.F., Reeves D.S., and Viniotis Y. Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Journal on Selected Areas in Communications 15 (1997) 332-345
7. Mir-Fakhraei N. An efficient multicast approach in an ATM switching network for multimedia applications. Journal of Network and Computer Applications 21 (1998) 31-39
8. Yeo C.K., Lee B.S., and Er M.H. A framework for multicast video streaming over IP networks. Journal of Network and Computer Applications 26 (2003) 273-289
9. Yeo C.K., Lee B.S., and Er M.H. A survey of application level multicast techniques. Computer Communications 27 (2004) 1547-1568
10. Li X., and Veeravalli B. Design and performance analysis of multimedia document retrieval strategies for networked video-on-reservation systems. Computer Communications 28 (2005) 1910-1924
11. Masip-Bruin X., Yannuzzi M., Domingo-Pascual J., Fonte A., Curado M., Monteiro E., Kuipers F., Van Mieghem P., Avallone S., Ventre G., Aranda-Gutiérrez P., Hollick M., Steinmetz R., Iannone L., and Salamatian K. Research challenges in QoS routing. Computer Communications 29 (2006) 563-581
12. Yang C.B., and Wen U.P. Applying tabu search to backup path planning for multicast networks. Computers & Operations Research 32 (2005) 2875-2889
13. Banerjee S., Kommareddy C., Kar K., Bhattacharjee B., and Khulle S. OMNI: an efficient overlay multicast infrastructure for real-time applications. Computer Networks 50 6 (2006) 826-841
14. Harrison T., and Williamson C. A performance study of multicast routing algorithms for ATM networks. Proceedings of 21st annual IEEE conference on local computer networks (1996) 191-201
15. Zhang Q.F., and Leung Y.W. An orthogonal genetic algorithm for multimedia multicast routing. IEEE Transactions on Evolutionary Computation 3 (1999) 53-62
16. Karp R.M. Reducibility among combinatorial problems. Complexity of computer computations (1972), Plenum Press, New York p. 85-103
17. Zhu L., Wainwright R.L., and Schoenefeld D.A. A genetic algorithm for the point to multipoint routing problem with varying number of requests. Proceedings of IEEE international conference on evolutionary computation (1998) 171-176
18. Galiasso P., and Wainwright R.L. A hybrid genetic algorithm for the point to multipoint routing problem with single split paths. Proceedings of ACM Symposium on Applied Computing (2001) 327-332
19. Ericsson M., Resende M.G.C., and Pardalos P.M. A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization 6 3 (2002) 299-333
20. Barolli L., Koyama A., Suganuma T., and Shiratori N. GAMAN: a GA based QoS routing method for mobile Ad-Hoc networks. Journal of Interconnection Networks 4 3 (2003) 251-270
21. Yang W.L. A heuristic algorithm for the multi-constrained multicast tree. Proceedings of the sixth IFIP/IEEE international conference on management of multimedia networks and services, Lecture Notes in Computer Science vol. 2839 (2003) 78-89
22. Skorin-Kapov N., and Kos M. The application of Steiner trees to delay constrained multicast routing: a tabu search approach. Proceedings of the seventh international conference on telecommunications vol. 2 (2003) 443-448
23. Wang H., Fang J., Wang H., and Sun Y.M. TSDLMRA: an efficient multicast routing algorithm based on tabu search. Journal of Network and Computer Applications 27 2 (2004) 77-90
24. 2 RP: a QoS-based mobile multicast routing protocol using multiobjective genetic algorithms. Wireless Networks 10 3 (2004) 271-286
25. Kampstra P. Evolutionary computing in telecommunications. BMI paper, August 2005. Vrije Universiteit Amsterdam.
26. Kirkpatrick S., Gelatt Jr. C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
27. Černy V. A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications 45 (1985) 41-51
28. Hajek B. Cooling schedules for optimal annealing. Mathematics of Operations Research 13 (1988) 311-329
29. Catoni O. Rough large deviation estimates for simulated annealing: applications to exponential schedules. Annals of Probability 20 (1992) 1109-1146
30. Aarts E.H.L. Local search in combinatorial optimization (1998), Wiley, New York
31. Cui Y., Xu K., Wu J.P., Yu Z.C., and Zhao Y.J. Multi-constrained routing based on simulated annealing. Proceedings IEEE international conference on communications vol. 3 (2003) 1718-1722
32. Wang X.W., Cheng H., Cao J., Zheng L.W., and Huang M. A simulated-annealing-based QoS multicasting algorithm. Proceedings international conference on communication technology (2003) 469-473
33. Wang X.L., and Jiang Z. QoS multicast routing based on simulated annealing algorithm. Proceedings SPIE on network architectures, management, and applications (2004) 511-516
34. Kun Z., Heng W., and Feng-Yu L. Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing. Computer Communications 28 (2005) 1356-1370
35. Wang X., Cao J., Cheng H., and Huang M. QoS multicast routing for multimedia group communications using intelligent computational methods. Computer Communications 29 (2006) 2217-2229
36. Wright S. The roles of mutation, inbreeding, crossbreeding and selection in evolution. Proceedings of the sixth international congress on genetics vol. 1 (1932) 356-366
37. Merz P., and Freisleben B. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evolutionary Computation 8 1 (2000) 61-91
38. Reidys C.M., and Stadler P.F. Combinatorial landscapes. SIAM Review 44 1 (2002) 3-54
39. Wales D. Energy landscapes (2003), Cambridge University Press, Cambridge
40. Albrecht A.A. A stopping criterion for logarithmic simulated annealing. Computing 78 (2006) 55-79
41. Ferreira F.F., Fontanari J.F., and Stadler P.F. Landscape statistics of the low-autocorrelation binary string problem. Journal of Physics A 33 (2000) 8635-8647
42. Wolfinger M.T., Svrcek-Seiler W.A., Flamm C., Hofacker I.L., and Stadler P.F. Exact folding dynamics of RNA secondary structures. Journal of Physics A 37 (2004) 4731-4741
43. Schmitt L.M. Theory of genetic algorithms. Theoretical Computer Science 259 (2001) 1-61
44. Zahrani MS, Loomes MJ, Malcolm JA, Albrecht AA. Genetic local search for multicast routing, Proceedings of genetic and evolutionary computation conference (GECCO'06), 2006. p. 615-16.
45. Steinhöfel K., Albrecht A., and Wong C.K. Fast parallel heuristics for the job shop scheduling problem. Computers & Operations Research 29 2 (2002) 151-169
46. Beasley JE. OR library: 〈http://people.brunel.ac.uk/~mastjjb〉.
47. Hakimi S.L. Steiner's problem in graphs and its implications. Networks 1 (1971) 113-133
48. Kou L., Markowsky G., and Berman L. A fast algorithm for Steiner trees. Acta Informatica 15 (1981) 141-145
49. Doar M., and Leslie I.M. How bad is naïve multicast routing?. Proceedings of IEEE INFOCOM (1993) 82-89
50. Alexander M.J., and Robins G. New performance-driven FPGA routing algorithm. Proceedings of ACM/SIGDA design automation conference (1995) 562-567
51. Koch T., and Martin A. Solving Steiner tree problems in graphs to optimality. Networks 32 (1998) 207-232
52. Prömel H.J., and Steger A. A new approximation algorithm for the Steiner tree problem with performance ratio 5/3. Journal of Algorithms 36 (2000) 89-101
53. Goldberg D.E. Genetic algorithms in search. Optimization and machine learning (1989), Addison-Wesley, New York
54. Holland J.H. Genetic algorithms. Scientific American 267 1 (1992) 66-72
55. Rudolph G. Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks 5 (1994) 96-101
56. Baudet P., Azzaro C., Pibouleau L., and Domenech S. A genetic algorithm for batch chemical plant scheduling. Proceedings of international congress of chemical and process engineering (1996) 25-30
57. CPLEX: 〈http://www.ilog.com/products/cplex/〉.
58. Pompili D, Lopez L, Scoglio C. Multicast algorithms in service overlay networks. Proceedings of IEEE INFOCOM, 2006.
59. Guo S., and Yang O. Minimum-energy multicast in wireless ad hoc networks with adaptive antennas: MILP formulations and heuristic algorithms. IEEE Transactions on Mobile Computing 5 4 (2006) 333-346