Exact tail asymptotics in a priority queue -- characterizations of the non-preemptive model
From MaRDI portal
Publication:660140
DOI10.1007/s11134-011-9252-zzbMath1235.60131OpenAlexW4250765222MaRDI QIDQ660140
Publication date: 26 January 2012
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-011-9252-z
generating functionsdecay ratelight tailnon-preemptive priority queueexact tail asymptoticsgeometric decaydouble QBD process
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Asymptotic representations in the complex plane (30E15)
Related Items
Heavy-traffic asymptotics of a priority polling system with threshold service policy ⋮ Asymptotics for the stationary distribution in a discrete-time two-dimensional quasi-birth-and-death process ⋮ Analysis of the queue lengths in a priority retrial queue with constant retrial policy ⋮ A multi-objective fuzzy queuing priority assignment model ⋮ On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency
Cites Work
- Unnamed Item
- Rare event asymptotics for a random walk in the quarter plane
- Asymptotics for M/G/1 low-priority waiting-time tail probabilities
- Exact tail asymptotics in a priority queue -- characterizations of the preemptive model
- A matrix-analytic solution for the DBMAP/PH/ 1 priority queue
- Priority queueing systems: from probability generating functions to tail probabilities
- Tail Decay Rates in Double QBD Processes and Related Reflected Random Walks
- Singularity Analysis of Generating Functions
- Analysis of a non-preemptive priority multiserver queue
- Computation of Steady-State Probabilities for M/M/1 Priority Queues
- Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue
- AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE
- A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS