Scheduling in polling systems in heavy traffic

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

doi:10.1145/2518025.2518032

Scheduling in polling systems in heavy traffic

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

Mathematics

Research output: Contribution to Journal › Article › Academic › peer-review

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.

Original language	English
Journal	ACM Sigmetrics Performance Evaluation Review
DOIs	https://doi.org/10.1145/2518025.2518032
Publication status	Published - 2013

Access to Document

10.1145/2518025.2518032

Handle.net

Persistent link

Cite this

@article{d592b23c1bdd4e81b22ab45187ef4626,

title = "Scheduling in polling systems in heavy traffic",

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.",

author = "R. Bekker and J.L. Dorsman and {van der Mei}, R.D. and P. Vis and E.M.M. Winands",

year = "2013",

doi = "10.1145/2518025.2518032",

language = "English",

journal = "ACM Sigmetrics Performance Evaluation Review",

issn = "0163-5999",

publisher = "Association for Computing Machinery (ACM)",

}

TY - JOUR

T1 - Scheduling in polling systems in heavy traffic

AU - Bekker, R.

AU - Dorsman, J.L.

AU - van der Mei, R.D.

AU - Vis, P.

AU - Winands, E.M.M.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

U2 - 10.1145/2518025.2518032

DO - 10.1145/2518025.2518032

M3 - Article

JO - ACM Sigmetrics Performance Evaluation Review

JF - ACM Sigmetrics Performance Evaluation Review

SN - 0163-5999

ER -

Scheduling in polling systems in heavy traffic

Abstract

Access to Document

Handle.net

Fingerprint

Cite this