Optimization of a topologically tree-based local area network (Q1117827)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimization of a topologically tree-based local area network |
scientific article; zbMATH DE number 4093150
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimization of a topologically tree-based local area network |
scientific article; zbMATH DE number 4093150 |
Statements
Optimization of a topologically tree-based local area network (English)
0 references
1988
0 references
In search of the most versatile local area network (LAN) available, we discovered a topologically tree-based LAN proposed by \textit{G. J. Lipovski, A. Goyal} and \textit{M. Malek} [Lookahead networks, AFIPS Proc. Nat. Comput. Conf. 51, 153-165 (1982)] to be most adaptable to the various purposes and applications desirable within a LAN environment. In addition to versatility, the network considered here offers the advantages of a high degree of fail-softness - and thus reliability - simplicity in the access protocol, high bandwidth utilization, low-delay characteristics, and modularity - which ensures future expansion and ease of installation and maintenance. Questions relating to features critical to the optimal design and use of such a LAN are analyzed and answered. Key mechanisms investigated include fanouts and partitions, delays and degradation.
0 references
communication network
0 references
local area network
0 references
reliability
0 references
installation
0 references
maintenance
0 references
optimal design
0 references
fanouts
0 references
partitions
0 references
delays
0 references
degradation
0 references
0.8900581
0 references
0.8800873
0 references
0.8781884
0 references
0.8780372
0 references
0.87542874
0 references