Analysis of token ring networks with both finite and infinite buffer capacity stations

The effects of station buffer capacity on the performance of token-ring networks are investigated. The network is modeled as a multi-queue system with a single cyclic server, one finite buffer queue and an arbitrary number of infinite buffer queues, a nonexhaustive service discipline, constant station walking time, Poisson arrival processes, and general message service time distributions. For the particular cases of exponentially distributed and constant message service times, approximate average message delays for both the finite and infinite buffer stations and the probability of message blocking at the finite buffer station are given in explicit expressions. Several numerical results are presented. Interesting conclusions are obtained from comparing network performance in the case 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