Solving m/g/l type markov chains: recent advances and applications

DOI10.1080/15326349808807483zbMath0934.60086OpenAlexW2089094604WikidataQ56778642 ScholiaQ56778642MaRDI QIDQ4385233

Beatrice Meini

Publication date: 17 April 2000

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349808807483

zbMATH Keywords

fast Fourier transformToeplitz matricesM/G/1 type matrices

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (8)

Computations with infinite Toeplitz matrices and polynomials ⋮ A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain ⋮ A unified method of analysis for queues with Markovian arrivals ⋮ Numerical analysis of M/G/1 type queueing systems with phase type transition structure ⋮ Stationary analysis of a fluid queue driven by some countable state space Markov chain ⋮ Approximated Transient Queue Length and Waiting Time Distributions via Steady State Analysis ⋮ Risk processes analyzed as fluid queues ⋮ Several Types of Ergodicity for M/G/1-Type Markov Chains and Markov Processes

This page was built for publication: Solving m/g/l type markov chains: recent advances and applications