A \(BMAP| G| 1\)-analysis based on convolution calculus

DOI10.1007/BF02432332zbMath0927.65004OpenAlexW2061038590MaRDI QIDQ1288931

K. Appert

Publication date: 29 June 1999

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02432332

zbMATH Keywords

algorithmscomputational complexityChapman-Kolmogorov equationsarrival block matricesbatch Markovian arrival processesconvolutional exponential distributionsgeneralized compound Poisson processesmodelling of modern communication systemssemi-convolutions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From the matrix-geometric to the matrix-exponential
• Opsearch
• New results on the single server queue with a batch markovian arrival process
• A single-server queue with server vacations and a class of non-renewal arrival processes
• A versatile Markovian point process
• The N/G/1 queue and its detailed analysis
• A logarithmic reduction algorithm for quasi-birth-death processes
• Markov additive processes. II

This page was built for publication: A \(BMAP| G| 1\)-analysis based on convolution calculus