M/M/1 Queueing System with Non-preemptive Priority

Details M/M/1 Queueing System with Non-preemptive Priority M/M/1 Queueing System with Non-preemptive Priority

2009-02-12

arxiv.org/abs/0902.2086v1

Mathematics

Optimization and Control

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

M/M/1 Queueing System with Non-preemptive Priority does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with M/M/1 Queueing System with Non-preemptive Priority, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and M/M/1 Queueing System with Non-preemptive Priority will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556336