Tree network: Difference between revisions

Content deleted Content added

Inline

Latest revision as of 18:59, 20 August 2024

A tree topology, or star-bus topology, 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's topology is characterized by two parameters: the branching, $d$ , and the number of generations, $G$ . The total number of the nodes, $N$ , and the number of peripheral nodes $N_{p}$ , are given by ^[3]

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.^[4]

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

^ 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.
^ 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.
^ 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.

[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.

[1]

[2]

[3]

[4]

@@ Line 1: / Line 1: @@
-{{Distinguish|Tree (data structure)}}
+{{Short description|Hybrid network topology}}{{Distinguish|Tree (data structure)}}
 [[File:TreeTopology.png|alt= Tree topology|thumb|Tree network topology]]
-A '''tree network''', or '''star-bus network''', is a hybrid [[network topology]] in which [[star network]]s are interconnected via [[bus network]]s.<ref>{{cite book |url=https://books.google.com/books?id=gnuwPpBcO-MC&pg=RA1-PT12 |title=Understanding Computer Science (for Advanced Level): The Study Guide |last=Bradley |first=Ray |location=Cheltenham |publisher=[[Nelson Thornes]] |page=244 |isbn=978-0-7487-6147-0 |oclc=47869750 |access-date=2016-03-26}}</ref><ref>{{cite book |title=Networking Bible |last=Sosinsky |first=Barrie A. |page=16 |date=2009 |location=Indianapolis |publisher=Wiley Publishing |isbn=978-0-470-43131-3 |oclc=359673774 |chapter=Network Basics |chapter-url=https://books.google.com/books?id=3DOREqRZejcC&pg=PA16 |access-date=2016-03-26}}</ref> Tree networks are hierarchical, and each [[Node (networking)|node]] can have an arbitrary number of child nodes.
+A '''tree topology''', or '''star-bus topology''', is a hybrid [[network topology]] in which [[star network]]s are interconnected via [[bus network]]s.<ref>{{cite book |url=https://books.google.com/books?id=gnuwPpBcO-MC&pg=RA1-PT12 |title=Understanding Computer Science (for Advanced Level): The Study Guide |last=Bradley |first=Ray |location=Cheltenham |publisher=[[Nelson Thornes]] |page=244 |isbn=978-0-7487-6147-0 |oclc=47869750 |access-date=2016-03-26}}</ref><ref>{{cite book |title=Networking Bible |last=Sosinsky |first=Barrie A. |page=16 |date=2009 |location=Indianapolis |publisher=Wiley Publishing |isbn=978-0-470-43131-3 |oclc=359673774 |chapter=Network Basics |chapter-url=https://books.google.com/books?id=3DOREqRZejcC&pg=PA16 |access-date=2016-03-26}}</ref> Tree networks are hierarchical, and each [[Node (networking)|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,  <math>d</math>, and the
-== Regular Tree Networks==
+number of generations,  <math>G</math>.  The total number of the nodes,  <math>N</math>, and the number of peripheral nodes  <math>N_p</math>, are given by  <ref>{{cite journal | last1 = Kromer | first1 = J. | last2 = Khaledi-Nasab | first2 = A | last3 = Schimansky-Geier  | first3 = L. |last4 = Neiman  | first4 = A.B| year = 2017 | title = Emergent stochastic oscillations and signal detection in tree networks of excitable elements | journal = Scientific Reports | volume = 7 | doi=10.1038/s41598-017-04193-8 | arxiv = 1701.01693 }}</ref>
-A tree network with given number of generations and the branching is a regular tree.
-A regular tree network topology is characterized by two parameters: the branching,  <math>d</math>, and the
-number of generations,  <math>G</math>.  The total number of the nodes,  <math>N</math>, and the and the number of peripheral nodes  <math>N_p</math>, are given by
-: <math>N= \frac{d^{G+1}-1}{d-1}</math>
+: <math>N= \frac{d^{G+1}-1}{d-1},\quad N_p=d^G</math>
+== 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.<ref>{{Cite journal |last=Khaledi-Nasab |first=Ali |last2=Kromer |first2=Justus A. |last3=Schimansky-Geier |first3=Lutz |last4=Neiman |first4=Alexander B. |date=2018-11-12 |title=Variability of collective dynamics in random tree networks of strongly coupled stochastic excitable elements |url=https://link.aps.org/doi/10.1103/PhysRevE.98.052303 |journal=Physical Review E |volume=98 |issue=5 |pages=052303 |doi=10.1103/PhysRevE.98.052303|arxiv=1808.02750 }}</ref>
+==Tools to deal with networks==
+A group at MIT has developed a set of functions for [[MATLAB|Matlab]] that can help in analyzing the networks. These tools could be used to study the tree networks as well.
+{{cite web |url=http://strategic.mit.edu/downloads.php?page=matlab_networks |title=MIT Strategic Engineering Research Group (SERG), Part II |last= L. de Weck|first=Oliver |access-date=May 1, 2018}}
 ==References==
 {{Reflist}}
 {{Network topologies}}
 [[Category:Network topology]]
 [[Category:Trees (data structures)]]

v t e Network topologies
Arrangements of the data links and nodes of computer networks
Bus network Grid network Mesh network Point-to-point Ring network Arbitrated loop Star network Switched fabric Tree network Fat tree Hypertree
Topology of the World Wide Web