Share Email Print

Proceedings Paper

An effective genetic algorithm for multicast routing tree with degree delay constrain
Author(s): Lin Chen; ZhengQuan Xu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

With the advent of many new multimedia applications with Quality of Service (QoS), the issue of multicast routing has become more and more important. Some previous researches in this area mainly take bounded end-to-end delay into account and neglect the ability of router in supporting multicasting, therefore a new multicast routing algorithm based on genetic algorithm (GA) is proposed to construct Degree-Delay-Constrained least-cost multicast routing Tree (DDCT problem). Our proposed algorithms adopt pruefer coding and decoding technique which is very suitable for crossover and mutation operation and can save runtime; Otherwise because pruning and grafting techniques are used to adjust node degree and repair tree structure, this algorithms may also be employed when taking dynamic adjusting tree or keeping load balance into consideration. Simulations were conducted on a random graph to evaluate the performance of the proposed algorithm compared with that of the other algorithms such as CSPT and Wang_GA. The experimental result shows that the proposed algorithm performs well.

Paper Details

Date Published: 8 February 2005
PDF: 12 pages
Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.565822
Show Author Affiliations
Lin Chen, Wuhan Univ. (China)
Yangtze Univ. (China)
ZhengQuan Xu, Wuhan Univ. (China)

Published in SPIE Proceedings Vol. 5626:
Network Architectures, Management, and Applications II
S. J. Ben Yoo; Gee-Kung Chang; Guangcheng Li; Kwok-wai Cheung, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?