13rd lecture: 30/8/09

Mesh Topology & Tree Topology

Mesh Topology
A type of network setup where each of the computers and network devices are interconnected with one another, allowing for most transmissions to be distributed, even if one of the connections go down. This type of topology is not commonly used for most computer networks as it is difficult and expensive to have redundant connection to every computer. However, this type of topology is commonly used for wireless networks. Below is a visual example of a simple computer setup on a network using a mesh topology.

The Mesh topology gives rise to more efficient message propagation, and means that alternative routes can be found if a link fails or there is congestion. A “route discovery” feature is provided which allows the network to find the best available route for a message.


Tree Topology
A Tree topology consists of a Co-ordinator, to which other nodes are connected as follows:

• The Co-ordinator is linked to a set of Routers and End Devices - its children.
  
• A Router may then be linked to more Routers and End Devices - its children. This can continue to a number of levels.
  This hierarchy can be visualised as a tree structure with the Co-ordinator at the top, as illustrated in the diagram below.
  

A Router can be used in place of an End Device in a Tree network, but the message relay functionality of the Router will not be used -only its applications will be relevant.

Structural Rules

The structural rules and terminology of the Tree topology are as follows:

• The Co-ordinator and Routers can have children, and can therefore be parents.
  
• End Devices cannot have children, and therefore cannot be parents.
  

Communication Rules

The communication rules in a Tree topology are as follows:

• A child can only directly communicate with its parent (and with no other node).
  
• A parent can only directly communicate with its children and with its own parent.
  
• In sending a message from one node to another, the message must travel from the source node up the tree to the nearest common ancestor and then down the tree to the destination node.