A fitting algorithm for Markov-modulated poisson processes having two arrival rates

[1]  M. Neuts.  The caudal characteristic curve of queues , 1984, Advances in Applied Probability.

[2]  Ward Whitt,et al.  Approximating a point process by a renewal process , 1981 .

[3]  P. Pawlita,et al.  Traffic Measurements in Data Networks, Recent Measurement Results, and Some Implications , 1981, IEEE Trans. Commun..

[4]  H. Heffes,et al.  A class of data traffic processes — covariance function characterization and related queuing results , 1980, The Bell System Technical Journal.

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

[6]  M. Neuts.  A versatile Markovian point process , 1979, Journal of Applied Probability.

[7]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[8]  A. Kuczura,et al.  A Method of Moments for the Analysis of a Switched Communication Network's Performance , 1977, IEEE Trans. Commun..

[9]  Anatol Kuczura,et al.  The interrupted poisson process as an overflow process , 1973 .

[10]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[11]  L. Baum,et al.  An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology , 1967 .

[12]  R. Pyke.  Markov Renewal Processes with Finitely Many States , 1961 .

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

[14]  T. Downs,et al.  Decomposition of Traffic in Loss Systems with Renewal Input , 1979, IEEE Trans. Commun..

[15]  Debasis Mitra,et al.  Formulas on queues in burst processes — II , 1973 .