Analysis of polling systems
Waiting-time approximations for cyclic-service systems with switchover times
Performance Evaluation
Performance of ARQ Schemes on Token Ring Networks
IEEE Transactions on Computers
Two Symmmetric Queues with Alternating Service and Switching Times
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Hi-index | 0.24 |
This paper investigates the effects of station buffer capacity on the performance of token ring networks. The network is modelled as a multi-queue system with a single cyclic server, one finite buffer queue and an arbitrary number of infinite buffer queues. Approximate average message delays for both the finite and infinite buffer stations and the probability of message blocking at the finite buffer station are derived, and numerical results are presented. Interesting conclusions are obtained when we compare network performance when the network traffic load is completely balanced with the case when the finite buffer station is much more heavily loaded than the individual infinite buffer stations. The latter situation would arise, for example, in the interconnected networks employing gateways or bridges.