scholarly journals The transient behaviour of the queueing system Gi/M/1

1963 ◽  
Vol 3 (2) ◽  
pp. 249-256 ◽  
Author(s):  
P. J. Brockwell
Keyword(s):  
Distribution Function ◽  
Explicit Expression ◽  
Queueing System ◽  
Single Server ◽  
Single Server Queue ◽  
Transient Behaviour ◽  
Special Cases ◽  
Server Queue ◽  
Interarrival Times ◽  
Lagrange Series

SUMMARYWe consider a single server queue for which the interarrival times are identically and independently distributed with distribution function A(x) and whose service times are distributed independently of each other and of the interarrival times with distribution function B(x) = 1 − e−x, x ≧ 0. We suppose that the system starts from emptiness and use the results of P. D. Finch [2] to derive an explicit expression for qnj, the probability that the (n + 1)th arrival finds more than j customers in the system. The special cases M/M/1 and D/M/1 are considerend and it is shown in the general case that qnj is a partial sum of the usual Lagrange series for the limiting probability .

The single-server queue with independent GI/G and M/G input streams

1987 ◽  
Vol 19 (1) ◽  
pp. 266-286 ◽  
Author(s):  
Teunis J. Ott
Keyword(s):  
Distribution Function ◽  
Numerical Analysis ◽  
Real Time ◽  
Queueing System ◽  
Single Server ◽  
Equivalent System ◽  
Single Server Queue ◽  
Input Stream ◽  
Server Queue ◽  
Single Input

This paper studies the single-server queueing system with two independent input streams: a GI/G and an M/G stream. A new proof is given of an old result which shows how this system can be transformed into an equivalent ‘single input stream’ GI/G/1 queue, and methods to study that equivalent system numerically are given. As part of the numerical analysis, algorithms are given to compute the moments and the distribution function of busy periods in the M/G/1 queue, and of other related busy periods. Special attention is given to the single-server queue with independent D/G and M/G input streams.This work is to be used in the modeling of real-time computer systems, which can often be described as a single-server queueing system with independent D/G and M/G input streams, see for example Ott (1984b).

The single-server queue with independent GI/G and M/G input streams

1987 ◽  
Vol 19 (01) ◽  
pp. 266-286 ◽  
Author(s):  
Teunis J. Ott
Keyword(s):  
Distribution Function ◽  
Numerical Analysis ◽  
Real Time ◽  
Queueing System ◽  
Single Server ◽  
Equivalent System ◽  
Single Server Queue ◽  
Input Stream ◽  
Server Queue ◽  
Single Input

This paper studies the single-server queueing system with two independent input streams: a GI/G and an M/G stream. A new proof is given of an old result which shows how this system can be transformed into an equivalent ‘single input stream’ GI/G/1 queue, and methods to study that equivalent system numerically are given. As part of the numerical analysis, algorithms are given to compute the moments and the distribution function of busy periods in the M/G/1 queue, and of other related busy periods. Special attention is given to the single-server queue with independent D/G and M/G input streams. This work is to be used in the modeling of real-time computer systems, which can often be described as a single-server queueing system with independent D/G and M/G input streams, see for example Ott (1984b).

The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline

1987 ◽  
Vol 24 (03) ◽  
pp. 758-767
Author(s):  
D. Fakinos
Keyword(s):  
Queueing System ◽  
Limiting Distribution ◽  
Single Server ◽  
Queue Size ◽  
Single Server Queue ◽  
Preemptive Resume ◽  
Server Queue ◽  
Queue Discipline ◽  
Service Times

This paper studies theGI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.

The number of departures from a semi-Markov queue

1974 ◽  
Vol 11 (04) ◽  
pp. 825-828 ◽  
Author(s):  
D. C. McNickle
Keyword(s):  
Busy Period ◽  
Single Server ◽  
Single Server Queue ◽  
Server Queue ◽  
Customer Type ◽  
Interarrival Times ◽  
Busy Cycle

In this note an identity due to Arjas (1972) is used to express the distribution of the number of departures from a single server queue in which both service and interarrival times may depend on customer type in terms of the busy period and busy cycle processes.

scholarly journals Stochastic analysis of the departure and quasi-input processes in a versatile single-server queue

1996 ◽  
Vol 9 (2) ◽  
pp. 171-183 ◽  
Author(s):  
J. R. Artalejo ◽  
A. Gomez-Corral
Keyword(s):  
Markov Chain ◽  
Stochastic Analysis ◽  
Queueing System ◽  
Single Server ◽  
Structural Form ◽  
Single Server Queue ◽  
Server Queue ◽  
Negative Exponential ◽  
Orbit Size ◽  
Negative Arrivals

This paper is concerned with the stochastic analysis of the departure and quasi-input processes of a Markovian single-server queue with negative exponential arrivals and repeated attempts. Our queueing system is characterized by the phenomenon that a customer who finds the server busy upon arrival joins an orbit of unsatisfied customers. The orbiting customers form a queue such that only a customer selected according to a certain rule can reapply for service. The intervals separating two successive repeated attempts are exponentially distributed with rate α+jμ, when the orbit size is j≥1. Negative arrivals have the effect of killing some customer in the orbit, if one is present, and they have no effect otherwise. Since customers can leave the system without service, the structural form of type M/G/1 is not preserved. We study the Markov chain with transitions occurring at epochs of service completions or negative arrivals. Then we investigate the departure and quasi-input processes.

