Finite queues in parallel under a generalized channel selection rule

Abstract

Consider a queueing system of the following type: random arrivals enter the system, where they are assigned to one of r service channels. Each arrival is then serviced and discharged from the system. The classical results for this class of problems are based upon systems where customers join a single queue and then are randomly assigned to an available server from this queue. (See, for instance, Takács (1962).)

Cite this work

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

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

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