Queueing models in which customers or messages arrive in batches with inter-arrival times of batches possibly correlated and services rendered in batches of varying sizes play an important role in telecommunication systems. Recently queueing models of BMAP/G/1-type in which a new type of group clearance was studied using embedded Markov renewal process as well as continuous time Markov chain whose generator has a very special structure. In this paper, we generalize these models to multi-server systems through simulation approach. After validating the simulation model for the single server case, we report our simulated results for much more general situations.
CITATION STYLE
Chakravarthy, S. R., & Rumyantsev, A. (2019). BMAP/G/c queueing model with group clearance useful in telecommunications systems - A simulation approach. International Journal of Innovative Technology and Exploring Engineering, 8(7), 621–627.
Mendeley helps you to discover research relevant for your work.