Simulation Models of the Bi-Level Randomized Policy and N-Policy for Multi-Server Queueing Systems

Volume 7, Issue 3, June 2023     |     PP. 48-74      |     PDF (1105 K)    |     Pub. Date: May 15, 2023
DOI: 10.54647/isss120287    63 Downloads     100221 Views  

Author(s)

Yuriy Zhernovyi, Faculty of Mechanics and Mathematics, Ivan Franko National University of Lviv, Ukraine

Abstract
We consider a multi-server G/G/n queue that operates the bi-level randomized (p, N1, N2)-policy or the N-policy. This means that as soon as there are no more customers in the system, the server will be shut down immediately. If the number of arriving customers falls to a particular low threshold value N1, the server will be activated for work with a probability of p or remain turned off with a probability of 1‒p. If the number of arriving customers reaches a specified high threshold value N2 (≥N1), the server will start serving waiting customers until the system is empty again. When p=1 or p=0 or N1=N2=N, the (p, N1, N2)-policy becomes the classic N-policy. Using GPSS World simulation models, we studied the dependencies of system performance measures on the following parameters: threshold values N1, N2 or N, the load factor, coefficient of variation of inter-arrival times, and number of servers. We validated the simulation models by comparing the results with those obtained by an analytical method. We determined the simulation time required to obtain results corresponding to the stationary process. By utilizing the created simulation models, we can solve the problem of minimizing a long-run expected cost rate by selecting appropriate values for the thresholds N1 and N2.

Keywords
queueing system, N-policy, be-level randomized policy, simulation model, GPSS World

Cite this paper
Yuriy Zhernovyi, Simulation Models of the Bi-Level Randomized Policy and N-Policy for Multi-Server Queueing Systems , SCIREA Journal of Information Science and Systems Science. Volume 7, Issue 3, June 2023 | PP. 48-74. 10.54647/isss120287

References

[ 1 ] Yadin, M. and Naor, P., “Queueing system with a removable service station,” Journ. of the Operational Research Society, 14 (4). 393-405. 1963.
[ 2 ] Heyman, D.P., “The T-policy for the M/G/1 queue,” Manag. Sci., 23 (7). 775–778. Mar. 1977.
[ 3 ] Balachandran, K.R. “Control policies for a single server system,” Manag. Sci, 19 (9). 1013–1018. May 1973.
[ 4 ] Lee, H.W. and Seo, W.J. “The performance of the M/G/1 queue under the dyadic Min(N,D)-policy and its cost optimization,” Perform. Eval. 65 (10). 742–758. Oct. 2008.
[ 5 ] Xinyu Kuang, Yinghui Tang, Miaomiao Yu and Wenqing Wu, “Performance analysis of an M/G/1 queue with bi-level randomized policy,” RAIRO-Oper. Res., 56 (1). 395–414. Feb. 2022.
[ 6 ] Zhernovyi, Yu., “Simulation models of modified multiple vacation policy for multi-server queueing systems,” SCIREA Journal of Information Science and Systems Science, 6 (1). 62–88. Feb. 2022.
[ 7 ] Birta, L.G. and Arbez, G., Modelling and Simulation: Exploring Dynamic System Behaviour, 3rd edition, Springer Nature, Switzerland, 2019, 491-520.
[ 8 ] Zhernovyi, Yu., Creating models of queueing systems using GPSS World: Programs, detailed explanations and analysis of results, LAP Lambert Academic Publishing, Saarbrücken, 2015, 220 p.