A new formula for the transient solution of the Erlang queueing model
From MaRDI portal
Publication:1003806
DOI10.1016/J.SPL.2008.09.014zbMath1157.60342OpenAlexW2089400159MaRDI QIDQ1003806
Publication date: 4 March 2009
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2008.09.014
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (5)
Double orbit finite retrial queues with priority customers and service interruptions ⋮ On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue ⋮ The periodic steady-state solution for queues with Erlang arrivals and service and time-varying periodic transition rates ⋮ A time-dependent busy period queue length formula for the \(\mathrm{M}/\mathrm{E}_k/1\) queue ⋮ Exact time-dependent solutions for the $M / D / 1$ queue
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional transform inversion with applications to the transient \(M/G/1\) queue
- A new formula for the transient behaviour of a non-empty M/M/1/\(\infty\) queue.
- Generalized Erlang problem for service systems with finite total capacity
- Transient analysis of a non-empty \(M/M/1/N\) queue -- an alternative approach.
- The transient solution to \(M/E_{k}/1\) queue
- An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems
- Time-Dependent Solution of the Bulk-Service Queuing Problem
- Transient solution to the many-server Poisson queue: a simple approach
- A transient solution to an M/M/1 queue: a simple approach
- A Simple Formula for the Transient State Probabilities of an M/M/1/∞Queue
- Transient solutions of Markov processes and generalized continued fractions
- Transient analytical solution of M/D/1/N queues
- Numerical Inversion of Laplace Transforms of Probability Distributions
- On a new formula for the transient state probabilities for M/M/1 queues and computational implications
- The Solution of the Single-Channel Queuing Equations Characterized by a Time-Dependent Poisson-Distributed Arrival Rate and a General Class of Holding Times
- A Combinatorial Method in the Theory of Queues
This page was built for publication: A new formula for the transient solution of the Erlang queueing model
