Tree and hypertree networks

From Wikipedia, the free encyclopedia

This article or section does not adequately cite its references or sources.
Please help improve this article by adding citations to reliable sources. (help, get involved!)
Any material not supported by sources may be challenged and removed at any time. This article has been tagged since December 2006.

A hypertree is an acyclic hypergraph.

Tree and hypertree networks are important special cases of star network topologies.

A Tree Network consists of star-configured nodes connected to switches/concentrators, each connected to a linear bus backbone. Each hub/concentrator rebroadcasts all transmissions received from any peripheral node to all peripheral nodes on the network, sometimes including the originating node. All peripheral nodes may thus communicate with all others by transmitting to, and receiving from, the central node only. The failure of a transmission line linking any peripheral node to the central node will result in the isolation of that peripheral node from all others, but the rest of the systems will be unaffected.


[edit] See also


This computer network-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../t/r/e/Tree_and_hypertree_networks.html"