A limit theorem for priority queues in heavy traffic
- 1 December 1973
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 10 (4), 907-912
- https://doi.org/10.2307/3212396
Abstract
A single server, two priority queueing system is studied under the heavy traffic condition where the system traffic intensity is either at or near its critical value. An approximation is developed for the transient distribution of the low priority customers' virtual waiting time process. This result is stated formally as a limit theorem involving a sequence of systems whose traffic intensities approach the critical value.Keywords
This publication has 12 references indexed in Scilit:
- The heavy traffic approximation for single server queues in seriesJournal of Applied Probability, 1973
- Weak convergence theorems for priority queues: preemptive-resume disciplineJournal of Applied Probability, 1971
- The virtual waiting time of the GI/G/1 queue in heavy trafficAdvances in Applied Probability, 1971
- Work-conserving prioritiesJournal of Applied Probability, 1970
- Multiple channel queues in heavy traffic. IAdvances in Applied Probability, 1970
- Multiple channel queues in heavy traffic. II: sequences, networks, and batchesAdvances in Applied Probability, 1970
- Multiple channel queues in heavy traffic. II: sequences, networks, and batchesAdvances in Applied Probability, 1970
- Some Limit Theorems in the Theory of Mass Service, II Multiple Channels SystemsTheory of Probability and Its Applications, 1965
- The single server queue in heavy trafficMathematical Proceedings of the Cambridge Philosophical Society, 1961
- Convergence of Random Processes and Limit Theorems in Probability TheoryTheory of Probability and Its Applications, 1956