Abstract
A novel multi-server queueing model with finite buffer and batch arrival of customers is considered. In contrast to the standard batch arrival when a whole batch arrives into the system at one epoch, we assume that the customers of a batch arrive one by one in exponentially distributed times. Service time is exponentially distributed. Flow of batches is the stationary Poisson arrival process. Batch size distribution is geometric. The number of batches, which can be admitted into the system simultaneously, is subject of control. The problem of maximizing the throughput of the system under the fixed value of the admissible probability of losing the arbitrary customer from admitted batch is considered. Analysis of the joint distribution of the number of batches and customers in the system and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kist A.A., Lloyd-Smith B., Harris R.J.: A simple IP flow blocking model. Performance Challenges for Efficient Next Generation Networks. In: Proceedings of 19-th International Teletraffic Congress, Beijing, 29 August -2 September 2005, pp. 355-364 (2005)
Klimenok, V., Kim, C.S., Orlovsky, D., Dudin, A.: Lack of invariant property of Erlang loss model in case of the MAP input. Queueing Systems 49, 187–213 (2005)
Gantmakher, F.R.: The Matrix Theory. Moscow, Science (1967)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, M.H., Dudin, S., Klimenok, V. (2007). Queueing Model with Time-Phased Batch Arrivals. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)