By Topic

Near receiver branching point multicast protocol

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

3 Author(s)
Bag-Mohammadi, M. ; Router Lab, Tehran Univ., Iran ; Samadian-Barzoki , S. ; Yazdani, N.

Many multicast routing protocols construct SPTs (shortest path trees) to deliver multicast data packets to the receivers with the minimum delay. Some protocols, on the other hand, try to minimize the bandwidth consumption in the multicast distribution tree using Steiner trees. In this paper, we propose a new multicast routing protocol called NRBP (near receiver branching point) which can construct a wide range of multicast distribution trees between these two extremes. Changing the protocol parameters controls the tree characteristics. Our protocol is not only able to build SPT with minimum total tree cost, but also it can create semi-Steiner tree with less data delivery delay. Benefits of the proposed protocol include some sort of congestion avoidance, controlling the MFT (multicast forwarding table) memory requirements and QoS provisioning.

Published in:

Communications, 2003. APCC 2003. The 9th Asia-Pacific Conference on  (Volume:3 )

Date of Conference:

21-24 Sept. 2003