On BASTA for Discrete-Time Queues
Abstract
We address the issue of Bernoulli/Geometric arrivals see time-averages, BASTA, in discrete-time queues when using a variety of scheduling rules. It is well-known that BASTA/ ASTA holds in the framework of a discrete-time process with an imbedded arrival process without regard to scheduling rules. However, when scheduling rules are invoked, it is not always clear whether arrivals see time averages as asserted by the general theory. We resolve this issue so that BASTA/ ASTA holds regardless of the scheduling rule at play.
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.