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): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A versatile Markovian point process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable recursion for the steady state vector in markov chains of m/g/1 type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved cyclic reduction for solving queueing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral approach to compute the mean performance measures of the queue with low-order BMAP input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral analysis of <i>M/G/</i>1 and <i>G</i>/<i>M</i>/1 type Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple eigenvalue method for low-order D-BMAP/G/1 queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A<i>MAP</i>/<i>G</i>/1 Queue with an Underlying Birth–Death Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the single server queue with a batch markovian arrival process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of polynomial zeros by means of Aberth's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and complete computational analysis of MAP/R/1 queue using roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Distribution for the Number of Renewals with Bulk Arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: MODELING BURST TRAFFIC USING A MAP WITH A TREE STRUCTURE / rank
 
Normal rank

Latest revision as of 20:11, 11 July 2024

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
    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
    infinite-buffer queueing system
    0 references
    birth-death modulated Markovian arrival process
    0 references
    numerical methods
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references