Core-based trees: Difference between revisions

Revision as of 10:07, 14 December 2005

Latest revision as of 18:34, 21 December 2023

(25 intermediate revisions by 17 users not shown)

Line 1:

'''Core-based trees''' ('''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.

'''Core-based trees''' is an abbreviation of correctional based tree stems or cbt

for short, this is the process in ict of finding any virus on a network and swapping it onto another tree's stem.

== References ==

Sometimes the tree rejects the virus and destroys it although sometimes the tree reacts to the virus and moves it to a secure folder to be dismantled for the sap that it provides, this usually results in the computer getting converted into trinary which as most computers cant handle ceases to work efficiently and for all intents and purposes becomes redundant.

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

title=Core Based Trees|

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

pages=85–95|

volume=23|

issue=4|

doi=10.1145/167954.166246|

doi-access=free}}

*RFC 2189

*{{cite web

|url=http://www.cse.iitk.ac.in/research/mtech1997/9711105/node15.html

|title=Core Based Trees (CBT)

|accessdate=2005-12-14

|work=SCAMP: SCAlable Multicast Protocol for Communication in Large Groups

|author=Atul Vadera

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

|archivedate=2005-12-01

|url-status=dead

}}

[[Category:Network architecture]]

An extract from the only book i know of published on this subject is quite striking when you think about it for any amount of time.

'...And the tendency for the virus to be rejected and destroyed by the host tree stem is disparingly low...'.

This obviously indicates that core based trees are in fact a useless technique and only employed by the most desperate of technicians

A chracterisic of core based trees that have been infected by a virus is that thier leaves turn brown and tend to fall off.

The is a simple derived formula to show the probability of rejects by the core-based tree.

R=Span of tree {{compu-network-stub}}

s=desity of virus

u=Plank's constant

v=Corruptablitiy of virus

v=(u+2as)^2

R-V/I, V=RI therefore, RI=(U+2as)^2

A is the tendecy of rejection so,

(√RI)-(U+2as)=a

the higher value of a, the less chance of rejections.