arXiv:1312.6970 [math.PR]AbstractReferencesReviewsResources
Heavy-traffic asymptotic formulas for the multiclass M${}^X$/G/1 queue
Hiroshi Miyawaki, Hiroyuki Masuyama, Yutaka Takahashi
Published 2013-12-25, updated 2014-04-24Version 2
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.
Comments: This paper has been withdrawn by the author because Conjecture 4.1 has turned out to be not true
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:1412.8006 [math.PR] (Published 2014-12-27)
Analysis and Computation of the Joint Queue Length Distribution in a FIFO Single-Server Queue with Multiple Batch Markovian Arrival Streams
arXiv:1804.07696 [math.PR] (Published 2018-04-20)
Central limit theorems from the roots of probability generating functions
Queue lengths and workloads in polling systems