On the analysis of a symmetric polling system with single-message buffers
Performance Evaluation
Analytic Models of Cyclic Service Systems and their Application to Token-Passing Local Networks
IEEE Transactions on Computers
Approximate Analysis of Single and Multiple Ring Networks
IEEE Transactions on Computers
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Approximate Delay Analysis and Results for Asymmetric Token-Passing and Polling Networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
In this paper, the performance of the IEEE 802.4 token-passing system is analyzed under the assumption that all nodes have finite buffers and finite THT (token holding time). The loads generated at nodes are assumed to be asymmetric. The priority mechanism is not considered. This paper derives an approximate matrix equation of the queue length distribution in terms of the number of nodes, frame arrival rate and mean service time of a frame in steady state. Based on the matrix equation, the mean token-rotation time, 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.