Effective bandwidths with priorities
IEEE/ACM Transactions on Networking (TON)
Asymptotics for M/G/1 low-priority waiting-time tail probabilities
Queueing Systems: Theory and Applications
Tail probabilities of low-priority waiting times and queue lengths in {MAP}/{GI}/1 queues
Queueing Systems: Theory and Applications
Tail Asymptotics for HOL Priority Queues Handling a Large Number of Independent Stationary Sources
Queueing Systems: Theory and Applications
The Nonpreemptive Priority Map/G/1 Queue
Operations Research
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Extending the effective bandwidth concept to networks with priority classes
IEEE Communications Magazine
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
We consider a MAP/PH/1 queue with two priority classes and nonpreemptive discipline, focusing on the asymptotic behavior of the tail probability of queue length of low-priority customers. A sufficient condition under which this tail probability decays asymptotically geometrically is derived. Numerical methods are presented to verify this sufficient condition and to compute the decay rate of the tail probability.