Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
From MaRDI portal
Publication:2786424
DOI10.1239/aap/1449859797zbMath1333.60196MaRDI QIDQ2786424
No author found.
Publication date: 12 February 2016
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aap/1449859797
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Polling: past, present, and perspective, Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sojourn times in a processor sharing queue with multiple vacations
- A two-queue polling model with two priority levels in the first queue
- Mean value analysis for polling systems
- Handling load with less stress
- Generalized trapezoidal distributions
- The equivalence between processor sharing and service in random order.
- Web server performance modeling
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- The impact of scheduling policies on the waiting-time distributions in polling systems
- Mathematical methods to study the polling systems
- Towards a unifying theory on branching-type polling systems in heavy traffic
- Polling Systems in Heavy Traffic: A Bessel Process Limit
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
- Symbolic higher-order moments of the waiting time in an M/G/1 queue with random order of service
- On the M/G/1 Queue with Rest Periods and Certain Service-Independent Queueing Disciplines
- Polling systems with periodic server routeing in heavy traffic: distribution of the delay
- WAITING TIME ANALYSIS OF M^X/G/1 QUEUES WITH/WITHOUT VACATIONS UNDER RANDOM ORDER OF SERVICE DISCIPLINE
- Distribution of the delay in polling systems in heavy traffic
- Introduction to Queueing
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
- Polling systems with switch-over times under heavy load: Moments of the delay
