Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T12:59:33.821Z Has data issue: false hasContentIssue false

THE ISRAELI QUEUE WITH INFINITE NUMBER OF GROUPS

Published online by Cambridge University Press:  19 November 2013

Nir Perel
Affiliation:
Department of Statistics and Operations Research, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv, Israel. E-mail: perelnir@post.tau.ac.il; uriy@post.tau.ac.il
Uri Yechiali
Affiliation:
Department of Statistics and Operations Research, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv, Israel. E-mail: perelnir@post.tau.ac.il; uriy@post.tau.ac.il
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2013