M/M/1 Queueing System with Non-preemptive Priority
Optimization and Control
2009-02-13 v1 Probability
Abstract
The performance of non-preemptive M/M/1 queueing system with two priority is analyzed. By using complementary variable method to make vector Markov process and analyzing the state-change equations of the queueing system, the generating function of two kinds of customers'length distribution are derived under non-preemptive priority .Through further discussion, the probability of the server that it is working or free and average length of two kinds of customers are also derived.
Keywords
Cite
@article{arxiv.0902.2086,
title = {M/M/1 Queueing System with Non-preemptive Priority},
author = {Zhao Guo-xi and Hu Qi-Zhou},
journal= {arXiv preprint arXiv:0902.2086},
year = {2009}
}
Comments
8 pages