Polling with Batch Service

Onno Boxma · Jan van der Wal · Uri Yechiali

39 citations0/0 files storedStochastic Models

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Optimization and Search Problems Age of Information Optimization

Abstract

This article considers a batch service polling system. We first study the case in which the server visits the queues cyclically, considering three different service regimes: gated, exhaustive, and globally gated. We subsequently analyze the case (the so-called “Israeli Queue”) in which the server first visits the queue with the “oldest” customer. In both cases, queue lengths and waiting times are the main performance measures under consideration.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 39 citations exist upstream.

References

1987Pseudo-conservation laws in cyclic-service systems 1993Polling systems and multitype branching processes 2000Analysis and Application of Polling Models 1979The Distribution of Queueing Network States at Input and Output Instants

Cited by

2021Polling Systems and Their Application to Telecommunication Networks 2013The Israeli Queue with Priorities 2014The Israeli queue with retrials

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.