A new method for finding the characteristic roots of \(E_{n }/E_{m }/1\) queues

DOI10.1007/S11009-010-9199-2zbMath1253.60095OpenAlexW2031646574MaRDI QIDQ429992

Winfried K. Grassmann

Publication date: 20 June 2012

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-010-9199-2

zbMATH Keywords

waiting timecharacteristic equationsmatrix analytic methodsErlang queuessolutions of polynomials

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Numerical computation of roots of polynomial equations (65H04)

Related Items (3)

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 note on the waiting-time distribution in an infinite-buffer \(\text{GI}^{[X}/ \text{C-MSP} / 1\) queueing system]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steady-state Solution for the Queueing Process E_k/E_m/r
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Spectral analysis of M/G/1 and G/M/1 type Markov chains
• Two-stations queueing networks with moving servers, blocking, and customer loss

This page was built for publication: A new method for finding the characteristic roots of \(E_{n }/E_{m }/1\) queues