We study the matched queueing system GIoPH/PH/1, where the type-I input is a renewal process, the type-II input is a PH renewal process, and the service times are i. i. d. random variables with PH-distributions. Fir...We study the matched queueing system GIoPH/PH/1, where the type-I input is a renewal process, the type-II input is a PH renewal process, and the service times are i. i. d. random variables with PH-distributions. First, a condition is given for the stationarity of the system. Then the distributions of the number of type-I customers at the arrival epoches of type-I customers and the number of type-I customers at an arbitrary epoch are derived. We also discuss the occupation time and the waiting time. Their L. S. transforms are derived. Finally, we discuss some problems in numerical computation.展开更多
文摘We study the matched queueing system GIoPH/PH/1, where the type-I input is a renewal process, the type-II input is a PH renewal process, and the service times are i. i. d. random variables with PH-distributions. First, a condition is given for the stationarity of the system. Then the distributions of the number of type-I customers at the arrival epoches of type-I customers and the number of type-I customers at an arbitrary epoch are derived. We also discuss the occupation time and the waiting time. Their L. S. transforms are derived. Finally, we discuss some problems in numerical computation.