Performance issues in local-area networks

Abstract

This paper discusses several important performance problems in the design of local-area networks. The questions discussed relate to various aspects of architecture, design, and implementation: (1) the delaythroughput characteristics of the medium access protocols, (2) the performance of local-area networks on which a file server provides file storage and retrieval services to intelligent workstations, and (3) timing problems in local-area network adapters. Since the paper does not primarily address the performance analyst, it is descriptive in nature; analytic details are omitted in favor of a more intuitive explanation of the relevant erlects.

Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic

“…According to teletraffic theory, the probability of occupancy by a full buffer is the probability of loss of packets. The probability of delay and cell/packet loss is prevalent but it is a cumbersome task to determine the traffic parameters of a combined packet traffic stream [9,10]. In this paper, the probability states of M/G/1(m) before normalization are evaluated and the corresponding analysis is presented in the next section.…”

Exploring a New Markov Chain Model for Multiqueue Systems

“…This was pursued in the 60s and 70s with the advent of central computing facilities where a central server polled data from terminals distributed around large facilities such as univerity campuses. However, with the advent of computer networks in the 80s, these models were also used to study slotted and token rings [2] [3].…”

Architecture selection for deployable local area networks

“…The figure shows the shorter the frame length, the smaller the delay at small throughput values. Source (Bux, 1984, p. 361) Figure 4.6 varies the number of stations on the network between five and 500 while holding the transmission rate at one Mbps. With a small number of stations, the token bus and token ring curves are very similar.…”