Scheduling in polling systems in heavy traffic

Authors:
R. Bekker;J. L. Dorsman;R. D. van der Mei;P. Vis;E. M.M. Winands
Affiliations:
VU University Amsterdam, Amsterdam, Netherlands;Eindhoven University of Technology, Eindhoven, Netherlands and Centre for Mathematics and Computer Science, Amsterdam, Netherlands;VU University Amsterdam, Amsterdam, Netherlands and Centre for Mathematics and Computer Science, Amsterdam, Netherlands;VU University Amsterdam, Amsterdam, Netherlands and Centre for Mathematics and Computer Science, Amsterdam, Netherlands;University of Amsterdam, Netherlands
Venue:
ACM SIGMETRICS Performance Evaluation Review - Special issue on the 31st international symposium on computer performance, modeling, measurements and evaluation (IFIPWG 7.3 Performance 2013)
Year:
2013

Citing 7
Cited 0

Analysis of polling systems

Analysis of polling systems
Distribution of the delay in polling systems in heavy traffic

Performance Evaluation
Scheduling in polling systems

Performance Evaluation
Towards a unifying theory on branching-type polling systems in heavy traffic

Queueing Systems: Theory and Applications
Sojourn times in polling systems with various service disciplines

Performance Evaluation
A polling model with multiple priority levels

Performance Evaluation
Polling systems with periodic server routing in heavy traffic: renewal arrivals

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the classical cyclic polling model with Poisson arrivals and with gated service at all queues, but where the local scheduling policies are not necessarily First-Come- First-Served (FCFS). More precisely, we study the waitingtime performance of polling models where the local service order is Last-Come-First-Served (LCFS), Random-Orderof- Service (ROS) or Processor Sharing (PS). Under heavytraffic conditions the waiting times turn out to converge to products of generalized trapezoidal distributions and a gamma distribution.