Continuous time Markov chain model for token ring local area network

Abstract

A continuous-time Markov chain model of a token ring network with each node having a finite buffer is presented. A model is developed to analyze the token ring network by considering the exponential distribution of message length and token transmission time. Throughput, delay, probability of blocking, and throughput-delay tradeoffs have been derived. A comparative evaluation of the performance of the token ring network with the mathematical models stated by W. Bux (1981) is also presented. It is pointed out that the proposed model is so general that it can be extended to analyze the interconnected token ring local area networks using the window flow control mechanism for ground and spaceborne systems.<>