Share Email Print

Proceedings Paper

An efficient group multicast routing for multimedia communication
Author(s): Yanlin Wang; Yugen Sun; Xinfang Yan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Group multicasting is a kind of communication mechanism whereby each member of a group sends messages to all the other members of the same group. Group multicast routing algorithms capable of satisfying quality of service (QoS) requirements of multimedia applications are essential for high-speed networks. We present a heuristic algorithm for group multicast routing with end to end delay constraint. Source-specific routing trees for each member are generated in our algorithm, which satisfy member’s bandwidth and end to end delay requirements. Simulations over random network were carried out to compare proposed algorithm performance with Low and Song’s. The experimental results show that our proposed algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover, our algorithm achieves good performance in balancing traffic, which can avoid link blocking and enhance the network behavior efficiently.

Paper Details

Date Published: 15 April 2004
PDF: 9 pages
Proc. SPIE 5282, Network Architectures, Management, and Applications, (15 April 2004); doi: 10.1117/12.523516
Show Author Affiliations
Yanlin Wang, Tianjin Univ. (China)
Yugen Sun, Tianjin Univ. (China)
Xinfang Yan, Tianjin Univ. (China)
Zhengzhou Univ. (China)

Published in SPIE Proceedings Vol. 5282:
Network Architectures, Management, and Applications
S. J. Ben Yoo; Kwok-wai Cheung; Yun-Chur Chung; Guangcheng Li, Editor(s)

© SPIE. Terms of Use
Back to Top