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

Simple item page
dc.creatorGuo-xi, Zhao
dc.creatorQi-Zhou, Hu
dc.date2009-02-12
dc.date.accessioned2026-07-07T12:40:56Z
dc.date.available2026-07-07T12:40:56Z
dc.descriptionThe 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.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0902.2086
dc.identifierhttp://arxiv.org/abs/0902.2086
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219600
dc.subjectOptimization and Control
dc.subjectProbability
dc.titleM/M/1 Queueing System with Non-preemptive Priority
dc.typetext

Files

Collections

arXiv