Monotonicity in the Limited Processor-Sharing Queue

Abstract

We study a processor-sharing queue with a limited number of service positions and an infinite buffer. The occupied service positions share an underlying resource. We prove that for service times with a decreasing failure rate, the queue length is stochastically decreasing in the number of service positions, and that for service times with an increasing failure rate, the queue length is stochastically increasing. We show that a similar result holds for the foreground-background queue. The queue length distributions and their decay rates are compared to these in other queueing models with and without restrictions on the number of service positions.

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 — 13 citations exist upstream.

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