A Two-Queue Polling Model with Two Priority Levels in the First Queue

Authors:
Marko A. Boon;Ivo J. Adan;Onno J. Boxma
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600MB;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600MB;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600MB
Venue:
Discrete Event Dynamic Systems
Year:
2010

Citing 10
Cited 0

Workloads and waiting times in single-server systems with multiple customer classes

Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems

Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Polling systems with synchronization constraints

Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Polling Best Effort Traffic in Bluetooth

Wireless Personal Communications: An International Journal
Performance evaluation of Bluetooth polling schemes: an analytical approach

Mobile Networks and Applications
Mean value analysis for polling systems

Queueing Systems: Theory and Applications
Scheduling in polling systems

Performance Evaluation
A two-queue polling model with two priority levels in the first queue

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Polling-based protocols for packet voice transport over IEEE 802.11 wireless local area networks

IEEE Wireless Communications
Performance analysis and enhancements for IEEE 802.11e wireless networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and low priority customers. For this situation the following service disciplines are considered: gated, globally gated, and exhaustive. We study the cycle time distribution, the waiting times for each customer type, the joint queue length distribution at polling epochs, and the steady-state marginal queue length distributions for each customer type.