Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
暂无分享,去创建一个
Abolfazl Toroghi Haghighat | Rana Forsati | Mehrdad Mahdavi | M. Mahdavi | R. Forsati | A. Haghighat
[1] Sriram Raghavan,et al. A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees , 1999, TNET.
[2] Quan Sun,et al. An efficient delay-constrained multicast routing algorithm , 1998, J. High Speed Networks.
[3] Jiannong Cao,et al. QoS multicast routing for multimedia group communications using intelligent computational methods , 2006, Comput. Commun..
[4] Erdun Zhao,et al. Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm , 2001, Comput. Commun..
[5] Wang Zhengying,et al. Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm , 2001 .
[6] Zong Woo Geem,et al. A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..
[7] Panos M. Pardalos,et al. A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..
[8] Heng Wang,et al. TSDLMRA: an efficient multicast routing algorithm based on Tabu search , 2004, J. Netw. Comput. Appl..
[9] Zong Woo Geem,et al. Harmony Search for Generalized Orienteering Problem: Best Touring in China , 2005, ICNC.
[10] George C. Polyzos,et al. Multicast routing for multimedia communication , 1993, TNET.
[11] Douglas S. Reeves,et al. Evaluation of multicast routing algorithms for real-time communication on high-speed networks , 1995 .
[12] G. Raidl,et al. Prüfer numbers: a poor representation of spanning trees for evolutionary search , 2001 .
[13] Karim Faez,et al. GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing , 2004, Comput. Commun..
[14] Jon Crowcroft,et al. Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..
[15] Hans Jürgen Prömel,et al. The Steiner Tree Problem , 2002 .
[16] H. T. Mouftah,et al. A destination-driven shortest path tree algorithm , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).
[17] Mitsuo Gen,et al. Genetic algorithms and engineering optimization , 1999 .
[18] Francis Suraweera,et al. Encoding Graphs for Genetic Algorithms: An Investigation Using the Minimum Spanning Tree Problem , 1994, Evo Workshops.
[19] Lawrence Davis,et al. A Genetic Algorithm for Survivable Network Design , 1993, International Conference on Genetic Algorithms.
[20] Yong Qi,et al. Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem , 2006, Knowl. Based Syst..
[21] Bryant A. Julstrom,et al. Edge sets: an effective evolutionary coding of spanning trees , 2003, IEEE Trans. Evol. Comput..
[22] J. Y. Yen. Finding the K Shortest Loopless Paths in a Network , 1971 .
[23] M. Fesanghary,et al. An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..
[24] Chien-Hung Liu,et al. A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).
[25] C. Siva Ram Murthy,et al. A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[26] 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..
[27] Qingfu Zhang,et al. An orthogonal genetic algorithm for multimedia multicast routing , 1999, IEEE Trans. Evol. Comput..
[28] Ron Widyono. The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .
[29] Mitsuo Gen,et al. Genetic Algorithms , 1999, Wiley Encyclopedia of Computer Science and Engineering.
[30] R. Prim. Shortest connection networks and some generalizations , 1957 .
[31] Andreas Alexander Albrecht,et al. Landscape analysis for multicast routing , 2006, Comput. Commun..
[32] Pablo Galiasso,et al. A hybrid genetic algorithm for the point to multipoint routing problem with single split paths , 2001, SAC.
[33] Leonard Barolli,et al. GAMAN: A GA Based QoS Routing Method for Mobile Ad-Hoc Networks , 2003, J. Interconnect. Networks.
[34] S. Louis Hakimi,et al. Steiner's problem in graphs and its implications , 1971, Networks.
[35] Fred W. Glover,et al. Tabu Search , 1997, Handbook of Heuristics.
[36] A. Cayley. A theorem on trees , 2009 .
[37] K. Lee,et al. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .
[38] Qing Zhu,et al. A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.
[39] George N. Rouskas,et al. Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..
[40] Liang Guo,et al. QDMR: an efficient QoS dependent multicast routing algorithm , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.
[41] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.