Scheduling in polling systems in heavy traffic
| Authors |
|
|---|---|
| Publication date | 2013 |
| Journal | Performance Evaluation Review |
| Volume | Issue number | 41 | 2 |
| Pages (from-to) | 41-43 |
| Organisations |
|
| 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. |
| Document type | Article |
| Note | Special issue on the 31st international symposium on computer performance, modeling, measurements and evaluation (IFIPWG 7.3 Performance 2013) |
| Language | Dutch |
| Published at |
https://doi.org/10.1145/2518025.2518032
(Final published version)
|
| Permalink to this page | |