a simple eigenvalue method for low-order d-bmapg1 queues：一个低阶d-bmapg1队列的简单特征值的方法.pdfVIP

Applied Mathematical Modelling 29 (2005) 277–288 /locate/apm A simple eigenvalue method for low-order D-BMAP/G/1 queues Ho Woo Lee a * ,Jong Min Moon b ,Byung Kyu Kim c Jong Geun Park d ,Se Won Lee e a Department of Systems Management Engineering, Sungkyunkwan University, Su Won 440-746, Korea b SE Application Prog. Info Tech. Group Division LG CNS, Good Morning Bldg., Yeo Eui Do, Seou l150-712, Korea c Itsweb, CRM Team, RD Center, 789-4 Young Bldg., Yok Sam Dong Kang Nam, Seou l135-080, Korea d I/O System Team, Computer System Department, Computer Software Research Lab, ETRI, Dae Jon 305-350, Korea e Department of Systems Management Engineering, Sungkyunkwan University, Su Won 440-746, Korea Accepted 19 July 2004 Available online 18 October 2004 Abstract This paper is aimed at those engineers and practitioners who need a simple and understandable non- matrix-analytic procedure to compute the performance measures of the discrete-time BMAP/G/1 queueing system when the order of parameter matrices is very low. We develop a set of system equations and derive the vector generating function of the queue length. Starting from the generating function ,we propose a eigenvalue approach that can be implemented by those who have basic knowledge on M/G/1 queues and eigenvalue algebra. 2004 Elsevier Inc. All rights reserved. 1. Introduction The D-BMAP(Discrete-time Batch Markovian Arrival Process) is a two-dimensional stochastic process {A(k) J(k) k P0} with transition probability matrix * Correspondi