Approximating Nonrenewal Processes by Markov Chains: Use of Super-Erlang (SE) Chains

DOI10.1287/OPRE.41.5.903MaRDI QIDQ4286470zbMATH OpenOpenAlexFDO

Authors Gabriel Bitran, Sriram Dasu

Publication date 6 April 1994

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainsopen queueing networksphase renewal processespoint processesSuper-Erlang chains

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues
• Superposition of Markov renewal processes and applications
• Approximating a class of superposition processes
• The superposition of discrete-time Markov renewal processes with an application to statistical multiplexing of bursty traffic sources.
• Superposition of renewal processes

Cited in

(6)

• A review of open queueing network models of manufacturing systems
• Class dependent departure process from multiclass phase queues: Exact and approximate analyses
• Higher order approximations for the single server queue with splitting, merging and feedback
• Jitter analysis of an MMPP-2 tagged stream in the presence of an MMPP-2 background stream
• Higher order approximations for tandem queueing networks
• Re-direction in queueing networks with two customer types: the inter-departure analysis

This page was built for publication: Approximating Nonrenewal Processes by Markov Chains: Use of Super-Erlang (SE) Chains

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