Functional limit theorems for Gaussian-fed queueing network in light and heavy traffic
Abstract: We consider a queueing network operating under a strictly upper-triangular routing matrix with per column at most one non-negative entry. The root node is fed by a Gaussian process with stationary increments. Our aim is to characterize the distribution of the multivariate stationary workload process under a specific scaling of the queue's service rates. In the main results of this paper we identify, under mild conditions on the standard deviation function of the driving Gaussian process, in both light and heavy traffic parameterization, the limiting law of an appropriately scaled version (in both time and space) of the joint stationary workload process. In particular, we develop conditions under which specific queueing processes of the network effectively decouple, i.e., become independent in the limiting regime.
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.