loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS '95)
A two-queue polling model with a threshold service policy
Durham, North Carolina
January 18-January 20
ISBN: 0-8186-6902-0
ASCII Text
x 
 
O.J. Boxma, G.M. Koole, I. Mitrani, "A two-queue polling model with a threshold service policy," Modeling, Analysis, and Simulation of Computer Systems, International Symposium on, pp. 84, Third IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS '95), 1995.
 
 
BibTex
x
 
@article{ 10.1109/MASCOT.1995.378705,
author = {O.J. Boxma and G.M. Koole and I. Mitrani},
title = {A two-queue polling model with a threshold service policy},
journal ={Modeling, Analysis, and Simulation of Computer Systems, International Symposium on},
volume = {0},
year = {1995},
isbn = {0-8186-6902-0},
pages = {84},
doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOT.1995.378705},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on
TI - A two-queue polling model with a threshold service policy
SN - 0-8186-6902-0
SP
EP
A1 - O.J. Boxma,
A1 - G.M. Koole,
A1 - I. Mitrani,
PY - 1995
KW - performance evaluation; queueing theory; two-queue polling model; threshold service policy; M/M/1 queues; power series algorithm
VL - 0
JA - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on
ER -
 
O.J. Boxma, Fac. of Econ., Tilburg Univ., Netherlands
G.M. Koole, Fac. of Econ., Tilburg Univ., Netherlands
I. Mitrani, Fac. of Econ., Tilburg Univ., Netherlands
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.<>
Index Terms:
performance evaluation; queueing theory; two-queue polling model; threshold service policy; M/M/1 queues; power series algorithm
Citation:
O.J. Boxma, G.M. Koole, I. Mitrani, "A two-queue polling model with a threshold service policy," mascots, pp.84, Third IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.