Spanning tree algorithm for routing in hierarchical MANs

The authors present a hierarchical three-level MAN (metropolitan area network) which is capable of interconnecting a large number of LANs (local area networks). They also propose a routing strategy based on a spanning-tree-type algorithm which allows optimization of reconfiguration times thanks to the possibility of selective network reconfiguration, and a limited extension of the filtering database, even in networks of metropolitan dimensions. A possible implementation of the MAN is suggested.<<ETX>>