Research: Performance analysis of the IEEE 802.4 token-passing system with finite buffers and asymmetric loads

  • Authors:
  • Sang Yong Moon;Jung Woo Park;Wook Hyun Kwon

  • Affiliations:
  • School of Electrical Engineering, Seoul National University, San 56-1, Shillim-dong, Kwanak-ku, 151-742 Seoul, South Korea;School of Electrical Engineering, Seoul National University, San 56-1, Shillim-dong, Kwanak-ku, 151-742 Seoul, South Korea;School of Electrical Engineering, Seoul National University, San 56-1, Shillim-dong, Kwanak-ku, 151-742 Seoul, South Korea

  • Venue:
  • Computer Communications
  • Year:
  • 1998

Quantified Score

Hi-index 0.24

Visualization

Abstract

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.