Taylor series solution of a single server queueing model with feedback

Sandeep Kumar Mogha and Mamta Rani

International Journal of Process Management and Benchmarking, 2021, vol. 11, issue 5, 658-670

Abstract: In multi-access systems, scheduling mechanism often require a proper feedback policy. In this article, we compute transient state probabilities of the classical single server Markovian queueing system with feedback. The method demonstrated in present study involves direct and practical steps for deriving explicit expression for queue size distribution. The present method avoids involvement of any special function (e.g., Bessel function), transformation (e.g., Laplace transform) or/and complex analysis. The resulting Taylor series for queue size distribution are proved to converge for all time under arbitrary initial condition. This approach is easy to understand and to extend for a more advanced queueing system otherwise another solution technique is very complicated when compared to this technique. For example, if we use Laplace technique then Rouch theorem will be used to find the roots and it is very difficult to obtain the roots by using any other method.

Keywords: Catalan sequence; transient analysis; M / M /1; feedback policy; Poisson queues. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=117280 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijpmbe:v:11:y:2021:i:5:p:658-670

Access Statistics for this article

More articles in International Journal of Process Management and Benchmarking from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().