On the counting process for a class of Markovian arrival processes with an application to a queueing system

DOI10.1007/s11134-005-6478-7zbMath1063.60136OpenAlexW2037355501MaRDI QIDQ1775807

Ken'ichi Kawanishi

Publication date: 4 May 2005

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-005-6478-7

zbMATH Keywords

Lie algebraexplicit solutionMarkovian arrival processcounting processautomatic call distributionBaker-Hausdorff lemma

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (3)

The Wei-Norman method for the infinite-server queue with phase-type arrivals ⋮ On symbolic RG factorization of quasi-birth-and-death processes ⋮ QBD approximations of a call center queueing model with general patience distribution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Queueing systems with vacations - a survey
• A numerical study of large sparse matrix exponentials arising in Markov chains.
• Asymptotic results and a Markovian approximation for the \(M(n)/M(n)/s+GI\) system
• Queueing models of call centers: An introduction
• Methods for the approximation of the matrix exponential in a Lie-algebraic setting
• Generalized Polar Decompositions for the Approximation of the Matrix Exponential
• Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method
• A single-server queue with server vacations and a class of non-renewal arrival processes
• Nineteen Dubious Ways to Compute the Exponential of a Matrix
• The Markov-modulated Poisson process (MMPP) cookbook

This page was built for publication: On the counting process for a class of Markovian arrival processes with an application to a queueing system