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

We study a class of point processes generated by transitions in Markov chains. We are primarily concerned with approximating superposed phase renewal processes by these point processes. We identify a subclass of Markov chains that we call Super-Erlang chains. These chains have special properties that facilitate the development of approximations. We outline an approximation procedure and provide computational results that demonstrate the potential of the approach. The primary motivation for this study is the analysis of open queueing networks.

[1]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[2]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

[3]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[4]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[5]  Susan L. Albin,et al.  Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues , 1984, Oper. Res..

[6]  Michael A. Johnson,et al.  Matching moments to phase distri-butions: mixtures of Erlang distribution of common order , 1989 .

[7]  Marcel F. Neuts,et al.  The superposition of two PH-renewal processes , 1986 .

[8]  M. Rudemo.  Point processes generated by transitions of Markov chains , 1973 .

[9]  W. Whitt,et al.  Performance of the Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[10]  M. Neuts.  Renewal processes of phase type , 1978 .

[11]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

[12]  Marcel F. Neuts.  A new informative embedded Markov renewal process for the PH/G/1 queue , 1986, Advances in Applied Probability.

[13]  Ward Whitt,et al.  Approximating a Point Process by a Renewal Process, I: Two Basic Methods , 1982, Oper. Res..

[14]  A. W. Kemp,et al.  Applied Probability and Queues , 1989 .

[15]  S. Albin.  On Poisson Approximations for Superposition Arrival Processes in Queues , 1982 .

[16]  David M. Lucantoni,et al.  A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance , 1986, IEEE J. Sel. Areas Commun..

[17]  L. Mirsky,et al.  The Theory of Matrices , 1961, The Mathematical Gazette.

[18]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[19]  M. A. Johnson,et al.  Matching moments to phase distributions: nonlinear programming approaches , 1990 .

[20]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

[21]  V. Ramaswami.  The N/G/1 queue and its detailed analysis , 1980, Advances in Applied Probability.

[22]  W. D. Ray,et al.  Stochastic Modelling and Analysis: A Computational Approach. , 1986 .

[23]  J. A. Buzacott,et al.  Open queueing network models of dynamic job shops , 1981 .

[24]  M. Neuts,et al.  A single-server queue with server vacations and a class of non-renewal arrival processes , 1990, Advances in Applied Probability.

[25]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[26]  M. Neuts.  A Versatile Markovian Point Process , 1979 .