Two-centre tree topologies for metropolitan area networks

A two-centre binary tree (BT) can be constructed by linking the root nodes of two binary trees. Variations can also be constructed by making additional linkages within the two-centre binary tree. Three of these variations, referred to as the quaternary tree (QT), the X-tree (XT) and the ring tree (RT), are studied. Comparisons using performance measures of traffic flows and path reliabilities are made with respect to the BT and some popular topologies in the literature. Various implementations issues that take advantage of these tree networks are then proposed and discussed. The study indicates that the variants of the two-centre trees are viable topologies for the implementation of a metropolitan area network (MAN)