Single-Server Queues With State-Dependent Feedback

Abstract

In a M/G/1 queue, suppose that units after being served either immediately join the queue again with some probability or depart permanently with the complementary probability. Such a probability is conditioned upon whether or not the previous unit fed back, upon the increments in the queue length between two consecutive service completions, and upon the length of service received. For such a system, the stationary queue length and departure processes are characterized. The busy period distribution is also worked out. Single-server queues with feedback are applied to model computer time-sharing systems.

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

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