Abstract
This paper studies the Heavy Traffic (HT) joint distribution of queue lengths in an Input-queued switch (IQ switch) operating under the MaxWeight scheduling policy. IQ switchserve as representative of SPNs that do not satisfy the socalled 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 is known in the literature. In this paper, we develop the Transform method to study the joint distribution of queue lengths in non-CRP systems. The key challenge is in solving an implicit functional equation involving the Laplace transform of the HT limiting distribution. For the general n x n IQ switch that has n2 queues, under a conjecture on uniqueness of the solution of the functional equation, we obtain an exact joint distribution of the HT limiting queue-lengths in terms of a non-linear combination of 2n iid exponentials.
- D. A. Hurtado Lange and S. T. Maguluri. Heavy-traffic analysis of queueing systems with no complete resource pooling. Mathematics of Operations Research, 47(4):3129--3155, 2022.Google ScholarDigital Library
- P. Jhunjhunwala and S. T. Maguluri. Heavy traffic distribution of queueing systems without resource pooling. Preprint arXiv:2206.06504, 2022.Google Scholar
- S. T. Maguluri and R. Srikant. Heavy traffic queue length behavior in a switch under the maxweight algorithm. Stochastic Systems, 6(1):211--250, 2016.Google ScholarCross Ref
Index Terms
- Heavy Traffic Joint Queue Length Distribution withoutResource Pooling
Recommendations
Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
In this paper, we study a multiple class discriminatory processor-sharing queue. The queue is assumed to have Poisson input and exponentially distributed service times. In this discipline there are K classes of customers. When there are n i ...
Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues
Performance 2005We obtain a decomposition result for the steady state queue length distribution in egalitarian processor-sharing (PS) models. In particular, for multi-class egalitarian PS queues, we show that the marginal queue length distribution for each class equals ...
Tail asymptotics for the queue length in an M/G/1 retrial queue
In this paper, we study the tail behavior of the stationary queue length of an M/G/1 retrial queue. We show that the subexponential tail of the stationary queue length of an M/G/1 retrial queue is determined by that of the corresponding M/G/1 queue, and ...
Comments