Critically loaded k-limited polling systems

Boon, Marko and Winands, Erik (2016) Critically loaded k-limited polling systems. Critically loaded k-limited polling systems, 2 (10). e1. ISSN 2312-8623

[thumbnail of eai.14-12-2015.2262578.pdf]
Available under License Creative Commons Attribution No Derivatives.

Download (1MB) | Preview


We consider a two-queue polling model with switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$) in each queue. The major benefit of the $k$-limited service discipline is that it - besides bounding the cycle time - effectuates prioritization by assigning different service limits to different queues. System performance is studied in the heavy-traffic regime, in which one of the queues becomes critically loaded with the other queue remaining stable. By using a singular-perturbation technique, we rigorously prove heavy-traffic limits for the joint queue-length distribution. Moreover, it is observed that an interchange exists among the first two moments in service and switch-over times such that the HT limits remain unchanged. Not only do the rigorously proven results readily carry over to $N$($\geq2$) queue polling systems, but one can also easily relax the distributional assumptions. The results and insights of this note prove their worth in the performance analysis of Wireless Personal Area Networks (WPAN) and mobile networks, where different users compete for access to the shared scarce resources.

Item Type: Article
Uncontrolled Keywords: polling model, k-limited, heavy traffic
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
QA75 Electronic computers. Computer science
Depositing User: EAI Editor IV
Date Deposited: 09 Jul 2021 08:27
Last Modified: 09 Jul 2021 08:27

Actions (login required)

View Item
View Item