Multicast routing in a datagram internetwork
Multicast routing in a datagram internetwork
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
The HIP protocol for hierarchical multicast routing
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The MASC/BGMP architecture for inter-domain multicast routing
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A comparison of reliable multicast protocols
Multimedia Systems
Organizing multicast receivers deterministically by packet-loss correlation
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
KHIP—a scalable protocol for secure multicast routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An Evaluation of Shared Multicast Trees with Multiple Active Cores
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Organizing multicast receivers deterministically by packet-loss correlation
Multimedia Systems
QoS-constrained core selection for group communication
Computer Communications
Cost analysis and optimization for IP multicast group management
Computer Communications
On a multicast resequencer for ATM networks
Information Sciences: an International Journal
Sender access and data distribution control for inter-domain multicast groups
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved fault recovery for core based trees
Computer Communications
A routing algorithm for dynamic multicast trees with end-to-end path length control
Computer Communications
| Hi-index | 0.00 |
This paper presents a new protocol, the Ordered Core Based Tree (OCBT) protocol, which remedies several shortcomings of the Core Based Tree (CBT) multicast protocol. We show that the CBT protocol can form loops during periods of routing instability, and that it can consistently fail to build a connected multicast tree, even when the underlying routing is stable. The OCBT protocol provably eliminates these deficiencies and reduces the latency of tree repair following a link or core failure. OCBT also improves scalability by allowing flexible placement of the cores that serve as points of connection to a multicast tree. Simulation results show that the amount of control traffic in OCBT is comparable to that in CBT.