The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 철저한 서비스 전략을 갖춘 토큰 제어 네트워크를 분석합니다. 스테이션의 서비스 시간의 평균과 분산, 네트워크상의 평균 토큰 회전 시간은 각 스테이션의 버퍼 용량이 개별적으로 유한하다는 조건 하에서 도출됩니다. 분석을 위해 스테이션의 확장된 확률론적 Petri-net 모델이 제시됩니다. 그런 다음 모델을 분석하여 네트워크의 총 스테이션 수, 프레임 도착 속도, 전송 속도 등 주어진 네트워크 매개 변수의 함수로 스테이션의 평균 서비스 시간과 평균 토큰 회전 시간을 도출합니다. 프레임 수 및 버퍼 용량. 역의 서비스 시간의 변화도 도출됩니다. 도출된 결과를 검토함으로써 네트워크의 실제 작동을 정확하게 설명하고 있음을 알 수 있습니다. 또한 충분한 신뢰 구간을 갖춘 컴퓨터 시뮬레이션은 결과를 검증하는 데 도움이 됩니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Sang Yong MOON, Hong Seong PARK, Wook Hyun KWON, "Performance Analysis of the Exhaustive Token-Controlled Network with Finite Buffers" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 12, pp. 2061-2072, December 1999, doi: .
Abstract: In this paper, a token-controlled network with exhaustive service strategy is analyzed. The mean and variance of service time of a station, and the mean token rotation time on the network are derived under the condition that the buffer capacity of each station is individually finite. For analysis, an extended stochastic Petri-net model of a station is presented. Then, by analyzing the model, the mean service time of a station and the mean token rotation time are derived, as functions of the given network parameters such as the total number of stations on the network, the arrival rate of frames, the transmission rate of frames, and the buffer capacity. The variance of service time of a station is also derived. By examining derived results, it is shown that they exactly describe the actual operations of the network. In addition, computer simulations with sufficient confidence intervals help to validate the results.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_12_2061/_p
부
@ARTICLE{e82-b_12_2061,
author={Sang Yong MOON, Hong Seong PARK, Wook Hyun KWON, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance Analysis of the Exhaustive Token-Controlled Network with Finite Buffers},
year={1999},
volume={E82-B},
number={12},
pages={2061-2072},
abstract={In this paper, a token-controlled network with exhaustive service strategy is analyzed. The mean and variance of service time of a station, and the mean token rotation time on the network are derived under the condition that the buffer capacity of each station is individually finite. For analysis, an extended stochastic Petri-net model of a station is presented. Then, by analyzing the model, the mean service time of a station and the mean token rotation time are derived, as functions of the given network parameters such as the total number of stations on the network, the arrival rate of frames, the transmission rate of frames, and the buffer capacity. The variance of service time of a station is also derived. By examining derived results, it is shown that they exactly describe the actual operations of the network. In addition, computer simulations with sufficient confidence intervals help to validate the results.},
keywords={},
doi={},
ISSN={},
month={December},}
부
TY - JOUR
TI - Performance Analysis of the Exhaustive Token-Controlled Network with Finite Buffers
T2 - IEICE TRANSACTIONS on Communications
SP - 2061
EP - 2072
AU - Sang Yong MOON
AU - Hong Seong PARK
AU - Wook Hyun KWON
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1999
AB - In this paper, a token-controlled network with exhaustive service strategy is analyzed. The mean and variance of service time of a station, and the mean token rotation time on the network are derived under the condition that the buffer capacity of each station is individually finite. For analysis, an extended stochastic Petri-net model of a station is presented. Then, by analyzing the model, the mean service time of a station and the mean token rotation time are derived, as functions of the given network parameters such as the total number of stations on the network, the arrival rate of frames, the transmission rate of frames, and the buffer capacity. The variance of service time of a station is also derived. By examining derived results, it is shown that they exactly describe the actual operations of the network. In addition, computer simulations with sufficient confidence intervals help to validate the results.
ER -