Jump to content

Core-based trees

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Citation bot (talk | contribs) at 18:34, 21 December 2023 (Removed proxy/dead URL that duplicated identifier. | Use this bot. Report bugs. | Suggested by Abductive | Category:Computer network stubs | #UCB_Category 95/547). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Core-based trees (CBT) is a proposal for making IP Multicast scalable by constructing a tree of routers. It was first proposed in a paper by Ballardie, Francis, and Crowcroft. What differentiates it from other schemes for multicasting is that the routing tree comprises multiple "cores" (also known as "centres"). The locations of the core routers are statically configured. Other routers are added by growing "branches" of a tree, comprising a chain of routers, from the core routers out towards the routers directly adjacent to the multicast group members.

References

[edit]
  • A. J. Ballardie; P. F. Francis; J. Crowcroft (August 1993). "Core Based Trees". ACM SIGCOMM Computer Communication Review. 23 (4): 85–95. doi:10.1145/167954.166246.
  • RFC 2189
  • Atul Vadera. "Core Based Trees (CBT)". SCAMP: SCAlable Multicast Protocol for Communication in Large Groups. Archived from the original on 2005-12-01. Retrieved 2005-12-14.