BMAP/G/c Queueing Model with Group Clearance Useful in Telecommunications Systems – A Simulation Approach
Srinivas R. Chakravarthy1, Alexander Rumyantsev2
1Srinivas R. Chakravarthy, Departments of Industrial and Manufacturing Engineering & Mathematics, Kettering University, Flint, Michigan.
2Alexander Rumyantsev, Institute of Applied Mathematical Research, Karelian Research Centre of RAS, Petrozavodsk, Russia, Petrozavodsk State University, Petrozavodsk, Russia.
Manuscript received on 17 May 2019 | Revised Manuscript received on 24 May 2019 | Manuscript Published on 02 June 2019 | PP: 621-627 | Volume-8 Issue-7S2 May 2019 | Retrieval Number: G11060587S219/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Desktop Grid, Multiserver Systems, Group Clearance, BMAP, Simulation.
Scope of the Article: Advanced Manufacturing Technologies