Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks

DOI10.1007/BF02031594zbMath0798.90045MaRDI QIDQ1319827

Alexei A. Gaivoronski, Mario Bonatti

Publication date: 9 May 1994

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

zbMATH Keywords

discrete Markov chainshigh speed ATM networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete-time conversion for simulating semi-Markov processes
• Block iterative algorithms for stochastic matrices
• Integrals which are convex functionals
• Approximation methods of solution of stochastic programming problems
• Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
• The completion time of a job on multimode systems
• Stochastic theory of a fluid model of producers and consumers coupled by a buffer
• Optimal and suboptimal stationary controls for Markov chains
• Geometric convergence of value-iteration in multichain Markov decision problems
• Queueing analysis of buffered switching networks
• Bounding availability of repairable systems

This page was built for publication: Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks