• 제목/요약/키워드: M/G/1 queue

검색결과 94건 처리시간 0.026초

Analysis on G/M/1 queue with two-stage service policy

  • KIM SUNGGON;KIM JONGWOO;LEE EUI YONG
    • 한국통계학회:학술대회논문집
    • /
    • 한국통계학회 2004년도 학술발표논문집
    • /
    • pp.295-300
    • /
    • 2004
  • We consider a G/M/1 queue with two-stage service policy. The server starts to serve with rate of ${\mu}1$ customers per unit time until the number of customers in the system reaches A. At this moment, the service rate is changed to that of ${\mu}2$ customers per unit time and this rate continues until the system is empty. We obtain the stationary distribution of the number of customers in the system.

  • PDF

AN M/G/1 QUEUE WITH GENERALIZED VACATIONS AND EXHAUSTIVE SERVICE

  • Lim, Jong-Seul;Lee, Sang-Heon
    • Journal of applied mathematics & informatics
    • /
    • 제6권1호
    • /
    • pp.309-320
    • /
    • 1999
  • Models of single-server queues with vacations have been widely used to study the performance of many computer communi-cation and production systems. In this paper we analyze an M/G/1 queue with generalized vacations and exhaustive service. This sys-tem has been shown to possess a stochastic decomposition property. That is the customer waiting time in this system is distributed as the sum of the waiting time in a regular M/G/1 queue with no va-cations and the additional delay due to vacations. Herein a general formula for the additional delay is derived for a wide class of vacation policies. The formula is also extended to cases with multiple types of vacations. Using these new formulas existing results for certain vacation models are easily re-derived and unified.

THE M/G/1 FEEDBACK RETRIAL QUEUE WITH TWO TYPES OF CUSTOMERS

  • Lee, Yong-Wan
    • 대한수학회보
    • /
    • 제42권4호
    • /
    • pp.875-887
    • /
    • 2005
  • In M/G/1 retrial queueing system with two types of customers and feedback, we derived the joint generating function of the number of customers in two groups by using the supplementary variable method. It is shown that our results are consistent with those already known in the literature when ${\delta}_k\;=\;0(k\;=\;1,\;2),\;{\lambda}_1\;=\;0\;or\;{\lambda}_2\;=\;0$.

확률모형에 등장하는 최대와 최소의 특성에 관한 소고 (On the Characteristics of Maximum and Minimum of Random Variables in Stochastic Models)

  • 채경철;김진동;양원석
    • 한국경영과학회지
    • /
    • 제26권4호
    • /
    • pp.39-45
    • /
    • 2001
  • Maximum and minimum of rendom variables are frequently encountered in the stochastic modelling for various OR problems. We summarize and extend characteristics of maximum and minimum, emphasizing the case in which random variables are independent and all of them except one are distributed exponential. As an application, we derive a transform-free expression for the M/G/1 queue length distribution.

  • PDF

M/G/1/1 대기체계의 고객 손실간격 분포에 대한 소고 (A Note on the Inter-Loss Time Distribution of an M/G/1/1 Queuing System)

  • 이두호
    • 한국경영과학회지
    • /
    • 제41권3호
    • /
    • pp.37-43
    • /
    • 2016
  • This note discusses the inter-loss time ofan M/G/1/1 queuing system. The inter-loss time is defined as the time duration between two consecutive losses of arriving customers. In this study, we present the explicit Laplace transform of the inter-loss time distribution of an M/G/1/1 queuing system.

M/G/1 QUEUE WITH COMPLEX VACATION POLICIES

  • Lim, Jong-Seul;Oh, Choon-Suk
    • Journal of applied mathematics & informatics
    • /
    • 제6권3호
    • /
    • pp.943-952
    • /
    • 1999
  • Models of single-server queues with vacation have been widely used to study the performance of many computer communica-tion and production system. In this paper we use the formula for a wide class of vacation policies and multiple types of vacations based on the M/G/1 queue with generalized vacations and exhaustive service. furthermore we derive the waiting times for many complex vacation policies which would otherwise be to analyze. These new results are also applicable to other related queueing models. if they conform with the basic model considered in this paper.

Optimal(m,N)-policy for M/G/1 queue with set-up time

  • 박정옥;이순석;이호우
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
    • /
    • pp.57-57
    • /
    • 1993
  • PDF

CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS

  • Kim, Jeong-Sim
    • 대한수학회보
    • /
    • 제47권6호
    • /
    • pp.1251-1258
    • /
    • 2010
  • For an M/G/1 processor-sharing queue with batch arrivals, Avrachenkov et al. [1] conjectured that the conditional mean sojourn time is concave. However, Kim and Kim [5] showed that this conjecture is not true in general. In this paper, we show that this conjecture is true if the service times have a hyperexponential distribution.

레벨횡단법의 확장에 대한 소고 (An Extension of the Level Crossing Technique)

  • 채경철;이승원
    • 한국경영과학회지
    • /
    • 제29권3호
    • /
    • pp.1-7
    • /
    • 2004
  • We demonstrate in this paper that the level crossing technique can be applied to such a system that not only the state vector is two-dimensional but Its two components are heterogeneous. As an example system, we use the GI-G/c/K queue whose state vector consists of the number of customers in the system and the total unfinished work.