Misplaced Pages

Tree network

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Tree and hypertree networks) Hybrid network topologyNot to be confused with Tree (data structure).
Tree topology
Tree network topology

A tree topology, or star-bus topology, is a hybrid network topology in which star networks are interconnected via bus networks. Tree networks are hierarchical, and each node can have an arbitrary number of child nodes.

Regular tree networks

A regular tree network's topology is characterized by two parameters: the branching, d {\displaystyle d} , and the number of generations, G {\displaystyle G} . The total number of the nodes, N {\displaystyle N} , and the number of peripheral nodes N p {\displaystyle N_{p}} , are given by

N = d G + 1 − 1 d − 1 , N p = d G {\displaystyle N={\frac {d^{G+1}-1}{d-1}},\quad N_{p}=d^{G}}

Random tree networks

Three parameters are crucial in determining the statistics of random tree networks, first, the branching probability, second the maximum number of allowed progenies at each branching point, and third the maximum number of generations, that a tree can attain. There are a lot of studies that address the large tree networks, however small tree networks are seldom studied.

Tools to deal with networks

A group at MIT has developed a set of functions for Matlab that can help in analyzing the networks. These tools could be used to study the tree networks as well.

L. de Weck, Oliver. "MIT Strategic Engineering Research Group (SERG), Part II". Retrieved May 1, 2018.

References

  1. 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.
  2. 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.
  3. Kromer, J.; Khaledi-Nasab, A; Schimansky-Geier, L.; Neiman, A.B (2017). "Emergent stochastic oscillations and signal detection in tree networks of excitable elements". Scientific Reports. 7. arXiv:1701.01693. doi:10.1038/s41598-017-04193-8.
  4. Khaledi-Nasab, Ali; Kromer, Justus A.; Schimansky-Geier, Lutz; Neiman, Alexander B. (2018-11-12). "Variability of collective dynamics in random tree networks of strongly coupled stochastic excitable elements". Physical Review E. 98 (5): 052303. arXiv:1808.02750. doi:10.1103/PhysRevE.98.052303.
Network topologies
Arrangements of the data links and nodes of computer networks
Categories: