Exact analysis of transient behavior of finite-capacity MAP-driven queues
Abstract
This paper studies the workload distribution of a finite-capacity queue driven by a spectrally one-sided Markov additive process (MAP). Our main result provides the Laplace-Stieltjes transform of the workload at an exponentially distributed time, thereby uniquely characterizing its transient distribution. The proposed approach combines several decompositions with established fluctuation-theoretic results for spectrally one-sided L\'evy processes. For the special case of Markov-modulated compound Poisson input, we additionally derive results for the idle time and the cumulative amount of lost work. We conclude this paper with a series of numerical experiments.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.