Exact distribution of discrete-time D-BMAP/G/\inf queueing model
Tonglin Liao, Youming Li
TL;DR
Addresses the exact time-dependent distribution of the number of customers in a discrete-time D-BMAP/G/infty queue. The authors construct an effective Markovian dynamics using the auxiliary process N(s;t) and derive a generating-function recursion with T(z,s;t) = D(Phi(t-s) z + 1 - Phi(t-s)); this yields explicit expressions for $p_m(t)$ and factorial moments. For the discrete-time M/M/infty case, they obtain a closed form $G(z,t) = product_{i=1}^t (1 + p alpha^i (z-1))$ with $m(t) = p alpha (1 - alpha^t)/(1 - alpha)$ and $\sigma^2(t) = p alpha (1 - alpha^t)/(1 - alpha) - p^2 alpha^2 (1 - alpha^{2t})/(1 - alpha^2)$, and show a sub-Poisson Fano factor. The framework enables exact performance analysis of discrete-time infinite-server queues with general arrivals and service distributions and bridges discrete-time and continuous-time limits.
Abstract
In this paper, we consider discrete-time D-BMAP/G/\inf queueing model. We construct effective discrete-time Markovian dynamics for this model and utilize it to derive exact time-dependent distribution of customer number and the corresponding moments for the original queueing model. Numerical simulations are used to verify our results. Using our result, we provide analytical distribution for discrete-time M/M/\inf, and then compare it with the distribution of continuous-time M/M/\inf.
