Application layer multicast routing solution based on genetic algorithms

doi:10.1007/s11460-008-0027-1

Front Elect Electr Eng Chin

2009, Vol. 4

Issue (1) : 43-46 https://doi.org/10.1007/s11460-008-0027-1

Research Article

Application layer multicast routing solution based on genetic algorithms

Peng CHENG(

), Qiufeng WU, Qionghai DAI

Department of Automation, Tsinghua University

Download: PDF(144 KB) HTML
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

Abstract

Application layer multicast routing is a multi-objective optimization problem. Three routing constraints, tree's cost, tree's balance and network layer load distribution are analyzed in this paper. The three fitness functions are used to evaluate a multicast tree on the three indexes respectively and one general fitness function is generated. A novel approach based on genetic algorithms is proposed. Numerical simulations show that, compared with geometrical routing rules, the proposed algorithm improve all three indexes, especially on cost and network layer load distribution indexes.

Keywords multicast application layer multicast genetic algorithms multicast routing

Corresponding Author(s): CHENG Peng,Email:chengpeng00@mails.tsinghua.edu.cn

Issue Date: 05 March 2009

Cite this article:

Peng CHENG,Qiufeng WU,Qionghai DAI. Application layer multicast routing solution based on genetic algorithms[J]. Front Elect Electr Eng Chin, 2009, 4(1): 43-46.

URL:

https://academic.hep.com.cn/fee/EN/10.1007/s11460-008-0027-1
https://academic.hep.com.cn/fee/EN/Y2009/V4/I1/43

Fig0 Effects of and on the outputs

Tab0 Comparison of average output fitness value of three ALM routing algorithms

1	LiebeherrJ, NahasM, SiW S. Application-layer multicasting with delaunay triangulation overlays. IEEE Journal on Selected Areas in Communications , 2002, 20(8): 1472–1488 doi: 10.1109/JSAC.2002.803067
2	PendarakisD, ShiS, VermaD, . ALMI: An application level multicast infrastructure. In: Proceedings of 3rd Usenix Symposium on Internet Technologies and Systems , 2001
3	HwangR H, DoW Y, YangS C. Multicast routing based on genetic algorithms. Journal of Information Science and Engineering , 2000, 16(6): 885–901
4	ShiS Y, TurnerJ S. Routing in overlay multicast networks. In: Proceedings of IEEE INFOCOM , 2002, 3: 1200–1208
5	PanY, YuZ W, WangL C. A genetic algorithm for the overlay multicast routing problem. In: Proceedings of ICCNMC'03 , 2003, 261–265
6	KranakisE, SinghH, UrrutiaJ. Compass routing on geometric networks. In: Proceedings of 11th Canada Conference on Computational Geometry (CCCG'90) , 1999, 51–54
7	HamdanM, El-HawaryM E. A novel genetic algorithm searching approach for dynamic constrained multicast routing. In: Proceedings of CCECE 2003 , 2003, 2: 1127–1130
8	HaghighatA T, FaezK, DehghanM, . GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing. Computer Communications , 2004, 27(1): 111–127 doi: 10.1016/S0140-3664(03)00185-3
9	WangZ Y, ShiB X, ZhaoE. Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic. Computer Communications , 2001, 24(7): 685–692 doi: 10.1016/S0140-3664(00)00273-5
10	SunQ, LangendoerferH. Computation of constrained multicast trees using a genetic algorithm. European Transactions on Telecommunications , 1999, 10(5): 513–516 doi: 10.1002/ett.4460100506
11	HamdanM, El-HawaryM E. Hopfield-Genetic approach for solving the routing problem in computer networks. In: Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering , 2002, 2: 823–827
12	ZeguraE W, CalvertK L, BhattacharjeeS. How to model an internetwork. In: Proceedings of IEEE INFOCOM'96, San Francisco . 1996, 2: 594–602 doi: 10.1109/INFCOM.1996.493353

[1]	Abdelkader KANSSAB, Abdelhalim ZAOUI, Mouloud FELIACHI. Modeling and optimization of induction cooking by the use of magneto-thermal finite element analysis and genetic algorithms[J]. Front Elect Electr Eng, 2012, 7(3): 312-317.
[2]	CHENG Xiao-jun, GE Ning, FENG Chong-xi. Dynamic multicast traffic grooming in WDM networks[J]. Front. Electr. Electron. Eng., 2006, 1(4): 441-444.

Viewed

Full text

Abstract

Cited

Shared

Discussed