TY - JOUR
T1 - The Israeli queue with infinite number of groups
AU - Perel, Nir
AU - Yechiali, Uri
N1 - Publisher Copyright:
© Cambridge University Press 2013.
PY - 2014
Y1 - 2014
N2 - The so called Israeli Queue is a single server polling system with batch service of an unlimited size, where the next queue to be visited is the one in which the first customer in line has been waiting for the longest time. The case with finite number of queues (groups) was introduced by Boxma, Van der Wal and Yechiali [3]. In this paper we extend the model to the case with a (possibly) infinite number of queues. We analyze the M/M/1, M/M/c, and M/M/1/N - type queues, as well as a priority model with (at most) M high-priority classes and a single lower priority class. In all models we present an extensive probabilistic analysis and calculate key performance measures.
AB - The so called Israeli Queue is a single server polling system with batch service of an unlimited size, where the next queue to be visited is the one in which the first customer in line has been waiting for the longest time. The case with finite number of queues (groups) was introduced by Boxma, Van der Wal and Yechiali [3]. In this paper we extend the model to the case with a (possibly) infinite number of queues. We analyze the M/M/1, M/M/c, and M/M/1/N - type queues, as well as a priority model with (at most) M high-priority classes and a single lower priority class. In all models we present an extensive probabilistic analysis and calculate key performance measures.
UR - http://www.scopus.com/inward/record.url?scp=84910677650&partnerID=8YFLogxK
U2 - 10.1017/S0269964813000296
DO - 10.1017/S0269964813000296
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84910677650
SN - 0269-9648
VL - 28
SP - 1
EP - 19
JO - Probability in the Engineering and Informational Sciences
JF - Probability in the Engineering and Informational Sciences
IS - 1
ER -