Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue
From MaRDI portal
Publication:4025915
DOI10.1287/ijoc.2.3.211zbMath0760.60085OpenAlexW2068353037MaRDI QIDQ4025915
Kumar S. Narayanan, Edward P. C. Kao
Publication date: 18 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2.3.211
numerical examplesquasi-birth-and-death processsteady-state probabilitiesnonpreemptive priority exponential queue
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
A preemptive priority queue with balking ⋮ Performance evaluation and analysis of a discrete queue system with multiple working vacations and non-preemptive priority ⋮ Exact tail asymptotics in a priority queue -- characterizations of the non-preemptive model ⋮ Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type ⋮ Exact tail asymptotics in a priority queue -- characterizations of the preemptive model ⋮ A Nonpreemptive Priority System with Fuzzy Parameters ⋮ MULTI-CLASS RESOURCE SHARING WITH PREEMPTIVE PRIORITIES ⋮ Waiting times of a finite-capacity multi-server model with non-preemptive priorities ⋮ An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities ⋮ Analysis of nonpreemptive priority queues with multiple servers and two priority classes ⋮ Exact tail asymptotics for a discrete-time preemptive priority queue ⋮ Multi-server queueing systems with multiple priority classes
