HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES
From MaRDI portal
Publication:5358033
DOI10.1017/S0269964814000278zbMath1370.60170OpenAlexW2166802241MaRDI QIDQ5358033
A. Izagirre, Ina Maria Verloop, Urtzi Ayesta
Publication date: 19 September 2017
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964814000278
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines, Stability of a queue with discriminatory random order service discipline and heterogeneous servers, HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Waiting time asymptotics in the single server queue with service in random order
- The equivalence between processor sharing and service in random order.
- Heavy traffic limits for some queueing networks
- Waiting times in queues with relative priorities
- Heavy-traffic asymptotics for the single-server queue with random order of service
- Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing
- QUEUE LENGTH DISTRIBUTION IN A QUEUE WITH RELATIVE PRIORITIES
- Queue Disciplines in Heavy Traffic
- Applied Probability and Queues
- HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES
- Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
