Tail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
From MaRDI portal
Publication:1569712
DOI10.1023/A:1019161120564zbMath0942.90019MaRDI QIDQ1569712
Publication date: 5 July 2000
Published in: Queueing Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)
Related Items (9)
Efficient analysis of the MMAP[\(K\)/PH[\(K\)]/1 priority queue] ⋮ Priority queueing systems: from probability generating functions to tail probabilities ⋮ Identifiability of the \(\mathrm{MAP}_2/\mathrm{G}/1\) queueing system ⋮ Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue ⋮ Resource allocation for end-to-end qos provisioning in a hybrid wireless WCDMA and wireline IP-based DiffServ network ⋮ Class clustering destroys delay differentiation in priority queues ⋮ Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue ⋮ Light-tailed asymptotics of stationary probability vectors of Markov chains of GI/G/1 type ⋮ A Direct Approach to a First-Passage Problem with Applications in Risk Theory
This page was built for publication: Tail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
