Core based trees (CBT)
Open Access
- 1 October 1993
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 23 (4) , 85-95
- https://doi.org/10.1145/167954.166246
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 4 references indexed in Scilit:
- Requirements for Multicast ProtocolsPublished by RFC Editor ,1993
- X.500 and DomainsPublished by RFC Editor ,1991
- Multicast routing in internetworks and extended LANsPublished by Association for Computing Machinery (ACM) ,1988
- Reverse path forwarding of broadcast packetsCommunications of the ACM, 1978