Approximated Transient Queue Length and Waiting Time Distributions via Steady State Analysis

DOI10.1081/STM-200056027MaRDI QIDQ5462814zbMATH OpenOpenAlexFDO

Authors Benny Van Houdt, Chris Blondia

Publication date 27 July 2005

Published in Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1081/stm-200056027

zbMATH Keywords

Markov chainsmatrix analytic methodqueueing systemsreset eventstransient distribution

Mathematics Subject Classification ID

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

Recommendations

• Transient analysis of a Markovian queue with deterministic rejection
• Transient queueing analysis
• USING SINGULARITY ANALYSIS TO APPROXIMATE TRANSIENT CHARACTERISTICS IN QUEUEING SYSTEMS
• Transient flows in queueing systems via closure approximations
• scientific article; zbMATH DE number 431650

Cites work

• A single-server queue with server vacations and a class of non-renewal arrival processes
• Approximating Transition Probabilities and Mean Occupation Times in Continuous-Time Markov Chains
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Invariant measures for quasi-birth-and-death processes
• Multidimensional transform inversion with applications to the transient \(M/G/1\) queue
• New results on the single server queue with a batch markovian arrival process
• Solving m/g/l type markov chains: recent advances and applications

Cited in

(9)

• Transient and first passage time distributions of first- and second-order multi-regime Markov fluid queues via ME-fication
• Steady-state and first passage time distributions for waiting times in the MAP/M/s+G queueing model with generally distributed patience times
• Transient analysis of piecewise homogeneous Markov fluid models
• A computational framework for two-dimensional random walks with restarts
• USING SINGULARITY ANALYSIS TO APPROXIMATE TRANSIENT CHARACTERISTICS IN QUEUEING SYSTEMS
• Transient analysis of Markov modulated processes with Erlangization, ME-fication and inverse Laplace transformation
• Space-grid approximations of hybrid stochastic differential equations and first-passage properties
• Transient analysis of the M/M/K/ +M queue
• CSL model checking algorithms for QBDs

This page was built for publication: Approximated Transient Queue Length and Waiting Time Distributions via Steady State Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5462814)