On ramaswami's algorithm for the computation of the steady state vector in markov chains ofM/G/1-Type
DOI10.1080/15326349908807161zbMATH Open0702.60085OpenAlexW2077381507MaRDI QIDQ3481041FDOQ3481041
Authors: 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
Recommendations
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type
- Ramaswami's duality and probabilistic algorithms for determining the rate matrix for a structured GI/M/1 Markov chain
- scientific article; zbMATH DE number 44744
- scientific article; zbMATH DE number 1867245
Monte Carlo methods (65C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25)
Cited In (14)
- Some Improvements for the Computation of the Steady-State Distribution of a Markov Chain by Monotone Sequences of Vectors
- Light-tailed asymptotics of stationary tail probability vectors of Markov chains of M/G/1 type
- Single server queues with a batch Markovian arrival process and server vacations
- Subexponential asymptotics of the stationary distributions of M/G/1-type Markov chains
- A geometric convergence formula for the level-increment-truncation approximation of \(M/G/1\)-type Markov chains
- The queue dynamics of protected/permissive left turns at pre-timed signalized intersections
- Modeling the permissive-only left-turn queue at signals
- The evolution process of queues at signalized intersections under batch arrivals
- An extended queueing model for vehicles at signalized intersections considering the platoon correlated arrivals
- Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type
- Modelling the variation and uncertainty problem of right-turn-on-red queue in a variety of conflicting environments
- Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue
- Ramaswami's duality and probabilistic algorithms for determining the rate matrix for a structured GI/M/1 Markov chain
- A stable recursion for the steady state vector in markov chains of m/g/1 type
This page was built for publication: On ramaswami's algorithm for the computation of the steady state vector in markov chains ofM/G/1-Type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3481041)