2000 character limit reached
Stability conditions of the $N$-model with a waiting time dependent threshold on the diagonal
Published 14 Nov 2025 in math.PR | (2511.11488v1)
Abstract: We consider the $N$-model queueing system with a waiting time dependent threshold on the diagonal: the service discipline is First--Come--First--Served, but type-1 jobs can only be served by server 2 if their waiting time exceeds a deterministic threshold. We prove the necessary and sufficient stability conditions for this model -- an intuitive result that has not been established in literature up to this point. Our proof relies on coupling the queue length process to a carefully constructed upper (and lower) bound system, and establishing stochastic dominance for the queue length process.
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.