Information Technology Reference
In-Depth Information
13. Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source based algorithm for delay-
constrained minimum-cost multicasting. In: Proceedings of the fourteenth annual joint
conference of the IEEE computer and communication societies, pp. 377-385 (1995)
14. Widyono, R.: The design and evaluation of routing algorithms for realtime channels.
Technical report TR-94-024, University of California at Berkeley (1994)
15. Raghavan, S., Manimaran, G., Ram Murthy, C.S.: A re-arrangeable algorithm for the con-
struction of delay-constrained dynamic multicast trees. IEEE/ACM Transactions on Net-
working 7, 514-529 (1999)
16. Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of multicast routing algorithms for
real-time communication on high-speed networks. IEEE Journal on Selected Areas in
Communications 15, 332-345 (1997)
17. Kun, Z., Yong, Q., Hong, Z.: Dynamic multicast routing algorithm for delay and delay
variation-bounded Steiner tree problem. Knowledge-Based Systems 19, 554-564 (2006)
18. Haghighat, A.T., Faez, K., Dehghan, M., Mowlaei, A., Ghahremani, Y.: GA-based heuris-
tic algorithms for bandwidth-delay-constrained least-cost multicast routing. Computer
Communications 27, 111-127 (2004)
19. Galiasso, P., Wainwright, R.L.: A hybrid genetic algorithm for the point to multipoint rout-
ing problem with single split paths. In: Proceedings of ACM Symposium on Applied
Computting, pp. 327-332 (2001)
20. Ericsson, M., Resende, M., Pardalos, J.M.: A genetic algorithm for the weight setting
problem in OSPF routing. Journal of Combinatorial Optimization 6, 299-333 (2002)
21. Barolli, L., Koyama, A., Suganuma, T., Shiratori, N.: A GA-based QoS routing method for
mobile Ad-Hoc networks. Journal of Interconnection Networks 4, 251-270 (2003)
22. Zhang, Q., Lenug, Y.W.: An orthogonal genetic algorithm for multimedia multicast rout-
ing. IEEE Transactions on Evolutionary Computation 3, 53-62 (1999)
23. Wang, X., Cao, J., Cheng, H., Huang, M.: QoS multicast routing for multimedia group
communications using intelligent computational methods. Computer Communications 29,
2217-2229 (2006)
24. Skorin-Kapov, N., Kos, M.: The application of Steiner trees to delay constrained multicast
routing: a Tabu Search approach. In: Proceedings of the seventh international conference
on telecommunications, pp. 443-448 (2003)
25. Prim, R.: Shortest connection networks and some generalizations. Bell System Technical
Journal 36, 1389-1401 (1957)
26. Wang, H., Wang, J., Wang, H., Sun, Y.: TSDLMRA: an efficient multicast routing algo-
rithm based on tabu search. Journal of Network and Computer Applications 27, 77-90
(2004)
27. Zhang, B., Mouftah, H.: A destination-driven shortest path tree algorithm. In: Proceedings
of the IEEE international conference on communications, pp. 2258-2262 (2002)
28. Yen, J.Y.: Finding the K-shortest loop-less paths in a network. Management Science 17,
712-716 (1971)
29. Glover, F., Laguna, M.: Tabu search. Kluwer Academic, Dordrecht (1997)
30. Wang, Z., Shi, B., Zhao, E.: Bandwidth-delay-constrained least-cost multicast routing
based on heuristic genetic algorithm. Computer Communications 24, 685-692 (2001)
31. Forsati, R., Mahdavi, M., Haghighat, M.T.: Bandwidth delay constrained least cost multi-
cast routing. Computer Communications 31, 2505-2519 (2008)
32. Forsati, R., Mahdavi, M., Haghighat, M.T.: An efficient algorithm for bandwidth delay
constraint least cost multicast routing. In: Proceedings of IEEE Canadian Conference on
Electrical and Computer Engineering, pp. 1641-1646 (2008)
Search WWH ::




Custom Search