Tree network: Difference between revisions
Content deleted Content added
| Line 15: | Line 15: | ||
A tree network with branching order, <math>d = 3</math> , and <math>G = 3</math> generations is shown in the following figure |
A tree network with branching order, <math>d = 3</math> , and <math>G = 3</math> generations is shown in the following figure |
||
<gallery> |
|||
[[File:1.png|thumb|Tree]] |
|||
</gallery> |
|||
. Peripheral nodes are marked red and |
. Peripheral nodes are marked red and |
||
Revision as of 14:22, 23 March 2018
A tree network, or star-bus network, is a hybrid network topology in which star networks are interconnected via bus networks.[1][2] Tree networks are hierarchical, and each node can have an arbitrary number of child nodes.
Regular Tree Networks
A regular tree network topology is characterized by two parameters: the branching, , and the number of generations, . The total number of the nodes, , and the and the number of peripheral nodes , are given by
Adjacency matrix
A tree network with branching order, , and generations is shown in the following figure
. Peripheral nodes are marked red and
References
- ^ Bradley, Ray. Understanding Computer Science (for Advanced Level): The Study Guide. Cheltenham: Nelson Thornes. p. 244. ISBN 978-0-7487-6147-0. OCLC 47869750. Retrieved 2016-03-26.
- ^ Sosinsky, Barrie A. (2009). "Network Basics". Networking Bible. Indianapolis: Wiley Publishing. p. 16. ISBN 978-0-470-43131-3. OCLC 359673774. Retrieved 2016-03-26.