Landscape analysis for multicast routing

Computer Communications

Volumn 30, Issue 1, 2006, Pages 101-116

  Zahrani, M S ^a   Loomes, M J ^b   Malcolm, J A ^a   Albrecht, A A ^a  

^a UNIVERSITY OF HERTFORDSHIRE   (United Kingdom)

^b MIDDLESEX UNIVERSITY   (United Kingdom)

Author keywords

Landscape analysis; Multicast routing; Quality of service (QoS); Simulated annealing; Steiner trees

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER NETWORKS; CONSTRAINT THEORY; HEURISTIC METHODS; OPTIMIZATION; QUALITY OF SERVICE; SIMULATED ANNEALING; TELECOMMUNICATION NETWORKS;

COMBINATORIAL OPTIMISATION; LOGARITHMIC COOLING; MULTICAST ROUTING; STEINER TREES; TRANSMISSION COSTS;

MULTICASTING;

EID: 33751177327     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2006.07.019     Document Type: Article

References (47)

1. Muchnik V.B., and Shafarenko A.V. Dynamic evaluation strategy for fine-grain data-parallel computing. IEE Proceedings - Computers and Digital Techniques 143 3 (1996) 181-188
2. Abdel-Wahab H., Maly K., Stoica E., and Youssef A. The role of multicasting in managing interactive multimedia distance learning systems. Journal of Network and Systems Management 5 3 (1997) 351-367
3. Diot C., Dabbous W., and Crowcroft J. Multipoint communication: a survey of protocols, functions, and mechanisms. IEEE Journal on Selected Areas in Communications 15 3 (1997) 277-290
4. Al-Shaer E., and Tang Y. QoS path monitoring for multicast networks. Journal of Network and Systems Management 10 3 (2002) 357-381
5. Rajvaidya P., Ramachandran K.N., and Almeroth K.C. Managing and securing the global multicast infrastructure. Journal of Network and Systems Management 12 3 (2004) 297-326
6. Yeo C.K., Lee B.S., and Er M.H. A survey of application level multicast techniques. Computer Communications 27 (2004) 1547-1568
7. 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
8. 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
9. T. Harrison, C. Williamson, A performance study of multicast routing algorithms for ATM networks, in: Proc. 21st Annual IEEE Conference on Local Computer Networks, 1996, p. 191.
10. 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
11. Jia W., Xu G., Zhao W., and Au P.O. Efficient internet multicast routing using anycast path selection. Journal of Network and Systems Management 10 4 (2002) 417-438
12. 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
13. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-103
14. M. Doar, I.M. Leslie, How bad is nai{dotless}̈ve multicast routing?, in: Proc. INFOCOM, 1993, pp. 82-89.
15. L. Zhu, R.L. Wainwright, D.A. Schoenefeld, A genetic algorithm for the point to multipoint routing problem with varying number of requests, in: Proc. IEEE International Conference on Evolutionary Computation, 1998, pp. 171-176.
16. Leung Y., Li G., and Xu Z.B. A genetic algorithm for the multiple destination routing problems. IEEE Transactions on Evolutionary Computation 2 4 (1998) 150-161
17. P. Galiasso, R.L. Wainwright, A hybrid genetic algorithm for the point to multipoint routing problem with single split paths, in: Proc. ACM Symposium on Applied Computing, 2001, pp. 327-332.
18. Wang H., Fang J., 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
19. Yang C.B., and Wen U.P. Applying tabu search to backup path planning for multicast networks. Computers and Operations Research 32 (2005) 2875-2889
20. Kirkpatrick S., Gelatt Jr. C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
21. Černy V. A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications 45 (1985) 41-51
22. Hajek B. Cooling schedules for optimal annealing. Mathematics of Operations Research 13 (1988) 311-329
23. Catoni O. Rough large deviation estimates for simulated annealing: applications to exponential schedules. Annals of Probability 20 (1992) 1109-1146
24. Aarts E.H.L. Local Search in Combinatorial Optimization (1998), Wiley & Sons, New York
25. Y. Cui, K. Xu, J.P. Wu, Z.C. Yu, Y.J. Zhao, Multi-constrained routing based on simulated annealing, in: Proc. IEEE Int. Conf. on Communications, 2003, vol. 3, pp. 1718-1722.
26. X.W. Wang, H. Cheng, J. Cao, L.W. Zheng, M. Huang, A simulated-annealing-based QoS multicasting algorithm, in: Proc. Int. Conf. on Communication Technology, 2003, pp. 469-473.
27. X.L. Wang, Z. Jiang, QoS multicast routing based on simulated annealing algorithm, in: S.J.B. Yoo, K.W. Cheung, Y.C. Chung, G.C. Li (Eds.), Proc. SPIE on Network Architectures, Management, and Applications, 2004, pp. 511-516.
28. 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
29. 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
30. Wang X., Cao J., Cheng H., and Huang M. QoS multicast routing for multimedia group communications using intelligent computational methods. Computer Communications 29 12 (2006) 2217-2229
31. S. Wright, The roles of mutation, inbreeding, crossbreeding and selection in evolution, in: Proc. Sixth Int. Congress on Genetics, 1932, vol. 1, pp. 356-366.
32. Merz P., and Freisleben B. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evolutionary Computation 8 1 (2000) 61-91
33. Reidys Ch.M., and Stadler P.F. Combinatorial landscapes. SIAM Review 44 1 (2002) 3-54
34. Wales D. Energy Landscapes (2003), Cambridge University Press, Cambridge
35. Albrecht A.A. A stopping criterion for logarithmic simulated annealing. Computing 78 1 (2006) 55-79
36. Ferreira F.F., Fontanari J.F., and Stadler P.F. Landscape statistics of the low-autocorrelation binary string problem. Journal of Physics A-Mathematical and General 33 (2000) 8635-8647
37. Wolfinger M.T., Svrcek-Seiler W.A., Flamm Ch., Hofacker I.L., and Stadler P.F. Exact folding dynamics of RNA secondary structures. Journal of Physics A-Mathematical and General 37 (2004) 4731-4741
38. Schmitt L.M. Theory of genetic algorithms. Theoretical Computer Science 259 (2001) 1-61
39. Zahrani M.S., Loomes M.J., Malcolm J.A., and Albrecht A.A. Genetic local search for multicast routing. Proc. 8th Annual Conference on Genetic and Evolutionary Computation (GECCO'06) (2006), ACM Press, New York 615-616
40. Steinhöfel K., Albrecht A., and Wong C.K. Fast parallel heuristics for the job shop scheduling problem. Computers and Operations Research 29 2 (2002) 151-169
41. J.E. Beasley, OR-library: .
42. Hakimi S.L. Steiner's problem in graphs and its implications. Networks 1 (1971) 113-133
43. Kou L., Markowsky G., and Berman L. A fast algorithm for Steiner trees. Acta Informatica 15 (1981) 141-145
44. M.J. Alexander, G. Robins, New performance-driven FPGA routing algorithm, in: Proc. ACM/SIGDA Design Automation Conference, 1995, pp. 562-567.
45. Koch T., and Martin A. Solving Steiner tree problems in graphs to optimality. Networks 32 (1998) 207-232
46. 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
47. P. Baudet, C. Azzaro, L. Pibouleau, S. Domenech, A genetic algorithm for batch chemical plant scheduling, in: Proc. Int. Congress of Chemical and Process Engineering, 1996, pp. 25-30.