• Title/Summary/Keyword: mean token rotation time

Search Result 3, Processing Time 0.019 seconds

Performance analysis of fieldbus systems using Petri net (페리네트를 이용한 필드버스 시스템의 성능 해석)

  • Park, Hong-Seong;Lee, Jae-Soo;Hong, Seong-Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.2 no.3
    • /
    • pp.220-228
    • /
    • 1996
  • This paper presents a extended stochastic Petri net (ESPN) model for CTN(Circulated Token with No duration) service in the data link layer of IEC/ISA fieldbus. It is assumed that a station on the fieldbus has a specified minimum token holding time, a finite capacity buffer, and one transmitter queue with the highest priority. The mean transmission (or service) time at a station and the mean token rotation time for the symmetric fieldbus system atr derived using the presented SPN model and the moment generating function. These performance measures are represented in terms of the minimum token holding time, the number of stations, the arrival rate of messages, and the mean length of messages. The presented performance measure are validated by computer simulations.

  • PDF

Performance and parameter region for real time use in IEEE 802.4 token bus network

  • Park, Hong-Seong;Kim, Deok-Woo;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10b
    • /
    • pp.1805-1810
    • /
    • 1991
  • This paper derives the upper and the lower bound of the mean cycle time and the mean service time of the class 6 and the class 4, within which the minimum utilization constrain of the class 4 is guaranteed. Also, derived are conditions under which the token bus network is stable or unstable. These bounds and stable conditions are represented in terms of the high priority token hold time, the token rotation time and the arrival rate and the total station number etc. This paper suggest a parameter tuning algorithm in a partially symmetric token bus network with two classes, which maximizes the token rotation time for a suitable high priority token hold time and at the same time meets the stability condition of the network, the real time constraint and the minimum utilization constraint of the class 4.

  • PDF

Performance analysis of the IeEE 802.4 token passing system with finite buffers (유한한 버퍼를 가지는 IEEE 802.4 토큰패싱시스템의 성능해석)

  • 박정우;문상용;권욱현
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.7
    • /
    • pp.11-20
    • /
    • 1996
  • In this paper, the performance of the IeEE 802.4 token-passing is analyzed under the assumption that all nodes have finite buffers and finite THT (token tolding 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 distributin 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.

  • PDF