Regenerative Analysis and Steady State Distributions for Markov Chains

From MaRDI portal
Publication:3696262

DOI10.1287/opre.33.5.1107zbMath0576.60083OpenAlexW1988914905MaRDI QIDQ3696262

Daniel P. Heyman, Winfried K. Grassmann, Michael I. Taksar

Publication date: 1985

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.33.5.1107




Related Items (82)

Perturbation results for nearly uncoupled Markov chains with applications to iterative methodsEntrywise perturbation theory and error analysis for Markov chainsStability of a two-queue cyclic polling system with BMAPs under gated service and state-dependent time-limited service disciplinesNumerical method for discrete-time finite-buffer queues with some regenerative structureON LATOUCHE–RAMASWAMI'S LOGARITHMIC REDUCTION ALGORITHM FOR QUASI-BIRTH-AND-DEATH PROCESSESOn a two-level multigrid solution method for finite Markov chainsA detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-serviceAnalysis of the asymmetric shortest queue problemA Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order TensorThe snowball effect of customer slowdown in critical many-server systemsThe computation of key properties of Markov chains via perturbationsContinue, quit, restart probability modelModelling traffic queues at a signalized intersection with vehicle- actuated control and Markovian arrival processesComplete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approachOn the batch arrival batch service queue with finite buffer under server's vacation: \(MX/GY/1/N\) queueAnalyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)Analysis of the stationary \(E_ k/C_ 2/s\) queueing systemOptimal Stopping of Seasonal Observations and Projection of a Markov ChainStationary distributions in a queueing system with vacation times and limited serviceComputing absorption probabilities for a Markov chainNewton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensorNumerical computation of mean passage times and absorption probabilities in Markov and Semi-Markov modelsExploiting the Toeplitz structure in certain queueing problemsA simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queuesComparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitasSecurity screening queues with impatient applicants: a new model with a case studyAccurate inverses for computing eigenvalues of extremely ill-conditioned matrices and differential operatorsRed light green light method for solving large Markov chainsOn the finite buffer queue with renewal input and batch Markovian service process: \(\mathrm{GI}/\mathrm{BMSP}/1/N\)A note on Newton-Noda iteration for computing the Perron pair of a weakly irreducible nonnegative tensorFour Canadian Contributions to Stochastic ModelingAccurate solutions of \(M\)-matrix Sylvester equationsRapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.Finite-state-space truncations for infinite quasi-birth-death processesMatrix Structures in Queuing ModelsOn a direct method for the solution of nearly uncoupled Markov chainsPerformance and stability of direct methods for computing generalized inverses of the graph LaplacianAsymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov ProcessesStationary analysis of a BMAP/R/1 queue with R-type multiple working vacationsAnalysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal controlA direct projection method for Markov chainsFinding equilibrium probabilities of QBD processes by spectral methods when eigenvalues vanishProbabilistic approach to computational algorithms for finding stationary distributions of Markov chainsAnalysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival processFast multilevel methods for Markov chainsUsing state reduction for computing steady state vectors in Markov chains of \(M/G/1\) typeThe computation of the mean first passage times for Markov chainsComputing the fundamental matrix for a nonirreducible Markov chainA Performance Comparison of Density-of-States MethodsAnalysis of a finite buffer variable batch service queue with batch Markovian arrival process and server's vacationEntrywise relative perturbation bounds for exponentials of essentially non-negative matricesFurther Comparisons of Direct Methods for Computing Stationary Distributions of Markov ChainsThe infinite-buffer single server queue with a variant of multiple vacation policy and batch Markovian arrival processSteady state analysis of level dependent quasi-birth-and-death processes with catastrophesBlockwise perturbation theory for nearly uncoupled Markov chains and its applicationLoss probability in an overloaded discrete-time \(GI/G/1/K\) system with very large \(K\).Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reorderingAnalysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffersFluid Flow Models and Queues—A Connection by Stochastic CouplingComputing singular values of diagonally dominant matrices to high relative accuracySolving matrix polynomial equations arising in queueing problemsAccurate numerical solution for structured \(M\)-matrix algebraic Riccati equationsThe Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifieldsIterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid methodAnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing QueueFinite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP(a,b)/1/NOptimizing steady state Markov chains by state reductionEfficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited disciplineOn the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing systemA simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method:GI/C-MSP(a,b)/1/Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing systemCase for First Courses on Finite Markov Chain Modeling to Include Sojourn Time Cycle ChartInfinite level-dependent QBD processes and matrix-analytic solutions for stochastic chemical kineticsAccurate numerical solution for shifted \(M\)-matrix algebraic Riccati equationsHighly accurate doubling algorithm for quadratic matrix equation from quasi-birth-and-death processParallel computing for Markov chains with islands and portsThe state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problemAnalysis of nonpreemptive priority queues with multiple servers and two priority classesHighly Accurate Latouche-Ramaswami Logarithmic Reduction Algorithm for Quasi-Birth-and-Death ProcessAnalyses of an M/M/N queue with servers' vacationsState reduction in a Markov decision processAccurate calculations of stationary distributions and mean first passage times in Markov renewal processes and Markov chains




This page was built for publication: Regenerative Analysis and Steady State Distributions for Markov Chains