GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing

Computer Communications

Volumn 27, Issue 1, 2004, Pages 111-127

  Haghighat, A T ^a,c   Faez, K ^a   Dehghan, M ^b,d   Mowlaei, A ^a   Ghahremani, Y ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b IRAN TELECOMMUNICATION RESEARCH CENTER   (Iran)

^c ATOMIC ENERGY ORGANIZATION OF IRAN   (Iran)

^d IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Genetic algorithm; Multicast routing; Multiconstrained Steiner tree; Quality of Service

Indexed keywords

BANDWIDTH; COMPUTER SIMULATION; COST EFFECTIVENESS; GENETIC ALGORITHMS; HEURISTIC METHODS; MULTIMEDIA SYSTEMS; PACKET NETWORKS; QUALITY OF SERVICE; ROUTERS; TREES (MATHEMATICS);

GENOTYPES; MULTIPOINT CONNECTIONS;

MULTICASTING;

EID: 0346332918     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(03)00185-3     Document Type: Article

References (40)

1. Hakimi S.L. Steiner problem in graphs and its implications. Networks. 1:1971;113-133.
2. Karp R. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;85-103 Plenum Press, New York.
3. Parsa M., Zhu Q., Garcia-Luna-Aceves J.J. An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE/ACM Transactions on Networking. 6:(4):1998;461-474.
4. Kompella V.P., Pasquale J.C., Polyzos G.C. Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking. 1:(3):1993;286-292.
5. R. Widyono, The design and evaluation of routing algorithms for real-time channels, Technical Reports TR-94-024, Tenet Group, Department of EECS, University of California at Berkeley, 1994.
6. Waters A.G. A new heuristic for ATM multicast routing. Second IFIP Workshop on Performance Modeling and Evaluation of ATM networks. 1994.
7. Kou L., Markowsky G., Berman L. A fast algorithm for Steiner trees. Acta Informatica. 15:1981;141-145.
8. Rayward-smith V. The computation of nearly minimal Steiner trees in graphs. International Journal of Mathematical Education in Science and Technology. 14:(1):1983;15-23.
9. Takahashi H., Matsuyama A. An approximate solution for the Steiner problem in graphs. Mathematica Japonica. 22:(6):1980;573-577.
10. Gelenbe E., Ghanwani A., Srinivasan V. Improved neural heuristics for multicast routing. IEEE Journal of selected Area in Communication. 15:(2):1997;147-155.
11. Sun Q., Langendörfer H. An efficient delay-constrained multicast routing algorithm. Journal of High-Speed Networks. 7:(1):1998;43-55.
12. Guo L., Matta I. QDMR: an efficient QoS dependent multicast routing algorithm. Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium. 1999.
13. Rouskas G.N., Baldine I. Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on Selected Areas in Communications. 15:(3):1997;346-356.
14. Marathe M.V., Ravi R., Sundaram R., Ravi S.S., Rosenkrantz D.J., Hunt H.B. Bicriteria network design problems. Journal of Algorithms. 28:(1):1998;142-171.
15. Sriram R., Manimaran G., Murthy S.R. Algorithms for delay-constrained low-cost multicast tree construction. Computer Communications. 21:(18):1998;1693-1706.
16. Sriram R., Manimaran G., Murthy S.R. A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. Proceedings of the Conference on Computer Communications, IEEE INFOCOM 99, New York. March:1999.
17. 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:(3):1997;332-345.
18. Chotipat P., Goutam C., Norio S. Neural network approach to multicast routing in real-time communication networks. IEEE International Conference on Network Protocols. 1995;332-339.
19. Pierre S., Legault G. A genetic algorithm for designing distributed computer network topologies. IEEE Transactions on Systems Man and Cybernetics, Part B: Cybernetics. 28:(2):1998;249-258.
20. Bright M.S., Arslan T. Genetic framework for the high-level optimisation of low power VLSI DSP systems. IEEE electronics Letters. 32:(13):1996;1150-1151.
21. Coello C.A., Christiansen A.D., Arturo H.A. Use of evolutionary techniques to automate the design of combinational circuits. International Journal of Smart Engineering System Design. 2:(4):2000;299-314.
22. Hwang F.K., Richards D.S., Winter P. The Steiner Tree Problem. 1992;Elsevier Science, Amsterdam.
23. Hesser J., Männer R., Stucky O. Optimization of Steiner trees using genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA. 1989;231-236.
24. Julstrom B.A. A genetic algorithm for the rectilinear Steiner problem. Proceedings of the Fifth International Conference on Genetic Algorithms. 1993;474-480.
25. Kapsalis A., Rayward-Smith V.J., Smith G.D. Solving the graphical Steiner tree problem using genetic algorithms. Journal of the Operational Research Society. 44:(4):1993;397-406.
26. Esbensen H. Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm. Networks. 26:1995;173-185.
27. Leung Y., Li G., Xu Z.B. A genetic algorithm for the multiple destination routing problems. IEEE Transactions on Evolutionary Computation. 2:(4):1998;150-161.
28. Q. Sun, A genetic algorithm for delay-constrained minimum-cost multicasting, Technical Report, IBR, TU Braunschweig, Butenweg, 74/75, 38106, Braunschweig, Germany, 1999.
29. Xiang F., Junzhou L., Jieyi W., Guanqun G. QoS routing based on genetic algorithm. Computer Communications. 22:1999;1394-1399.
30. Ravikumar C.P., Bajpai R. Source-based delay-bounded multicasting in multimedia networks. Computer Communications. 21:1998;126-132.
31. Zhang Q., Lenug Y.W. An orthogonal genetic algorithm for multimedia multicast routing. IEEE Transactions on Evolutionary Computation. 3:(1):1999;53-62.
32. Wu J.J., Hwang R.H., Lu H.I. Multicast routing with multiple QoS constraints in ATM networks. Information Sciences. 124:2000;29-57.
33. Wang Z., Shi B., Zhao E. Bandwidth-delay-constrainted least-cost multicast routing based on heuristic genetic algorithm. Computer Communications. 24:2001;685-692.
34. Guoliang C., Xufa W., Zhenquan Z. Genetic Algorithm and its Application. 1996;People's Posts and Telecommunications Press.
35. Rouskas G.N., Baldine I. Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on Selected Areas in Communications. 15:(3):1997;346-356.
36. Gen M., Cheng R. Genetic Algorithms and Engineering Optimization. 2000;Wiley.
37. Zhou G., Gen M. An effective genetic algorithm approach to the quadratic minimum spanning tree problem. Computers and operations research. 25:(3):1998;229-247.
38. C.C. Palmer, An approach to a problem in network design using genetic algorithms, PhD Dissertation in Computer Science, Polytechnic University, April 1994.
39. A.T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, Y. Ghahremani, A genetic algorithm for Steiner tree optimization with multiple constraints using Prüfer number, in EURASIA-ICT 2002 Conference, Tehran, Iran (2002) 167-173.
40. A.T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, Y. Ghahremani, Multicast routing with multiple constraints in high-speed networks based on genetic algorithms, in ICCC 2002 Conference, India (2002) 243-249.