Analytic Models of Cyclic Service Systems and their Application to Token-Passing Local Networks

Authors:
V. Rego;L. M. Ni
Affiliations:
Purdue Univ., West Lafayette, IN;Michigan State Univ., East Lansing, MI
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 4
Cited 2

On the analysis of a symmetric polling system with single-message buffers

Performance Evaluation
Mean waiting time for a token ring with station dependent overheads

Local area and multiple access networks
Waiting Lines and Times in a System with Polling

Journal of the ACM (JACM)
Polling in a Loop System

Journal of the ACM (JACM)

A note on two simulation benchmarks

ACM SIGSIM Simulation Digest
Research: Performance analysis of the IEEE 802.4 token-passing system with finite buffers and asymmetric loads

Computer Communications

Quantified Score

Hi-index	14.98

Visualization

Abstract

Using the framework of cyclic-service systems with a single server, two different token-passing models are investigated. The first model is approximate, obtaining the free-tokens cycle-time distribution on an asymmetric system with infinite capacity buffers and single-token operation. The second model is exact, yielding the cycle-time distribution of the free token on an asymmetric system with unit-capacity buffers, and single-token operation. The latter result is verified using known results for symmetric, unit-capacity buffer systems. To demonstrate the positive effects of buffering, a small variation of the unit-capacity buffering scheme is introduced. Computational results include performance measures such as throughput, utilization, loss probabilities, mean cycle times, cycle-time distributions, and a comparison of two buffering schemes