Problems of network planning and bridge design in interconnected Local Area Networks are studied by comparing and analyzing the performance of two bridge algorithms: Spanning Tree (ST) and Source Routing (SR), which are currently being specified by the IEEE 802 standards committee. The study supported by the extended LAN model simulation shows that the SR algorithm performs better under both steady-state compared to the ST algorithm. Also, in a real environment, it is pointed out that the table look-up time in ST algorithm and the route locating procedure in SR algorithm are not such critical factors as generally conceived by most people in the performance evaluation of bridging algorithms. Besides, network planning rules related to the topology of the extended network and bridging algorithms are given.
Bibliographical noteFunding Information:
This research has been performed by the support of Korea Science and Engineering Foundation (contract no. 883-1106-001-2).
All Science Journal Classification (ASJC) codes