Priority queueing systems are widely used to model communication networks with several classes of messages, and a single transmission channel. An iterative numerical technique for the evaluation of queue length distributions is applied to multi-queue systems with one server and multi-priority queue discipline. The technique is based on power series expansions of the state probabilities, as a function of the load of the system. The convergence of the series is accelerated by applying an adopted form of the bilinear mapping, introduced by Blanc.
Talat, N. (2000). Performance Analysis of Preemptive Priority Multi-queue Systems and Poisson Arrivals by Means of Power Series Algorithm. The Egyptian Statistical Journal, 44(1), 11-25. doi: 10.21608/esju.2000.313820
MLA
Ndia Wagieh Talat. "Performance Analysis of Preemptive Priority Multi-queue Systems and Poisson Arrivals by Means of Power Series Algorithm", The Egyptian Statistical Journal, 44, 1, 2000, 11-25. doi: 10.21608/esju.2000.313820
HARVARD
Talat, N. (2000). 'Performance Analysis of Preemptive Priority Multi-queue Systems and Poisson Arrivals by Means of Power Series Algorithm', The Egyptian Statistical Journal, 44(1), pp. 11-25. doi: 10.21608/esju.2000.313820
VANCOUVER
Talat, N. Performance Analysis of Preemptive Priority Multi-queue Systems and Poisson Arrivals by Means of Power Series Algorithm. The Egyptian Statistical Journal, 2000; 44(1): 11-25. doi: 10.21608/esju.2000.313820
)
View on SCiNiTO