Approximate sojourn time distribution for cyclic service systems and its applications to token passing networks

순환서비스시스템에서의 근사화된 체류시간 분포화 토큰 패싱 네트워크에의 응용

In this paper, an approximate sojourn time distribution is obtained for cyclic service systems. We consider symmetric and limited service systems in which each queue has an infinite capacity. The combined service time is defined which consists of the frame service time and server waiting time that is approximated by two cases of the uniform and exponential distributions. The approximate sojourn time distribution is obtained from the Pollaczek-Khinchine formula where the combined service time is used for the service time in the M/G/I model. And some numerical examples are given to validate the suggested approximate analysis.