As we know,many scholars have been involved in the study of stochastic processes,whichhave a wide range of applications,such as the Markov processes.In the study of Markov pro-cesses,minimal Markov chain(i.e.the minim...As we know,many scholars have been involved in the study of stochastic processes,whichhave a wide range of applications,such as the Markov processes.In the study of Markov pro-cesses,minimal Markov chain(i.e.the minimal homogeneous denumerable Markov process)got most mature.One of the characteristics of this kind of processes is that the stay time展开更多
In this paper, we apply the backward equations of Markov skeleton processes to qucueing systems. The transient distribution of the waiting time of a GI/G/1 queueing system, the transient distribution of the length of... In this paper, we apply the backward equations of Markov skeleton processes to qucueing systems. The transient distribution of the waiting time of a GI/G/1 queueing system, the transient distribution of the length of a GI/G/N queueing system and the transient distribution of the length of queueing networks are obtained.展开更多
文摘As we know,many scholars have been involved in the study of stochastic processes,whichhave a wide range of applications,such as the Markov processes.In the study of Markov pro-cesses,minimal Markov chain(i.e.the minimal homogeneous denumerable Markov process)got most mature.One of the characteristics of this kind of processes is that the stay time
基金the National Natural Sciences Foundation of China (No.10171009) "211 Project"+1 种基金"985 Project"Research Fund for Ph.D Programs of MOE of China (No.20010533001).
文摘 In this paper, we apply the backward equations of Markov skeleton processes to qucueing systems. The transient distribution of the waiting time of a GI/G/1 queueing system, the transient distribution of the length of a GI/G/N queueing system and the transient distribution of the length of queueing networks are obtained.
