Queuing analyses of a topologically tree-based local area network (Q1115792)

A topologically tree-based local area network (LAN), proposed by \textit{G. J. Lipovski}, \textit{A. Goyal} and \textit{M. Malek} [AFIPS Proc. Nat. Comput. Conf. 51, 153-165 (1982)], is found to be most adaptable to various pruposes 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.