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

DOI10.1287/OPRE.41.5.903zbMATH Open0790.60073OpenAlexW1987934592MaRDI QIDQ4286470FDOQ4286470

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

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

zbMATH Keywords

point processesMarkov chainsopen queueing networksphase renewal 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)

Cited In (5)

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

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)