Queuing Analyses of a Topologically Tree-Based Local Area Network

Author

Paul D. Stigall, Missouri University of Science and TechnologyFollow
Saeed Azimi

Abstract

A Topologically Tree-Based Local Area Network (LAN), Proposed by Lipovski, Goyal and Malek, is Found to Be Most Adaptable to Various Purposes and Applications within a LAN Environment. in Addition, the Network Provides a High Degree of Fail-Softness (Reliability), Simplicity in the Access Protocol, High Bandwidth Utilization, Low-Delay Characteristics, and Modularity (Insuring Future Expansion and Ease of Installation and Maintenance). a Series of Questions on Limitations of Key Mechanisms of the above LAN is Investigated and Answered. These Include Traffic Load, Number of Levels, Maximum Span and Channel Transmission Rate. © 1988.

Recommended Citation

P. D. Stigall and S. Azimi, "Queuing Analyses of a Topologically Tree-Based Local Area Network," Computers and Electrical Engineering, vol. 14, no. 1 thru 2, pp. 11 - 27, Elsevier, Jan 1988.

The definitive version is available at https://doi.org/10.1016/0045-7906(88)90004-3

Department(s)

Electrical and Computer Engineering

International Standard Serial Number (ISSN)

0045-7906

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2023 Elsevier, All rights reserved.

Publication Date

01 Jan 1988