Abstract
The timer-controlled token-passing mechanism widely used in industrial communication networks is analyzed. Several real network parameters, such as finite buffers and finite token-holding time (THT), which generally determine the overall performance of a network, are considered. The approximate matrix equation between the queue length distribution and the token rotation time is derived. Based on this matrix equation, the equations for the mean waiting time and the blocking probability are also derived. These equations can be easily solved using personal computers, due to its simple matrix structure and small computation time. Using these equations, the performance of field bus or other timer-controlled token-passing networks can be more accurately evaluated, since finite size buffers and finite THT are considered. The approximation error is shown to be small by computer simulation.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
