Generating Markov-Chain Transitions Quickly: I

DOI10.1287/IJOC.2.2.126MaRDI QIDQ4029055zbMATH OpenOpenAlexFDO

Authors Bennett L. Fox

Publication date 1 April 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2.2.126

zbMATH Keywords

Markov chainqueueing networksreliability problemssimulations

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Recommendations

• Generating Markov-Chain Transitions Quickly: II
• scientific article; zbMATH DE number 1424144
• Probability, Markov chains, queues, and simulation. The mathematical basis of performance modeling.
• scientific article; zbMATH DE number 729460
• scientific article; zbMATH DE number 1457259

Cited in

(5)

• Massively parallel SIMD simulation of Markovian DEDS: Event and time synchronous methods
• Variance reduction algorithms for parallel replicated simulation of uniformized Markov chains
• Generating Markov-Chain Transitions Quickly: II
• Maintaining discrete probability distributions optimally
• scientific article; zbMATH DE number 7651155 (Why is no real title available?)

This page was built for publication: Generating Markov-Chain Transitions Quickly: I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029055)