A law of iterated logarithm for multiclass queues with preemptive priority service discipline
- 12 September 2014
- journal article
- Published by Springer Nature in Queueing Systems
- Vol. 79 (3-4) , 251-291
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Strong approximations for multiclass feedforward queueing networksThe Annals of Applied Probability, 2000
- Strong Approximations of Irreducible Closed Queueing NetworksAdvances in Applied Probability, 1997
- On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit ModelsThe Annals of Applied Probability, 1995
- Strong approximations for priority queues; head-of-the-line-first disciplineQueueing Systems, 1992
- Departures from Many Queues in SeriesThe Annals of Applied Probability, 1991
- Strong approximations for multiple channel queues in heavy trafficJournal of Applied Probability, 1990
- An approximation of stopped sums with applications in queueing theoryAdvances in Applied Probability, 1987
- Sufficient conditions for functional-limit-theorem versions ofL = ?WQueueing Systems, 1987
- A limit theorem for priority queues in heavy trafficJournal of Applied Probability, 1973
- Weak convergence theorems for priority queues: preemptive-resume disciplineJournal of Applied Probability, 1971