By Topic

An efficient routing algorithm for multicasting in a large network

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)
Young-Chul Shim ; Dept. of Comput. Eng., Hong-Ik Univ., Seoul, South Korea ; Shin-Kyu Kang

In this paper we introduce a new multicast routing algorithm to be used in a large network. The proposed algorithm is a hybrid of the core based tree (CBT) and protocol independent multicast-sparse mode (PIM-SM) and builds a bidirectional shared tree centered around a rendezvous point and shortest path trees rooted at some senders. Multicast messages are distributed along the bidirectional shared tree and the shortest path trees and, therefore, the message delivery delay is lower than both the CBT and the PIM-SM.

Published in:

Communications, 1999. APCC/OECC '99. Fifth Asia-Pacific Conference on ... and Fourth Optoelectronics and Communications Conference  (Volume:2 )

Date of Conference:

18-22 Oct. 1999