On ramaswami's algorithm for the computation of the steady state vector in markov chains ofM/G/1-Type

DOI10.1080/15326349908807161zbMath0702.60085OpenAlexW2077381507MaRDI QIDQ3481041

Helmut Schellhaas

Publication date: 1990

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

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

zbMATH Keywords

Ramaswami's algorithmsteady state vector

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

The queue dynamics of protected/permissive left turns at pre-timed signalized intersections ⋮ The evolution process of queues at signalized intersections under batch arrivals ⋮ Modeling the permissive-only left-turn queue at signals ⋮ Modelling the variation and uncertainty problem of right-turn-on-red queue in a variety of conflicting environments ⋮ A geometric convergence formula for the level-increment-truncation approximation of \(M/G/1\)-type Markov chains ⋮ An extended queueing model for vehicles at signalized intersections considering the platoon correlated arrivals ⋮ Subexponential asymptotics of the stationary distributions of M/G/1-type Markov chains ⋮ Light-Tailed Asymptotics of Stationary Tail Probability Vectors of Markov Chains of M/G/1 Type ⋮ Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue ⋮ Single server queues with a batch Markovian arrival process and server vacations