Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing

Chiang, 2006, A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm, Expert Systems with Applications Zahrani, 2006, Landscape analysis for multicast routing, Computer Communications, 30, 101, 10.1016/j.comcom.2006.07.019 Hakimi, 1971, Steiner problem in graphs and its implications, Networks, 1, 113, 10.1002/net.3230010203 Hwang, 1992 Sun, 1998, An efficient delay-constrained multicast routing algorithm, Journal of High-Speed Networks, 7, 43 L.Guo, I. Matta, QDMR: an efficient QoS dependent multicast routing algorithm, in: RTAS’99: Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium, Vancouver, BC, Canada, Washington, IEEE Comput. Soc, 1999, pp. 213–222. Rouskas, 1997, Multicast routing with end to end delay and delay variation constraints, IEEE Journal on Selected Areas in Communications, 15, 346, 10.1109/49.564133 Kompella, 1993, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking, 1, 286, 10.1109/90.234851 Q. Zhu, M. Parsa, J.J. Garcia-Luna-Aceves, A source based algorithm for delay-constrained minimum-cost multicasting, in: INFOCOM’95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies, vol. 1, Washington, IEEE Comput. Soc., 1995, pp. 377–385. R. Widyono, The Design and Evaluation of Routing Algorithms for Realtime Channels, Technical Report TR-94-024, Tenet Group, Department of EECS, University of California at Berkeley, 1994. Raghavan, 1999, A re-arrangeable algorithm for the construction of delay-constrained dynamic multicast trees, IEEE/ACM Transactions on Networking, 7, 514, 10.1109/90.793020 Salama, 1997, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE Journal on Selected Areas in Communications, 15, 332, 10.1109/49.564132 Kun, 2006, Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem, Knowledge-Based Systems, 19, 554, 10.1016/j.knosys.2006.04.012 Haghighat, 2004, GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing, Computer Communications, 27, 111, 10.1016/S0140-3664(03)00185-3 P.Galiasso, R.L. Wainwright, A hybrid genetic algorithm for the point to multipoint routing problem with single split paths, in: Proceedings of ACM Symposium on Applied Computing, 2001, p. 327–32. Ericsson, 2002, A genetic algorithm for the weight setting problem in OSPF routing, Journal of Combinatorial Optimization, 6, 299, 10.1023/A:1014852026591 Barolli, 2003, A GA-based QoS routing method for mobile ad-hoc networks, Journal of Interconnection Networks, 4, 251, 10.1142/S0219265903000866 Zhang, 1999, An orthogonal genetic algorithm for multimedia multicast routing, IEEE Transactions on Evolutionary Computation, 3, 53, 10.1109/4235.752920 Wang, 2006, QoS multicast routing for multimedia group communications using intelligent computational methods, Computer Communications, 29, 2217, 10.1016/j.comcom.2006.02.015 N. Skorin-Kapov, M. Kos, The application of Steiner trees to delay constrained multicast routing: a Tabu Search approach, in: ConTEL: Proceedings of the Seventh International Conference on Telecommunications, 2003, Zagreb, Croatia, IEEE Press, New York, pp. 443–448. Prim, 1957, Shortest connection networks and some generalizations, Bell System Technical Journal, 36, 1389, 10.1002/j.1538-7305.1957.tb01515.x Wang, 2004, TSDLMRA: an efficient multicast routing algorithm based on tabu search, Journal of Network and Computer Applications, 27, 77, 10.1016/j.jnca.2003.10.001 B. Zhang, H.Mouftah, A destination-driven shortest path tree algorithm, in: ICC 2002: Proceedings of the IEEE International Conference on Communications, IEEE Press, New York, pp. 2258–2262. Yen, 1971, Finding the K-shortest loop-less paths in a network, Management Science, 17, 712, 10.1287/mnsc.17.11.712 Glover, 1997 Wang, 2001, Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm, Computer Communications, 24, 685, 10.1016/S0140-3664(00)00273-5 Lee, 2004, A new meta-heuristic algorithm for continues engineering optimization: harmony search theory and practice, Computer Methods in Applied Mechanics and Engineering, 194, 3902, 10.1016/j.cma.2004.09.007 Geem, 2001, A new heuristic optimization algorithm: harmony search, Simulation, 76, 60, 10.1177/003754970107600201 Geem, 2005, Harmony search for generalized orienteering problem: best touring in China, Springer Lecture Notes in Computer Science, 3412, 741, 10.1007/11539902_91 Wang, 1996, Quality of service for supporting multimedia applications, IEEE Journal on Selected Areas in Communications, 14, 1228, 10.1109/49.536364 Mahdavi, 2007, An improved harmony search algorithm for solving optimization problems, Applied Mathematics and Computation, 188, 1567, 10.1016/j.amc.2006.11.033 J. Gottlieb, B.A. Julstrom, F. Rothlauf, G.R. Raidl, Prüfer numbers: a poor representation of spanning trees for evolutionary search, in: Proceedings of the 2001 Genetic and Evolutionary Computation Conference, Morgan Kaufmann, 2000, pp. 343–350. Cayley, 1889, A theorem on trees, Quarterly Journal of Mathematics, 23, 376 Gen, 2000 Raidl, 2003, Edge-Sets: an effective evolutionary coding of spanning trees, IEEE Transactions on Evolutionary Computation, 7, 225, 10.1109/TEVC.2002.807275 L. Davis, D. Orvosh, A. Cox, Y. Qiu, A genetic algorithm for survivable network design, in: Stephanie Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, 1993, pp. 408–415. P. Piggott, F. Suraweera, Encoding graphs for genetic algorithms: An investigation using the minimum spanning tree problem, in: Xin Yao (Ed.), Progress in Evolutionary Computation, LNAI 956, Springer, 1995, pp. 305–314. A. Broder, Generating random spanning trees, in: IEEE 30th Annual Symposium on Foundations of Computer Science (FOCS), 1989, pp. 442–447. Kompella, 1993, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking, 1, 286, 10.1109/90.234851