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
- EP ID EP45725
- DOI http://dx.doi.org/10.4108/eai.14-12-2015.2262578
- Views 298
- Downloads 0
Notification Mechanisms In Second-Screen Scenarios - Towards a Balanced User Experience
As technological devices surrounding the television are changing, so are viewers’ habits. When the interactive Television industry turns its focus to the development of second-screen applications, this paper reports on a...
A Novel Stackelberg-Bertrand Game Model for Pricing Content Provider
With the popularity of smart devices such as smartphone, tablet, contents that traditionally be viewed on a personal computer, can also be viewed on these smart devices. The demand for contents thus is increasing year by...
A Scheme for Collaboratively Processing Nearest Neighbor Queries in Oblivious Storage
Security concerns are a substantial impediment to the wider deployment of cloud storage. There are two main concerns on the confidentiality of outsourced data: i) protecting the data, and ii) protecting the access patter...
Reinforcement Learning with Internal Reward for Multi-Agent Cooperation: A Theoretical Approach
This paper focuses on a multi-agent cooperation which is generally difficult to be achieved without sufficient information of other agents, and proposes the reinforcement learning method that introduces an internal rewar...
Harnessing Context for Vandalism Detection in Wikipedia
The importance of collaborative social media (CSM) applications such as Wikipedia to modern free societies can hardly be overemphasized. By allowing end users to freely create and edit content, Wikipedia has greatly faci...