An alternative method for computing system-length distributions of BMAP/R/1 and BMAP/D/1 queues using roots

详细信息    查看全文

• 作者：U.C. Gupta^a ; ^{umesh@maths.iitkgp.ernet.in" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Gagandeep Singh^b ; ^{rahigs@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; ^{gsrahi@maths.iitkgp.ernet.in" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; M.L. Chaudhry^c ; ^{chaudhry-ml@rmc.ca" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Batch Markovian arrival process (BMAP) ; Deterministic ; Matrix-exponential ; Phase-type ; Rational Laplace&ndash ; Stieltjes transform ; Roots
• 刊名：Performance Evaluation
• 出版年：2016
• 出版时间：January 2016
• 年：2016
• 卷：95
• 期：Complete
• 页码：60-79
• 全文大小：672 K

文摘

In this paper, we present closed-form expressions for system-length distributions in terms of roots outside the unit disk of the characteristic equation of the BMAP/R/1 queue, where arrival process is batch Markovian arrival process (BMAP) and R represents a class of distributions having rational Laplace–Stieltjes transform. The unknown boundary vector has been evaluated using the roots (inside and on the unit disk) of the characteristic equation. Several numerical results are presented for a variety of arrival and service-time distributions including phase-type (PH) and matrix-exponential (ME) which cover a wide variety of distributions that arise in applications. Using an approximated representation of ME distribution, results for BMAP/D/1 queue are also presented. We compared our result with the results obtained using classical matrix analytic method as well as cyclic reduction algorithm. It is shown that the computation-time of the proposed method does not depend upon the parameters like traffic intensity and correlation co-efficient. The method is analytically quite simple and easy to implement.