A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of \(\mathrm{BDMMAP}/\mathrm{G}/1\) queue (Q274838)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of \(\mathrm{BDMMAP}/\mathrm{G}/1\) queue
scientific article

    Statements

    A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of \(\mathrm{BDMMAP}/\mathrm{G}/1\) queue (English)
    0 references
    0 references
    0 references
    0 references
    25 April 2016
    0 references
    Summary: This paper considers an infinite-buffer queueing system with birth-death modulated Markovian arrival process (BDMMAP) with arbitrary service time distribution. BDMMAP is an excellent representation of the arrival process, where the fractal behavior such as burstiness, correlation, and self-similarity is observed, for example, in ethernet LAN traffic systems. This model was first apprised by \textit{S. Nishimura} [Stoch. Models 19, No. 4, 425--447 (2003; Zbl 1035.60090)], and to analyze it, he proposed a twofold spectral theory approach. It seems from the investigations that Nishimura's approach is tedious and difficult to employ for practical purposes. The objective of this paper is to analyze the same model with an alternative methodology proposed by \textit{M. L. Chaudhry} et al. [Methodol. Comput. Appl. Probab. 15, No. 3, 563--582 (2013; Zbl 1274.60271)] (to be referred to as CGG method). The CGG method appears to be rather simple, mathematically tractable, and easy to implement compared to Nishimura's approach. The Achilles tendon of the CGG method are the roots of the characteristic equation associated with the probability generating function (pgf) of the queue length distribution, which absolve any eigenvalue algebra and iterative analysis. Both the methods are presented in a stepwise manner for easy accessibility, followed by some illustrative examples in accordance with the context.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    infinite-buffer queueing system
    0 references
    birth-death modulated Markovian arrival process
    0 references
    numerical methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references