Lattice path approach for busy period density of M/G/1 queues using C₃ Coxian distribution

DOI10.1016/J.APM.2006.08.005MaRDI QIDQ2470263zbMATH OpenOpenAlexFDO

Authors Kanwar Sen, Bidisha Borkakaty, Manju Agarwal

Publication date 14 February 2008

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2006.08.005

applications (traffic)non-Markovian processes: estimation performance evaluation Queueing theory

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Non-Markovian processes: estimation (62M09) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Review text

This paper introduce a new approach to analysing the queueing process, namely lattice paths (LPs). Starting with the \(M/G/1\) queueing system with \(i_{0}\) customers, the authors analyze a busy period with the LP approach. The general distribution in the \(M/G/1\) queueing system is approximated by 3-phase Cox distribution, \(C_{3}\). When the LP approach is applied to the discretised queueing model, the limiting case \(h \rightarrow 0\) yields results for the continuous model. Thus, a wide range of \(M/G/1\) queues with non-rational Laplace-Stieltjes transforms can be approximated by \(C_{3}\), which has Markovian properties. These results are very valuable. They are applicable to almost any real queueing systems.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2470263)