An overlay multicast routing algorithm based on genetic algorithms

Chinese Journal of Electronics

Volumn 16, Issue 1, 2007, Pages 161-165

  Cheng, Peng ^a   Dai, Qionghai ^a   Wu, Qiufeng ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Analytic hierarchy process; Genetic algorithms; Multicast routing; Overlay multicast

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GENETIC ALGORITHMS; MULTICASTING; OPTIMIZATION; TREES (MATHEMATICS);

ANALYTIC HIERARCHY PROCESS; FITNESS FUNCTION; LOAD BALANCING; MULTICAST ROUTING; OVERLAY MULTICAST;

ROUTERS;

EID: 33846796157     PISSN: 10224653     EISSN: 20755597     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. J. Liebeherr, M. Nahas and Si Weisheng, "Application layer multicasting with Delaunay triangulation overlays", IEEE Journal on Selected Areas in Communications, Vol.20, No.8, pp.1472-1488, Oct. 2002.
2. D. Pendarakis, S. Shi, D. Verma and M. Waldvogel. "ALMI: An application level multicast infrastructure", Proceedings of 3rd Usenix Symposium on Internet Technologies and Systems, st. Louis, Washington, U.S.A., pp.49-60, Mar. 2001.
3. S. Ratnasamy, M. Handley, R. Karp and S. Shenker, "Application level multicast using content-addressable networks". Proceedings of 3rd International Workshop on Networked Group Communication, London, U.K., Nov. 2001.
4. L. Mathy, R. Canonico and D. Hutchison D., "An overlay tree building control protocol", Proceedings of Networked Group Communications, London, U.K., 2001.
5. R.H. Hwang, W.Y. Do and S.O. Yang, "Multicast routing based on genetic algorithms", Journal of Information Science and Engineering, Vol.16, pp.885-901, 2000.
6. S.Y. Shi, J.S. Turner, "Routing in overlay multicast networks", Proceedings of IEEE INFOCOM 2002, New York, U.S.A., pp. 1200-1208, June 2002.
7. Pan Yun, Yu Zhenwei and Wang Licheng, "A genetic algorithm for the overlay multicast routing problem", Proceedings of IC-CNMC'03, Shanghai, China, pp.261-266, 2003.
8. E. Kranakis, H. Singh and J. Urrutia, "Compass routing on geometric networks", Proceedings of 11th Canada Conference of Computational Geometry (CCCG'90), Aug. 1999.
9. M. Hamdan, M.E. El-Hawary, "A novel genetic algorithm searching approach for dynamic constrained multicast routing", Proceedings of CCECE 2003, May 2003.
10. A.T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, Y. Ghahremani, "GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing", Computer Communications, Vol.27, No.1, pp.111-127, Jan. 2004.
11. Z.Y. Wang, B.X. Shi, E. Zhao, "Bandwidth-delayconstrained least-cost multicast routing based on heuristic genetic", Computer Communications, Vol.24, No.7-8, pp.685-692, Apr. 2001.
12. Q. Sun, H. Langendoerfer, "Computation of constrained multicast trees using a genetic algorithm", European Transactions on Telecommunications, Sep.-Oct. 1999.
13. Shi Jian, Zou Liang, Dong Tianlin, Zhao Erdun, "The application of genetic algorithms in multicast routing", Acta Electronica Sinica, Vol.28, No.5, May 2000.
14. Wang Zhengying, Shi Bingxin, Zhao Erdun, "Heuristic genetic algorithms for QoS multicast routing", Acta Electronica Sinica, Vol.29, No.2, Feb. 2001.
15. M. Hamdan, M.E. El-Hawary, "Hopfield-Genetic approach for solving the routing problem in computer networks", Proceedings of the 2002 IEEE Canadian Conference on Electrical and ComputerEngineering, 2002.
16. K. Bharathkumar and J.M. Jaffe, "Routing to multiple destinations in computer networks", IEEE Trans. Commun., Vol.COM-31, No.3, pp.343-351, Mar. 1983.
17. L. Kou, G. Markowsky and L. Berman, "A fast algorithm for Steiner trees", Acta Informat., Vol.15, pp.141-145, 1981.
18. V.J. Rayward-Smith, "The computation of nearly minimal Steiner trees in graphs", Int. J. Math. Educ. Sci. Tech., Vol.14, No.1, pp.15-23, 1983.
19. H. Tode, Y. Sakai, H. Okada and Y. Tezuka, "Multicast routing algorithm for nodal load balancing", Proceedings of IEEE INFOCOM, pp.2086-2095, 1992.
20. T.L. Saaty, The Analytic Hierarchy Process, New York: McGraw-Hill, 1980.
21. E.W. Zegura, K. Calvert, S. Bhattacharjee, "How to model an Internetwork", Proceedings of IEEE Infocom '96, San Francisco, pp.594-602, Mar. 1996.