Performance comparison of bridge algorithms in interconnected local area networks

Do Y. Lee, Jai Y. Lee

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)265-276
Number of pages12
JournalComputer Networks and ISDN Systems
Volume22
Issue number4
DOIs
Publication statusPublished - 1991 Oct 14

Fingerprint

Local area networks
Routing algorithms
Planning
Topology

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

@article{44b22ed7129244c889fb04c9fee089ad,
title = "Performance comparison of bridge algorithms in interconnected local area networks",
abstract = "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.",
author = "Lee, {Do Y.} and Lee, {Jai Y.}",
year = "1991",
month = "10",
day = "14",
doi = "10.1016/0169-7552(91)90064-J",
language = "English",
volume = "22",
pages = "265--276",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "4",

}

Performance comparison of bridge algorithms in interconnected local area networks. / Lee, Do Y.; Lee, Jai Y.

In: Computer Networks and ISDN Systems, Vol. 22, No. 4, 14.10.1991, p. 265-276.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Performance comparison of bridge algorithms in interconnected local area networks

AU - Lee, Do Y.

AU - Lee, Jai Y.

PY - 1991/10/14

Y1 - 1991/10/14

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026243542&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026243542&partnerID=8YFLogxK

U2 - 10.1016/0169-7552(91)90064-J

DO - 10.1016/0169-7552(91)90064-J

M3 - Article

AN - SCOPUS:0026243542

VL - 22

SP - 265

EP - 276

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 4

ER -