Application of level crossing analysis to discrete state processes in queueing systems

Abstract

Abstract In this paper we introduce a discrete state level crossing analysis and present some basic results and a key theorem of level crossings. We illustrate the fertility of the discrete state level crossing analysis by applying it to queueing systems with (i) bulk arrival, (ii) instantaneous feedback, (iii) limited waiting space, and (iv) to machine interference problems.

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

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