• Title/Summary/Keyword: 서비스율 조절 대기행렬

Search Result 2, Processing Time 0.015 seconds

Analysis of an M/G/1/K Queueing System with Queue-Length Dependent Service and Arrival Rates (시스템 내 고객 수에 따라 서비스율과 도착율을 조절하는 M/G/1/K 대기행렬의 분석)

  • Choi, Doo-Il;Lim, Dae-Eun
    • Journal of the Korea Society for Simulation
    • /
    • v.24 no.3
    • /
    • pp.27-35
    • /
    • 2015
  • We analyze an M/G/1/K queueing system with queue-length dependent service and arrival rates. There are a single server and a buffer with finite capacity K including a customer in service. The customers are served by a first-come-first-service basis. We put two thresholds $L_1$ and $L_2$($${\geq_-}L_1$$ ) on the buffer. If the queue length at the service initiation epoch is less than the threshold $L_1$, the service time of customers follows $S_1$ with a mean of ${\mu}_1$ and the arrival of customers follows a Poisson process with a rate of ${\lambda}_1$. When the queue length at the service initiation epoch is equal to or greater than $L_1$ and less than $L_2$, the service time is changed to $S_2$ with a mean of $${\mu}_2{\geq_-}{\mu}_1$$. The arrival rate is still ${\lambda}_1$. Finally, if the queue length at the service initiation epoch is greater than $L_2$, the arrival rate of customers are also changed to a value of $${\lambda}_2({\leq_-}{\lambda}_1)$$ and the mean of the service times is ${\mu}_2$. By using the embedded Markov chain method, we derive queue length distribution at departure epochs. We also obtain the queue length distribution at an arbitrary time by the supplementary variable method. Finally, performance measures such as loss probability and mean waiting time are presented.

Busy Period Analysis of an M/G/1/K Queue with the Queue-Length-Dependent Overload Control Policy (고객수 기반의 오버로드 제어 정책이 있는 M/G/1/K 대기행렬의 바쁜기간 분석)

  • Lim, Heonsang;Lim, Dae-Eun
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.3
    • /
    • pp.45-52
    • /
    • 2018
  • We consider the busy period of an M/G/1/K queueing system with queue-length-dependent overload control policy. A variant of an oscillating control strategy that was recently analyzed by Choi and Kim (2016) is considered: two threshold values, $L_1({\leq_-}L_2)$ and $L_2({\leq_-}K)$, are assumed, and service rate and arrival rate are adjusted depending on the queue length to alleviate congestion. We investigate the busy period of an M/G/1/K queue with two overload control policies, and present the formulae to obtain the expected length of a busy period for each control policy. Based on the numerical examples, we conclude that the variability and expected value of the service time distribution have the most influence on the length of a busy period.