Abstract
In telecommunications networks, usually an aggregation of information units (a batch) is transmitted instead of individual information units. In order to obtain performance measures for such networks, we analyze a discrete-time queueing model with a batch server operating under the minimum batch size (MBS) service policy. Specifically, we calculate the steady-state probability generating function (PGF) of the system contents at the beginning of an arbitrary slot. This PGF enables us to derive some important performance measures.
Furthermore, we investigate, through some numerical examples, the influence of some parameters on the optimal choice of the MBS. In this paper, we focus on the influence of the load and the distribution of the service times.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abate, J.: Numerical inversion of probability generating functions. Operations Research Letters 12(4), 245–251 (1992)
Bruneel, H., Steyaert, B., Desmet, E., Petit, G.H.: Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues. European Journal of Operational Research 76, 563–572 (1994)
Chaudhry, M.L., Templeton, J.G.C.: A First Course in Bulk Queues. Wiley, New York (1983)
Dümmler, M.A., Schömig, A.K.: Using discrete-time analysis in the performance evaluation of manufacturing systems. In: 1999 International Conference on Semiconductor Manufacturing Operational Modeling and Simulation (SMOMS 1999), San Francisco, California (1999)
Fiems, D., Bruneel, H.: A note on the discretization of Little’s result. Operations Research Letters 30, 17–18 (2002)
Gupta, U.C., Goswami, V.: Performance analysis of finite buffer discrete-time queue with bulk service. Computers & Operations Research 29, 1331–1341 (2002)
Kim, N.K., Chaudhry, M.L.: Equivalences of Batch-Service Queues and Multi-Server Queues and Their Complete Simple Solutions in Terms of Roots. Stochastic Analysis and Applications 24, 753–766 (2006)
Kleinrock, L.: Queueing Systems: Volume I – Theory. Wiley Interscience, New York (1975)
Neuts, M.F.: A general class of bulk queues with Poisson input. Ann. Math. Stat. 38, 759–770 (1967)
Qiao, C.M, Yoo, M.S.: Optical burst switching (OBS) - a new paradigm for an optical Internet. Journal of high speed networks 8(1), 69–84 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Claeys, D., Walraevens, J., Laevens, K., Bruneel, H. (2007). A Discrete-Time Queueing Model with a Batch Server Operating Under the Minimum Batch Size Rule. In: Koucheryavy, Y., Harju, J., Sayenko, A. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. NEW2AN 2007. Lecture Notes in Computer Science, vol 4712. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74833-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-74833-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74832-8
Online ISBN: 978-3-540-74833-5
eBook Packages: Computer ScienceComputer Science (R0)