Comparing counting processes and queues

Abstract

Several partial orderings of counting processes are introduced and applied to compare stochastic processes in queueing models. The conditions for the queueing comparisons involve the counting processes associated with the interarrival and service times. The two queueing processes being compared are constructed on the same probability space so that each sample path of one process lies below the corresponding sample path of the other process. Stochastic comparisons between the processes and monotone functionals of the processes follow immediately from this construction. The stochastic comparisons are useful to obtain bounds for intractable systems. For example, the approach here yields bounds for queues with time-dependent arrival rates.

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

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