An efficient routing algorithm for multicasting in a large network

Author

Shim, Young-Chul ; Kang, Shin-Kyu

Author_Institution

Dept. of Comput. Eng., Hong-Ik Univ., Seoul, South Korea

Volume

2

fYear

1999

fDate

18-22 Oct. 1999

Firstpage

1143

Abstract

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.

Keywords

multicast communication; telecommunication network routing; trees (mathematics); CBT; PIM-SM; bidirectional shared tree; core based tree; large network; message delivery delay; multicast routing algorithm; multicasting; protocol independent multicast-sparse mode; rendezvous point; shortest path trees; Computer networks; Database systems; Delay; Electronic mail; Information retrieval; Intelligent networks; Multicast algorithms; Multicast protocols; Routing; Samarium;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1999. APCC/OECC '99. Fifth Asia-Pacific Conference on ... and Fourth Optoelectronics and Communications Conference

Conference_Location

Beijing, China

Print_ISBN

7-5635-0402-8

Type

conf

DOI

10.1109/APCC.1999.820466

Filename

820466