A single-server queue with server vacations and a class of non-renewal arrival processes

1990 ◽  
Vol 22 (3) ◽  
pp. 676-705 ◽  
Author(s):  
David M. Lucantoni ◽  
Kathleen S. Meier-Hellstern ◽  
Marcel F. Neuts
Keyword(s):  
Waiting Times ◽  
Arrival Process ◽  
Single Server ◽  
Single Server Queue ◽  
Arbitrary Time ◽  
Markov Modulated Poisson Process ◽  
Special Cases ◽  
Server Queue ◽  
Arrival Processes ◽  
Markov Modulated

We study a single-server queue in which the server takes a vacation whenever the system becomes empty. The service and vacation times and the arrival process are all assumed to be mutually independent. The successive service times and the vacation times each form independent, identically distributed sequences with general distributions. A new class of non-renewal arrival processes is introduced. As special cases, it includes the Markov-modulated Poisson process and the superposition of phase-type renewal processes.Algorithmically tractable equations for the distributions of the waiting times at an arbitrary time and at arrivals, as well as for the queue length at an arbitrary time, at arrivals, and at departures are established. Some factorizations, which are known for the case of renewal input, are generalized to this new framework and new factorizations are obtained. The algorithmic implementation of these results is discussed.

scholarly journals Estimating the Probability of Ruin for Variable Premiums by Simulation

1996 ◽  
Vol 26 (1) ◽  
pp. 93-105 ◽  
Author(s):  
Frédéric Michaud
Keyword(s):  
Sample Path ◽  
Risk Theory ◽  
Single Server ◽  
Single Server Queue ◽  
Storage Process ◽  
Probability Of Ruin ◽  
Surplus Process ◽  
Special Cases ◽  
Server Queue ◽  
Waiting Time Process

AbstractThere is a duality between the surplus process of classical risk theory and the single-server queue. It follows that the probability of ruin can be retrieved from a single sample path of the waiting time process of the single-server queue. In this paper, premiums are allowed to vary. It has been shown that the stationary distribution of a corresponding storage process is equal to the survival probability (with variable premiums). Thus by simulation of the corresponding storage process, the probability of ruin can be obtained. The special cases where the surplus earns interest and the premiums are charged by layers are considered and illustrated numerically.

A note on the queueing system GI/Ek/1

1969 ◽  
Vol 6 (3) ◽  
pp. 708-710 ◽  
Author(s):  
P. D. Finch
Keyword(s):  
Time Distribution ◽  
Queueing System ◽  
Single Server ◽  
Service Time Distribution ◽  
Alternative Procedure ◽  
Single Server Queue ◽  
Server Queue ◽  
Image Position ◽  
The Right ◽  
Similar Evaluation

In this note we adopt the notation and terminology of Kingman (1966) without further comment. For the general single server queue one has For the queueing system GI/Ek/1 it is possible to make use of the particular nature of the service time distribution to evaluate the right-hand side of Equation (1) in terms of the k roots of a certain equation. This evaluation is carried out in detail in Prabhu (1965) to which reference should be made for the technicalities involved. A similar evaluation applies to the limiting distribution when it exists. However, the resulting expression again involves the k roots of a certain equation. In this note we draw attention to an alternative procedure which does not involve the calculation of roots. We remark that a similar, but slightly different, procedure can be used in the study of the queueing system Ek/GI/1. Details of this will be presented in a separate note.

The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline

1987 ◽  
Vol 24 (3) ◽  
pp. 758-767 ◽  
Author(s):  
D. Fakinos
Keyword(s):  
Queueing System ◽  
Limiting Distribution ◽  
Single Server ◽  
Queue Size ◽  
Single Server Queue ◽  
Preemptive Resume ◽  
Server Queue ◽  
Queue Discipline ◽  
Service Times

This paper studies the GI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.

scholarly journals Queues, stores, and tableaux

2005 ◽  
Vol 42 (04) ◽  
pp. 1145-1167 ◽  
Author(s):  
Moez Draief ◽  
Jean Mairesse ◽  
Neil O'Connell
Keyword(s):  
Stability Condition ◽  
Young Tableau ◽  
Arrival Process ◽  
Single Server ◽  
Single Server Queue ◽  
Departure Process ◽  
Transient Behaviour ◽  
Server Queue ◽  
The Stability ◽  
First In First Out

Consider the single-server queue with an infinite buffer and a first-in–first-out discipline, either of type M/M/1 or Geom/Geom/1. Denote by 𝒜 the arrival process and by s the services. Assume the stability condition to be satisfied. Denote by 𝒟 the departure process in equilibrium and by r the time spent by the customers at the very back of the queue. We prove that (𝒟, r) has the same law as (𝒜, s), which is an extension of the classical Burke theorem. In fact, r can be viewed as the sequence of departures from a dual storage model. This duality between the two models also appears when studying the transient behaviour of a tandem by means of the Robinson–Schensted–Knuth algorithm: the first and last rows of the resulting semistandard Young tableau are respectively the last instant of departure from the queue and the total number of departures from the store.

Sign in / Sign up

Export Citation Format

Share Document