By Topic

A source-based bandwidth-delay-bounded multicasting algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liao Jing-Yi ; Inst. of Inf. Sci., Northern Jiaotong Univ., Beijing, China ; Qiu Zheng-ding

The problem of multicasting (MC) assumes a new dimension in multimedia communication networks. One main object of studying MC problems is to find a way to support the QoS need of each user, and to minimize the MC tree cost. This problem is related to the constrained Steiner tree. In this paper, we propose a novel source-based bandwidth-delay-constrained low-cost multicast routing algorithm, which may be used for MC real-time communication in heterogeneous networks

Published in:

Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on  (Volume:2 )

Date of Conference:

2000