Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Performance comparison of routing protocols using MaRS: distance-vector versus link-state
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Scalable inter-domain routing architecture
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
Building shared trees using a one-to-many joining mechanism
ACM SIGCOMM Computer Communication Review
On routes and multicast trees in the Internet
ACM SIGCOMM Computer Communication Review
IP multicast channels: EXPRESS support for large-scale single-source applications
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
LCN '99 Proceedings of the 24th Annual IEEE Conference on Local Computer Networks
An Analysis of Internet Inter-Domain Topology and Route Stability
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Multicast routing in dense and sparse modes: simulation study of tradeoffs and dynamics
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Multicast group behavior in the Internet's multicast backbone (MBone)
IEEE Communications Magazine
IEEE Communications Magazine
A routing algorithm for dynamic multicast trees with end-to-end path length control
Computer Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
The evolution of multicast: from the MBone to interdomain multicast to Internet2 deployment
IEEE Network: The Magazine of Global Internetworking
Lazy flooding: a new technique for information dissemination in distributed network systems
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.24 |
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.