Multicast routing based on ant algorithm for delay-bounded and load-balancing traffic
暂无分享,去创建一个
[1] George C. Polyzos,et al. Multicasting for multimedia applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[2] Dana S. Richards,et al. Steiner tree problems , 1992, Networks.
[3] Qing Zhu,et al. A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.
[4] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[5] Anoop Ghanwani,et al. Improved Neural Heuristics for Multicast Routing , 1997, IEEE J. Sel. Areas Commun..
[6] T. Stützle,et al. MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[7] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[8] George N. Rouskas,et al. Multicast routing with end-to-end delay and delay variation constraints , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[9] Douglas S. Reeves,et al. Evaluation of multicast routing algorithms for real-time communication on high-speed networks , 1995 .
[10] Dimitri P. Bertsekas,et al. Data networks (2nd ed.) , 1992 .