一种基于克隆策略的多播路由算法

Abstract
Figure/Table
References
Related Citation (2)

Download: PDF (1031 KB)
Export: BibTeX | EndNote (RIS)

Abstract An algorithm based on Clonal Strategies(CS) is presented to deal with the delay-constrained and least-cost multicast routing problem known as NP-complet. Simulations show that compared with those based on genetic algorithm, the multicast routing based on CS has faster converging speed and better ability of global searching with the property of stabilization, agility and operating simply.

Key words： Muticast routing CS Delay-constrained

Received: 30 May 2003

PACS:

TP393

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors


	Liu Fang
	Yang Hai-chao

Cite this article:

Liu Fang,Yang Hai-chao. A Multicast Routing Algorithm Based on Clonal Strategies[J]. , 2004, 26(11): 1825-1829 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y2004/V26/I11/1825