Critically loaded k-limited polling systems

Journal Title: EAI Endorsed Transactions on Collaborative Computing - Year 2016, Vol 2, Issue 10

Abstract

We consider a two-queue polling model with switch-over times and k-limited service (serve at most ki 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( ≥ 2) 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.

Authors and Affiliations

Marko Boon, Erik Winands

Keywords

Related Articles

Impact of window to walls ratios on thermal comfort and energy consumption in tropical zone

This paper investigated the impact of Window to Wall Ratios (WWR) an the thermal comfort and energy lighting demand of a building in tropical zone. Simulations were carried out for a reference office proposed by Task 27...

Guest Editorial: Selected Papers from IEEE IEEE/EAI CollaborateCom 2013

This issue of EAI Transactions on Collaborative Computing includes extended versions of articles selected from the program of the 9th IEEE International Conference on Collaborative Computing: Networking, Applications...

A QoE Aware Fairness Bi-level Resource Allocation Algorithm for Multiple Video Streaming in WLAN

With the increasing of smart devices such as mobile phones and tablets, the scenario of multiple video users watching video streaming simultaneously in one wireless local area network (WLAN) becomes more and more popular...

An Augmented User Model for Personalized Search in Collaborative Social Tagging Systems

Alongside the enormous volume of user-generated content posted to World Wide Web, there exists a thriving demand for search personalization services. To provide personalized services, a user model is usually required. We...

A Collaboration Model for Community-Based Software Development with Social Machines

Crowdsourcing is generally used for tasks with minimal coordination, providing limited support for dynamic reconfiguration. Modern systems, exemplified by social ma chines, are subject to continual flux in both the clien...

Download PDF file
  • EP ID EP45725
  • DOI http://dx.doi.org/10.4108/eai.14-12-2015.2262578
  • Views 275
  • Downloads 0

How To Cite

Marko Boon, Erik Winands (2016). Critically loaded k-limited polling systems. EAI Endorsed Transactions on Collaborative Computing, 2(10), -. https://europub.co.uk/articles/-A-45725