Continuity of the M/G/c queue

@article{Breuer2008ContinuityOT,
  title={Continuity of the M/G/c queue},
  author={Lothar Breuer},
  journal={Queueing Systems},
  year={2008},
  volume={58},
  pages={321-331}
}
  • L. Breuer
  • Published 1 April 2008
  • Mathematics
  • Queueing Systems
Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller distributions, say Fn, leads to an approximation of the stationary distribution π of the original M/G/c queue by the stationary distributions πn of the M/G/c queues with service time distributions Fn. Here all approximations are in weak convergence. The argument is based on a representation of M/G/c queues in terms of… 
The Total Overflow during a Busy Cycle in a Markov-Additive Finite Buffer System
TLDR
This work considers a finite buffer system where the buffer content moves in a Markov-additive way while it is strictly between the buffer boundaries and determines the joint distribution of the total overflow and the last time of being at the upper boundary.
Markov Chains on Continuous State Space
TLDR
A piecewise deterministic Markov process is studied, which is applied to deal with more general queues such as the GI/G/c queue and introduces continuousphase type (CPH) distribution and continuous-phase Markovian arrival process (CMAP), and then analyze a CMAP/CPH/1 queue.

References

SHOWING 1-10 OF 21 REFERENCES
Transient and Stationary Distributions for the GI/G/k Queue with Lebesgue-Dominated Inter-Arrival Time Distribution
  • L. Breuer
  • Mathematics
    Queueing Syst. Theory Appl.
  • 2003
TLDR
It turns out that the transition probability kernel of the embedded Markov chain at arrival instants has the form of a lower Hessenberg matrix and hence admits an operator–geometric stationary distribution.
Calculation of the Steady State Waiting Time Distribution in GI/PH/c and MAP/PH/c Queues
TLDR
The phase-type representation of W in a FCFS c-server queue is derived in a form which is explicit up to the solution of a matrix fixed point problem; the key new ingredient is a careful study of the not-all-busy period where some or all servers are idle.
Algorithms for the multi-server queue with phase type service
We consider the multiserver queue with c phase type servers and a renewal input. It is well-known that the stationary joint distribution of the queue length and the number of servers in each phase of
Stationary distributions for piecewise-deterministic Markov processes
  • O. Costa
  • Mathematics
    Journal of Applied Probability
  • 1990
In this paper we show that the problem of existence and uniqueness of stationary distributions for piecewise-deterministic Markov processes (PDPs) is equivalent to the same problem for the associated
Comparison methods for queues and other stochastic models
TLDR
Comparison properties of random variables and stochastic processes are given and are illustrated by application to various queueing models and questions in experimental design, renewal and reliability theory, PERT networks and branching processes.
Piecewise‐Deterministic Markov Processes: A General Class of Non‐Diffusion Stochastic Models
TLDR
Stochastic calculus for these stochastic processes is developed and a complete characterization of the extended generator is given; this is the main technical result of the paper.
Applied Probability and Queues
TLDR
This paper presents simple Markovian models for regenerative processes, and some examples in the Theory of Random Walks and Single Server Queues multi-Dimensional Methods and many-server Queues.
Fitting Phase-type Distributions via the EM Algorithm
TLDR
An extended EM algorithm is used to minimize the information divergence (maximize the relative entropy) in the density approximation case and fits to Weibull, log normal, and Erlang distributions are used as illustrations of the latter.
Probability Metrics and the Stability of Stochastic Models
General topics in the theory of probability metrics relations between compound, simple and primary distances applications of minimal p. distances ideal metrics.
Markov Models and Optimization
Analysis, probability and stochastic processes piecewise deterministic processes expectations and distributions control theory control by intervention.
...
...