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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
