2000 character limit reached
Asymptotic Product-form Steady-state for Multiclass Queueing Networks: A Reentrant Line Case Study
Published 1 Nov 2024 in math.PR | (2411.00930v1)
Abstract: This paper serves as a companion to "Asymptotic Product-form Steady-state for Multiclass Queueing Networks with SBP Service Policies in Multi-scale Heavy Traffic." In this short paper, we illustrate the main results of the main paper through a two-station, five-class reentrant line under a specific static buffer priority policy, while avoiding heavy notations. For this example, we prove the asymptotic steady-state limit and uniform moment bound under general inter-arrival and service time distributions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.