Tempered Erlang Queue with Multiple Arrivals

Abstract

In this paper, we introduce and study a time-changed variant of the Erlang queue with multiple arrivals where the time-changing component used is the first hitting time of a tempered stable subordinator. The system of fractional difference-differential equations that governs its state probabilities is derived which is solved to obtain their explicit expressions. An equivalent representation in terms of phases and the mean queue length is obtained. For a particular case, the distribution of inter-arrival times, inter-phase times, sojourn times, busy period and that of conditional waiting times are derived.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…