A finite-buffer queueing system with batch Poisson arrivals is considered. A system of integral equations for the distribution function of the number of customers h(t) served before t, conditioned by the initial state of the system, is built. A compact formula for probability generating function of the Laplace transform of distribution of h(t) is found using the potential technique. From this representation the mean of h(t) can be effectively calculated numerically using one of the inverse Laplace transform approximation algorithms. Moreover a limit behavior of departure process as the buffer size tends to infinity is investigated. Numerical examples are attached as well. © 2011 Springer-Verlag.
CITATION STYLE
Kempa, W. M. (2011). Departure process in finite-buffer queue with batch arrivals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6751 LNCS, pp. 1–13). https://doi.org/10.1007/978-3-642-21713-5_1
Mendeley helps you to discover research relevant for your work.