Heavy-traffic asymptotic formulas for the multiclass M{}^X/G/1 queue
classification
🧮 math.PR
keywords
queuejointformulasheavy-trafficlengthasymptoticconditionsdistribution
read the original abstract
This paper studies the heavy-traffic asymptotics for the multiclass FIFO M${}^X$/G/1 queue. We first derive the probability generating function of the joint queue length distribution. Using the probability generating function, we then present heavy-traffic asymptotic formulas for the joint queue length distribution and its joint moments (i.e., the joint queue length moments). These formulas are proved under weaker conditions on the service time distributions, compared to the ones reported in the literature. This fact leads us to conjectures that some of the conditions made in the literature are relaxed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.