Core based trees (CBT)
Authors:
- Tony BallardieTBTony Ballardie
- Paul FrancisPFPaul Francis
- Jon CrowcroftJCJon Crowcroft
Open Access
- 1 October 1993
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 23 (4) , 85-95
Abstract
One of the central problems in one-to-many wide-area communications is forming the delivery tree - the collection of nodes and links that a multicast packet traverses. Significant problems remain to be solved in the area of multicast tree formation, the problem of scaling being paramount among these.In this paper we show how the current IP multicast architecture scales poorly (by scale poorly, we mean consume too much memory, bandwidth, or too many processing resources), and subsequently present a multicast protocol based on a new scalable architecture that is low-cost, relatively simple, and efficient. We also show how this architecture is decoupled from (though dependent on) unicast routing, and is therefore easy to install in an internet that comprises multiple heterogeneous unicast routing algorithms.Keywords
This publication has 3 references indexed in Scilit:
- X.500 and Domains1991
- Multicast routing in internetworks and extended LANs1988
- Reverse path forwarding of broadcast packetsCommunications of the ACM, 1978