Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks
- 1 December 1994
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 49 (1) , 111-136
- https://doi.org/10.1007/bf02031594
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A unified framework for simulating Markovian models of highly dependable systemsIEEE Transactions on Computers, 1992
- Bounding availability of repairable systemsIEEE Transactions on Computers, 1989
- Stochastic theory of a fluid model of producers and consumers coupled by a bufferAdvances in Applied Probability, 1988
- The completion time of a job on multimode systemsAdvances in Applied Probability, 1987
- A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer PerformanceIEEE Journal on Selected Areas in Communications, 1986
- Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing ModelsIEEE Journal on Selected Areas in Communications, 1986
- Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by DecompositionJournal of the ACM, 1984
- Approximation methods of solution of stochastic programming problemsCybernetics and Systems Analysis, 1982
- Geometric convergence of value-iteration in multichain Markov decision problemsAdvances in Applied Probability, 1979
- Optimal and suboptimal stationary controls for Markov chainsIEEE Transactions on Automatic Control, 1978