|
'''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.
<!-- Please do not remove or change this AfD message until the issue is settled -->
<div class="boilerplate metadata" id="afd" style="margin: 0 5%; padding: 0 7px 7px 7px; background: #EDF1F1; border: 1px solid #999999; text-align: left; font-size:95%;">
'''This article is being considered for deletion''' in accordance with Wikipedia's [[Wikipedia:Deletion policy|deletion policy]][[Template:Afd|.]]<br />
Please share your thoughts on the matter at '''[[Wikipedia:Articles for deletion/{{PAGENAME}}|this article's entry]]''' on the Articles for Deletion page.<br />
You are welcome to edit this article, but please do not blank this article or remove this notice while the discussion is in progress. For more information, particularly on merging or moving the article during the discussion, read the [[Wikipedia:Guide to deletion|Guide to Deletion]].<br/>
<div class="NavFrame" style="padding:0;border-style:none;"><div class="NavFrame" style="border-style:none;padding:0;"><div class="NavHead" style="background:#EDF1F1;text-align:left;"><span style="font-weight:normal;font-style:italic;">[[Template:AfD in 3 steps|How to list a page for deletion]] ([{{SERVER}}{{localurl:Wikipedia:Articles for deletion/Log/{{CURRENTYEAR}}_{{CURRENTMONTHNAMEGEN}}_{{CURRENTDAY}}|action=edit}} log])</span></div>
<div class="NavContent" style="display:none;background:#EDF1F1;">
{{AfD doc}}
</div></div></div></div>
[[Category:Pages for deletion]] ▼<!-- End of AfD message, feel free to edit beyond this point -->
== References ==
'''Core-based trees''' is an abbreviation of correctional based tree stems or cbt
*{{cite journal|author1=A. J. Ballardie |author2=P. F. Francis |author3=J. Crowcroft |
for short, this is the process in ict of finding any virus on a network and swapping it onto another tree's stem.
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: PagesNetwork for deletionarchitecture]]
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.
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.
{{compu-network-stub}}
A chracterisic of core based trees that have been infected by a virus is that "their leaves turn brown and tend to fall off". This is the term in the ICT world which means the system files are slowly corrupt untill the OS (Operating system) is unusable.
== Formula ==
There is a simple derived formula to show the probability of rejects by the core-based tree.
R=Span of tree network
I=Number of affected '''folders''' not files, common misconception
s=density 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.
== How to fix it? ==
This section will deal with how to fix your computer if it has been afflicted by a virus that cbt's dont affect, this usually involves getting a proffesional to deal with your desktop or laptop which does tend to cost some amount, but there are some methods of dealing with these that don't require money to change hands at all; these include system restores and bespoke software and end with crudely using magnets and hammers.
| 