Heavy Traffic Joint Queue Length Distribution without Resource Pooling

arXiv2206.06504MaRDI QIDQ6401974FDOQ6401974

Authors: Prakirt Raj Jhunjhunwala, Siva Theja Maguluri 

Publication date: 13 June 2022

Abstract: This paper studies the heavy-traffic joint distribution of queue lengths in two stochastic processing networks (SPN), viz., an input-queued switch operating under the MaxWeight scheduling policy and a two-server parallel server system called the $mathcalN$-system. These two systems serve as representatives of SPNs that do not satisfy the so-called Complete Resource Pooling (CRP) condition, and consequently exhibit a multidimensional State Space Collapse (SSC). Except in special cases, only mean queue lengths of such non-CRP systems are known in the literature. In this paper, we develop the transform method to study non-CRP systems. The key challenge is in solving an implicit functional equation involving the Laplace transform of the heavy-traffic limiting distribution. For the $mathcalN$-system and a special case of an input-queued switch involving only three queues, we obtain the exact limiting heavy-traffic joint distribution in terms of a linear transformation of two iid exponentials. We then consider the general $nimesn$ input-queued switch that has $n^2$ queues. Under a conjecture on uniqueness of the solution of the functional equation, we obtain an exact joint distribution of the heavy-traffic limiting queue-lengths in terms of a non-linear transformation of $2n$ iid exponentials.

This page was built for publication: Heavy Traffic Joint Queue Length Distribution without Resource Pooling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401974)