No open-access location is known for this record yet.
No open-access location is known for this record yet.
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.
Loading…
Stored only when both papers are in the corpus — 49 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.