The Nonpreemptive Priority MAP/G/1 Queue

DOI10.1287/opre.47.6.917zbMath0986.60087OpenAlexW2149070841MaRDI QIDQ2770131

Tetsuya Takine

Publication date: 7 February 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.47.6.917

zbMATH Keywords

Laplace-Stieltjes transformMarkovian arrival processmatrix analytic methodqueue length distributiongenerating function techniquedelay cycle analysisnonpreemptive priority queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

A UNIFIED QUEUE LENGTH FORMULA FOR BMAP/G/1 QUEUE WITH GENERALIZED VACATIONS ⋮ The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service ⋮ Efficient analysis of the MMAP[\(K\)/PH[\(K\)]/1 priority queue] ⋮ Unified analysis of \(BMAP/G/1\) cyclic polling models ⋮ Analyzing priority queues with 3 classes using tree-like processes ⋮ Asymptotics of waiting time distributions in the accumulating priority queue ⋮ Delay analysis of a two-class priority queue with external arrivals and correlated arrivals from another node ⋮ Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue ⋮ MAP/(PH/PH)/c Queue with Self-Generation of Priorities and Non-Preemptive Service ⋮ Class clustering destroys delay differentiation in priority queues ⋮ Single-server queues with Markov-modulated arrivals and service speed ⋮ Analysis of \(\mathrm{MAP}/\mathrm{PH}_1,\mathrm{PH}_2/1\) queue with vacations and optional secondary services ⋮ The Impact of Self-Generation of Priorities on Multi-Server Queues with Finite Capacity ⋮ A Spectral Method for a Nonpreemptive PriorityBMAP/G/1 QUEUE ⋮ Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue

This page was built for publication: The Nonpreemptive Priority MAP/G/1 Queue