arXiv Analytics

Sign in

arXiv:1412.8006 [math.PR]AbstractReferencesReviewsResources

Analysis and Computation of the Joint Queue Length Distribution in a FIFO Single-Server Queue with Multiple Batch Markovian Arrival Streams

Hiroyuki Masuyama, Tetsuya Takine

Published 2014-12-27Version 1

This paper considers a work-conserving FIFO single-server queue with multiple batch Markovian arrival streams governed by a continuous-time finite-state Markov chain. A particular feature of this queue is that service time distributions of customers may be different for different arrival streams. After briefly discussing the actual waiting time distributions of customers from respective arrival streams, we derive a formula for the vector generating function of the time-average joint queue length distribution in terms of the virtual waiting time distribution. Further assuming the discrete phase-type batch size distributions, we develop a numerically feasible procedure to compute the joint queue length distribution. Some numerical examples are provided also.

Journal: Stochastic Models, vol. 19, no. 3, pp. 349-381, 2003
Categories: math.PR
Subjects: 60K25, 60J22
Related articles: Most relevant | Search more
arXiv:1106.0964 [math.PR] (Published 2011-06-06, updated 2011-10-17)
Queue lengths and workloads in polling systems
arXiv:1312.6970 [math.PR] (Published 2013-12-25, updated 2014-04-24)
Heavy-traffic asymptotic formulas for the multiclass M${}^X$/G/1 queue
arXiv:1408.0129 [math.PR] (Published 2014-08-01)
A Polling Model with Smart Customers