Multicast routing based on genetic algorithms

Journal of Information Science and Engineering

Volumn 16, Issue 6, 2000, Pages 885-901

  Hwang, Ren Hung ^a   Do, Wei Yuan ^a   Yang, Shyi Chang ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER SIMULATION; GENETIC ALGORITHMS; MULTICASTING; ROUTERS;

MULTICAST ROUTING; QUALITY OF SERVICES (QOS); STEINER TREES;

MULTIMEDIA SYSTEMS;

EID: 0034317092     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. S. L. Hakimi, "Steiner's problem in graphs and its implications," Networks, Vol. 1, No. 1, 1971, pp. 113-133.
2. R. M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Communications, R. E. Miller and J. W. Thatcher, Eds., Plenum, New York, 1972, pp. 85-103.
3. M. R. Gareg and D. S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
4. C. H. Chow, "On multicast path finding algorithms," IEEE INFOCOM '91, 1991, pp. 1274-1283.
5. H. Takahashi and A. Mutsuyama, "An approximate solution for the Steiner problem in graphs," Mathematic Japonica., Vol. 6, 1980, pp. 573-577.
6. B. M. Waxman, "Routing of multipoint connections," IEEE Journal on Selected Areas in Communications, Vol. 6, No. 9, 1988, pp. 1617-1622.
7. V. P. Kompleea, J. C. Pasquale, and G. C. Polyzos, "Multicast routing for multimedia communication," IEEE/ACM Transactions on Networking, Vol. 1, No. 3, 1993, pp. 286-292.
8. H. Tode, Y. Sakai, M. Yamamoto, H. Okada, and Y. Tezuka, "Multicast routing algorithm for nodal load balancing," IEEE INFOCOM '92, 1992, pp. 2086-2095.
9. J. J. Wu and R.-H. Hwang, "Multicast routing with multiple constraints," Information Sciences, Vol. 124, 2000, pp. 29-57.
10. D. E. Goldberg, Genetic Algorithms: Search, Optimization and Machine Learning, Addison Wesley, Massachusetts, 1989.
11. J. H. Holland, Adaption in Natural and Artificial Systems, Boston, MA: MIT Press, 1992
12. L. Davies, Genetic Algorithms and Simulated Annealing, Morgan Kaufmann, 1987.
13. H. Pan and I. Y. Wang, "The bandwidth allocation of ATM through genetic algorithm," IEEE GLOBECOM '91, 1991, pp. 125-129.
14. L.-D. Chou and J.-L. C. Wu, "Buffer management using genetic algorithms and neural networks," IEEE GLOBECOM '95, 1995, pp. 1333-1337.
15. N. Shimamoto, A. Hiramatu, and K. Yamasaki, "A dynamic routing control based on a genetic algorithm," 1993 IEEE International Conference on Neural Network, 1993, pp. 1123-1128.
16. C. C. Palmer and A. Kershenbaum, "Two algorithms for finding optimal communication spanning trees," Technical Report, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1993.
17. V. J. Rayward-Smith, "The computation of nearly minimal Steiner trees in graphs," International Journal Mathematic Educational Science Technology, Vol. 14, No. 1, 1983, pp. 15-23.
18. V. J. Rayward-Smith and A. Clare, "On finding Steiner vertices," Networks, Vol. 16, 1986, pp. 283-294.
19. C. C. Palmer and A. Kershenbaum, "Representing trees in genetic algorithms," IEEE World Congress on Computational Intelligence, Vol. 1, 1993, pp. 379-384.
20. W.-Y. Do, "Multicast routing based on genetic algorithms," M.S. Thesis, Department of Computer Science and Information Engineering, National Chung Cheng University, 1996.
21. T. J. Ott and K. R. Krishnan, "State dependent routing of telephone traffic and the use of separable routing schemes," The 11th International Telecommunication Conference, 1985, pp. 867-872.