Scheduling in polling systems in heavy traffic

R. Bekker, J.L. Dorsman, R.D. van der Mei, P. Vis, E.M.M. Winands

Research output: Contribution to JournalArticleAcademicpeer-review


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.
Original languageEnglish
JournalACM Sigmetrics Performance Evaluation Review
Publication statusPublished - 2013


Dive into the research topics of 'Scheduling in polling systems in heavy traffic'. Together they form a unique fingerprint.

Cite this