Renewal processes of phase type
暂无分享,去创建一个
This paper discusses a class of analytically and numerically tractable renewal processes, which generalize the Poisson process. When used to describe interarrival or service times in queues, these renewal processes lead to computationally explicit solutions which involve only real arithmetic. Previous modifications of the Poisson process, based on the Erlang or the hyperexponential distributions, appear as particular cases.
[1] Marcel F. Neuts,et al. Computational uses of the method of phases in the theory of queues , 1975 .
[2] M. Neuts. Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector , 1978, Advances in Applied Probability.