Performance comparison of bridge algorithms in interconnected local area networks

Do Y. Lee; Jai Y. Lee

doi:10.1016/0169-7552(91)90064-J

Performance comparison of bridge algorithms in interconnected local area networks

Do Y. Lee, Jai Y. Lee

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	265-276
Number of pages	12
Journal	Computer Networks and ISDN Systems
Volume	22
Issue number	4
DOIs	https://doi.org/10.1016/0169-7552(91)90064-J
Publication status	Published - 1991 Oct 14

Bibliographical note

Funding 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

Engineering(all)

Access to Document

10.1016/0169-7552(91)90064-J

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.}",

note = "Funding Information: This research has been performed by the support of Korea Science and Engineering Foundation (contract no. 883-1106-001-2).",

year = "1991",

month = oct,

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",

}

TY - JOUR

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

AU - Lee, Do Y.

AU - Lee, Jai Y.

N1 - Funding Information: This research has been performed by the support of Korea Science and Engineering Foundation (contract no. 883-1106-001-2).

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

SN - 1389-1286

VL - 22

SP - 265

EP - 276

JO - Computer Networks

JF - Computer Networks

IS - 4

ER -

Performance comparison of bridge algorithms in interconnected local area networks

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this