A Two-Queue Polling Model with a Threshold Service Policy

Authors:
Onno J. Boxma;Ger Koole;Isi Mitrani
Affiliations:
-;-;-
Venue:
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Year:
1995

Citing 4
Cited 4

On the optimal control of two queues with server setup times and its analysis

SIAM Journal on Computing
On optimal polling policies

Queueing Systems: Theory and Applications - Polling models
Queueing analysis of a threshold based priority scheme for ATM networks

IEEE/ACM Transactions on Networking (TON)
Performance Analysis and Optimization with the Power-Series Algorithm

Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93

A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime

Queueing Systems: Theory and Applications
THRESHOLD POLICIES FOR A SINGLE-SERVER QUEUING NETWORK

Probability in the Engineering and Informational Sciences
An Analytical Approach to Providing Controllable Differentiated Quality of Service in Web Servers

IEEE Transactions on Parallel and Distributed Systems
A class-based scheme for E-commerce web servers: Formal specification and performance evaluation

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a model of two M/M/1 queues, served by a single server. The service policy for this polling model is of threshold type: the server serves queue 1 exhaustively, and does not remain at an empty queue if the other one is non-empty. It switches from queue 2 to queue 1 when the size of the latter queue reaches some level T. All switches are instantaneous. We determine the joint queue length distribution, both using analytic techniques and using the power series algorithm. The results are used to obtain further insight into the quality of threshold policies for polling models.