Paper Info
Title
The directed reverse path join (DRPJ) protocol: an efficient multicast routing protocol.
Abstract
The new Directed Reverse Path Join (DRPJ) protocol efficiently implements a Greedy routing algorithm for generating a multicast tree. The DRPJ protocol minimizes the messaging overhead from probe messages and allows a joining node to find multiple paths that are not constrained to be only the shortest paths. This enables a controllable tradeoff between path length and bandwidth consumption. Using simulation, the DRPJ protocol is compared to the existing Flooding with TTL (Time-To-Live) and Directed Spanning Join (DSJ) protocols. Using a topology model of the current Internet, it is found that the DRPJ protocol reduces probe messages by nearly 90 and 75% when compared to the Flooding with TTL and DSJ protocols, respectively.
Year
DOI
Venue
2001
10.1016/S0140-3664(00)00368-6
Computer Communications
Keywords
Field
DocType
Multicast,Multicast routing protocols,Dynamic membership
Open Shortest Path First,Protocol Independent Multicast,Link-state routing protocol,Computer science,Path vector protocol,Computer network,Real-time computing,Wireless Routing Protocol,Interior gateway protocol,Distance Vector Multicast Routing Protocol,Distributed computing,Zone Routing Protocol
Journal
Volume
Issue
ISSN
24
12
Computer Communications
Citations 
PageRank 
References 
1
0.38
25
Authors
2
Name
Order
Citations
PageRank
H. Fujinoki140.81
Kenneth J. Christensen256986.17