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

2009/02/12 by Zhao Guo-xi, Guo-xi, Zhao, Hu Qi-Zhou +1
Business, Management and Accounting · Engineering · Mathematics · #Advanced Data Processing Techniques #Advanced Queuing Theory Analysis #math.OC #math.PR

paper · pdf · doi:10.48550/arxiv.0902.2086

8 pages

arxiv created 2009/02/12 · arxiv updated 2009/12/01

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.

Related

• Joint Queue-Length Distribution for the Non-Preemptive Multi-Server Multi-Level Markovian Priority Queue
• Explicit Results for the Distributions of Queue Lengths for a Non-Preemptive Two-Level Priority Queue
• Time-dependent analysis of an M/M/c preemptive priority system with two priority classes
• A 3-Queue Polling System with Join the Shortest -- Serve the Longest Policy
• Analytic Approach to the Non-Preemptive Markovian Priority Queue