• Journal of the Korean Statistical Society
• /
• 제36권2호
• /
• pp.285-297
• /
• 2007

We consider the $P_{\lambda}^M-service$ policy for an M/G/1 queueing system in which the workload is monitored randomly at discrete points in time. If the level of the workload exceeds a threshold ${\lambda}$ when it is monitored, then the service rate is increased from 1 to M instantaneously and is kept as M until the workload reaches zero. By using level-crossing arguments, we obtain explicit expressions for the stationary distribution of the workload in the system.

• 대한수학회논문집
• /
• 제32권2호
• /
• pp.425-433
• /
• 2017

This paper is concerned with the analysis of the busy period distribution in a batch arrival $M^X/G/1$ retrial queue. The expression for the Laplace-Stieltjes transform of the length of the busy period is well known, but from this expression we cannot compute the moments of the length of the busy period by direct differentiation. This paper provides a direct method of calculation for the first and second moments of the length of the busy period.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.36-48
• /
• 1991

In this study, an efficient algorithm is developed to compute steady state probabilities for the following M$_{x}$G/1 server vacation system under control-operating poligy: At the end of a busy period, the server takes a sequence of vacations, each for a random amount of time. At the end of each vacation, he inspects the length of the queue. If the queue length at this time is equal to or greater than a prespecified threshold value r, he begins to serve the queue until it is empty.y.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.229-229
• /
• 1993

• Journal of Information Processing Systems
• /
• 제7권4호
• /
• pp.679-690
• /
• 2011

In this paper we consider a local area network (LAN) of dual mode service where one is a token bus and the other is a carrier sense multiple access with a collision detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet dropping probability of a dual mode LAN for finite length queue M/G/1(m) traffic. Here, the offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond delay. The concept of a tabular solution for two-dimensional Poisson's traffic of circuit switching is adapted here to find the cell dropping probability of the dual mode packet service. Although the work is done for the traffic of similar bandwidth, it can be extended for the case of a dissimilar bandwidth of a circuit switched network.

• Journal of the Korean Statistical Society
• /
• 제33권2호
• /
• pp.159-167
• /
• 2004

We present a simple approach to finding the stationary workload of M/G/1 queues having generalized vacations and exhaustive service discipline. The approach is based on the level crossing technique. According to the approach, all that we need is the workload at the beginning of a busy period. An example system to which we apply the approach is the M/G/1 queue with both multiple vacations and D-policy.

• Journal of applied mathematics & informatics
• /
• 제41권6호
• /
• pp.1155-1171
• /
• 2023

This paper investigates a non Markovian M/G/1 queue with retrial policy, different kind of service rates as well as unsatisfied clients which is inspired by an example of a transmission medium access control in wireless communications. The server tends to work continuously until it finds at least one client in the system. The server will begin its maintenance tasks after serving all of the clients and if the system becomes empty. Provisioning periods in regular working periods and maintenance service periods should be evenly divided. Using supplementary variable technique, the amount of clients in the system as well as in the orbit were found. Further few performance measures of the system were demonstrated numerically.

• 대한수학회지
• /
• 제38권4호
• /
• pp.807-842
• /
• 2001

This paper summarizes recent development of analytical and algorithmical results for stationary FIFO queues with multiple Markovian arrival streams, where service time distributions are general and they may differ for different arrival streams. While this kind of queues naturally arises in considering queues with a superposition of independent phase-type arrivals, the conventional approach based on the queue length dynamics (i.e., M/G/1 pradigm) is not applicable to this kind of queues. On the contrary, the workload process has a Markovian property, so that it is analytically tractable. This paper first reviews the results for the stationary distributions of the amount of work-in-system, actual waiting time and sojourn time, all of which were obtained in the last six years by the author. Further this paper shows an alternative approach, recently developed by the author, to analyze the joint queue length distribution based on the waiting time distribution. An emphasis is placed on how to construct a numerically feasible recursion to compute the stationary queue length mass function.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2006년도 PROCEEDINGS OF JOINT CONFERENCEOF KDISS AND KDAS
• /
• pp.43-47
• /
• 2006

Consider a multitype queue where queued customers arc served in their order of arrival at a rate which depends on the customer type. Here we calculate the sharp asymptotics of the probability the total number of customers in the queue reaches a high level before emptying. The natural state space to describe this queue is a tree whose branches increase in length as the number of customers in the queue grows. Consequently it is difficult to prove a large deviation principle. Moreover, since service rates depend on the customer type the stationary distribution is not of product form so there is no simple expression for the stationary distribution. Instead, we use a change of measure technique which increases the arrival rate of customers and decreases the departure rate thus making large deviations common.

• Journal of the Korean Statistical Society
• /
• 제31권4호
• /
• pp.491-507
• /
• 2002

We analyze a single server bulk input queue with optional server vacations under a single vacation policy and balking phenomenon. The service times of the customers as well as the vacation times of the server have been assumed to be arbitrary (general). We further assume that not all arriving batches join the system during server's vacation periods. The supplementary variable technique is employed to obtain time-dependent probability generating functions of the queue size as well as the system size in terms of their Laplace transforms. For the steady state, we obtain probability generating functions of the queue size as well as the system size, the expected number of customers and the expected waiting time of the customers in the queue as well as the system, all in explicit and closed forms. Some special cases are discussed and some known results have been derived.