Abstract
In this paper, the IEEE 802.4 token passing bus network is analyzed. It is assumed that all nodes have finite buffers, finite THT (Token Holding Time) and asymmetric loads. The priority mechanism is not considered. This paper derives the approximate matrix equation between the queue length distribution and the token rotation time in equilibrium state. Based on the matrix equation, the mean waiting time and the blocking probability are derived analytically. The analytic results are compared with simulation results in order to show that the deviations are small.
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.
