Share Email Print
cover

Proceedings Paper

Degree-constrained multicast routing for multimedia communications
Author(s): Yanlin Wang; Yugeng Sun; Guidan Li
Format Member Price Non-Member Price
PDF $14.40 $18.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 two heuristic algorithms, named BMSTA and BSPTA, for the degree-constrained case in multimedia communications. Both algorithms are 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 two proposed algorithms. Experimental results show that the proposed algorithms have advantages in traffic load balancing, which can avoid link blocking and enhance networks performance efficiently. BMSTA has better ability in finding unsaturated links and (or) unsaturated nodes to generate multicast trees than BSPTA. The performance of BMSTA is affected by the variation of degree constraints.

Paper Details

Date Published: 8 February 2005
PDF: 8 pages
Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.570395
Show Author Affiliations
Yanlin Wang, Tianjin Univ. (China)
Yugeng Sun, Tianjin Univ. (China)
Guidan Li, Tianjin 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