Core-based trees: Difference between revisions

Revision as of 20:09, 30 November 2016

Latest revision as of 18:34, 21 December 2023

(5 intermediate revisions by 4 users not shown)

Line 1:

'''Core-Basedbased Treestrees''' ('''CBT''') is a proposal for making [[IP [[Multicast]] [[scale (computing)|scalable]] by constructing a [[tree structure|tree]] of [[Router (computing)|router]]s. 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 ==

author*{{cite journal|author1=A. J. Ballardie, |author2=P. F. Francis, and |author3=J. Crowcroft |

*{{cite journal|

author=A. J. Ballardie, P. F. Francis, and J. Crowcroft|

title=Core Based Trees|

journal=ACM SIGCOMM Computer Communication Review|date=August 1993|

Line 9 ⟶ 8:

volume=23|

issue=4|

urldoi=http://portal10.acm.org1145/citation.cfm?id=167954.166246|

doi-access=free}}

doi=10.1145/167954.166246}}

*RFC 2189

*{{cite web

Line 20 ⟶ 19:

|archiveurl=https://web.archive.org/web/20051201222035/http://www.cse.iitk.ac.in/research/mtech1997/9711105/node15.html

|archivedate=2005-12-01

|deadurlurl-status=yesdead

|df=

}}