Share Email Print

Proceedings Paper

A degree-constrained multicast routing algorithm for multimedia communications
Author(s): Yanlin Wang; Ying Lu; Yugeng Sun
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Multicast services have been increasingly used by many multimedia applications. As one of the key techniques to support multimedia applications, the rational and effective multicast routing algorithms are very important to networks performance. When switch nodes in networks have different multicast capability, multicast routing problem is modeled as the degree-constrained Steiner problem. We presented a genetic algorithm, named DCGA, for the degree-constrained case in multimedia communications. The algorithm is used to generate degree-constrained multicast trees with bandwidth and end to end delay bound. Simulations over random networks were carried out to compare the performance of the proposed algorithm. Experimental results show that DCGA has better ability in balance load among the nodes in networks, and has capability of finding unsaturated links and (or) unsaturated nodes to generate multicast trees than BMSTA. Moreover, the proposed algorithm can generate multicast tree with lower cost in any networks and can also achieve optimal multicast tree rapidly with the smaller group size.

Paper Details

Date Published: 5 December 2005
PDF: 9 pages
Proc. SPIE 6022, Network Architectures, Management, and Applications III, 60223R (5 December 2005); doi: 10.1117/12.634310
Show Author Affiliations
Yanlin Wang, Tianjin Univ. (China)
Ying Lu, Tianjin Univ. (China)
Yugeng Sun, Tianjin Univ. (China)

Published in SPIE Proceedings Vol. 6022:
Network Architectures, Management, and Applications III
Kwok-wai Cheung; Gee-Kung Chang; Guangcheng Li; Ken-Ichi Sato, Editor(s)

© SPIE. Terms of Use
Back to Top