An effective spanning tree algorithm for a bridged LAN

Abstract

A Bridged Local Area Network (BLAN) is an internetwork where a lot of LANs are interconnected by bridges. The active spanning tree topology of a BLAN is to ensure that at most one routing path is existed between any two end stations. In this paper, we propose a new distributed algorithm for the bridges of a BLAN to construct an active spanning tree topology. Comparing with the IEEE 802.ID standard spanning tree algorithm [1], our distributed algorithm has following advantages: (a) constructing a spanning tree in a faster way, (b) using an easier mechanist a to predict the spanning tree topology, and (c) establishing a more balanced spanning tree topology.